F
[Far02] Berndt Farwer. ω-automata. In Erich Grädel, Wolfgang Thomas et Thomas Wilke (eds.), Automata, Logics, and Infinite Games, Lecture Notes in Computer Science 2500, pages 3-21. Springer-Verlag, 2002. 
@incollection{lncs2500-Far,
  author =              {Farwer, Berndt},
  title =               {{{\(\omega\)}}-automata},
  editor =              {Gr{\"a}del, Erich and Thomas, Wolfgang and Wilke,
                         Thomas},
  booktitle =           {Automata, Logics, and Infinite Games},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2500},
  pages =               {3-21},
  chapter =             {1},
  year =                {2002},
}
[FBB+23] Nathanaël Fijalkow, Nathalie Bertrand, Patricia Bouyer, Romain Brenguier, Arnaud Carayol, John Fearnley, Florian Gimbert, Rasmus Ibsen-Jensen, Nicolas Markey, Benjamin Monmege, Petr Novotný, Mickael Randour, Ocan Sankur, Sylvain Schmitz, Olivier Serre et Mateusz Skomra. Games on graphs. Technical Report 2305.10546, arXiv, mai 2023. 
@techreport{GoG-fij23,
  author =              {Fijalkow, Nathana{\"e}l and Bertrand, Nathalie and
                         Bouyer, Patricia and Brenguier, Romain and Carayol,
                         Arnaud and Fearnley, John and Gimbert, Hugo an Horn,
                         Florian and Ibsen{-}Jensen, Rasmus and Markey,
                         Nicolas and Monmege, Benjamin and Novotn{\'y}, Petr
                         and Randour, Mickael and Sankur, Ocan and Schmitz,
                         Sylvain and Serre, Olivier and Skomra, Mateusz},
  title =               {Games on graphs},
  number =              {2305.10546},
  year =                {2023},
  month =               may,
  doi =                 {10.48550/arXiv.2305.10546},
  institution =         {arXiv},
}
[Feh99] Ansgar Fehnker. Scheduling a Steel Plant with Timed Automata. In RTCSA'99, pages 280-286. IEEE Comp. Soc. Press, décembre 1999. 
@inproceedings{rtcsa1999-Feh,
  author =              {Fehnker, Ansgar},
  title =               {Scheduling a Steel Plant with Timed Automata},
  booktitle =           {{P}roceedings of the 6th {I}nternational
                         {C}onference on {R}eal-{T}ime {C}omputing {S}ystems
                         and {A}pplications ({RTCSA}'99)},
  acronym =             {{RTCSA}'99},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {280-286},
  year =                {1999},
  month =               dec,
  doi =                 {10.1109/RTCSA.1999.811256},
}
[FG02] Jörg Flum et Martin Grohe. Describing Parameterized Complexity Classes. In STACS'02, Lecture Notes in Computer Science 2285, pages 359-371. Springer-Verlag, mars 2002. 
@inproceedings{stacs2002-FG,
  author =              {Flum, J{\"o}rg and Grohe, Martin},
  title =               {Describing Parameterized Complexity Classes},
  editor =              {Alt, Helmut and Ferreira, Afonso},
  booktitle =           {{P}roceedings of the 19th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'02)},
  acronym =             {{STACS}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2285},
  pages =               {359-371},
  year =                {2002},
  month =               mar,
}
[FG02] Markus Frick et Martin Grohe. The Complexity of First-Order and Monadic Second-Order Logic Revisited. In LICS'02, pages 215-224. IEEE Comp. Soc. Press, juillet 2002. 
@inproceedings{lics2002-FG,
  author =              {Frick, Markus and Grohe, Martin},
  title =               {The Complexity of First-Order and Monadic
                         Second-Order Logic Revisited},
  booktitle =           {{P}roceedings of the 17th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'02)},
  acronym =             {{LICS}'02},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {215-224},
  year =                {2002},
  month =               jul,
}
[FGH+19] Henning Fernau, Vladimir V. Gusev, Stefan Hoffmann, Markus Holzer, Mikhail V. Volkov et Petra Wolf. Computational Complexity of Synchronization under Regular Constraints. In MFCS'19, Leibniz International Proceedings in Informatics 138, pages 63:1-63:14. Leibniz-Zentrum für Informatik, août 2019. 
@inproceedings{mfcs2019-FGHHVW,
  author =              {Fernau, Henning and Gusev, Vladimir V. and Hoffmann,
                         Stefan and Holzer, Markus and Volkov, Mikhail V. and
                         Wolf, Petra},
  title =               {Computational Complexity of Synchronization under
                         Regular Constraints},
  editor =              {Rossmanith, Peter and Heggernes, Pinar and Katoen,
                         Joost-Pieter},
  booktitle =           {{P}roceedings of the 44th {I}nternational
                         {S}ymposium on {M}athematical {F}oundations of
                         {C}omputer {S}cience ({MFCS}'19)},
  acronym =             {{MFCS}'19},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {138},
  pages =               {63:1-63:14},
  year =                {2019},
  month =               aug,
  doi =                 {10.4230/LIPIcs.MFCS.2019.63},
}
[FGK95] Jürgen Frößl, Joachim Gerlach et Thomas Kropf. Symbolic Model Checking for Real-Time Circuits and Specifications. In TAU'95. ACM Press, novembre 1995. 
@inproceedings{tau1995-FGK,
  author =              {Fr{\"o}{\ss}l, J{\"u}rgen and Gerlach, Joachim and
                         Kropf, {\relax Th}omas},
  title =               {Symbolic Model Checking for Real-Time Circuits and
                         Specifications},
  booktitle =           {{P}roceedings of the 1995 {ACM} {I}nternational
                         {W}orkshop on {T}iming {I}ssues in the
                         {S}pecification and {S}ynthesis of {D}igital
                         {S}ystems ({TAU}'95)},
  acronym =             {{TAU}'95},
  publisher =           {ACM Press},
  year =                {1995},
  month =               nov,
}
[FH03] Lance Fortnow et Steve Homer. A Short History of Computational Complexity. EATCS Bulletin 80:95-133. EATCS, juin 2003. 
@article{beatcs80-FH,
  author =              {Fortnow, Lance and Homer, Steve},
  title =               {A~Short History of Computational Complexity},
  publisher =           {EATCS},
  journal =             {EATCS Bulletin},
  volume =              {80},
  pages =               {95-133},
  year =                {2003},
  month =               jun,
}
[FHB06] Márk Félegyházi, Jean-Pierre Hubaux et Levente Buttyán. Nash Equilibria of Packet Forwarding Strategies in Wireless Ad Hoc Networks. IEEE Transactions on Mobile Computing 5(5):463-476. IEEE, mai 2006. 
@article{tmc5(5)-FHB,
  author =              {F{\'e}legyh{\'a}zi, M{\'a}rk and Hubaux, Jean-Pierre
                         and Butty{\'a}n, Levente},
  title =               {{N}ash Equilibria of Packet Forwarding Strategies in
                         Wireless Ad~Hoc Networks},
  publisher =           {IEEE},
  journal =             {IEEE Transactions on Mobile Computing},
  volume =              {5},
  number =              {5},
  pages =               {463-476},
  year =                {2006},
  month =               may,
}
[FHM+95] Ronald Fagin, Joseph Y. Halpern, Yoram Moses et Moshe Y. Vardi. Knowledge-Based Programs. In PODC'95, pages 153-163. ACM Press, août 1995. 
@inproceedings{podc1995-FHMV,
  author =              {Fagin, Ronald and Halpern, Joseph Y. and Moses,
                         Yoram and Vardi, Moshe Y.},
  title =               {Knowledge-Based Programs},
  booktitle =           {{P}roceedings of the 14th {ACM} {S}ymposium on
                         {P}rinciples of {D}istributed {C}omputing
                         ({PODC}'95)},
  acronym =             {{PODC}'95},
  publisher =           {ACM Press},
  pages =               {153-163},
  year =                {1995},
  month =               aug,
}
[FHM+96] Ronald Fagin, Joseph Y. Halpern, Yoram Moses et Moshe Y. Vardi. Common Knowledge Revisited. In TARK'96, pages 283-298. Morgan Kaufmann Publishers, mars 1996. 
@inproceedings{tark1996-FHMV,
  author =              {Fagin, Ronald and Halpern, Joseph Y. and Moses,
                         Yoram and Vardi, Moshe Y.},
  title =               {Common Knowledge Revisited},
  editor =              {Shoham, Yoav},
  booktitle =           {{P}roceedings of the 6th {C}onference on
                         {T}heoretical {A}spects of {R}ationality and
                         {K}nowledge ({TARK}'96)},
  acronym =             {{TARK}'96},
  publisher =           {Morgan Kaufmann Publishers},
  pages =               {283-298},
  year =                {1996},
  month =               mar,
}
[FHN02] Ulrik Frendrup, Hans Hüttel et Jesper Nyholm Jensen. Modal Logic for Cryptographic Systems. In EXPRESS'02, Electronic Notes in Theoretical Computer Science 68(2), pages 127-144. Elsevier, août 2002. 
@inproceedings{express2002-FHN,
  author =              {Frendrup, Ulrik and H{\"u}ttel, Hans and Nyholm{
                         }Jensen, Jesper},
  title =               {Modal Logic for Cryptographic Systems},
  editor =              {Nestmann, Uwe and Panangaden, Prakash},
  booktitle =           {{P}roceedings of the 9th {I}nternational {W}orkshop
                         on {E}xpressiveness in {C}oncurrency ({EXPRESS}'02)},
  acronym =             {{EXPRESS}'02},
  publisher =           {Elsevier},
  series =              {Electronic Notes in Theoretical Computer Science},
  volume =              {68},
  number =              {2},
  pages =               {127-144},
  year =                {2002},
  month =               aug,
}
[Fil11] Jean-Christophe Filliâtre. Deductive software verification. International Journal on Software Tools for Technology Transfer 13(5):397-403. Springer-Verlag, octobre 2011. 
@article{sttt13(5)-Fil,
  author =              {Filli{\^a}tre, Jean-Christophe},
  title =               {Deductive software verification},
  publisher =           {Springer-Verlag},
  journal =             {International Journal on Software Tools for
                         Technology Transfer},
  volume =              {13},
  number =              {5},
  pages =               {397-403},
  year =                {2011},
  month =               oct,
  doi =                 {10.1007/s10009-011-0211-0},
}
[Fin70] Kit Fine. Propositional quantifiers in modal logic. Theoria 36(3):336-346. John Wiley & Sons, décembre 1970. 
@article{theoria36(3)-Fine,
  author =              {Fine, Kit},
  title =               {Propositional quantifiers in modal logic},
  publisher =           {John Wiley \& Sons},
  journal =             {Theoria},
  volume =              {36},
  number =              {3},
  pages =               {336-346},
  year =                {1970},
  month =               dec,
  doi =                 {10.1111/j.1755-2567.1970.tb00432.x},
}
[Fin06] Olivier Finkel. Undecidable Problems About Timed Automata. In FORMATS'06, Lecture Notes in Computer Science 4202, pages 187-199. Springer-Verlag, septembre 2006. 
@inproceedings{formats2006-Fin,
  author =              {Finkel, Olivier},
  title =               {Undecidable Problems About Timed Automata},
  editor =              {Asarin, Eugene and Bouyer, Patricia},
  booktitle =           {{P}roceedings of the 4th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'06)},
  acronym =             {{FORMATS}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4202},
  pages =               {187-199},
  year =                {2006},
  month =               sep,
  doi =                 {10.1007/11867340_14},
}
[FJ13] John Fearnley et Marcin Jurdziński. Reachability in two-clock timed automata is PSPACE-complete. In ICALP'13, Lecture Notes in Computer Science 7966, pages 212-223. Springer-Verlag, juillet 2013. 
@inproceedings{icalp2013-FJ,
  author =              {Fearnley, John and Jurdzi{\'n}ski, Marcin},
  title =               {Reachability in two-clock timed automata is
                         {PSPACE}-complete},
  editor =              {Fomin, Fedor V. and Freivalds, Rusins and
                         Kwiatkowska, Marta and Peleg, David},
  booktitle =           {{P}roceedings of the 40th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'13)~-- Part~{II}},
  acronym =             {{ICALP}'13},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7966},
  pages =               {212-223},
  year =                {2013},
  month =               jul,
  doi =                 {10.1007/978-3-642-39212-2_21},
}
[FJL+11] Uli Fahrenberg, Line Juhl, Kim Guldstrand Larsen et Jiří Srba. Energy Games in Multiweighted Automata. In ICTAC'11, Lecture Notes in Computer Science 6916, pages 95-115. Springer-Verlag, août 2011. 
@inproceedings{ictac2011-FJLS,
  author =              {Fahrenberg, Uli and Juhl, Line and Larsen, Kim
                         Guldstrand and Srba, Ji{\v r}{\'\i}},
  title =               {Energy Games in Multiweighted Automata},
  editor =              {Cerone, Antonio and Pihlajasaari, Pekka},
  booktitle =           {{P}roceedings of the 8th {I}nternational
                         {C}olloquium on {T}heoretical {A}spects of
                         {C}omputing ({ICTAC}'11)},
  acronym =             {{ICTAC}'11},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6916},
  pages =               {95-115},
  year =                {2011},
  month =               aug,
  doi =                 {10.1007/978-3-642-23283-1_9},
}
[FJM+16] Yliès Falcone, Thierry Jéron, Hervé Marchand et Srinivas Pinisetty. Runtime enforcement of regular timed properties by suppressing and delaying events. Science of Computer Programming 123:2-41. Elsevier, juillet 2016. 
@article{scp123()-FJMP,
  author =              {Falcone, Yli{\`e}s and J{\'e}ron, Thierry and
                         Marchand, Herv{\'e} and Pinisetty, Srinivas},
  title =               {Runtime enforcement of regular timed properties by
                         suppressing and delaying events},
  publisher =           {Elsevier},
  journal =             {Science of Computer Programming},
  volume =              {123},
  pages =               {2-41},
  year =                {2016},
  month =               jul,
  doi =                 {10.1016/j.scico.2016.02.008},
}
[FJR09] Emmanuel Filiot, Naiyong Jin et Jean-François Raskin. An Antichain Algorithm for LTL Realizability. In CAV'09, Lecture Notes in Computer Science 5643, pages 263-277. Springer-Verlag, juin 2009. 
@inproceedings{cav2009-FJR,
  author =              {Filiot, Emmanuel and Jin, Naiyong and Raskin,
                         Jean-Fran{\c c}ois},
  title =               {An Antichain Algorithm for {LTL} Realizability},
  editor =              {Bouajjani, Ahmed and Maler, Oded},
  booktitle =           {{P}roceedings of the 21st {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'09)},
  acronym =             {{CAV}'09},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5643},
  pages =               {263-277},
  year =                {2009},
  month =               jun,
}
[FKG96] Jürgen Frößl, Thomas Kropf et Joachim Gerlach. An Efficient Algorithm for Real-Time Symbolic Model Checking. In ED&TC'96, pages 15-20. IEEE Comp. Soc. Press, mars 1996. 
@inproceedings{edtc1996-FKG,
  author =              {Fr{\"o}{\ss}l, J{\"u}rgen and Kropf, {\relax Th}omas
                         and Gerlach, Joachim},
  title =               {An Efficient Algorithm for Real-Time Symbolic Model
                         Checking},
  booktitle =           {{P}roceedings of the 1996 {E}uropean {D}esign and
                         {T}est {C}onference ({ED\&TC}'96)},
  acronym =             {{ED\&TC}'96},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {15-20},
  year =                {1996},
  month =               mar,
}
[FKK+09] Dimitris Fotakis, Spyros Kontogiannis, Elias Koutsoupias, Marios Mavronicolas et Paul G. Spirakis. The structure and complexity of Nash equilibria for a selfish routing game. Theoretical Computer Science 410(36):3305-3326. Elsevier, août 2009. 
@article{tcs410(36)-FKKMS,
  author =              {Fotakis, Dimitris and Kontogiannis, Spyros and
                         Koutsoupias, Elias and Mavronicolas, Marios and
                         Spirakis, Paul G.},
  title =               {The~structure and complexity of Nash equilibria for
                         a selfish routing game},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {410},
  number =              {36},
  pages =               {3305-3326},
  year =                {2009},
  month =               aug,
  doi =                 {10.1016/j.tcs.2008.01.004},
}
[FKL10] Dana Fisman, Orna Kupferman et Yoad Lustig. Rational synthesis. In TACAS'10, Lecture Notes in Computer Science 6015, pages 190-204. Springer-Verlag, mars 2010. 
@inproceedings{tacas2010-FKL,
  author =              {Fisman, Dana and Kupferman, Orna and Lustig, Yoad},
  title =               {Rational synthesis},
  editor =              {Esparza, Javier and Majumdar, Rupak},
  booktitle =           {{P}roceedings of the 16th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'10)},
  acronym =             {{TACAS}'10},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6015},
  pages =               {190-204},
  year =                {2010},
  month =               mar,
  doi =                 {10.1007/978-3-642-12002-2_16},
}
[FKM16] Laurent Fribourg, Ulrich Kühne et Nicolas Markey. Game-based Synthesis of Distributed Controllers for Sampled Switched Systems. In SynCoP'15, OpenAccess Series in Informatics 44, pages 47-61. Leibniz-Zentrum für Informatik, avril 2016.
Résumé

Switched systems are a convenient formalism for modeling physical processes interacting with a digital controller. Unfortunately, the formalism does not capture the distributed nature encountered e.g. in cyber-physical systems, which are organized as networks of elements interacting with each other and with local controllers. Most current methods for control synthesis can only produce a centralized controller, which is assumed to have complete knowledge of all the component states and can interact with all of them. In this paper, we consider a controller synthesis method based on state space decomposition, and propose a game-based approach in order to extend it within a distributed framework.

@inproceedings{syncop2015-FKM,
  author =              {Fribourg, Laurent and K{\"u}hne, Ulrich and Markey,
                         Nicolas},
  title =               {Game-based Synthesis of Distributed Controllers for
                         Sampled Switched Systems},
  editor =              {Andr{\'e}, {\'E}tienne and Frehse, Goran},
  booktitle =           {{P}roceedings of the 2nd {I}nternational {W}orkshop
                         on {S}ynthesis of {C}omplex {P}arameters
                         ({S}yn{C}o{P}'15)},
  acronym =             {{S}yn{C}o{P}'15},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {OpenAccess Series in Informatics},
  volume =              {44},
  pages =               {47-61},
  year =                {2016},
  month =               apr,
  doi =                 {10.4230/OASIcs.SynCoP.2015.48},
  abstract =            {Switched systems are a convenient formalism for
                         modeling physical processes interacting with a
                         digital controller. Unfortunately, the formalism
                         does not capture the distributed nature encountered
                         e.g. in cyber-physical systems, which are organized
                         as networks of elements interacting with each other
                         and with local controllers. Most current methods for
                         control synthesis can only produce a centralized
                         controller, which is assumed to have complete
                         knowledge of all the component states and can
                         interact with all of them. In~this paper,
                         we~consider a controller synthesis method based on
                         state space decomposition, and propose a game-based
                         approach in order to extend it within a distributed
                         framework.},
}
[FKS05] Dimitris Fotakis, Spyros Kontogiannis et Paul G. Spirakis. Selfish unsplittable flows. Theoretical Computer Science 348(2-3):226-239. Elsevier, décembre 2005. 
@article{tcs348(2-3)-FKS,
  author =              {Fotakis, Dimitris and Kontogiannis, Spyros and
                         Spirakis, Paul G.},
  title =               {Selfish unsplittable flows},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {348},
  number =              {2-3},
  pages =               {226-239},
  year =                {2005},
  month =               dec,
  doi =                 {10.1016/j.tcs.2005.09.024},
}
[FKV06] Ehud Friedgut, Orna Kupferman et Moshe Y. Vardi. Büchi Complementation Made Tighter. International Journal of Foundations of Computer Science 17(4):851-868. Août 2006. 
@article{ijfcs17(4)-FKV,
  author =              {Friedgut, Ehud and Kupferman, Orna and Vardi, Moshe
                         Y.},
  title =               {B{\"u}chi Complementation Made Tighter},
  journal =             {International Journal of Foundations of Computer
                         Science},
  volume =              {17},
  number =              {4},
  pages =               {851-868},
  year =                {2006},
  month =               aug,
  doi =                 {10.1142/S0129054106004145},
}
[FL79] Michael J. Fischer et Richard E. Ladner. Propositional Dynamic Logic of Regular Programs. Journal of Computer and System Sciences 18(2):194-211. Academic Press, avril 1979. 
@article{jcss18(2)-FL,
  author =              {Fischer, Michael J. and Ladner, Richard E.},
  title =               {Propositional Dynamic Logic of Regular Programs},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {18},
  number =              {2},
  pages =               {194-211},
  year =                {1979},
  month =               apr,
}
[FL02] Alain Finkel et Jérôme Leroux. How to Compose Presburger-Accelerations: Applications to Broadcast Protocols. Research Report, Lab. Spécification & Vérification, ENS Cachan, France, septembre 2002. 
@techreport{LSV-02-14,
  author =              {Finkel, Alain and Leroux, J{\'e}r{\^o}me},
  title =               {How to Compose {P}resburger-Accelerations:
                         Applications to Broadcast Protocols},
  year =                {2002},
  month =               sep,
  institution =         {Lab.~Sp\'ecification \& V\'erification, ENS Cachan,
                         France},
  type =                {Research Report},
}
[FL09] Oliver Friedmann et Martin Lange. Solving Parity Games in Practice. In ATVA'09, Lecture Notes in Computer Science 5799, pages 182-196. Springer-Verlag, octobre 2009. 
@inproceedings{atva2009-FL,
  author =              {Friedmann, Oliver and Lange, Martin},
  title =               {Solving Parity Games in Practice},
  editor =              {Liu, Zhiming and Ravn, Anders P.},
  booktitle =           {{P}roceedings of the 7th {I}nternational {S}ymposium
                         on {A}utomated {T}echnology for {V}erification and
                         {A}nalysis ({ATVA}'09)},
  acronym =             {{ATVA}'09},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5799},
  pages =               {182-196},
  year =                {2009},
  month =               oct,
  doi =                 {10.1007/978-3-642-04761-9_15},
}
[FL09] Uli Fahrenberg et Kim Guldstrand Larsen. Discount-optimal infinite Runs in Proced Timed Automata. In INFINITY'06-08, Electronic Notes in Theoretical Computer Science 239, pages 179-191. Elsevier, juillet 2009. 
@inproceedings{infinity2008-FL,
  author =              {Fahrenberg, Uli and Larsen, Kim Guldstrand},
  title =               {Discount-optimal infinite Runs in Proced Timed
                         Automata},
  editor =              {Habermehl, Peter and Vojnar, Tom{\'a}{\v s}},
  booktitle =           {{J}oint {P}roceedings of the 8th, 9th, and 10th
                         {I}nternational {W}orkshops on {V}erification of
                         {I}nfinite-{S}tate {S}ystems {(INFINITY}'06-08)},
  acronym =             {{INFINITY}'06-08},
  publisher =           {Elsevier},
  series =              {Electronic Notes in Theoretical Computer Science},
  volume =              {239},
  pages =               {179-191},
  year =                {2009},
  month =               jul,
}
[FLL13] Oliver Friedmann, Martin Lange et Markus Latte. Satisfiability Games for Branching-Time Logics. Logical Methods in Computer Science 9(4). Octobre 2013. 
@article{lmcs9(4)-FLL,
  author =              {Friedmann, Oliver and Lange, Martin and Latte,
                         Markus},
  title =               {Satisfiability Games for Branching-Time Logics},
  journal =             {Logical Methods in Computer Science},
  volume =              {9},
  number =              {4},
  year =                {2013},
  month =               oct,
  doi =                 {10.2168/LMCS-9(4:5)2013},
}
[FLM02] Marco Faella, Salvatore La Torre et Aniello Murano. Dense Real-Time Games. In LICS'02, pages 167-176. IEEE Comp. Soc. Press, juillet 2002. 
@inproceedings{lics2002-FLM,
  author =              {Faella, Marco and La{~}Torre, Salvatore and Murano,
                         Aniello},
  title =               {Dense Real-Time Games},
  booktitle =           {{P}roceedings of the 17th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'02)},
  acronym =             {{LICS}'02},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {167-176},
  year =                {2002},
  month =               jul,
}
[FLM02] Marco Faella, Salvatore La Torre et Aniello Murano. Automata-Theoretic Decision of Timed Games. In VMCAI'02, Lecture Notes in Computer Science 2294, pages 94-108. Springer-Verlag, janvier 2002. 
@inproceedings{vmcai2002-FLM,
  author =              {Faella, Marco and La{~}Torre, Salvatore and Murano,
                         Aniello},
  title =               {Automata-Theoretic Decision of Timed Games},
  editor =              {Cortesi, Agostino},
  booktitle =           {{P}roceedings of the 3rd {I}nternational {W}orkshop
                         on {V}erification, {M}odel {C}hecking, and
                         {A}bstract {I}nterpretation ({VMCAI}'02)},
  acronym =             {{VMCAI}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2294},
  pages =               {94-108},
  year =                {2002},
  month =               jan,
}
[FLR10] Emmanuel Filiot, Tristan Le Gall et Jean-François Raskin. Iterated Regret Minimization in Game Graphs. In MFCS'10, Lecture Notes in Computer Science 6281, pages 342-354. Springer-Verlag, août 2010. 
@inproceedings{mfcs2010-FLR,
  author =              {Filiot, Emmanuel and Le{~}Gall, Tristan and Raskin,
                         Jean-Fran{\c c}ois},
  title =               {Iterated Regret Minimization in Game Graphs},
  editor =              {Hlin{\v{e}}n{\'y}, Petr and Ku{\v c}era,
                         Anton{\'\i}n},
  booktitle =           {{P}roceedings of the 35th {I}nternational
                         {S}ymposium on {M}athematical {F}oundations of
                         {C}omputer {S}cience ({MFCS}'10)},
  acronym =             {{MFCS}'10},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6281},
  pages =               {342-354},
  year =                {2010},
  month =               aug,
}
[FLS08] Marco Faella, Axel Legay et Mariëlle Stoelinga. Model Checking Quantitative Linear Time Logic. In QAPL'08, Electronic Notes in Theoretical Computer Science 220(3), pages 61-77. Elsevier, mars 2008. 
@inproceedings{qapl2008-FLS,
  author =              {Faella, Marco and Legay, Axel and Stoelinga,
                         Mari{\"e}lle},
  title =               {Model Checking Quantitative Linear Time Logic},
  editor =              {Aldini, Alessandro and Baier, {\relax Ch}ristel},
  booktitle =           {{P}roceedings of the 6th {W}orkshop on
                         {Q}uantitative {A}spects of {P}rogramming
                         {L}anguages ({QAPL}'08)},
  acronym =             {{QAPL}'08},
  publisher =           {Elsevier},
  series =              {Electronic Notes in Theoretical Computer Science},
  volume =              {220},
  number =              {3},
  pages =               {61-77},
  year =                {2008},
  month =               mar,
}
[FLT09] Uli Fahrenberg, Kim Guldstrand Larsen et Claus Thrane. A Quantitative Characterization of Weighted Kripke Structures in Temporal Logics. In MEMICS'09, OpenAccess Series in Informatics 13. Leibniz-Zentrum für Informatik, septembre 2009. 
@inproceedings{memics2209-FLT,
  author =              {Fahrenberg, Uli and Larsen, Kim Guldstrand and
                         Thrane, Claus},
  title =               {A Quantitative Characterization of Weighted {K}ripke
                         Structures in Temporal Logics},
  editor =              {Hlin{\v{e}}n{\'y}, Petr and Maty{\'a}{\v{s}}, Vashek
                         and Vojnar, Tom{\'a}{\v s}},
  booktitle =           {{P}roceedings of the 5th {A}nnual {D}octoral
                         {W}orkshop on {M}athematical and {E}ngineering
                         {M}ethods in {C}omputer {S}cience ({MEMICS}'09)},
  acronym =             {{MEMICS}'09},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {OpenAccess Series in Informatics},
  volume =              {13},
  year =                {2009},
  month =               sep,
}
[FLT11] Uli Fahrenberg, Axel Legay et Claus Thrane. The Quantitative Linear-Time–Branching-Time Spectrum. In FSTTCS'11, Leibniz International Proceedings in Informatics 13. Leibniz-Zentrum für Informatik, décembre 2011. 
@inproceedings{fsttcs2011-FLT,
  author =              {Fahrenberg, Uli and Legay, Axel and Thrane, Claus},
  title =               {The Quantitative Linear-Time--Branching-Time
                         Spectrum},
  editor =              {Chakraborty, Supratik and Kumar, Amit},
  booktitle =           {{P}roceedings of the 31st {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'11)},
  acronym =             {{FSTTCS}'11},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {13},
  year =                {2011},
  month =               dec,
}
[FLZ11] Wladimir Fridman, Christof Löding et Martin Zimmermann. Degrees of Lookahead in Context-free Infinite Games. In CSL'11, Leibniz International Proceedings in Informatics 12, pages 264-276. Leibniz-Zentrum für Informatik, septembre 2011. 
@inproceedings{csl2011-FLZ,
  author =              {Fridman, Wladimir and L{\"o}ding, Christof and
                         Zimmermann, Martin},
  title =               {Degrees of Lookahead in Context-free Infinite Games},
  editor =              {Bezem, Marc},
  booktitle =           {{P}roceedings of the 25th {I}nternational {W}orkshop
                         on {C}omputer {S}cience {L}ogic ({CSL}'11)},
  acronym =             {{CSL}'11},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {12},
  pages =               {264-276},
  year =                {2011},
  month =               sep,
}
[FM98] Melvin Fitting et Richard L. Mendelsohn. First-Order Modal Logic. Synthese Library 277. Springer-Verlag, 1998. 
@book{FOML-FM98,
  author =              {Fitting, Melvin and Mendelsohn, Richard L.},
  title =               {First-Order Modal Logic},
  publisher =           {Springer-Verlag},
  series =              {Synthese Library},
  number =              {277},
  year =                {1998},
}
[FM16] Martin Fränzle et Nicolas Markey (eds.) Proceedings of the 14th International Conferences on Formal Modelling and Analysis of Timed Systems (FORMATS'16). Lecture Notes in Computer Science 9884. Springer-Verlag, août 2016. 
@proceedings{formats2016-FM,
  title =               {{P}roceedings of the 14th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'16)},
  editor =              {Fr{\"a}nzle, Martin and Markey, Nicolas},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'16)},
  acronym =             {{FORMATS}'16},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9884},
  year =                {2016},
  month =               aug,
  doi =                 {10.1007/978-3-319-44878-7},
  url =                 {http://link.springer.com/book/10.1007/978-3-319-44878-7},
}
[FMM+18] Nathanaël Fijalkow, Bastien Maubert, Aniello Murano et Sasha Rubin. Quantifying Bounds in Strategy Logic. In CSL'18, Leibniz International Proceedings in Informatics 119, pages 23:1-23:23. Leibniz-Zentrum für Informatik, septembre 2018. 
@inproceedings{csl2018-FMMR,
  author =              {Fijalkow, Nathana{\"e}l and Maubert, Bastien and
                         Murano, Aniello and Rubin, Sasha},
  title =               {Quantifying Bounds in Strategy Logic},
  editor =              {Ghica, Dan R. and Jung, Achim},
  booktitle =           {{P}roceedings of the 27th {EACSL} {A}nnual
                         {C}onference on {C}omputer {S}cience {L}ogic
                         ({CSL}'18)},
  acronym =             {{CSL}'18},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {119},
  pages =               {23:1-23:23},
  year =                {2018},
  month =               sep,
  doi =                 {10.4230/LIPIcs.CSL.2018.23},
}
[FMP+03] Elena Fersman, Leonid Mokrushin, Paul Pettersson et Wang Yi. Schedulability Analysis Using Two Clocks. In TACAS'03, Lecture Notes in Computer Science 2619, pages 224-239. Springer-Verlag, avril 2003. 
@inproceedings{tacas2003-FMPY,
  author =              {Fersman, Elena and Mokrushin, Leonid and Pettersson,
                         Paul and Yi, Wang},
  title =               {Schedulability Analysis Using Two Clocks},
  editor =              {Garavel, Hubert and Hatcliff, John},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'03)},
  acronym =             {{TACAS}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2619},
  pages =               {224-239},
  year =                {2003},
  month =               apr,
}
[FMP+06] Elena Fersman, Leonid Mokrushin, Paul Pettersson et Wang Yi. Schedulability analysis of fixed-priority systems using timed automata. Theoretical Computer Science 354(2):301-317. Elsevier, mars 2006. 
@article{tcs354(2)-FMPY,
  author =              {Fersman, Elena and Mokrushin, Leonid and Pettersson,
                         Paul and Yi, Wang},
  title =               {Schedulability analysis of fixed-priority systems
                         using timed automata},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {354},
  number =              {2},
  pages =               {301-317},
  year =                {2006},
  month =               mar,
}
[FMR07] Tim French, John C. McCabe-Dansted et Mark Reynolds. A Temporal Logic of Robustness. In FroCoS'07, Lecture Notes in Artificial Intelligence 4720, pages 193-205. Springer-Verlag, septembre 2007. 
@inproceedings{frocos2007-FMR,
  author =              {French, Tim and McCabe{-}Dansted, John C. and
                         Reynolds, Mark},
  title =               {A Temporal Logic of Robustness},
  editor =              {Konev, Boris and Wolter, Frank},
  booktitle =           {{P}roceedings of the 6th {I}nternational {W}orkshop
                         on {F}rontiers of {C}ombining {S}ystems
                         ({FroCoS}'07)},
  acronym =             {{FroCoS}'07},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Artificial Intelligence},
  volume =              {4720},
  pages =               {193-205},
  year =                {2007},
  month =               sep,
  doi =                 {10.1007/978-3-540-74621-8_13},
}
[For09] Lance Fortnow. The Status of the P versus NP Problem. Communications of the ACM 52(9):78-86. ACM Press, septembre 2009. 
@article{cacm52(9)-For,
  author =              {Fortnow, Lance},
  title =               {The Status of the {P} versus {NP} Problem},
  publisher =           {ACM Press},
  journal =             {Communications of the ACM},
  volume =              {52},
  number =              {9},
  pages =               {78-86},
  year =                {2009},
  month =               sep,
}
[Fot08] Dimitris Fotakis. Congestion games with linearly-independent paths: convergence time and price of anarchy. In SAGT'08, Lecture Notes in Computer Science 4997, pages 33-45. Springer-Verlag, avril 2008. 
@inproceedings{sagt2008-Fot,
  author =              {Fotakis, Dimitris},
  title =               {Congestion games with linearly-independent paths:
                         convergence time and price of anarchy},
  editor =              {Monien, Burkhard and Schroeder, Ulf-Peter},
  booktitle =           {{P}roceedings of the 1st {I}nternational {S}ymposium
                         on {A}lgorithmic {G}ame {T}heory ({SAGT}'08)},
  acronym =             {{SAGT}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4997},
  pages =               {33-45},
  year =                {2008},
  month =               apr,
  doi =                 {10.1007/978-3-540-79309-0_5},
}
[Fou15] Paulin Fournier. Parameterized verification of networks of many identical processes. Thèse de doctorat, Université Rennes 1, France, Décembre 2015. 
@phdthesis{phd-fournier,
  author =              {Fournier, Paulin},
  title =               {Parameterized verification of networks of many
                         identical processes},
  year =                {2015},
  month =               dec,
  school =              {Universit{\'e} Rennes~1, France},
  type =                {Th\`ese de doctorat},
}
[FPR07] Carlo A. Furia, Matteo Pradella et Matteo Rossi. Dense-Time MTL Verification Through Sampling. Research Report 2007-37, Dipartimento di Elettronica ed Informazione, Politecnico di Milano, Italy, avril 2007. 
@techreport{DEI-2007-37-FPR,
  author =              {Furia, Carlo A. and Pradella, Matteo and Rossi,
                         Matteo},
  title =               {Dense-Time {MTL} Verification Through Sampling},
  number =              {2007-37},
  year =                {2007},
  month =               apr,
  institution =         {Dipartimento di Elettronica ed Informazione,
                         Politecnico di Milano, Italy},
  type =                {Research Report},
}
[FPS13] Nathanaël Fijalkow, Sophie Pinchinat et Olivier Serre. Emptiness Of Alternating Tree Automata Using Games With Imperfect Information. In FSTTCS'13, Leibniz International Proceedings in Informatics 24, pages 299-311. Leibniz-Zentrum für Informatik, décembre 2013. 
@inproceedings{fsttcs2013-FPS,
  author =              {Fijalkow, Nathana{\"e}l and Pinchinat, Sophie and
                         Serre, Olivier},
  title =               {Emptiness Of Alternating Tree Automata Using Games
                         With Imperfect Information},
  editor =              {Seth, Anil and Vishnoi, Nisheeth K.},
  booktitle =           {{P}roceedings of the 33rd {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'13)},
  acronym =             {{FSTTCS}'13},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {24},
  pages =               {299-311},
  year =                {2013},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2013.299},
}
[FPS14] Achille Frigeri, Liliana Pasquale et Paola Spoletini. Fuzzy Time in Linear Temporal Logic. ACM Transactions on Computational Logic 15(4):30:1-30:22. ACM Press, août 2014. 
@article{tocl15(4)-FPS,
  author =              {Frigeri, Achille and Pasquale, Liliana and
                         Spoletini, Paola},
  title =               {Fuzzy Time in Linear Temporal Logic},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Computational Logic},
  volume =              {15},
  number =              {4},
  pages =               {30:1-30:22},
  year =                {2014},
  month =               aug,
}
[FPT04] Alex Fabrikant, Christos H. Papadimitriou et Kunal Talwar. The complexity of pure Nash equilibria. In STOC'04, pages 604-612. ACM Press, juin 2004. 
@inproceedings{stoc2004-FPT,
  author =              {Fabrikant, Alex and Papadimitriou, {\relax Ch}ristos
                         H. and Talwar, Kunal},
  title =               {The complexity of pure {N}ash equilibria},
  editor =              {Babai, L{\'a}szl{\'o}},
  booktitle =           {{P}roceedings of the 36th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'04)},
  acronym =             {{STOC}'04},
  publisher =           {ACM Press},
  pages =               {604-612},
  year =                {2004},
  month =               jun,
  doi =                 {10.1145/1007352.1007445},
}
[FPY02] Elena Fersman, Paul Pettersson et Wang Yi. Timed Automata with Asynchronous Processes: Schedulability and Decidability. In TACAS'02, Lecture Notes in Computer Science 2280, pages 67-82. Springer-Verlag, avril 2002. 
@inproceedings{tacas2002-FPY,
  author =              {Fersman, Elena and Pettersson, Paul and Yi, Wang},
  title =               {Timed Automata with Asynchronous Processes:
                         Schedulability and Decidability},
  editor =              {Katoen, Joost-Pieter and Stevens, Perdita},
  booktitle =           {{P}roceedings of the 8th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'02)},
  acronym =             {{TACAS}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2280},
  pages =               {67-82},
  year =                {2002},
  month =               apr,
}
[FR74] Michael J. Fischer et Michael O. Rabin. Super-Exponential Complexity of Presburger Arithmetic. TR TM-43, MIT Press, février 1974. 
@techreport{TM43-FR,
  author =              {Fischer, Michael J. and Rabin, Michael O.},
  title =               {Super-Exponential Complexity of {P}resburger
                         Arithmetic},
  number =              {TM-43},
  year =                {1974},
  month =               feb,
  institution =         {MIT Press},
  type =                {TR},
}
[FR03] Tim French et Mark Reynolds. A Sound and Complete Proof System for QPTL. In AIML'02, pages 127-148. King's College Publications, 2003. 
@inproceedings{aiml2002-FR,
  author =              {French, Tim and Reynolds, Mark},
  title =               {A~Sound and Complete Proof System for~{QPTL}},
  editor =              {Balbiani, {\relax Ph}ilippe and Suzuki, Nobu-Yuki
                         and Wolter, Frank and Zakharyaschev, Michael},
  booktitle =           {{P}roceedings of the 4th {W}orkshop on {A}dvances in
                         {M}odal {L}ogic ({AIML}'02)},
  acronym =             {{AIML}'02},
  publisher =           {King's College Publications},
  pages =               {127-148},
  year =                {2003},
  confyear =            {2002},
  confmonth =           {9-10},
}
[FR07] Carlo A. Furia et Matteo Rossi. On the Expressiveness of MTL Variants over Dense Time. In FORMATS'07, Lecture Notes in Computer Science 4763, pages 163-178. Springer-Verlag, octobre 2007. 
@inproceedings{formats07-FR,
  author =              {Furia, Carlo A. and Rossi, Matteo},
  title =               {On the Expressiveness of {MTL} Variants over Dense
                         Time},
  editor =              {Raskin, Jean-Fran{\c c}ois and Thiagarajan, P. S.},
  booktitle =           {{P}roceedings of the 5th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'07)},
  acronym =             {{FORMATS}'07},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4763},
  pages =               {163-178},
  year =                {2007},
  month =               oct,
  doi =                 {10.1007/978-3-540-75454-1_13},
}
[Fra82] Peter Frankl. An Extremal Problem for two Families of Sets. European Journal of Combinatorics 3(2):125-127. Elsevier, juin 1982. 
@article{ejc3(2)-Fra,
  author =              {Frankl, Peter},
  title =               {An~Extremal Problem for two Families of Sets},
  publisher =           {Elsevier},
  journal =             {European Journal of Combinatorics},
  volume =              {3},
  number =              {2},
  pages =               {125-127},
  year =                {1982},
  month =               jun,
  doi =                 {10.1016/S0195-6698(82)80025-5},
}
[Fra99] Martin Fränzle. Analysis of hybrid systems: an ounce of realism can save an infinity of states. In CSL'99, Lecture Notes in Computer Science 1862, pages 126-139. Springer-Verlag, septembre 1999. 
@inproceedings{csl1999-Fra,
  author =              {Fr{\"a}nzle, Martin},
  title =               {Analysis of hybrid systems: an~ounce of realism can
                         save an infinity of states},
  editor =              {Flum, J{\"o}rg and Rodr{\'\i}guez{-}Artalejo, Mario},
  booktitle =           {{P}roceedings of the 13th {I}nternational {W}orkshop
                         on {C}omputer {S}cience {L}ogic ({CSL}'99)},
  acronym =             {{CSL}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1862},
  pages =               {126-139},
  year =                {1999},
  month =               sep,
}
[Fre01] Tim French. Decidability of Quantified Propositional Branching Time Logics. In AJCAI'01, Lecture Notes in Computer Science 2256, pages 165-176. Springer-Verlag, décembre 2001. 
@inproceedings{ajcai2001-Fre,
  author =              {French, Tim},
  title =               {Decidability of Quantified Propositional Branching
                         Time Logics},
  editor =              {Stumptner, Markus and Corbett, Dan and Brooks, Mike},
  booktitle =           {{P}roceedings of the 14th {A}ustralian {J}oint
                         {C}onference on {A}rtificial {I}ntelligence
                         ({AJCAI}'01)},
  acronym =             {{AJCAI}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2256},
  pages =               {165-176},
  year =                {2001},
  month =               dec,
  doi =                 {10.1007/3-540-45656-2_15},
}
[Fre03] Tim French. Quantified Propositional Temporal Logic with Repeating States. In TIME-ICTL'03, pages 155-165. IEEE Comp. Soc. Press, juillet 2003. 
@inproceedings{time2003-Fre,
  author =              {French, Tim},
  title =               {Quantified Propositional Temporal Logic with
                         Repeating States},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {S}ymposium on {T}emporal {R}epresentation and
                         {R}easoning and of the 4th {I}nternational
                         {C}onference on {T}emporal {L}ogic
                         ({TIME}-{ICTL}'03)},
  acronym =             {{TIME-ICTL}'03},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {155-165},
  year =                {2003},
  month =               jul,
  doi =                 {10.1109/TIME.2003.1214891},
}
[Fre06] Tim French. Bisimulation Quantifiers for Modal Logics. PhD thesis, School of Computer Science & Software Engineering, University of Western Australia, Décembre 2006. 
@phdthesis{phd-french,
  author =              {French, Tim},
  title =               {Bisimulation Quantifiers for Modal Logics},
  year =                {2006},
  month =               dec,
  school =              {School of Computer Science \& Software Engineering,
                         University of Western Australia},
  type =                {{PhD} thesis},
}
[Fri03] Carsten Fritz. Construction Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata. In CIAA'04, Lecture Notes in Computer Science 2759, pages 35-48. Springer-Verlag, juillet 2003. 
@inproceedings{ciaa2003-Fri,
  author =              {Fritz, Carsten},
  title =               {Construction {B}{\"u}chi Automata from Linear
                         Temporal Logic Using Simulation Relations for
                         Alternating {B}{\"u}chi Automata},
  editor =              {Ibarra, Oscar H. and Dang, Zhe},
  booktitle =           {{R}evised {S}elected {P}apers of the 9th
                         {I}nternational {C}onference on Implementation and
                         Application of Automata ({CIAA}'04)},
  acronym =             {{CIAA}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2759},
  pages =               {35-48},
  year =                {2003},
  month =               jul,
}
[FdR+03] Massimo Franceschet, Marteen de Rijke et Bernd-Holger Schlingloff. Hybrid Logics on Linear Structures: Expressivity and Complexity. In TIME-ICTL'03, pages 166-173. IEEE Comp. Soc. Press, juillet 2003. 
@inproceedings{time2003-FRS,
  author =              {Franceschet, Massimo and de Rijke, Marteen and
                         Schlingloff, Bernd-Holger},
  title =               {Hybrid Logics on Linear Structures: Expressivity and
                         Complexity},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {S}ymposium on {T}emporal {R}epresentation and
                         {R}easoning and of the 4th {I}nternational
                         {C}onference on {T}emporal {L}ogic
                         ({TIME}-{ICTL}'03)},
  acronym =             {{TIME-ICTL}'03},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {166-173},
  year =                {2003},
  month =               jul,
}
[FS00] Alain Finkel et Grégoire Sutre. Decidability of Reachability Problems for Classes of Two-Counter Automata. In STACS'00, Lecture Notes in Computer Science 1770, pages 346-357. Springer-Verlag, mars 2000. 
@inproceedings{stacs2000-FS,
  author =              {Finkel, Alain and Sutre, Gr{\'e}goire},
  title =               {Decidability of Reachability Problems for Classes of
                         Two-Counter Automata},
  editor =              {Reichel, Horst and Tison, Sophie},
  booktitle =           {{P}roceedings of the 17th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'00)},
  acronym =             {{STACS}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1770},
  pages =               {346-357},
  year =                {2000},
  month =               mar,
}
[FS01] Bernd Finkbeiner et Henny Sipma. Checking Finite Traces using Alternating Automata. In RV'01, Electronic Notes in Theoretical Computer Science 55(2). Elsevier, juillet 2001. 
@inproceedings{rv2001-FS,
  author =              {Finkbeiner, Bernd and Sipma, Henny},
  title =               {Checking Finite Traces using Alternating Automata},
  editor =              {Havelund, Klaus and Ro{\c{s}}u, Grigore},
  booktitle =           {{P}roceedings of the 1st {I}nternational {W}orkshop
                         on {R}untime {V}erification ({RV}'01)},
  acronym =             {{RV}'01},
  publisher =           {Elsevier},
  series =              {Electronic Notes in Theoretical Computer Science},
  volume =              {55},
  number =              {2},
  year =                {2001},
  month =               jul,
}
[FS01] Alain Finkel et Philippe Schnoebelen. Well-Structured Transition Systems Everywhere!. Theoretical Computer Science 256(1-2):63-92. Elsevier, avril 2001. 
@article{tcs256(1-2)-FS,
  author =              {Finkel, Alain and Schnoebelen, {\relax Ph}ilippe},
  title =               {Well-Structured Transition Systems Everywhere!},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {256},
  number =              {1-2},
  pages =               {63-92},
  year =                {2001},
  month =               apr,
}
[FS04] Bernd Finkbeiner et Henny Sipma. Checking Finite Traces using Alternating Automata. Formal Methods in System Design 24(2):101-127. Kluwer Academic, mars 2004. 
@article{fmsd24(2)-FS,
  author =              {Finkbeiner, Bernd and Sipma, Henny},
  title =               {Checking Finite Traces using Alternating Automata},
  publisher =           {Kluwer Academic},
  journal =             {Formal Methods in System Design},
  volume =              {24},
  number =              {2},
  pages =               {101-127},
  year =                {2004},
  month =               mar,
  doi =                 {10.1023/B:FORM.0000017718.28096.48},
}
[FS12] John Fearnley et Sven Schewe. Time and parallelizability results for parity games with bounded treewidth. In ICALP'12, Lecture Notes in Computer Science 7392, pages 189-200. Springer-Verlag, juillet 2012. 
@inproceedings{icalp2012-FS,
  author =              {Fearnley, John and Schewe, Sven},
  title =               {Time and parallelizability results for parity games
                         with bounded treewidth},
  editor =              {Czumaj, Artur and Mehlhorn, Kurt and Pitts, Andrew
                         and Wattenhofer, Roger},
  booktitle =           {{P}roceedings of the 39th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'12)~-- Part~{II}},
  acronym =             {{ICALP}'12},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7392},
  pages =               {189-200},
  year =                {2012},
  month =               jul,
  doi =                 {10.1007/978-3-642-31585-5_20},
}
[FSS02] Bernd Finkbeiner, Sriram Sankaranarayanan et Henny Sipma. Collecting Statistics over Runtime Executions. In RV'02, Electronic Notes in Theoretical Computer Science 70(4). Elsevier, juillet 2002. 
@inproceedings{rv2002-FSS,
  author =              {Finkbeiner, Bernd and Sankaranarayanan, Sriram and
                         Sipma, Henny},
  title =               {Collecting Statistics over Runtime Executions},
  editor =              {Havelund, Klaus and Ro{\c{s}}u, Grigore},
  booktitle =           {{P}roceedings of the 2nd {I}nternational {W}orkshop
                         on {R}untime {V}erification ({RV}'02)},
  acronym =             {{RV}'02},
  publisher =           {Elsevier},
  series =              {Electronic Notes in Theoretical Computer Science},
  volume =              {70},
  number =              {4},
  year =                {2002},
  month =               jul,
}
[FT95] Martin Farach et Mikkel Thorup. String Matching in Lempel-Ziv Compressed Strings. In STOC'95, pages 703-712. ACM Press, mai 1995. 
@inproceedings{stoc1995-FT,
  author =              {Farach, Martin and Thorup, Mikkel},
  title =               {String Matching in {L}empel-{Z}iv Compressed
                         Strings},
  booktitle =           {{P}roceedings of the 27th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'95)},
  acronym =             {{STOC}'95},
  publisher =           {ACM Press},
  pages =               {703-712},
  year =                {1995},
  month =               may,
}
[FT15] Jie Fu et Ufuk Topcu. Computational methods for stochastic control with metric interval temporal logic specifications. Research Report 1503.07193, arXiv, mars 2015. 
@techreport{arxiv1503.07193-FT,
  author =              {Fu, Jie and Topcu, Ufuk},
  title =               {Computational methods for stochastic control with
                         metric interval temporal logic specifications},
  number =              {1503.07193},
  year =                {2015},
  month =               mar,
  institution =         {arXiv},
  type =                {Research Report},
}
[FV97] Jerzy Filar et Koos Vrieze. Competitive Markov decision processes. Springer-Verlag, 1997. 
@book{CMDP-FV97,
  author =              {Filar, Jerzy and Vrieze, Koos},
  title =               {Competitive {M}arkov decision processes},
  publisher =           {Springer-Verlag},
  year =                {1997},
}
[FW05] Carsten Fritz et Thomas Wilke. Simulation Relations for Alternating Büchi Automata. Theoretical Computer Science 338(1-3):275-314. Elsevier, juin 2005. 
@article{tcs338(1-3)-FW,
  author =              {Fritz, Carsten and Wilke, Thomas},
  title =               {Simulation Relations for Alternating {B}{\"u}chi
                         Automata},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {338},
  number =              {1-3},
  pages =               {275-314},
  year =                {2005},
  month =               jun,
}
[FZ12] Wladimir Fridman et Martin Zimmermann. Playing Pushdown Parity Games in a Hurry. In GandALF'12, Electronic Proceedings in Theoretical Computer Science 96, pages 183-196. Septembre 2012. 
@inproceedings{gandalf2012-FZ,
  author =              {Fridman, Wladimir and Zimmermann, Martin},
  title =               {Playing Pushdown Parity Games in a Hurry},
  editor =              {Faella, Marco and Murano, Aniello},
  booktitle =           {{P}roceedings of the 3th {I}nternational {S}ymposium
                         on {G}ames, {A}utomata, {L}ogics and {F}ormal
                         {V}erification ({GandALF}'12)},
  acronym =             {{GandALF}'12},
  series =              {Electronic Proceedings in Theoretical Computer
                         Science},
  volume =              {96},
  pages =               {183-196},
  year =                {2012},
  month =               sep,
  doi =                 {10.4204/EPTCS.96.14},
}
Liste des auteurs