A
[dA99] Luca de Alfaro. Computing minimum and maximum reachability times in probabilistic systems. In CONCUR'99, Lecture Notes in Computer Science 1664, pages 66-81. Springer-Verlag, August 1999. 
@inproceedings{concur1999-Alf,
  author =              {de Alfaro, Luca},
  title =               {Computing minimum and maximum reachability times in
                         probabilistic systems},
  editor =              {Baeten, Jos C. M. and Mauw, Sjouke},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'99)},
  acronym =             {{CONCUR}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1664},
  pages =               {66-81},
  year =                {1999},
  month =               aug,
}
[dA03] Luca de Alfaro. Quantitative Verification and Control via the Mu-Calculus. In CONCUR'03, Lecture Notes in Computer Science 2761, pages 102-126. Springer-Verlag, August 2003. 
@inproceedings{concur2003-Alf,
  author =              {de Alfaro, Luca},
  title =               {Quantitative Verification and Control via the
                         Mu-Calculus},
  editor =              {Amadio, Roberto and Lugiez, Denis},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'03)},
  acronym =             {{CONCUR}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2761},
  pages =               {102-126},
  year =                {2003},
  month =               aug,
}
[AAB00] Aurore Annichini, Eugene Asarin, and Ahmed Bouajjani. Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems. In CAV'00, Lecture Notes in Computer Science 1855, pages 419-434. Springer-Verlag, July 2000. 
@inproceedings{cav2000-AAB,
  author =              {Annichini, Aurore and Asarin, Eugene and Bouajjani,
                         Ahmed},
  title =               {Symbolic Techniques for Parametric Reasoning about
                         Counter and Clock Systems},
  editor =              {Emerson, E. Allen and Sistla, A. Prasad},
  booktitle =           {{P}roceedings of the 12th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'00)},
  acronym =             {{CAV}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1855},
  pages =               {419-434},
  year =                {2000},
  month =               jul,
}
[AAB23] Shaull Almagor, Daniel Assa, and Udi Boker. Synchronized CTL over One-Counter Automata. In FSTTCS'23, Leibniz International Proceedings in Informatics 284, pages 19:1-19:22. Leibniz-Zentrum für Informatik, December 2023. 
@inproceedings{fsttcs2023-AAB,
  author =              {Almagor, Shaull and Assa, Daniel and Boker, Udi},
  title =               {Synchronized {CTL} over One-Counter Automata},
  editor =              {Bouyer, Patricia and Srinivasan, Srikanth},
  booktitle =           {{P}roceedings of the 43rd {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'23)},
  acronym =             {{FSTTCS}'23},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {284},
  pages =               {19:1-19:22},
  year =                {2023},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2023.19},
}
[AAD+06] Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, and René Peralta. Computation in Networks of Passively Mobile Finite-State Sensors. Distributed Computing 18(4):235-253. Springer-Verlag, March 2006. 
@article{discomp18(4)-AADFP,
  author =              {Angluin, Dana and Aspnes, James and Diamadi, Zo{\"e}
                         and Fischer, Michael J. and Peralta, Ren{\'e}},
  title =               {Computation in Networks of Passively Mobile
                         Finite-State Sensors},
  publisher =           {Springer-Verlag},
  journal =             {Distributed Computing},
  volume =              {18},
  number =              {4},
  pages =               {235-253},
  year =                {2006},
  month =               mar,
  doi =                 {10.1007/s00446-005-0138-3},
}
[AAE05] Baruch Awerbuch, Yossi Azar, and Amir Epstein. The price of routing unsplittable flow. In STOC'05, pages 57-66. ACM Press, May 2005. 
@inproceedings{stoc2005-AAE,
  author =              {Awerbuch, Baruch and Azar, Yossi and Epstein, Amir},
  title =               {The price of routing unsplittable flow},
  editor =              {Gabow, Harold N. and Fagin, Ronald},
  booktitle =           {{P}roceedings of the 37th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'05)},
  acronym =             {{STOC}'05},
  publisher =           {ACM Press},
  pages =               {57-66},
  year =                {2005},
  month =               may,
  doi =                 {10.1145/1060590.1060599},
}
[AAE+07] Dana Angluin, James Aspnes, David Eisenstat, and Eric Ruppert. The computational power of population protocols. Distributed Computing 20(4):279-304. Springer-Verlag, March 2007. 
@article{discomp20(4)-AAER,
  author =              {Angluin, Dana and Aspnes, James and Eisenstat, David
                         and Ruppert, Eric},
  title =               {The computational power of population protocols},
  publisher =           {Springer-Verlag},
  journal =             {Distributed Computing},
  volume =              {20},
  number =              {4},
  pages =               {279-304},
  year =                {2007},
  month =               mar,
  doi =                 {10.1007/s00446-007-0040-2},
}
[AAG+15] Manindra Agrawal, S. Akshay, Blaise Genest, and P. S. Thiagarajan. Approximate Verification of the Symbolic Dynamics of Markov Chains. Journal of the ACM 62(1):183-235. ACM Press, February 2015. 
@article{jacm62(1)-AAGT,
  author =              {Agrawal, Manindra and Akshay, S. and Genest, Blaise
                         and Thiagarajan, P. S.},
  title =               {Approximate Verification of the Symbolic Dynamics of
                         {M}arkov Chains},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {62},
  number =              {1},
  pages =               {183-235},
  year =                {2015},
  month =               feb,
  doi =                 {10.1145/2629417},
}
[AAM06] Yasmina Abdeddaïm, Eugene Asarin, and Oded Maler. Scheduling with timed automata. Theoretical Computer Science 354(2):272-300. Elsevier, March 2006. 
@article{tcs354(2)-AAM,
  author =              {Abdedda{\"\i}m, Yasmina and Asarin, Eugene and
                         Maler, Oded},
  title =               {Scheduling with timed automata},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {354},
  number =              {2},
  pages =               {272-300},
  year =                {2006},
  month =               mar,
}
[AB01] Carlos Areces and Patrick Blackburn. Bringing them all Together. Journal of Logic and Computation 11(5):657-669. Oxford University Press, October 2001. 
@article{jlc11(5)-AB,
  author =              {Areces, Carlos and Blackburn, Patrick},
  title =               {Bringing them all Together},
  publisher =           {Oxford University Press},
  journal =             {Journal of Logic and Computation},
  volume =              {11},
  number =              {5},
  pages =               {657-669},
  year =                {2001},
  month =               oct,
}
[AB01] Eugene Asarin and Ahmed Bouajjani. Perturbed Turing machines and hybrid systems. In LICS'01, pages 269-278. IEEE Comp. Soc. Press, June 2001. 
@inproceedings{lics2001-AB,
  author =              {Asarin, Eugene and Bouajjani, Ahmed},
  title =               {Perturbed {T}uring machines and hybrid systems},
  booktitle =           {{P}roceedings of the 16th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'01)},
  acronym =             {{LICS}'01},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {269-278},
  year =                {2001},
  month =               jun,
}
[AB09] Sanjeev Arora and Boaz Barak. Computational Complexity: A Modern Approach. Cambridge University Press, 2009. 
@book{AB09-CCMA,
  author =              {Arora, Sanjeev and Barak, Boaz},
  title =               {Computational Complexity: A~Modern Approach},
  publisher =           {Cambridge University Press},
  year =                {2009},
}
[ABB+16] José Bacelar Almeida, Manuel Barbosa, Gilles Barthe, François Dupressoir, and Michael Emmi. Verifying Constant-Time Implementations. In USENIX Security'16, pages 53-70. Usenix Association, August 2016. 
@inproceedings{usenixsec2016-ABBDE,
  author =              {Almeida, Jos{\'e} Bacelar and Barbosa, Manuel and
                         Barthe, Gilles and Dupressoir, Fran{\c c}ois and
                         Emmi, Michael},
  title =               {Verifying Constant-Time Implementations},
  editor =              {Holz, Thorsten and Savage, Stefan},
  booktitle =           {{P}roceedings of the 25th {USENIX} {S}ecurity
                         {S}ymposium ({USENIX} {S}ecurity'16)},
  acronym =             {{USENIX} {S}ecurity'16},
  publisher =           {Usenix Association},
  pages =               {53-70},
  year =                {2016},
  month =               aug,
}
[ABB+03] Luca Aceto, Patricia Bouyer, Augusto Burgueño, and Kim Guldstrand Larsen. The Power of Reachability Testing for Timed Automata. Theoretical Computer Science 300(1-3):411-475. Elsevier, May 2003. 
@article{tcs300(1-3)-ABBL,
  author =              {Aceto, Luca and Bouyer, Patricia and Burgue{\~n}o,
                         Augusto and Larsen, Kim Guldstrand},
  title =               {The~Power of Reachability Testing for Timed
                         Automata},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {300},
  number =              {1-3},
  pages =               {411-475},
  year =                {2003},
  month =               may,
  doi =                 {10.1016/S0304-3975(02)00334-1},
}
[ABD+17] Ernst Althaus, Björn Beber, Werner Damm, Stefan Disch, Willem Hagemann, Astrid Rakow, Christoph Scholl, Uwe Waldmann, and Boris Wirtz. Verification of linear hybrid systems with large discrete state spaces using counterexample-guided abstraction refinement. Science of Computer Programming 148:123-160. Elsevier, November 2017. 
@article{scp148()-ABDDHRSWW,
  author =              {Althaus, Ernst and Beber, Bj{\"o}rn and Damm, Werner
                         and Disch, Stefan and Hagemann, Willem and Rakow,
                         Astrid and Scholl, Christoph and Waldmann, Uwe and
                         Wirtz, Boris},
  title =               {Verification of linear hybrid systems with large
                         discrete state spaces using counterexample-guided
                         abstraction refinement},
  publisher =           {Elsevier},
  journal =             {Science of Computer Programming},
  volume =              {148},
  pages =               {123-160},
  year =                {2017},
  month =               nov,
  doi =                 {10.1016/j.scico.2017.04.010},
}
[ABE00] Parosh Aziz Abdulla, Per Bjesse, and Niklas Eén. Symbolic Reachability Analysis based on SAT Solvers. In TACAS'00, Lecture Notes in Computer Science 1785, pages 411-425. Springer-Verlag, March 2000. 
@inproceedings{tacas2000-ABE,
  author =              {Abdulla, Parosh Aziz and Bjesse, Per and E{\'e}n,
                         Niklas},
  title =               {Symbolic Reachability Analysis based on {SAT}
                         Solvers},
  editor =              {Graf, Susanne and Schwartzbach, Michael I.},
  booktitle =           {{P}roceedings of the 6th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'00)},
  acronym =             {{TACAS}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1785},
  pages =               {411-425},
  year =                {2000},
  month =               mar,
}
[ABF94] Amihood Amir, Gary Benson, and Martin Farach. Let Sleeping Files Lie: Pattern Matching in Z-Comporessed Files. In SODA'94, pages 705-714. ACM Press, January 1994. 
@inproceedings{soda1994-ABF,
  author =              {Amir, Amihood and Benson, Gary and Farach, Martin},
  title =               {Let Sleeping Files Lie: Pattern Matching in
                         {Z}-Comporessed Files},
  booktitle =           {{P}roceedings of the 5th {A}nnual {ACM}-{SIAM}
                         {S}ymposium on {D}iscrete {A}lgorithms ({SODA}'94)},
  acronym =             {{SODA}'94},
  publisher =           {ACM Press},
  pages =               {705-714},
  year =                {1994},
  month =               jan,
}
[ABG15] C. Aiswarya, Benedikt Bollig, and Paul Gastin. An automata-theoretic approach to the verification of distributed algorithms. In CONCUR'15, Leibniz International Proceedings in Informatics 42, pages 340-353. Leibniz-Zentrum für Informatik, September 2015. 
@inproceedings{concur2015-ABG,
  author =              {Aiswarya, C. and Bollig, Benedikt and Gastin, Paul},
  title =               {An automata-theoretic approach to the verification
                         of distributed algorithms},
  editor =              {Aceto, Luca and de Frutos{-}Escrig, David},
  booktitle =           {{P}roceedings of the 26th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'15)},
  acronym =             {{CONCUR}'15},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {42},
  pages =               {340-353},
  year =                {2015},
  month =               sep,
  doi =                 {10.4230/LIPIcs.CONCUR.2015.340},
}
[ABG+08] S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, and K. Narayan Kumar. Distributed Timed Automata with Independently Evolving Clocks. In CONCUR'08, Lecture Notes in Computer Science 5201, pages 82-97. Springer-Verlag, August 2008. 
@inproceedings{ABGMN-concur08,
  author =              {Akshay, S. and Bollig, Benedikt and Gastin, Paul and
                         Mukund, Madhavan and Narayan Kumar, K.},
  title =               {Distributed Timed Automata with Independently
                         Evolving Clocks},
  editor =              {van Breugel, Franck and Chechik, Marsha},
  booktitle =           {{P}roceedings of the 19th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'08)},
  acronym =             {{CONCUR}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5201},
  pages =               {82-97},
  year =                {2008},
  month =               aug,
}
[ABK13] Shaull Almagor, Udi Boker, and Orna Kupferman. Formalizing and Reasoning about Quality. In ICALP'13, Lecture Notes in Computer Science 7966, pages 15-27. Springer-Verlag, July 2013. 
@inproceedings{icalp2013-ABK,
  author =              {Almagor, Shaull and Boker, Udi and Kupferman, Orna},
  title =               {Formalizing and Reasoning about Quality},
  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 =               {15-27},
  year =                {2013},
  month =               jul,
}
[ABK14] Shaull Almagor, Udi Boker, and Orna Kupferman. Discounting in LTL. In TACAS'14, Lecture Notes in Computer Science 8413, pages 424-439. Springer-Verlag, April 2014. 
@inproceedings{tacas2014-ABK,
  author =              {Almagor, Shaull and Boker, Udi and Kupferman, Orna},
  title =               {Discounting in~{LTL}},
  editor =              {{\'A}brah{\'a}m, Erikz and Havelund, Klaus},
  booktitle =           {{P}roceedings of the 20th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'14)},
  acronym =             {{TACAS}'14},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8413},
  pages =               {424-439},
  year =                {2014},
  month =               apr,
  doi =                 {10.1007/978-3-642-54862-8_37},
}
[ABK16] Shaull Almagor, Udi Boker, and Orna Kupferman. Formally Reasoning about Quality. Journal of the ACM 63(3):24:1-24:56. ACM Press, September 2016. 
@article{jacm63(3)-ABK,
  author =              {Almagor, Shaull and Boker, Udi and Kupferman, Orna},
  title =               {Formally Reasoning about Quality},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {63},
  number =              {3},
  pages =               {24:1-24:56},
  year =                {2016},
  month =               sep,
  doi =                 {10.1145/2875421},
}
[ABK+97] Eugene Asarin, Marius Bozga, Alain Kerbrat, Oded Maler, Amir Pnueli, and Anne Rasse. Data-Structures for the Verification of Timed Automata. In HART'97, Lecture Notes in Computer Science 1201, pages 346-360. Springer-Verlag, March 1997. 
@inproceedings{hart1997-ABKMPR,
  author =              {Asarin, Eugene and Bozga, Marius and Kerbrat, Alain
                         and Maler, Oded and Pnueli, Amir and Rasse, Anne},
  title =               {Data-Structures for the Verification of Timed
                         Automata},
  editor =              {Maler, Oded},
  booktitle =           {{P}roceedings of the 1997 {I}nternational {W}orkshop
                         on {H}ybrid and {R}eal-Time {S}ystems ({HART}'97)},
  acronym =             {{HART}'97},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1201},
  pages =               {346-360},
  year =                {1997},
  month =               mar,
}
[ABK+03] Roy Armoni, Doron Bustan, Orna Kupferman, and Moshe Y. Vardi. Resets vs. Aborts in Linear Temporal Logic. In TACAS'03, Lecture Notes in Computer Science 2619, pages 65-80. Springer-Verlag, April 2003. 
@inproceedings{tacas2003-ABKV,
  author =              {Armoni, Roy and Bustan, Doron and Kupferman, Orna
                         and Vardi, Moshe Y.},
  title =               {Resets {vs.} Aborts in Linear Temporal Logic},
  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 =               {65-80},
  year =                {2003},
  month =               apr,
}
[ABM99] Carlos Areces, Patrick Blackburn, and Maarten Marx. A Road-Map on Complexity for Hybrid Logics. In CSL'99, Lecture Notes in Computer Science 1862, pages 307-321. Springer-Verlag, September 1999. 
@inproceedings{csl1999-ABM,
  author =              {Areces, Carlos and Blackburn, Patrick and Marx,
                         Maarten},
  title =               {A Road-Map on Complexity for Hybrid Logics},
  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 =               {307-321},
  year =                {1999},
  month =               sep,
}
[ABM00] Carlos Areces, Patrick Blackburn, and Maarten Marx. The Computational Complexity of Hybrid Temporal Logics. Logic Journal of the IGPL 8(5):653-679. Oxford University Press, September 2000. 
@article{jigpl8(5)-ABM,
  author =              {Areces, Carlos and Blackburn, Patrick and Marx,
                         Maarten},
  title =               {The Computational Complexity of Hybrid Temporal
                         Logics},
  publisher =           {Oxford University Press},
  journal =             {Logic Journal of the IGPL},
  volume =              {8},
  number =              {5},
  pages =               {653-679},
  year =                {2000},
  month =               sep,
}
[ABM04] Rajeev Alur, Mikhail Bernadsky, and Parthasarathy Madhusudan. Optimal Reachability for Weighted Timed Games. In ICALP'04, Lecture Notes in Computer Science, pages 122-133. Springer-Verlag, 2004. 
@inproceedings{icalp2004-ABM,
  author =              {Alur, Rajeev and Bernadsky, Mikhail and Madhusudan,
                         Parthasarathy},
  title =               {Optimal Reachability for Weighted Timed Games},
  booktitle =           {{P}roceedings of the 31st {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'04)},
  acronym =             {{ICALP}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  pages =               {122-133},
  year =                {2004},
}
[ABO97] Eric Allender, Robert Beals, and Mitsunori Ogihara. The Complexity of Matrix Rank and Feasible Systems of Linear Equations. Technical Report 97-40, Rutgers University, New Jersey, USA, September 1997. 
@techreport{TR-DIMACS9740,
  author =              {Allender, Eric and Beals, Robert and Ogihara,
                         Mitsunori},
  title =               {The Complexity of Matrix Rank and Feasible Systems
                         of Linear Equations},
  number =              {97-40},
  year =                {1997},
  month =               sep,
  institution =         {Rutgers University, New Jersey, USA},
}
[Abr79] Karl Abrahamson. Modal Logic of Concurrent Nondeterministic Programs. In SCC'79, Lecture Notes in Computer Science 70, pages 21-33. Springer-Verlag, July 1979. 
@inproceedings{scc1979-Abr,
  author =              {Abrahamson, Karl},
  title =               {Modal Logic of Concurrent Nondeterministic Programs},
  editor =              {Kahn, Gilles},
  booktitle =           {{P}roceedings of the International Symposium
                         Semantics of Concurrent Computation ({SCC}'79)},
  acronym =             {{SCC}'79},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {70},
  pages =               {21-33},
  year =                {1979},
  month =               jul,
}
[AC02] Jean-Pierre Aubin and Francine Catté. Bilateral Fixed-point and Algebraic Properties of Viability Kernels and Capture Basins of Sets. Technical Report 02-10, CeReMaDe, Université Paris 9, Paris, France, April 2002. 
@techreport{TR-Ceremade0210,
  author =              {Aubin, Jean-Pierre and Catt{\'e}, Francine},
  title =               {Bilateral Fixed-point and Algebraic Properties of
                         Viability Kernels and Capture Basins of Sets},
  number =              {02-10},
  year =                {2002},
  month =               apr,
  institution =         {CeReMaDe, Universit\'e Paris 9, Paris, France},
}
[ACD93] Rajeev Alur, Costas Courcoubetis, and David L. Dill. Model-Checking in Dense Real-Time. Information and Computation 104(1):2-34. Academic Press, May 1993. 
@article{icomp104(1)-ACD,
  author =              {Alur, Rajeev and Courcoubetis, Costas and Dill,
                         David L.},
  title =               {Model-Checking in Dense Real-Time},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {104},
  number =              {1},
  pages =               {2-34},
  year =                {1993},
  month =               may,
}
[ACD+92] Rajeev Alur, Costas Courcoubetis, David L. Dill, Nicolas Halbwachs, and Howard Wong-Toi. An Implementation of three algorithms for timing verification based on automata emptiness. In RTSS'92, pages 157-166. IEEE Comp. Soc. Press, December 1992. 
@inproceedings{rts1992-ACDHW,
  author =              {Alur, Rajeev and Courcoubetis, Costas and Dill,
                         David L. and Halbwachs, Nicolas and Wong{-}Toi,
                         Howard},
  title =               {An Implementation of three algorithms for timing
                         verification based on automata emptiness},
  booktitle =           {{P}roceedings of the 13th {S}ymposium on {R}eal-Time
                         {S}ystems ({RTSS}'92)},
  acronym =             {{RTSS}'92},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {157-166},
  year =                {1992},
  month =               dec,
}
[ACH94] Rajeev Alur, Costas Courcoubetis, and Thomas A. Henzinger. The Observational Power of Clocks. In CONCUR'94, Lecture Notes in Computer Science 836, pages 162-177. Springer-Verlag, August 1994. 
@inproceedings{concur1994-ACH,
  author =              {Alur, Rajeev and Courcoubetis, Costas and Henzinger,
                         Thomas A.},
  title =               {The Observational Power of Clocks},
  editor =              {Jonsson, Bengt and Parrow, Joachim},
  booktitle =           {{P}roceedings of the 5th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'94)},
  acronym =             {{CONCUR}'94},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {836},
  pages =               {162-177},
  year =                {1994},
  month =               aug,
}
[ACH97] Rajeev Alur, Costas Courcoubetis, and Thomas A. Henzinger. Computing Accumulated Delays in Real Time Systems. Formal Methods in System Design 11(2):137-155. Kluwer Academic, August 1997. 
@article{fmsd11(2)-ACH,
  author =              {Alur, Rajeev and Courcoubetis, Costas and Henzinger,
                         Thomas A.},
  title =               {Computing Accumulated Delays in Real Time Systems},
  publisher =           {Kluwer Academic},
  journal =             {Formal Methods in System Design},
  volume =              {11},
  number =              {2},
  pages =               {137-155},
  year =                {1997},
  month =               aug,
}
[ACH+93] Rajeev Alur, Costas Courcoubetis, Thomas A. Henzinger, and Pei-Hsin Ho. Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems. In HSCC'92, Lecture Notes in Computer Science 736, pages 209-229. Springer-Verlag, 1993. 
@inproceedings{hscc1992-ACHH,
  author =              {Alur, Rajeev and Courcoubetis, Costas and Henzinger,
                         Thomas A. and Ho, Pei-Hsin},
  title =               {Hybrid Automata: An Algorithmic Approach to the
                         Specification and Verification of Hybrid Systems},
  editor =              {Grossman, Robert L. and Nerode, Anil and Ravn,
                         Anders P. and Rischel, Hans},
  booktitle =           {{H}ybrid {S}ystems ({HSCC}'92)},
  acronym =             {{HSCC}'92},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {736},
  pages =               {209-229},
  year =                {1993},
}
[ACH+95] Rajeev Alur, Costas Courcoubetis, Nicolas Halbwachs, Thomas A. Henzinger, Pei-Hsin Ho, Xavier Nicollin, Alfredo Olivero, Joseph Sifakis, and Sergio Yovine. The Algorithmic Analysis of Hybrid Systems. Theoretical Computer Science 138(1):3-34. Elsevier, 1995. 
@article{tcs138(1)-ACHHHNOSY,
  author =              {Alur, Rajeev and Courcoubetis, Costas and Halbwachs,
                         Nicolas and Henzinger, Thomas A. and Ho, Pei-Hsin
                         and Nicollin, Xavier and Olivero, Alfredo and
                         Sifakis, Joseph and Yovine, Sergio},
  title =               {The Algorithmic Analysis of Hybrid Systems},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {138},
  number =              {1},
  pages =               {3-34},
  year =                {1995},
}
[ACJ+96] Parosh Aziz Abdulla, Kārlis Čerāns, Bengt Jonsson, and Yih-Kuen Tsay. General Decidability Theorems for Infinite-State Systems. In LICS'96, pages 313-321. IEEE Comp. Soc. Press, July 1996. 
@inproceedings{lics1996-ACJT,
  author =              {Abdulla, Parosh Aziz and {\v{C}}er{\={a}}ns,
                         K{\={a}}rlis and Jonsson, Bengt and Tsay, Yih-Kuen},
  title =               {General Decidability Theorems for Infinite-State
                         Systems},
  booktitle =           {{P}roceedings of the 11th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'96)},
  acronym =             {{LICS}'96},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {313-321},
  year =                {1996},
  month =               jul,
}
[ACM97] Eugene Asarin, Paul Caspi, and Oded Maler. A Kleene Theorem for Timed Automata. In LICS'97, pages 160-171. IEEE Comp. Soc. Press, June 1997. 
@inproceedings{lics1997-ACM,
  author =              {Asarin, Eugene and Caspi, Paul and Maler, Oded},
  title =               {A {K}leene Theorem for Timed Automata},
  booktitle =           {{P}roceedings of the 12th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'97)},
  acronym =             {{LICS}'97},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {160-171},
  year =                {1997},
  month =               jun,
}
[ACS10] Tesnim Abdellatif, Jacques Combaz, and Joseph Sifakis. Model-based implementation of real-time applications. In EMSOFT'10, pages 229-238. ACM Press, October 2010. 
@inproceedings{emsoft2010-ACS,
  author =              {Abdellatif, Tesnim and Combaz, Jacques and Sifakis,
                         Joseph},
  title =               {Model-based implementation of real-time
                         applications},
  editor =              {Carloni, Luca P. and Tripakis, Stavros},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {E}mbedded {S}oftware ({EMSOFT}'10)},
  acronym =             {{EMSOFT}'10},
  publisher =           {ACM Press},
  pages =               {229-238},
  year =                {2010},
  month =               oct,
}
[ACZ+20] Jie An, Mingshuai Chen, Bohua Zhan, Naijun Zhan, and Miaomiao Zhang. Learning One-Clock Timed Automata. In TACAS'20 (Part I), Lecture Notes in Computer Science 12078, pages 444-462. Springer-Verlag, April 2020. 
@inproceedings{tacas2020-ACZZZ,
  author =              {An, Jie and Chen, Mingshuai and Zhan, Bohua and
                         Zhan, Naijun and Zhang, Miaomiao},
  title =               {Learning One-Clock Timed Automata},
  editor =              {Biere, Armin and Parker, David},
  booktitle =           {{P}roceedings of the 26th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'20)~-- {P}art~{I}},
  acronym =             {{TACAS}'20 (Part~{I})},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {12078},
  pages =               {444-462},
  year =                {2020},
  month =               apr,
  doi =                 {10.1007/978-3-030-45190-5_25},
}
[AD89] André Arnold and Anne Dicky. An Algebraic Characterization of Transition System Equivalences. Information and Computation 82(2):198-229. Academic Press, August 1989. 
@article{icomp82(2)-AD,
  author =              {Arnold, Andr{\'e} and Dicky, Anne},
  title =               {An Algebraic Characterization of Transition System
                         Equivalences},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {82},
  number =              {2},
  pages =               {198-229},
  year =                {1989},
  month =               aug,
}
[AD90] Rajeev Alur and David L. Dill. Automata For Modeling Real-Time Systems. In ICALP'90, Lecture Notes in Computer Science 443, pages 322-335. Springer-Verlag, July 1990. 
@inproceedings{icalp1990-AD,
  author =              {Alur, Rajeev and Dill, David L.},
  title =               {Automata For Modeling Real-Time Systems},
  editor =              {Paterson, Mike},
  booktitle =           {{P}roceedings of the 17th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'90)},
  acronym =             {{ICALP}'90},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {443},
  pages =               {322-335},
  year =                {1990},
  month =               jul,
}
[AD94] Rajeev Alur and David L. Dill. A Theory of Timed Automata. Theoretical Computer Science 126(2):183-235. Elsevier, April 1994. 
@article{tcs126(2)-AD,
  author =              {Alur, Rajeev and Dill, David L.},
  title =               {A Theory of Timed Automata},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {126},
  number =              {2},
  pages =               {183-235},
  year =                {1994},
  month =               apr,
}
[AD09] Timos Antonopoulos and Anuj Dawar. Separating Graph Logic from MSO. In FoSSaCS'09, Lecture Notes in Computer Science 5504, pages 63-77. Springer-Verlag, March 2009. 
@inproceedings{fossacs2009-AD,
  author =              {Antonopoulos, Timos and Dawar, Anuj},
  title =               {Separating Graph Logic from~{MSO}},
  editor =              {de Alfaro, Luca},
  booktitle =           {{P}roceedings of the 12th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'09)},
  acronym =             {{FoSSaCS}'09},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5504},
  pages =               {63-77},
  year =                {2009},
  month =               mar,
}
[ADK+04] Elliot Anshelevich, Anirban Dasgupta, Jon Kleinberg, Éva Tardos, Tom Wexler, and Tim Roughgarden. The Price of Stability for Network Design with Fair Cost Allocation. In FOCS'04, pages 295-304. IEEE Comp. Soc. Press, October 2004. 
@inproceedings{focs2004-ADKTWR,
  author =              {Anshelevich, Elliot and Dasgupta, Anirban and
                         Kleinberg, Jon and Tardos, {\'E}va and Wexler, Tom
                         and Roughgarden, Tim},
  title =               {The Price of Stability for Network Design with Fair
                         Cost Allocation},
  booktitle =           {{P}roceedings of the 45th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'04)},
  acronym =             {{FOCS}'04},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {295-304},
  year =                {2004},
  month =               oct,
  doi =                 {10.1109/FOCS.2004.68},
}
[ADK+08] Elliot Anshelevich, Anirban Dasgupta, Jon Kleinberg, Éva Tardos, Tom Wexler, and Tim Roughgarden. The Price of Stability for Network Design with Fair Cost Allocation. SIAM Journal on Computing 38(4):1602-1623. Society for Industrial and Applied Math., 2008. 
@article{siamcomp38(4)-ADKTWR,
  author =              {Anshelevich, Elliot and Dasgupta, Anirban and
                         Kleinberg, Jon and Tardos, {\'E}va and Wexler, Tom
                         and Roughgarden, Tim},
  title =               {The~Price of Stability for Network Design with Fair
                         Cost Allocation},
  publisher =           {Society for Industrial and Applied Math.},
  journal =             {SIAM Journal on Computing},
  volume =              {38},
  number =              {4},
  pages =               {1602-1623},
  year =                {2008},
  doi =                 {10.1137/070680096},
}
[ADM04] Parosh Aziz Abdulla, Johann Deneux, and Pritha Mahata. Multi-clock timed networks. In LICS'04, pages 345-354. IEEE Comp. Soc. Press, July 2004. 
@inproceedings{lics2004-ADM,
  author =              {Abdulla, Parosh Aziz and Deneux, Johann and Mahata,
                         Pritha},
  title =               {Multi-clock timed networks},
  booktitle =           {{P}roceedings of the 19th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'04)},
  acronym =             {{LICS}'04},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {345-354},
  year =                {2004},
  month =               jul,
  doi =                 {10.1109/LICS.2004.1319629},
}
[ADM+09] Rajeev Alur, Aldric Degorre, Oded Maler, and Gera Weiss. On Omega-Languages Defined by Mean-Payoff Conditions. In FoSSaCS'09, Lecture Notes in Computer Science 5504. Springer-Verlag, March 2009. 
@inproceedings{fossacs2009-ADMW,
  author =              {Alur, Rajeev and Degorre, Aldric and Maler, Oded and
                         Weiss, Gera},
  title =               {On Omega-Languages Defined by Mean-Payoff
                         Conditions},
  editor =              {de Alfaro, Luca},
  booktitle =           {{P}roceedings of the 12th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'09)},
  acronym =             {{FoSSaCS}'09},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5504},
  year =                {2009},
  month =               mar,
  doi =                 {10.1007/978-3-642-00596-1_24},
}
[ADO+05] Parosh Aziz Abdulla, Johann Deneux, Joël Ouaknine, and James Worrell. Decidability and Complexity Results for Timed Automata via Channel Machines. In ICALP'05, Lecture Notes in Computer Science 3580, pages 1089-1101. Springer-Verlag, July 2005. 
@inproceedings{icalp2005-ADOW,
  author =              {Abdulla, Parosh Aziz and Deneux, Johann and
                         Ouaknine, Jo{\"e}l and Worrell, James},
  title =               {Decidability and Complexity Results for Timed
                         Automata via Channel Machines},
  editor =              {Caires, Lu{\'\i}s and Italiano, Giuseppe F. and
                         Monteiro, Lu{\'\i}s and Palamidessi, Catuscia and
                         Yung, Moti},
  booktitle =           {{P}roceedings of the 32nd {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'05)},
  acronym =             {{ICALP}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3580},
  pages =               {1089-1101},
  year =                {2005},
  month =               jul,
}
[AEL+01] Rajeev Alur, Kousha Etessami, Salvatore La Torre, and Doron A. Peled. Parametric Temporal Logic for "Model Measuring". ACM Transactions on Computational Logic 2(3):388-407. ACM Press, July 2001. 
@article{tocl2(3)-AELP,
  author =              {Alur, Rajeev and Etessami, Kousha and La{~}Torre,
                         Salvatore and Peled, Doron A.},
  title =               {Parametric Temporal Logic for {"}Model Measuring{"}},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Computational Logic},
  volume =              {2},
  number =              {3},
  pages =               {388-407},
  year =                {2001},
  month =               jul,
}
[AFF+02] Roy Armoni, Limor Fix, Alon Flaisher, Rob Gerth, Boris Ginsburg, Tomer Kanza, Avner Landver, Sela Mador-Haim, Eli Singerman, Andreas Tiemeyer, Moshe Y. Vardi, and Yael Zbar. The ForSpec Temporal Logic: A New Temporal Property-Specification Language. In TACAS'02, Lecture Notes in Computer Science 2280, pages 296-311. Springer-Verlag, April 2002. 
@inproceedings{tacas2002-AFFGGKLMSTVZ,
  author =              {Armoni, Roy and Fix, Limor and Flaisher, Alon and
                         Gerth, Rob and Ginsburg, Boris and Kanza, Tomer and
                         Landver, Avner and Mador{-}Haim, Sela and Singerman,
                         Eli and Tiemeyer, Andreas and Vardi, Moshe Y. and
                         Zbar, Yael},
  title =               {The {ForSpec} Temporal Logic: A New Temporal
                         Property-Specification Language},
  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 =               {296-311},
  year =                {2002},
  month =               apr,
}
[AFF+03] Roy Armoni, Limor Fix, Alon Flaisher, Orna Grumberg, Nir Piterman, Andreas Tiemeyer, and Moshe Y. Vardi. Enhanced Vacuity Detection in Linear Temporal Logic. In CAV'03, Lecture Notes in Computer Science 2725, pages 368-380. Springer-Verlag, July 2003. 
@inproceedings{cav2003-AFFGPTV,
  author =              {Armoni, Roy and Fix, Limor and Flaisher, Alon and
                         Grumberg, Orna and Piterman, Nir and Tiemeyer,
                         Andreas and Vardi, Moshe Y.},
  title =               {Enhanced Vacuity Detection in Linear Temporal Logic},
  editor =              {Hunt, Jr, Warren A. and Somenzi, Fabio},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'03)},
  acronym =             {{CAV}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2725},
  pages =               {368-380},
  year =                {2003},
  month =               jul,
  doi =                 {10.1007/978-3-540-45069-6_35},
}
[AFH91] Rajeev Alur, Tómas Feder, and Thomas A. Henzinger. The Benefits of Relaxing Punctuality. In PODC'91, pages 139-152. ACM Press, August 1991. 
@inproceedings{podc1991-AFH,
  author =              {Alur, Rajeev and Feder, T{\'o}mas and Henzinger,
                         Thomas A.},
  title =               {The Benefits of Relaxing Punctuality},
  booktitle =           {{P}roceedings of the 10th {ACM} {S}ymposium on
                         {P}rinciples of {D}istributed {C}omputing
                         ({PODC}'91)},
  acronym =             {{PODC}'91},
  publisher =           {ACM Press},
  pages =               {139-152},
  year =                {1991},
  month =               aug,
}
[AFH94] Rajeev Alur, Limor Fix, and Thomas A. Henzinger. Event-Clock Automata: A Determinizable Class of Timed Automata. In CAV'94, Lecture Notes in Computer Science 818, pages 1-13. Springer-Verlag, June 1994. 
@inproceedings{cav1994-AFH,
  author =              {Alur, Rajeev and Fix, Limor and Henzinger, Thomas
                         A.},
  title =               {Event-Clock Automata: A Determinizable Class of
                         Timed Automata},
  editor =              {Dill, David L.},
  booktitle =           {{P}roceedings of the 6th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'94)},
  acronym =             {{CAV}'94},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {818},
  pages =               {1-13},
  year =                {1994},
  month =               jun,
}
[AFH96] Rajeev Alur, Tómas Feder, and Thomas A. Henzinger. The Benefits of Relaxing Punctuality. Journal of the ACM 43(1):116-146. ACM Press, January 1996. 
@article{jacm43(1)-AFH,
  author =              {Alur, Rajeev and Feder, T{\'o}mas and Henzinger,
                         Thomas A.},
  title =               {The Benefits of Relaxing Punctuality},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {43},
  number =              {1},
  pages =               {116-146},
  year =                {1996},
  month =               jan,
}
[AFH99] Rajeev Alur, Limor Fix, and Thomas A. Henzinger. Event-Clock Automata: A Determinizable Class of Timed Automata. Theoretical Computer Science 211(1-2):253-273. Elsevier, January 1999. 
@article{tcs211(1-2)-AFH,
  author =              {Alur, Rajeev and Fix, Limor and Henzinger, Thomas
                         A.},
  title =               {Event-Clock Automata: A Determinizable Class of
                         Timed Automata},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {211},
  number =              {1-2},
  pages =               {253-273},
  year =                {1999},
  month =               jan,
  doi =                 {10.1016/S0304-3975(97)00173-4},
}
[dAF+03] Luca de Alfaro, Marco Faella, Thomas A. Henzinger, Rupak Majumdar, and Mariëlle Stoelinga. The Element of Surprise in Timed Games. In CONCUR'03, Lecture Notes in Computer Science 2761, pages 142-156. Springer-Verlag, August 2003. 
@inproceedings{concur2003-AFHMS,
  author =              {de Alfaro, Luca and Faella, Marco and Henzinger,
                         Thomas A. and Majumdar, Rupak and Stoelinga,
                         Mari{\"e}lle},
  title =               {The Element of Surprise in Timed Games},
  editor =              {Amadio, Roberto and Lugiez, Denis},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'03)},
  acronym =             {{CONCUR}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2761},
  pages =               {142-156},
  year =                {2003},
  month =               aug,
}
[dAF+05] Luca de Alfaro, Marco Faella, Thomas A. Henzinger, Rupak Majumdar, and Mariëlle Stoelinga. Model checking discounted temporal properties. Theoretical Computer Science 345(1):139-170. Elsevier, November 2005. 
@article{tcs345(1)-AFHMS,
  author =              {de Alfaro, Luca and Faella, Marco and Henzinger,
                         Thomas A. and Majumdar, Rupak and Stoelinga,
                         Mari{\"e}lle},
  title =               {Model checking discounted temporal properties},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {345},
  number =              {1},
  pages =               {139-170},
  year =                {2005},
  month =               nov,
}
[AFM+02] Tobias Amnell, Elena Fersman, Leonid Mokrushin, Paul Pettersson, and Wang Yi. TIMES – A Tool for Modelling and Implementation of Embedded Systems. In TACAS'02, Lecture Notes in Computer Science 2280, pages 460-464. Springer-Verlag, April 2002. 
@inproceedings{tacas2002-AFMPY,
  author =              {Amnell, Tobias and Fersman, Elena and Mokrushin,
                         Leonid and Pettersson, Paul and Yi, Wang},
  title =               {TIMES~-- A~Tool for Modelling and Implementation of
                         Embedded Systems},
  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 =               {460-464},
  year =                {2002},
  month =               apr,
}
[AG00] Carme Àlvarez and Raymond Greenlaw. A Compendium of Problems Complete for Symmetric Logarithmic Space. Computational Complexity 9(2):123-145. Birkhäuser, 2000. 
@article{cc9(2)-AG,
  author =              {{\`A}lvarez, Carme and Greenlaw, Raymond},
  title =               {A Compendium of Problems Complete for Symmetric
                         Logarithmic Space},
  publisher =           {Birkh{\"a}user},
  journal =             {Computational Complexity},
  volume =              {9},
  number =              {2},
  pages =               {123-145},
  year =                {2000},
}
[AG11] Krzysztof Apt and Erich Grädel. Lectures in Game Theory for Computer Scientists. Cambridge University Press, 2011. 
@book{AG-gt4cs11,
  author =              {Apt, Krzysztof and Gr{\"a}del, Erich},
  title =               {Lectures in Game Theory for Computer Scientists},
  publisher =           {Cambridge University Press},
  year =                {2011},
}
[AGG08] Xavier Allamigeon, Stéphane Gaubert, and Éric Goubault. Inferring Min and Max Invariants Using Max-Plus Polyhedra. In SAS'08, Lecture Notes in Computer Science 5079, pages 189-204. Springer-Verlag, July 2008. 
@inproceedings{sas2008-AGG,
  author =              {Allamigeon, Xavier and Gaubert, St{\'e}phane and
                         Goubault, {\'E}ric},
  title =               {Inferring Min and Max Invariants Using Max-Plus
                         Polyhedra},
  editor =              {Alpuente, Mar{\'\i}a and Vidal, Germ{\'a}n},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {S}ymposium on {S}tatic {A}nalysis ({SAS}'08)},
  acronym =             {{SAS}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5079},
  pages =               {189-204},
  year =                {2008},
  month =               jul,
}
[AGJ07] Thomas Ågotnes, Valentin Goranko, and Wojciech Jamroga. Alternating-time Temporal Logics with Irrevocable Strategies. In TARK'07, pages 15-24. June 2007. 
@inproceedings{tark2007-AGJ,
  author =              {{\AA}gotnes, Thomas and Goranko, Valentin and
                         Jamroga, Wojciech},
  title =               {Alternating-time Temporal Logics with Irrevocable
                         Strategies},
  editor =              {Samet, Dov},
  booktitle =           {{P}roceedings of the 11th {C}onference on
                         {T}heoretical {A}spects of {R}ationality and
                         {K}nowledge ({TARK}'07)},
  acronym =             {{TARK}'07},
  pages =               {15-24},
  year =                {2007},
  month =               jun,
}
[AGJ08] Thomas Ågotnes, Valentin Goranko, and Wojciech Jamroga. Strategic Commitment and Release in Logics for Multi-Agent Systems (Extended abstract). Technical Report 08-01, Clausthal University of Technology, Germany, 2008. 
@techreport{clausthal0801-AGJ,
  author =              {{\AA}gotnes, Thomas and Goranko, Valentin and
                         Jamroga, Wojciech},
  title =               {Strategic Commitment and Release in Logics for
                         Multi-Agent Systems (Extended abstract)},
  number =              {08-01},
  year =                {2008},
  institution =         {Clausthal University of Technology, Germany},
}
[AGK16] S. Akshay, Paul Gastin, and Shankara Narayanan Krishna. Analyzing Timed Systems Using Tree Automata. In CONCUR'16, Leibniz International Proceedings in Informatics 59, pages 27:1-27:14. Leibniz-Zentrum für Informatik, August 2016. 
@inproceedings{concur2016-AGK,
  author =              {Akshay, S. and Gastin, Paul and Krishna, Shankara
                         Narayanan},
  title =               {Analyzing Timed Systems Using Tree Automata},
  editor =              {Desharnais, Jules and Jagadeesan, Radha},
  booktitle =           {{P}roceedings of the 27th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'16)},
  acronym =             {{CONCUR}'16},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {59},
  pages =               {27:1-27:14},
  year =                {2016},
  month =               aug,
  doi =                 {10.4230/LIPIcs.CONCUR.2016.27},
}
[AGK17] Guy Avni, Shibashis Guha, and Orna Kupferman. Timed Network Games. In MFCS'17, Leibniz International Proceedings in Informatics 84, pages 37:1-37:16. Leibniz-Zentrum für Informatik, August 2017. 
@inproceedings{mfcs2017-AGK,
  author =              {Avni, Guy and Guha, Shibashis and Kupferman, Orna},
  title =               {Timed Network Games},
  editor =              {Larsen, Kim Guldstrand and Bodlaender, Hans L. and
                         Raskin, Jean-Fran{\c c}ois},
  booktitle =           {{P}roceedings of the 42nd {I}nternational
                         {S}ymposium on {M}athematical {F}oundations of
                         {C}omputer {S}cience ({MFCS}'17)},
  acronym =             {{MFCS}'17},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {84},
  pages =               {37:1-37:16},
  year =                {2017},
  month =               aug,
  doi =                 {10.4230/LIPIcs.MFCS.2017.37},
}
[AGK18] Guy Avni, Shibashis Guha, and Orna Kupferman. Timed Network Games with Clocks. In MFCS'18, Leibniz International Proceedings in Informatics 117, pages 23:1-23:18. Leibniz-Zentrum für Informatik, August 2018. 
@inproceedings{mfcs2018-AGK,
  author =              {Avni, Guy and Guha, Shibashis and Kupferman, Orna},
  title =               {Timed Network Games with Clocks},
  editor =              {Potapov, Igor and Spirakis, Paul G. and Worrell,
                         James},
  booktitle =           {{P}roceedings of the 43rd {I}nternational
                         {S}ymposium on {M}athematical {F}oundations of
                         {C}omputer {S}cience ({MFCS}'18)},
  acronym =             {{MFCS}'18},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {117},
  pages =               {23:1-23:18},
  year =                {2018},
  month =               aug,
  doi =                 {10.4230/LIPIcs.MFCS.2018.23},
}
[AGK+17] S. Akshay, Paul Gastin, Shankara Narayanan Krishna, and Ilias Sarkar. Towards an Efficient Tree Automata Based Technique for Timed Systems. In CONCUR'17, Leibniz International Proceedings in Informatics 85, pages 39:1-39:15. Leibniz-Zentrum für Informatik, September 2017. 
@inproceedings{concur2017-AGKS,
  author =              {Akshay, S. and Gastin, Paul and Krishna, Shankara
                         Narayanan and Sarkar, Ilias},
  title =               {Towards an Efficient Tree Automata Based Technique
                         for Timed Systems},
  editor =              {Meyer, Roland and Nestmann, Uwe},
  booktitle =           {{P}roceedings of the 28th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'17)},
  acronym =             {{CONCUR}'17},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {85},
  pages =               {39:1-39:15},
  year =                {2017},
  month =               sep,
  doi =                 {10.4230/LIPIcs.CONCUR.2017.39},
}
[AGP+99] Karine Altisen, Gregor Gößler, Amir Pnueli, Joseph Sifakis, Stavros Tripakis, and Sergio Yovine. A Framework for Scheduler Synthesis. In RTSS'99, pages 154-163. IEEE Comp. Soc. Press, December 1999. 
@inproceedings{rts1999-AGPSTY,
  author =              {Altisen, Karine and G{\"o}{\ss}ler, Gregor and
                         Pnueli, Amir and Sifakis, Joseph and Tripakis,
                         Stavros and Yovine, Sergio},
  title =               {A Framework for Scheduler Synthesis},
  booktitle =           {{P}roceedings of the 20th {S}ymposium on {R}eal-Time
                         {S}ystems ({RTSS}'99)},
  acronym =             {{RTSS}'99},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {154-163},
  year =                {1999},
  month =               dec,
}
[AGS00] Karine Altisen, Gregor Gößler, and Joseph Sifakis. A Methodology for the Construction of Scheduled Systems. In FTRTFT'00, Lecture Notes in Computer Science 1926, pages 106-120. Springer-Verlag, September 2000. 
@inproceedings{ftrtft2000-AGS,
  author =              {Altisen, Karine and G{\"o}{\ss}ler, Gregor and
                         Sifakis, Joseph},
  title =               {A Methodology for the Construction of Scheduled
                         Systems},
  editor =              {Joseph, Mathai},
  booktitle =           {{P}roceedings of the 6th {F}ormal {T}echniques in
                         {R}eal-Time and {F}ault-Tolerant {S}ystems
                         ({FTRTFT}'00)},
  acronym =             {{FTRTFT}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1926},
  pages =               {106-120},
  year =                {2000},
  month =               sep,
}
[AH89] Rajeev Alur and Thomas A. Henzinger. A Really Temporal Logic. In FOCS'89, pages 164-169. IEEE Comp. Soc. Press, October 1989. 
@inproceedings{focs1989-AH,
  author =              {Alur, Rajeev and Henzinger, Thomas A.},
  title =               {A Really Temporal Logic},
  booktitle =           {{P}roceedings of the 30th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'89)},
  acronym =             {{FOCS}'89},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {164-169},
  year =                {1989},
  month =               oct,
}
[AH92] Rajeev Alur and Thomas A. Henzinger. Logics and Models of Real Time: A Survey. In REX'91, Lecture Notes in Computer Science 600, pages 74-106. Springer-Verlag, 1992. 
@inproceedings{rex1991-AH,
  author =              {Alur, Rajeev and Henzinger, Thomas A.},
  title =               {Logics and Models of Real Time: A~Survey},
  editor =              {de~Bakker, Jaco W. and Huizing, Cornelis and de
                         Roever, Willem-Paul and Rozenberg, Grzegorz},
  booktitle =           {{R}eal-{T}ime: {T}heory in {P}ractice, {P}roceedings
                         of {REX} {W}orkshop~1991 ({REX}'91)},
  acronym =             {{REX}'91},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {600},
  pages =               {74-106},
  year =                {1992},
  confyear =            {1991},
  confmonth =           {6},
}
[AH92] Rajeev Alur and Thomas A. Henzinger. Back to the Future: Towards a Theory of Timed Regular Languages. In FOCS'92, pages 177-186. IEEE Comp. Soc. Press, October 1992. 
@inproceedings{focs1992-AH,
  author =              {Alur, Rajeev and Henzinger, Thomas A.},
  title =               {Back to the Future: Towards a Theory of Timed
                         Regular Languages},
  booktitle =           {{P}roceedings of the 33rd {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'92)},
  acronym =             {{FOCS}'92},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {177-186},
  year =                {1992},
  month =               oct,
}
[AH93] Rajeev Alur and Thomas A. Henzinger. Real-time Logics: Complexity and Expressiveness. Information and Computation 104(1):35-77. Academic Press, May 1993. 
@article{icomp104(1)-AH,
  author =              {Alur, Rajeev and Henzinger, Thomas A.},
  title =               {Real-time Logics: Complexity and Expressiveness},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {104},
  number =              {1},
  pages =               {35-77},
  year =                {1993},
  month =               may,
}
[AH94] Rajeev Alur and Thomas A. Henzinger. A Really Temporal Logic. Journal of the ACM 41(1):181-203. ACM Press, January 1994. 
@article{jacm41(1)-AH,
  author =              {Alur, Rajeev and Henzinger, Thomas A.},
  title =               {A Really Temporal Logic},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {41},
  number =              {1},
  pages =               {181-203},
  year =                {1994},
  month =               jan,
}
[dAH00] Luca de Alfaro and Thomas A. Henzinger. Concurrent Omera-Regular Games. In LICS'00, pages 141-154. IEEE Comp. Soc. Press, June 2000. 
@inproceedings{lics2000-AH,
  author =              {de Alfaro, Luca and Henzinger, Thomas A.},
  title =               {Concurrent Omera-Regular Games},
  booktitle =           {{P}roceedings of the 15th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'00)},
  acronym =             {{LICS}'00},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {141-154},
  year =                {2000},
  month =               jun,
  doi =                 {10.1109/LICS.2000.855763},
}
[dAH01] Luca de Alfaro and Thomas A. Henzinger. Interface automata. In FSE'01, pages 109-120. ACM Press, September 2001. 
@inproceedings{fse2001-AH,
  author =              {de Alfaro, Luca and Henzinger, Thomas A.},
  title =               {Interface automata},
  booktitle =           {{P}roceedings of the 9th {A}nnual {S}ymposium on
                         {F}oundations of {S}oftware {E}ngineering
                         ({FSE}'01)},
  acronym =             {{FSE}'01},
  publisher =           {ACM Press},
  pages =               {109-120},
  year =                {2001},
  month =               sep,
}
[AH02] Henrik Reif Andersen and Henrik Hulgaard. Boolean Expression Diagrams. Information and Computation 179(2):194-212. Academic Press, December 2002. 
@article{icomp179(2)-AH,
  author =              {Andersen, Henrik Reif and Hulgaard, Henrik},
  title =               {Boolean Expression Diagrams},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {179},
  number =              {2},
  pages =               {194-212},
  year =                {2002},
  month =               dec,
  doi =                 {10.1006/inco.2001.2948},
}
[AHH96] Rajeev Alur, Thomas A. Henzinger, and Pei-Hsin Ho. Automatic Symbolic Verification of Embedded Systems. IEEE Transactions on Software Engineering 22(3):181-201. IEEE Comp. Soc. Press, March 1996. 
@article{tse22(3)-AHH,
  author =              {Alur, Rajeev and Henzinger, Thomas A. and Ho,
                         Pei-Hsin},
  title =               {Automatic Symbolic Verification of Embedded Systems},
  publisher =           {IEEE Comp. Soc. Press},
  journal =             {IEEE Transactions on Software Engineering},
  volume =              {22},
  number =              {3},
  pages =               {181-201},
  year =                {1996},
  month =               mar,
}
[AHK97] Rajeev Alur, Thomas A. Henzinger, and Orna Kupferman. Alternating-time Temporal Logic. In FOCS'97, pages 100-109. IEEE Comp. Soc. Press, October 1997. 
@inproceedings{focs1997-AHK,
  author =              {Alur, Rajeev and Henzinger, Thomas A. and Kupferman,
                         Orna},
  title =               {Alternating-time Temporal Logic},
  booktitle =           {{P}roceedings of the 38th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'97)},
  acronym =             {{FOCS}'97},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {100-109},
  year =                {1997},
  month =               oct,
}
[AHK98] Rajeev Alur, Thomas A. Henzinger, and Orna Kupferman. Alternating-time Temporal Logic. In COMPOS'97, Lecture Notes in Computer Science 1536, pages 23-60. Springer-Verlag, 1998. 
@inproceedings{compos1997-AHK,
  author =              {Alur, Rajeev and Henzinger, Thomas A. and Kupferman,
                         Orna},
  title =               {Alternating-time Temporal Logic},
  editor =              {de Roever, Willem-Paul and Langmaack, Hans and
                         Pnueli, Amir},
  booktitle =           {{R}evised {L}ectures of the 1st {I}nternational
                         {S}ymposium on {C}ompositionality: {T}he
                         {S}ignificant {D}ifference ({COMPOS}'97)},
  acronym =             {{COMPOS}'97},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1536},
  pages =               {23-60},
  year =                {1998},
  confyear =            {1997},
  confmonth =           {9},
}
[dAH+98] Luca de Alfaro, Thomas A. Henzinger, and Orna Kupferman. Concurrent Reachability Games. In FOCS'98, pages 564-575. IEEE Comp. Soc. Press, November 1998. 
@inproceedings{focs1998-AHK,
  author =              {de Alfaro, Luca and Henzinger, Thomas A. and
                         Kupferman, Orna},
  title =               {Concurrent Reachability Games},
  booktitle =           {{P}roceedings of the 39th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'98)},
  acronym =             {{FOCS}'98},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {564-575},
  year =                {1998},
  month =               nov,
}
[AHK02] Rajeev Alur, Thomas A. Henzinger, and Orna Kupferman. Alternating-time Temporal Logic. Journal of the ACM 49(5):672-713. ACM Press, September 2002. 
@article{jacm49(5)-AHK,
  author =              {Alur, Rajeev and Henzinger, Thomas A. and Kupferman,
                         Orna},
  title =               {Alternating-time Temporal Logic},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {49},
  number =              {5},
  pages =               {672-713},
  year =                {2002},
  month =               sep,
  doi =                 {10.1145/585265.585270},
}
[dAH+07] Luca de Alfaro, Thomas A. Henzinger, and Orna Kupferman. Concurrent Reachability Games. Theoretical Computer Science 386(3):188-217. Elsevier, November 2007. 
@article{tcs386(3)-AHK,
  author =              {de Alfaro, Luca and Henzinger, Thomas A. and
                         Kupferman, Orna},
  title =               {Concurrent Reachability Games},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {386},
  number =              {3},
  pages =               {188-217},
  year =                {2007},
  month =               nov,
  doi =                 {10.1016/j.tcs.2007.07.008},
}
[AHK16] Guy Avni, Thomas A. Henzinger, and Orna Kupferman. Dynamic Resource Allocation Games. In SAGT'16, Lecture Notes in Computer Science 9928, pages 153-166. Springer-Verlag, September 2016. 
@inproceedings{sagt2016-AHK,
  author =              {Avni, Guy and Henzinger, Thomas A. and Kupferman,
                         Orna},
  title =               {Dynamic Resource Allocation Games},
  booktitle =           {{P}roceedings of the 9th {I}nternational {S}ymposium
                         on {A}lgorithmic {G}ame {T}heory ({SAGT}'16)},
  acronym =             {{SAGT}'16},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9928},
  pages =               {153-166},
  year =                {2016},
  month =               sep,
  doi =                 {10.1007/978-3-662-53354-3_13},
}
[AHK20] Guy Avni, Thomas A. Henzinger, and Orna Kupferman. Dynamic Resource Allocation Games. Theoretical Computer Science 807:42-55. Elsevier, February 2020. 
@article{tcs807()-AHK,
  author =              {Avni, Guy and Henzinger, Thomas A. and Kupferman,
                         Orna},
  title =               {Dynamic Resource Allocation Games},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {807},
  pages =               {42-55},
  year =                {2020},
  month =               feb,
  doi =                 {10.1016/j.tcs.2019.06.031},
}
[AHK+98] Rajeev Alur, Thomas A. Henzinger, Orna Kupferman, and Moshe Y. Vardi. Alternating Refinement Relations. In CONCUR'98, Lecture Notes in Computer Science 1466, pages 163-178. Springer-Verlag, September 1998. 
@inproceedings{concur1998-AHKV,
  author =              {Alur, Rajeev and Henzinger, Thomas A. and Kupferman,
                         Orna and Vardi, Moshe Y.},
  title =               {Alternating Refinement Relations},
  editor =              {Sangiorgi, Davide and de Simone, Robert},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'98)},
  acronym =             {{CONCUR}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1466},
  pages =               {163-178},
  year =                {1998},
  month =               sep,
}
[dAH+00] Luca de Alfaro, Thomas A. Henzinger, and Freddy Y. C. Mang. The Control of Synchronous Systems. In CONCUR'00, Lecture Notes in Computer Science 1877, pages 458-473. Springer-Verlag, August 2000. 
@inproceedings{concur2000-AHM,
  author =              {de Alfaro, Luca and Henzinger, Thomas A. and Mang,
                         Freddy Y. C.},
  title =               {The Control of Synchronous Systems},
  editor =              {Palamidessi, Catuscia},
  booktitle =           {{P}roceedings of the 11th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'00)},
  acronym =             {{CONCUR}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1877},
  pages =               {458-473},
  year =                {2000},
  month =               aug,
}
[dAH+01] Luca de Alfaro, Thomas A. Henzinger, and Freddy Y. C. Mang. The Control of Synchronous Systems, Part II. In CONCUR'01, Lecture Notes in Computer Science 2154, pages 566-582. Springer-Verlag, August 2001. 
@inproceedings{concur2001-AHM,
  author =              {de Alfaro, Luca and Henzinger, Thomas A. and Mang,
                         Freddy Y. C.},
  title =               {The Control of Synchronous Systems, Part~{II}},
  editor =              {Larsen, Kim Guldstrand and Nielsen, Mogens},
  booktitle =           {{P}roceedings of the 12th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'01)},
  acronym =             {{CONCUR}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2154},
  pages =               {566-582},
  year =                {2001},
  month =               aug,
}
[dAH+01] Luca de Alfaro, Thomas A. Henzinger, and Rupak Majumdar. Symbolic Algorithms for Infinite-State Games. In CONCUR'01, Lecture Notes in Computer Science 2154, pages 536-550. Springer-Verlag, August 2001. 
@inproceedings{concur2001-AHM2,
  author =              {de Alfaro, Luca and Henzinger, Thomas A. and
                         Majumdar, Rupak},
  title =               {Symbolic Algorithms for Infinite-State Games},
  editor =              {Larsen, Kim Guldstrand and Nielsen, Mogens},
  booktitle =           {{P}roceedings of the 12th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'01)},
  acronym =             {{CONCUR}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2154},
  pages =               {536-550},
  year =                {2001},
  month =               aug,
}
[dAH+01] Luca de Alfaro, Thomas A. Henzinger, and Rupak Majumdar. From Verification to Control: Dynamic Programs for Omega-Regular Objectives. In LICS'01, pages 279-290. IEEE Comp. Soc. Press, June 2001. 
@inproceedings{lics2001-AHM,
  author =              {de Alfaro, Luca and Henzinger, Thomas A. and
                         Majumdar, Rupak},
  title =               {From Verification to Control: Dynamic Programs for
                         Omega-Regular Objectives},
  booktitle =           {{P}roceedings of the 16th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'01)},
  acronym =             {{LICS}'01},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {279-290},
  year =                {2001},
  month =               jun,
}
[AHM+98] Rajeev Alur, Thomas A. Henzinger, Freddy Y. C. Mang, Shaz Qadeer, Sriram Rajamani, and Serdar Taşiran. MOCHA: Modularity in Model Checking. In CAV'98, Lecture Notes in Computer Science 1427, pages 521-525. Springer-Verlag, June 1998. 
@inproceedings{cav1998-AHMQRT,
  author =              {Alur, Rajeev and Henzinger, Thomas A. and Mang,
                         Freddy Y. C. and Qadeer, Shaz and Rajamani, Sriram
                         and Ta{\c s}iran, Serdar},
  title =               {{MOCHA}: Modularity in Model Checking},
  editor =              {Hu, Alan J. and Vardi, Moshe Y.},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'98)},
  acronym =             {{CAV}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1427},
  pages =               {521-525},
  year =                {1998},
  month =               jun,
}
[AHR00] Myla Archer, Constance L. Heitmeyer, and Elvinia Riccobene. Using TAME to prove invariants of automata models: Two case studies. In FMSP'00, pages 25-36. ACM Press, August 2000. 
@inproceedings{fmsp2000-AHR,
  author =              {Archer, Myla and Heitmeyer, Constance L. and
                         Riccobene, Elvinia},
  title =               {Using {TAME} to prove invariants of automata models:
                         Two~case studies},
  editor =              {Heimdahl, Mats Per Erik},
  booktitle =           {{P}roceedings of the 3rd {W}orkshop on {F}ormal
                         {M}ethods in {S}oftware {P}ractice ({FMSP}'00)},
  acronym =             {{FMSP}'00},
  publisher =           {ACM Press},
  pages =               {25-36},
  year =                {2000},
  month =               aug,
  doi =                 {10.1145/349360.351127},
}
[AHV93] Rajeev Alur, Thomas A. Henzinger, and Moshe Y. Vardi. Parametric Real-Time Reasoning. In STOC'93, pages 592-601. ACM Press, 1993. 
@inproceedings{stoc1993-AHV,
  author =              {Alur, Rajeev and Henzinger, Thomas A. and Vardi,
                         Moshe Y.},
  title =               {Parametric Real-Time Reasoning},
  booktitle =           {{P}roceedings of the 25th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'93)},
  acronym =             {{STOC}'93},
  publisher =           {ACM Press},
  pages =               {592-601},
  year =                {1993},
}
[AI01] Micah Adler and Neil Immerman. An n! Lower Bound On Formula Size. In LICS'01, pages 197-206. IEEE Comp. Soc. Press, June 2001. 
@inproceedings{lics2001-AI,
  author =              {Adler, Micah and Immerman, Neil},
  title =               {An {{\(n!\)}} Lower Bound On Formula Size},
  booktitle =           {{P}roceedings of the 16th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'01)},
  acronym =             {{LICS}'01},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {197-206},
  year =                {2001},
  month =               jun,
}
[AI03] Micah Adler and Neil Immerman. An n! Lower Bound On Formula Size. ACM Transactions on Computational Logic 4(3):296-314. ACM Press, July 2003. 
@article{tocl4(3)-AI,
  author =              {Adler, Micah and Immerman, Neil},
  title =               {An {{\(n!\)}} Lower Bound On Formula Size},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Computational Logic},
  volume =              {4},
  number =              {3},
  pages =               {296-314},
  year =                {2003},
  month =               jul,
}
[AIK+95] Rajeev Alur, Alon Itai, Robert P. Kurshan, and Mihalis Yannakakis. Timing Verification by Successive Approximation. Information and Computation 118(1):142-157. Academic Press, April 1995. 
@article{icomp118(1)-AIKY,
  author =              {Alur, Rajeev and Itai, Alon and Kurshan, Robert P.
                         and Yannakakis, Mihalis},
  title =               {Timing Verification by Successive Approximation},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {118},
  number =              {1},
  pages =               {142-157},
  year =                {1995},
  month =               apr,
}
[AIP+00] Luca Aceto, Anna Ingólfsdóttir, Mikkel Lykke Pedersen, and Jan Poulsen. Characteristic Formulae for Timed Automata. RAIRO – Theoretical Informatics and Applications 34(6):565-584. EDP Sciences, 2000. 
@article{rairo-tia34(6)-AIPP,
  author =              {Aceto, Luca and Ing{\'o}lfsd{\'o}ttir, Anna and
                         Pedersen, Mikkel Lykke and Poulsen, Jan},
  title =               {Characteristic Formulae for Timed Automata},
  publisher =           {EDP Sciences},
  journal =             {RAIRO~-- Theoretical Informatics and Applications},
  volume =              {34},
  number =              {6},
  pages =               {565-584},
  year =                {2000},
  doi =                 {10.1051/ita:2000131},
}
[AJ95] Carme Àlvarez and Birgit Jenner. On adaptive DLOGTIME and POLYLOGTIME reductions. Theoretical Computer Science 148(2):183-205. Elsevier, September 1995. 
@article{tcs148(2)-AJ,
  author =              {{\`A}lvarez, Carme and Jenner, Birgit},
  title =               {On adaptive {DLOGTIME} and {POLYLOGTIME} reductions},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {148},
  number =              {2},
  pages =               {183-205},
  year =                {1995},
  month =               sep,
}
[AJ96] Parosh Aziz Abdulla and Bengt Jonsson. Verifying Programs with Unreliable Channels. Information and Computation 127(2):91-101. Academic Press, June 1996. 
@article{icomp127(2)-AJ,
  author =              {Abdulla, Parosh Aziz and Jonsson, Bengt},
  title =               {Verifying Programs with Unreliable Channels},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {127},
  number =              {2},
  pages =               {91-101},
  year =                {1996},
  month =               jun,
  doi =                 {10.1006/inco.1996.0053},
}
[AJ99] Parosh Aziz Abdulla and Bengt Jonsson. On the Existence of Network Invariants for Verifying Parameterized Systems. In Correct System Design, Recent Insight and Advances, Lecture Notes in Computer Science 1710, pages 180-197. Springer-Verlag, 1999. 
@inproceedings{lncs1710-AJ,
  author =              {Abdulla, Parosh Aziz and Jonsson, Bengt},
  title =               {On the Existence of Network Invariants for Verifying
                         Parameterized Systems},
  editor =              {Olderog, Ernst R{\"u}diger and Steffen, Bernhard},
  booktitle =           {Correct System Design, Recent Insight and Advances},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1710},
  pages =               {180-197},
  year =                {1999},
}
[AJ03] Parosh Aziz Abdulla and Bengt Jonsson. Model checking of systems with many identical timed processes. Theoretical Computer Science 290(1):241-264. Elsevier, January 2003. 
@article{tcs290(1)-AJ,
  author =              {Abdulla, Parosh Aziz and Jonsson, Bengt},
  title =               {Model checking of systems with many identical timed
                         processes},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {290},
  number =              {1},
  pages =               {241-264},
  year =                {2003},
  month =               jan,
  doi =                 {10.1016/S0304-3975(01)00330-9},
}
[AJK16] Simon Außerlechner, Swen Jacobs, and Ayrat Khalimov. Tight Cutoffs for Guarded Protocols with Fairness. In VMCAI'16, Lecture Notes in Computer Science 9583, pages 476-494. Springer-Verlag, January 2016. 
@inproceedings{vmcai2016-AJK,
  author =              {Au{\ss}erlechner, Simon and Jacobs, Swen and
                         Khalimov, Ayrat},
  title =               {Tight Cutoffs for Guarded Protocols with Fairness},
  editor =              {Jobstmann, Barbara and Leino, K. Rustan M.},
  booktitle =           {{P}roceedings of the 17th {I}nternational {W}orkshop
                         on {V}erification, {M}odel {C}hecking, and
                         {A}bstract {I}nterpretation ({VMCAI}'16)},
  acronym =             {{VMCAI}'16},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9583},
  pages =               {476-494},
  year =                {2016},
  month =               jan,
  doi =                 {10.1007/978-3-662-49122-5_23},
}
[AJK+14] Benjamin Aminof, Swen Jacobs, Ayrat Khalimov, and Sasha Rubin. Parametrized Model Checking of Token-Passing Systems. In VMCAI'14, Lecture Notes in Computer Science 8318, pages 262-281. Springer-Verlag, January 2014. 
@inproceedings{vmcai2014-AJKR,
  author =              {Aminof, Benjamin and Jacobs, Swen and Khalimov,
                         Ayrat and Rubin, Sasha},
  title =               {Parametrized Model Checking of Token-Passing
                         Systems},
  editor =              {McMillan, Kenneth L. and Rival, Xavier},
  booktitle =           {{P}roceedings of the 15th {I}nternational {W}orkshop
                         on {V}erification, {M}odel {C}hecking, and
                         {A}bstract {I}nterpretation ({VMCAI}'14)},
  acronym =             {{VMCAI}'14},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8318},
  pages =               {262-281},
  year =                {2014},
  month =               jan,
  doi =                 {10.1007/978-3-642-54013-4_15},
}
[AJN+04] Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, and Mayank Saksena. A Survey of Regular Model Checking. In CONCUR'04, Lecture Notes in Computer Science 3170, pages 35-48. Springer-Verlag, August 2004. 
@inproceedings{concur2004-AJNS,
  author =              {Abdulla, Parosh Aziz and Jonsson, Bengt and Nilsson,
                         Marcus and Saksena, Mayank},
  title =               {A Survey of Regular Model Checking},
  editor =              {Gardner, {\relax Ph}ilippa and Yoshida, Nobuko},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'04)},
  acronym =             {{CONCUR}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3170},
  pages =               {35-48},
  year =                {2004},
  month =               aug,
  doi =                 {10.1007/978-3-540-28644-8_3},
}
[AK86] Krzysztof Apt and Dexter C. Kozen. Limits for automatic verification of finite-state concurrent systems. Information Processing Letters 22(6):307-309. Elsevier, May 1986. 
@article{ipl22(6)-AK,
  author =              {Apt, Krzysztof and Kozen, Dexter C.},
  title =               {Limits for automatic verification of finite-state
                         concurrent systems},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {22},
  number =              {6},
  pages =               {307-309},
  year =                {1986},
  month =               may,
  doi =                 {10.1016/0020-0190(86)90071-2},
}
[AK16] Shaull Almagor and Orna Kupferman. High-Quality Synthesis Against Stochastic Environments. In CSL'16, Leibniz International Proceedings in Informatics 62, pages 28:1-28:17. Leibniz-Zentrum für Informatik, September 2016. 
@inproceedings{csl2016-AK,
  author =              {Almagor, Shaull and Kupferman, Orna},
  title =               {High-Quality Synthesis Against Stochastic
                         Environments},
  editor =              {Talbot, Jean-Marc and Regnier, Laurent},
  booktitle =           {{P}roceedings of the 25th {EACSL} {A}nnual
                         {C}onference on {C}omputer {S}cience {L}ogic
                         ({CSL}'16)},
  acronym =             {{CSL}'16},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {62},
  pages =               {28:1-28:17},
  year =                {2016},
  month =               sep,
  doi =                 {10.4230/LIPIcs.CSL.2016.28},
}
[AKK15] Shaull Almagor, Denis Kuperberg, and Orna Kupferman. The Sensing Cost of Monitoring and Synthesis. In FSTTCS'15, Leibniz International Proceedings in Informatics 45, pages 380-393. Leibniz-Zentrum für Informatik, December 2015. 
@inproceedings{fsttcs2015-AKK,
  author =              {Almagor, Shaull and Kuperberg, Denis and Kupferman,
                         Orna},
  title =               {The~Sensing Cost of Monitoring and Synthesis},
  editor =              {Harsha, Prahladh and Ramalingam, G.},
  booktitle =           {{P}roceedings of the 35th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'15)},
  acronym =             {{FSTTCS}'15},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {45},
  pages =               {380-393},
  year =                {2015},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2015.380},
}
[AKM03] Yasmina Abdeddaïm, Abdelkarim Kerbaa, and Oded Maler. Task Graph Scheduling Using Timed Automata. In IPDPS'03, pages 237. IEEE Comp. Soc. Press, April 2003. 
@inproceedings{ipdps2003-AKM,
  author =              {Abdedda{\"\i}m, Yasmina and Kerbaa, Abdelkarim and
                         Maler, Oded},
  title =               {Task Graph Scheduling Using Timed Automata},
  booktitle =           {{P}roceedings of the 17th International Parallel and
                         Distributed Processing Symposium ({IPDPS}'03)},
  acronym =             {{IPDPS}'03},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {237},
  year =                {2003},
  month =               apr,
}
[AKP18] Shaull Almagor, Orna Kupferman, and Giuseppe Perelli. Synthesis of Controllable Nash Equilibria in Quantitative Objective Games. In IJCAI'18, pages 35-41. IJCAI organization, July 2018. 
@inproceedings{ijcai2018-AKP,
  author =              {Almagor, Shaull and Kupferman, Orna and Perelli,
                         Giuseppe},
  title =               {Synthesis of Controllable {N}ash Equilibria in
                         Quantitative Objective Games},
  editor =              {Lang, J{\'e}r{\^o}me},
  booktitle =           {{P}roceedings of the 27th {I}nternational {J}oint
                         {C}onference on {A}rtificial {I}ntelligence
                         ({IJCAI}'18)},
  acronym =             {{IJCAI}'18},
  publisher =           {IJCAI organization},
  pages =               {35-41},
  year =                {2018},
  month =               jul,
  doi =                 {10.24963/ijcai.2018/5},
}
[AKR+14] Benjamin Aminof, Tomer Kotek, Sasha Rubin, Francesco Spegni, and Helmut Veith. Parameterized Model Checking of Rendezvous Systems. In CONCUR'14, Lecture Notes in Computer Science 8704, pages 109-124. Springer-Verlag, September 2014. 
@inproceedings{concur2014-AKRSV,
  author =              {Aminof, Benjamin and Kotek, Tomer and Rubin, Sasha
                         and Spegni, Francesco and Veith, Helmut},
  title =               {Parameterized Model Checking of Rendezvous Systems},
  editor =              {Baldan, Paolo and Gorla, Daniele},
  booktitle =           {{P}roceedings of the 25th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'14)},
  acronym =             {{CONCUR}'14},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8704},
  pages =               {109-124},
  year =                {2014},
  month =               sep,
  doi =                 {10.1007/978-3-662-44584-6_9},
}
[AKR+17] Shaull Almagor, Orna Kupferman, Jan Oliver Ringert, and Yaron Velner. Quantitative Assume Guarantee Synthesis. In CAV'17, Lecture Notes in Computer Science 10427, pages 353-374. Springer-Verlag, July 2017. 
@inproceedings{cav2017-AKRV,
  author =              {Almagor, Shaull and Kupferman, Orna and Ringert, Jan
                         Oliver and Velner, Yaron},
  title =               {Quantitative Assume Guarantee Synthesis},
  editor =              {Majumdar, Rupak and Kuncak, Viktor},
  booktitle =           {{P}roceedings of the 29th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'17)},
  acronym =             {{CAV}'17},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {10427},
  pages =               {353-374},
  year =                {2017},
  month =               jul,
  doi =                 {10.1007/978-3-319-63390-9_19},
}
[AKV98] Rajeev Alur, Robert P. Kurshan, and Mahesh Viswanathan. Membership Question for Timed and Hybrid Automata. In RTSS'98, pages 254-263. IEEE Comp. Soc. Press, December 1998. 
@inproceedings{rts1998-AKV,
  author =              {Alur, Rajeev and Kurshan, Robert P. and Viswanathan,
                         Mahesh},
  title =               {Membership Question for Timed and Hybrid Automata},
  booktitle =           {{P}roceedings of the 19th {S}ymposium on {R}eal-Time
                         {S}ystems ({RTSS}'98)},
  acronym =             {{RTSS}'98},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {254-263},
  year =                {1998},
  month =               dec,
}
[AKY10] Parosh Aziz Abdulla, Pavel Krčál, and Wang Yi. Sampled Semantics of Timed Automata. Logical Methods in Computer Science 6(3). September 2010. 
@article{lmcs6(3)-AJ,
  author =              {Abdulla, Parosh Aziz and Kr{\v{c}}{\'a}l, Pavel and
                         Yi, Wang},
  title =               {Sampled Semantics of Timed Automata},
  journal =             {Logical Methods in Computer Science},
  volume =              {6},
  number =              {3},
  year =                {2010},
  month =               sep,
  doi =                 {10.2168/LMCS-6(3:14)2010},
}
[AL92] Martín Abadi and Leslie Lamport. An old-fashioned recipe for real time. In REX'91, Lecture Notes in Computer Science 600, pages 1-27. Springer-Verlag, 1992. 
@inproceedings{rex1991-AL,
  author =              {Abadi, Mart{\'\i}n and Lamport, Leslie},
  title =               {An old-fashioned recipe for real time},
  editor =              {de~Bakker, Jaco W. and Huizing, Cornelis and de
                         Roever, Willem-Paul and Rozenberg, Grzegorz},
  booktitle =           {{R}eal-{T}ime: {T}heory in {P}ractice, {P}roceedings
                         of {REX} {W}orkshop~1991 ({REX}'91)},
  acronym =             {{REX}'91},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {600},
  pages =               {1-27},
  year =                {1992},
  confyear =            {1991},
  confmonth =           {6},
  doi =                 {10.1007/BFb0031985},
}
[AL02] Luca Aceto and François Laroussinie. Is your Model Checker on Time?. Journal of Logic and Algebraic Programming 52-53:3-51. Elsevier, June 2002. 
@article{jlap52-53()-AL,
  author =              {Aceto, Luca and Laroussinie, Fran{\c c}ois},
  title =               {Is your Model Checker on Time?},
  publisher =           {Elsevier},
  journal =             {Journal of Logic and Algebraic Programming},
  volume =              {52-53},
  pages =               {3-51},
  year =                {2002},
  month =               jun,
}
[AL04] Rajeev Alur and Salvatore La Torre. Deterministic Generators and Games for LTL Fragments. ACM Transactions on Computational Logic 5(1):297-322. ACM Press, January 2004. 
@article{tocl5(1)-AL,
  author =              {Alur, Rajeev and La{~}Torre, Salvatore},
  title =               {Deterministic Generators and Games for {LTL}
                         Fragments},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Computational Logic},
  volume =              {5},
  number =              {1},
  pages =               {297-322},
  year =                {2004},
  month =               jan,
}
[All89] Eric Allender. P-Uniform Circuit Complexity. Journal of the ACM 36(4):912-928. ACM Press, October 1989. 
@article{jacm36(4)-All,
  author =              {Allender, Eric},
  title =               {{P}-Uniform Circuit Complexity},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {36},
  number =              {4},
  pages =               {912-928},
  year =                {1989},
  month =               oct,
}
[All97] Eric Allender. Making Computation Count: Arithmetic Circuits in the Nineties. SIGACT News 28(4):2-15. ACM Press, December 1997. 
@article{sigact-news28(4)-All,
  author =              {Allender, Eric},
  title =               {Making Computation Count: Arithmetic Circuits in the
                         Nineties},
  publisher =           {ACM Press},
  journal =             {SIGACT News},
  volume =              {28},
  number =              {4},
  pages =               {2-15},
  year =                {1997},
  month =               dec,
}
[ALM03] Rajeev Alur, Salvatore La Torre, and Parthasarathy Madhusudan. Playing Games with Boxes and Diamonds. In CONCUR'03, Lecture Notes in Computer Science 2761, pages 127-141. Springer-Verlag, August 2003. 
@inproceedings{concur2003-ALM,
  author =              {Alur, Rajeev and La{~}Torre, Salvatore and
                         Madhusudan, Parthasarathy},
  title =               {Playing Games with Boxes and Diamonds},
  editor =              {Amadio, Roberto and Lugiez, Denis},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'03)},
  acronym =             {{CONCUR}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2761},
  pages =               {127-141},
  year =                {2003},
  month =               aug,
}
[ALM05] Rajeev Alur, Salvatore La Torre, and Parthasarathy Madhusudan. Perturbed Timed Automata. In HSCC'05, Lecture Notes in Computer Science 3414, pages 70-85. Springer-Verlag, March 2005. 
@inproceedings{hscc2005-ALM,
  author =              {Alur, Rajeev and La{~}Torre, Salvatore and
                         Madhusudan, Parthasarathy},
  title =               {Perturbed Timed Automata},
  editor =              {Morari, Manfred and Thiele, Lothar},
  booktitle =           {{P}roceedings of the 8th {I}nternational {W}orkshop
                         on {H}ybrid {S}ystems: {C}omputation and {C}ontrol
                         ({HSCC}'05)},
  acronym =             {{HSCC}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3414},
  pages =               {70-85},
  year =                {2005},
  month =               mar,
}
[ALM20] Étienne André, Didier Lime, and Nicolas Markey. Language-preservation problems in parametric timed automata. Logical Methods in Computer Science 16(1). January 2020.
Abstract

Parametric timed automata (PTA) are a powerful formalism to model and reason about concurrent systems with some unknown timing delays. In this paper, we address the (untimed) language- and trace-preservation problems: given a reference parameter valuation, does there exist another parameter valuation with the same untimed language, or with the same set of traces? We show that these problems are undecidable both for general PTA and for the restricted class of L/U-PTA, even for integer-valued parameters, or over bounded time. On the other hand, we exhibit decidable subclasses: 1-clock PTA, and 1-parameter deterministic L-PTA and U-PTA. We also consider robust versions of these problems, where we additionally require that the language be preserved for all valuations between the reference valuation and the new valuation.

@article{lmcs16(1)-ALM,
  author =              {Andr{\'e}, {\'E}tienne and Lime, Didier and Markey,
                         Nicolas},
  title =               {Language-preservation problems in parametric timed
                         automata},
  journal =             {Logical Methods in Computer Science},
  volume =              {16},
  number =              {1},
  year =                {2020},
  month =               jan,
  doi =                 {10.23638/LMCS-16(1:5)2020},
  abstract =            {Parametric timed automata (PTA) are a powerful
                         formalism to model and reason about concurrent
                         systems with some unknown timing delays. In~this
                         paper, we~address the (untimed) language- and
                         trace-preservation problems: given a reference
                         parameter valuation, does there exist another
                         parameter valuation with the same untimed language,
                         or with the same set of traces? We~show that these
                         problems are undecidable both for general PTA and
                         for the restricted class of L{\slash}U-PTA, even for
                         integer-valued parameters, or over bounded time.
                         On~the other~hand, we~exhibit decidable subclasses:
                         1-clock PTA, and 1-parameter deterministic L-PTA and
                         U-PTA. We~also consider robust versions of these
                         problems, where we additionally require that the
                         language be preserved for all valuations between the
                         reference valuation and the new valuation.},
}
[ALN+10] Natasha Alechina, Brian Logan, Nguyen Hoang Nga, and Abdur Rakib. Resource-bounded alternating-time temporal logic. In AAMAS'10, pages 481-488. International Foundation for Autonomous Agents and Multiagent Systems, May 2010. 
@inproceedings{aamas2010-ALHNR,
  author =              {Alechina, Natasha and Logan, Brian and Nga, Nguyen
                         Hoang and Rakib, Abdur},
  title =               {Resource-bounded alternating-time temporal logic},
  editor =              {van der Hoek, Wiebe and Kaminka, Gal A. and
                         Lesp{\'e}rance, Yves and Luck, Michael and Sen,
                         Sandeep},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference on {A}utonomous {A}gents and
                         {M}ultiagent {S}ystems ({AAMAS}'10)},
  acronym =             {{AAMAS}'10},
  publisher =           {International Foundation for Autonomous Agents and
                         Multiagent Systems},
  pages =               {481-488},
  year =                {2010},
  month =               may,
}
[ALP01] Rajeev Alur, Salvatore La Torre, and George J. Pappas. Optimal paths in weighted timed automata. In HSCC'01, Lecture Notes in Computer Science 2034, pages 49-62. Springer-Verlag, March 2001. 
@inproceedings{hscc2001-ALP,
  author =              {Alur, Rajeev and La{~}Torre, Salvatore and Pappas,
                         George J.},
  title =               {Optimal paths in weighted timed automata},
  editor =              {Di{~}Benedetto, Maria Domenica and
                         Sangiovani{-}Vincentelli, Alberto L.},
  booktitle =           {{P}roceedings of the 4th {I}nternational {W}orkshop
                         on {H}ybrid {S}ystems: {C}omputation and {C}ontrol
                         ({HSCC}'01)},
  acronym =             {{HSCC}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2034},
  pages =               {49-62},
  year =                {2001},
  month =               mar,
  doi =                 {10.1007/3-540-45351-2_8},
}
[ALP04] Rajeev Alur, Salvatore La Torre, and George J. Pappas. Optimal paths in weighted timed automata. Theoretical Computer Science 318(3):297-322. Elsevier, June 2004. 
@article{tcs318(3)-ALP,
  author =              {Alur, Rajeev and La{~}Torre, Salvatore and Pappas,
                         George J.},
  title =               {Optimal paths in weighted timed automata},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {318},
  number =              {3},
  pages =               {297-322},
  year =                {2004},
  month =               jun,
  doi =                 {10.1016/j.tcs.2003.10.038},
}
[ALR98] Eric Allender, Michael C. Loui, and Kenneth W. Regan. Complexity Classes. In Mikhail J. Atallah (eds.), Handbook of Algorithms and Theory of Computation. CRC Press, November 1998. 
@incollection{hatc1998-ALRa,
  author =              {Allender, Eric and Loui, Michael C. and Regan,
                         Kenneth W.},
  title =               {Complexity Classes},
  editor =              {Atallah, Mikhail J.},
  booktitle =           {Handbook of Algorithms and Theory of Computation},
  publisher =           {CRC Press},
  pages =               {27.1-27.23},
  year =                {1998},
  month =               nov,
}
[ALR98] Eric Allender, Michael C. Loui, and Kenneth W. Regan. Reducibility and Completeness. In Mikhail J. Atallah (eds.), Handbook of Algorithms and Theory of Computation. CRC Press, November 1998. 
@incollection{hatc1998-ALRb,
  author =              {Allender, Eric and Loui, Michael C. and Regan,
                         Kenneth W.},
  title =               {Reducibility and Completeness},
  editor =              {Atallah, Mikhail J.},
  booktitle =           {Handbook of Algorithms and Theory of Computation},
  publisher =           {CRC Press},
  pages =               {28.1-28.28},
  year =                {1998},
  month =               nov,
}
[ALR98] Eric Allender, Michael C. Loui, and Kenneth W. Regan. Other Complexity Classes and Measures. In Mikhail J. Atallah (eds.), Handbook of Algorithms and Theory of Computation. CRC Press, November 1998. 
@incollection{hatc1998-ALRc,
  author =              {Allender, Eric and Loui, Michael C. and Regan,
                         Kenneth W.},
  title =               {Other Complexity Classes and Measures},
  editor =              {Atallah, Mikhail J.},
  booktitle =           {Handbook of Algorithms and Theory of Computation},
  publisher =           {CRC Press},
  pages =               {29.1-29.24},
  year =                {1998},
  month =               nov,
}
[Alu91] Rajeev Alur. Techniques for Automatic Verification of Real-Time Systems. PhD thesis, Stanford University, 1991. 
@phdthesis{phd-alur,
  author =              {Alur, Rajeev},
  title =               {Techniques for Automatic Verification of Real-Time
                         Systems},
  year =                {1991},
  school =              {Stanford University},
}
[Alu99] Rajeev Alur. Timed Automata. In CAV'99, Lecture Notes in Computer Science 1633, pages 8-22. Springer-Verlag, July 1999. 
@inproceedings{cav1999-Alu,
  author =              {Alur, Rajeev},
  title =               {Timed Automata},
  editor =              {Halbwachs, Nicolas and Peled, Doron A.},
  booktitle =           {{P}roceedings of the 11th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'99)},
  acronym =             {{CAV}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1633},
  pages =               {8-22},
  year =                {1999},
  month =               jul,
}
[ALV01] Roberto Amadio, Denis Lugiez, and Vincent Vanackère. On the Symbolic Reduction of Processes with Cryptographic Functions. Technical Report 4147, INRIA, March 2001. 
@techreport{TR-inria4147,
  author =              {Amadio, Roberto and Lugiez, Denis and Vanack{\`e}re,
                         Vincent},
  title =               {On the Symbolic Reduction of Processes with
                         Cryptographic Functions},
  number =              {4147},
  year =                {2001},
  month =               mar,
  institution =         {INRIA},
}
[ALW89] Martín Abadi, Leslie Lamport, and Pierre Wolper. Realizable and Unrealizable Specifications of Reactive Systems. In ICALP'89, Lecture Notes in Computer Science 372, pages 1-17. Springer-Verlag, July 1989. 
@inproceedings{icalp1989-ALW,
  author =              {Abadi, Mart{\'\i}n and Lamport, Leslie and Wolper,
                         Pierre},
  title =               {Realizable and Unrealizable Specifications of
                         Reactive Systems},
  editor =              {Ausiello, Giorgio and Dezani{-}Ciancaglini,
                         Mariangiola and Ronchi{ }Della{~}Rocca, Simona},
  booktitle =           {{P}roceedings of the 16th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'89)},
  acronym =             {{ICALP}'89},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {372},
  pages =               {1-17},
  year =                {1989},
  month =               jul,
  doi =                 {10.1007/BFb0035748},
}
[AM99] Eugene Asarin and Oded Maler. As Soon as Possible: Time Optimal Control for Timed Automata. In HSCC'99, Lecture Notes in Computer Science 1569, pages 19-30. Springer-Verlag, March 1999. 
@inproceedings{hscc1999-AM,
  author =              {Asarin, Eugene and Maler, Oded},
  title =               {As~Soon as Possible: Time Optimal Control for Timed
                         Automata},
  editor =              {Vaandrager, Frits and van Schuppen, Jan H.},
  booktitle =           {{P}roceedings of the 2nd {I}nternational {W}orkshop
                         on {H}ybrid {S}ystems: {C}omputation and {C}ontrol
                         ({HSCC}'99)},
  acronym =             {{HSCC}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1569},
  pages =               {19-30},
  year =                {1999},
  month =               mar,
}
[AM01] Yasmina Abdeddaïm and Oded Maler. Job-Shop Scheduling Using Timed Automata. In CAV'01, Lecture Notes in Computer Science 2102, pages 478-492. Springer-Verlag, July 2001. 
@inproceedings{cav2001-AM,
  author =              {Abdedda{\"\i}m, Yasmina and Maler, Oded},
  title =               {Job-Shop Scheduling Using Timed Automata},
  editor =              {Berry, G{\'e}rard and Comon, Hubert and Finkel,
                         Alain},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'01)},
  acronym =             {{CAV}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2102},
  pages =               {478-492},
  year =                {2001},
  month =               jul,
}
[AM02] Yasmina Abdeddaïm and Oded Maler. Preemptive Job-Shop Scheduling using Stopwatch Automata. In TACAS'02, Lecture Notes in Computer Science 2280, pages 113-126. Springer-Verlag, April 2002. 
@inproceedings{tacas2002-AM,
  author =              {Abdedda{\"\i}m, Yasmina and Maler, Oded},
  title =               {Preemptive Job-Shop Scheduling using Stopwatch
                         Automata},
  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 =               {113-126},
  year =                {2002},
  month =               apr,
}
[AM04] Rajeev Alur and Parthasarathy Madhusudan. Decision Problems for Timed Automata: A Survey. In SFM-RT'04, Lecture Notes in Computer Science 3185, pages 1-24. Springer-Verlag, September 2004. 
@inproceedings{sfm2004-AM,
  author =              {Alur, Rajeev and Madhusudan, Parthasarathy},
  title =               {Decision Problems for Timed Automata: A~Survey},
  editor =              {Bernardo, Marco and Corradini, Flavio},
  booktitle =           {{F}ormal {M}ethods for the {D}esign of {R}eal-{T}ime
                         {S}ystems~--- {R}evised {L}ectures of the
                         {I}nternational {S}chool on {F}ormal {M}ethods for
                         the {D}esign of {C}omputer, {C}ommunication and
                         {S}oftware {S}ystems ({SFM-RT}'04)},
  acronym =             {{SFM-RT}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3185},
  pages =               {1-24},
  year =                {2004},
  month =               sep,
}
[AM15] Étienne André and Nicolas Markey. Language Preservation Problems in Parametric Timed Automata. In FORMATS'15, Lecture Notes in Computer Science 9268, pages 27-43. Springer-Verlag, September 2015.
Abstract

Parametric timed automata (PTA) are a powerful formalism to model and reason about concurrent systems with some unknown timing delays. In this paper, we address the (untimed) language- and trace-preservation problems: given a reference parameter valuation, does there exist another parameter valuation with the same untimed language (or trace)? We show that these problems are undecidable both for general PTA, and even for the restricted class of L/U-PTA. On the other hand, we exhibit decidable subclasses: 1-clock PTA, and 1-parameter deterministic L-PTA and U-PTA.

@inproceedings{formats2015-AM,
  author =              {Andr{\'e}, {\'E}tienne and Markey, Nicolas},
  title =               {Language Preservation Problems in Parametric Timed
                         Automata},
  editor =              {Sankaranarayanan, Sriram and Vicario, Enrico},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'15)},
  acronym =             {{FORMATS}'15},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9268},
  pages =               {27-43},
  year =                {2015},
  month =               sep,
  doi =                 {10.1007/978-3-319-22975-1_3},
  abstract =            {Parametric timed automata (PTA) are a powerful
                         formalism to model and reason about concurrent
                         systems with some unknown timing delays. In this
                         paper, we address the (untimed) language- and
                         trace-preservation problems: given a reference
                         parameter valuation, does there exist another
                         parameter valuation with the same untimed language
                         (or trace)? We show that these problems are
                         undecidable both for general PTA, and even for the
                         restricted class of L/U-PTA. On the other hand, we
                         exhibit decidable subclasses: 1-clock PTA, and
                         1-parameter deterministic L-PTA and U-PTA.},
}
[AMM+16] Benjamin Aminof, Vadim Malvone, Aniello Murano, and Sasha Rubin. Graded Strategy Logic: Reasoning about Uniqueness of Nash Equilibria. In AAMAS'16, pages 698-706. International Foundation for Autonomous Agents and Multiagent Systems, May 2016. 
@inproceedings{aamas2016-AMMR,
  author =              {Aminof, Benjamin and Malvone, Vadim and Murano,
                         Aniello and Rubin, Sasha},
  title =               {Graded Strategy Logic: Reasoning about Uniqueness of
                         Nash Equilibria},
  editor =              {Jonker, Catholijn M. and Marsella, Stacy and
                         Thangarajah, John and Tuyls, Karl},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}onference on {A}utonomous {A}gents and
                         {M}ultiagent {S}ystems ({AAMAS}'16)},
  acronym =             {{AAMAS}'16},
  publisher =           {International Foundation for Autonomous Agents and
                         Multiagent Systems},
  pages =               {698-706},
  year =                {2016},
  month =               may,
}
[AMM+18] Benjamin Aminof, Vadim Malvone, Aniello Murano, and Sasha Rubin. Graded modalities in Strategy Logic. Information and Computation 261(4):634-649. Elsevier, August 2018. 
@article{icomp261(4)-AMMR,
  author =              {Aminof, Benjamin and Malvone, Vadim and Murano,
                         Aniello and Rubin, Sasha},
  title =               {Graded modalities in Strategy Logic},
  publisher =           {Elsevier},
  journal =             {Information and Computation},
  volume =              {261},
  number =              {4},
  pages =               {634-649},
  year =                {2018},
  month =               aug,
  doi =                 {10.1016/j.ic.2018.02.021},
}
[AMP95] Eugene Asarin, Oded Maler, and Amir Pnueli. Reachability Analysis of Dynamical Systems Having Piecewise-Constant Derivatives. Theoretical Computer Science 138(1):35-65. Elsevier, 1995. 
@article{tcs138(1)-AMP,
  author =              {Asarin, Eugene and Maler, Oded and Pnueli, Amir},
  title =               {Reachability Analysis of Dynamical Systems Having
                         Piecewise-Constant Derivatives},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {138},
  number =              {1},
  pages =               {35-65},
  year =                {1995},
}
[AMP95] Eugene Asarin, Oded Maler, and Amir Pnueli. Symbolic Controller Synthesis for Discrete and Timed Systems. In HSCC'94, Lecture Notes in Computer Science 999, pages 1-20. Springer-Verlag, 1995. 
@inproceedings{hscc1994-AMP,
  author =              {Asarin, Eugene and Maler, Oded and Pnueli, Amir},
  title =               {Symbolic Controller Synthesis for Discrete and Timed
                         Systems},
  editor =              {Antsaklis, Panos and Kohn, Wolf and Nerode, Anil and
                         Sastry, Shankar},
  booktitle =           {{H}ybrid {S}ystems~{II} ({HSCC}'94)},
  acronym =             {{HSCC}'94},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {999},
  pages =               {1-20},
  year =                {1995},
}
[AMP98] Eugene Asarin, Oded Maler, and Amir Pnueli. On Discretization of Delays in Timed Automata and Digital Circuits. In CONCUR'98, Lecture Notes in Computer Science 1466, pages 470-484. Springer-Verlag, September 1998. 
@inproceedings{concur1998-AMP,
  author =              {Asarin, Eugene and Maler, Oded and Pnueli, Amir},
  title =               {On Discretization of Delays in Timed Automata and
                         Digital Circuits},
  editor =              {Sangiorgi, Davide and de Simone, Robert},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'98)},
  acronym =             {{CONCUR}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1466},
  pages =               {470-484},
  year =                {1998},
  month =               sep,
}
[AMP+20] Gal Amram, Shahar Maoz, Or Pistiner, and Jan Oliver Ringert. Energy μ-Calculus: Symbolic Fixed-Point Algorithms for ω-Regular Energy Games. Technical Report 2005.00641, arXiv, May 2020. 
@techreport{arxiv-AMPR,
  author =              {Amram, Gal and Maoz, Shahar and Pistiner, Or and
                         Ringert, Jan Oliver},
  title =               {Energy {{\(\mu\)}}-Calculus: Symbolic Fixed-Point
                         Algorithms for {{\(\omega\)}}-Regular Energy Games},
  number =              {2005.00641},
  year =                {2020},
  month =               may,
  institution =         {arXiv},
}
[AMP+98] Eugene Asarin, Oded Maler, Amir Pnueli, and Joseph Sifakis. Controller Synthesis for Timed Automata. In SSC'98, pages 469-474. Elsevier, July 1998. 
@inproceedings{sssc1998-AMPS,
  author =              {Asarin, Eugene and Maler, Oded and Pnueli, Amir and
                         Sifakis, Joseph},
  title =               {Controller Synthesis for Timed Automata},
  booktitle =           {{P}roceedings of the 5th {IFAC} {C}conference on
                         {S}ystem {S}tructure and {C}ontrol ({SSC}'98)},
  acronym =             {{SSC}'98},
  publisher =           {Elsevier},
  pages =               {469-474},
  year =                {1998},
  month =               jul,
}
[AMR+05] Karine Altisen, Nicolas Markey, Pierre-Alain Reynier, and Stavros Tripakis. Implémentabilité des automates temporisés. In MSR'05, pages 395-406. Hermès, October 2005. 
@inproceedings{msr2005-AMRT,
  author =              {Altisen, Karine and Markey, Nicolas and Reynier,
                         Pierre-Alain and Tripakis, Stavros},
  title =               {Impl{\'e}mentabilit{\'e} des automates
                         temporis{\'e}s},
  editor =              {Alla, Hassane and Rutten, {\'E}ric},
  booktitle =           {{A}ctes du 5{\`e}me {C}olloque {F}rancophone sur la
                         {M}od{\'e}lisation des {S}yst{\`e}mes r{\'e}actifs
                         ({MSR}'05)},
  acronym =             {{MSR}'05},
  publisher =           {Herm{\`e}s},
  pages =               {395-406},
  year =                {2005},
  month =               oct,
  url =                 {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MSR05-impl.pdf},
}
[AN80] André Arnold and Maurice Nivat. The metric space of infinite trees. Algebraic and topological properties. Fundamenta Informaticae 3(4):445-476. IOS Press, 1980. 
@article{fundi3(4)-AN,
  author =              {Arnold, Andr{\'e} and Nivat, Maurice},
  title =               {The metric space of infinite trees. Algebraic and
                         topological properties},
  publisher =           {IOS Press},
  journal =             {Fundamenta Informaticae},
  volume =              {3},
  number =              {4},
  pages =               {445-476},
  year =                {1980},
}
[AN01] André Arnold and Damian Niwiński. Complete lattices and fixed-point theorems. In Rudiments of μ-calculus, Studies in Logic and the Foundations of Mathematics 146, pages 1-39. North-Holland, 2001. 
@incollection{Rmc2001-ANa,
  author =              {Arnold, Andr{\'e} and Niwi{\'n}ski, Damian},
  title =               {Complete lattices and fixed-point theorems},
  booktitle =           {Rudiments of {\(\mu\)}-calculus},
  publisher =           {North-Holland},
  series =              {Studies in Logic and the Foundations of Mathematics},
  volume =              {146},
  pages =               {1-39},
  chapter =             {1},
  year =                {2001},
}
[And95] Henrik Reif Andersen. Partial Model-Checking (Extended Abstract). In LICS'95, pages 398-407. IEEE Comp. Soc. Press, June 1995. 
@inproceedings{lics1995-And,
  author =              {Andersen, Henrik Reif},
  title =               {Partial Model-Checking (Extended Abstract)},
  booktitle =           {{P}roceedings of the 10th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'95)},
  acronym =             {{LICS}'95},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {398-407},
  year =                {1995},
  month =               jun,
  doi =                 {10.1109/LICS.1995.523274},
}
[And06] Daniel Andersson. An improved algorithm for discounted payoff games. In Proceedings of the 11th ESSLLI Student Session, pages 91-98. August 2006. 
@inproceedings{esslli2006-students-And,
  author =              {Andersson, Daniel},
  title =               {An improved algorithm for discounted payoff games},
  editor =              {Huitink, Janneke and Katrenko, Sophia},
  booktitle =           {{P}roceedings of the 11th {ESSLLI} {S}tudent
                         {S}ession},
  pages =               {91-98},
  year =                {2006},
  month =               aug,
}
[Ang80] Dana Angluin. On Counting Problems and the Polynomial Hierarchy. Theoretical Computer Science 12:161-173. Elsevier, 1980. 
@article{tcs12()-Ang,
  author =              {Angluin, Dana},
  title =               {On Counting Problems and the Polynomial Hierarchy},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {12},
  pages =               {161-173},
  year =                {1980},
}
[Ang87] Dana Angluin. Learning regular sets from queries and counterexamples. Information and Computation 75(2):87-106. Academic Press, November 1987. 
@article{icomp75(2)-Ang,
  author =              {Angluin, Dana},
  title =               {Learning regular sets from queries and
                         counterexamples},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {75},
  number =              {2},
  pages =               {87-106},
  year =                {1987},
  month =               nov,
  doi =                 {10.1016/0890-5401(87)90052-6},
}
[AO96] Eric Allender and Mitsunori Ogihara. Relationships Among PL, #;L, and the Determinant. RAIRO – Theoretical Informatics and Applications 30(1):1-21. EDP Sciences, 1996. 
@article{rairo-tia30(1)-AO,
  author =              {Allender, Eric and Ogihara, Mitsunori},
  title =               {Relationships Among {PL}, {\#L}, and the
                         Determinant},
  publisher =           {EDP Sciences},
  journal =             {RAIRO~-- Theoretical Informatics and Applications},
  volume =              {30},
  number =              {1},
  pages =               {1-21},
  year =                {1996},
}
[AP06] Horacio Arló-Costa and Eric Pacuit. First-Order Classical Modal Logic. Studia Logica 84(2):171-210. Kluwer Academic, November 2006. 
@article{studlog84(2)-AP,
  author =              {Arl{\'o}{-}Costa, Horacio and Pacuit, Eric},
  title =               {First-Order Classical Modal Logic},
  publisher =           {Kluwer Academic},
  journal =             {Studia Logica},
  volume =              {84},
  number =              {2},
  pages =               {171-210},
  year =                {2006},
  month =               nov,
  doi =                 {10.1007/s11225-006-9010-0},
}
[APT79] Bengt Aspvall, Michael F. Plass, and Robert Endre Tarjan. A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas. Information Processing Letters 8(3):121-123. Elsevier, March 1979. erratum as \citeipl14(4)-APT. 
@article{ipl8(3)-APT,
  author =              {Aspvall, Bengt and Plass, Michael F. and Tarjan,
                         Robert Endre},
  title =               {A Linear-Time Algorithm for Testing the Truth of
                         Certain Quantified Boolean Formulas},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {8},
  number =              {3},
  pages =               {121-123},
  year =                {1979},
  month =               mar,
  note =                {erratum as~\cite{ipl14(4)-APT}},
}
[APT82] Bengt Aspvall, Michael F. Plass, and Robert Endre Tarjan. Erratum (A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas). Information Processing Letters 14(4):195. Elsevier, June 1982. 
@article{ipl14(4)-APT,
  author =              {Aspvall, Bengt and Plass, Michael F. and Tarjan,
                         Robert Endre},
  title =               {Erratum (A Linear-Time Algorithm for Testing the
                         Truth of Certain Quantified Boolean Formulas)},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {14},
  number =              {4},
  pages =               {195},
  year =                {1982},
  month =               jun,
}
[AR14] Benjamin Aminof and Sasha Rubin. First Cycle Games. In SR'14, Electronic Proceedings in Theoretical Computer Science 146, pages 83-90. March 2014. 
@inproceedings{sr2014-AR,
  author =              {Aminof, Benjamin and Rubin, Sasha},
  title =               {First Cycle Games},
  booktitle =           {{P}roceedings of the 2nd {I}nternational {W}orkshop
                         on {S}trategic {R}easoning ({SR}'14)},
  acronym =             {{SR}'14},
  series =              {Electronic Proceedings in Theoretical Computer
                         Science},
  volume =              {146},
  pages =               {83-90},
  year =                {2014},
  month =               mar,
  doi =                 {10.4204/EPTCS.146.11},
}
[ARZ15] Benjamin Aminof, Sasha Rubin, and Florian Zuleger. On the Expressive Power of Communication Primitives in Parameterised Systems. In LPAR'15, Lecture Notes in Computer Science 9450, pages 313-328. Springer-Verlag, November 2015. 
@inproceedings{lpar2015-ARZ,
  author =              {Aminof, Benjamin and Rubin, Sasha and Zuleger,
                         Florian},
  title =               {On the Expressive Power of Communication Primitives
                         in Parameterised Systems},
  editor =              {Davis, Martin and Fehnker, Ansgar and McIver,
                         Annabelle K. and Voronkov, Andrei},
  booktitle =           {{P}roceedings of the 20th {I}nternational
                         {C}onference {L}ogic {P}rogramming and {A}utomated
                         {R}easoning ({LPAR}'15)},
  acronym =             {{LPAR}'15},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9450},
  pages =               {313-328},
  year =                {2015},
  month =               nov,
  doi =                 {10.1007/978-3-662-48899-7_22},
}
[AS89] Bowen Alpern and Fred B. Schneider. Verifying Temporal Properties without Temporal Logic. ACM Transactions on Programming Languages and Systems 11(1):147-167. ACM Press, January 1989. 
@article{toplas11(1)-AS,
  author =              {Alpern, Bowen and Schneider, Fred B.},
  title =               {Verifying Temporal Properties without Temporal
                         Logic},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Programming Languages and
                         Systems},
  volume =              {11},
  number =              {1},
  pages =               {147-167},
  year =                {1989},
  month =               jan,
}
[AS02] Eugene Asarin and Gerardo Schneider. Widening the Boundary between Decidable and Undecidable Hybrid Systems. In CONCUR'02, Lecture Notes in Computer Science 2421, pages 193-208. Springer-Verlag, August 2002. 
@inproceedings{concur2002-AS,
  author =              {Asarin, Eugene and Schneider, Gerardo},
  title =               {Widening the Boundary between Decidable and
                         Undecidable Hybrid Systems},
  editor =              {Brim, Lubo{\v s} and Jan{\v c}ar, Petr and K{\v
                         r}et{\'\i}nsk{\'y}, Mojm{\'\i}r and Ku{\v c}era,
                         Anton{\'\i}n},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'02)},
  acronym =             {{CONCUR}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2421},
  pages =               {193-208},
  year =                {2002},
  month =               aug,
}
[AS04] Robert Airapetyan and Thorsten Schneider. Protecting Applications with Petri Nets. The Code Breaker's Journal 1(1). 2004. 
@article{cbj1(1)-AS,
  author =              {Airapetyan, Robert and Schneider, Thorsten},
  title =               {Protecting Applications with {P}etri Nets},
  journal =             {The Code Breaker's Journal},
  volume =              {1},
  number =              {1},
  year =                {2004},
}
[Asp02] James Aspnes. Fast deterministic consensus in a noisy environment. Journal of Algorithms 45(1):16-39. Elsevier, October 2002. 
@article{ja45(1)-Asp,
  author =              {Aspnes, James},
  title =               {Fast deterministic consensus in a noisy environment},
  publisher =           {Elsevier},
  journal =             {Journal of Algorithms},
  volume =              {45},
  number =              {1},
  pages =               {16-39},
  year =                {2002},
  month =               oct,
  doi =                 {10.1016/S0196-6774(02)00220-1},
}
[ASS+00] Adnan Aziz, Kumud Sanwal, Vigyan Singhal, and Robert K. Brayton. Model-checking continous-time Markov chains. ACM Transactions on Computational Logic 1(1):162-170. ACM Press, July 2000. 
@article{tocl1(1)-ASSB,
  author =              {Aziz, Adnan and Sanwal, Kumud and Singhal, Vigyan
                         and Brayton, Robert K.},
  title =               {Model-checking continous-time {M}arkov chains},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Computational Logic},
  volume =              {1},
  number =              {1},
  pages =               {162-170},
  year =                {2000},
  month =               jul,
  doi =                 {10.1145/343369.343402},
}
[ASY01] Eugene Asarin, Gerardo Schneider, and Sergio Yovine. On the Decidability of the Reachability Problem for Planar Differential Inclusions. In HSCC'01, Lecture Notes in Computer Science 2034, pages 89-104. Springer-Verlag, March 2001. 
@inproceedings{hscc2001-ASY,
  author =              {Asarin, Eugene and Schneider, Gerardo and Yovine,
                         Sergio},
  title =               {On the Decidability of the Reachability Problem for
                         Planar Differential Inclusions},
  editor =              {Di{~}Benedetto, Maria Domenica and
                         Sangiovani{-}Vincentelli, Alberto L.},
  booktitle =           {{P}roceedings of the 4th {I}nternational {W}orkshop
                         on {H}ybrid {S}ystems: {C}omputation and {C}ontrol
                         ({HSCC}'01)},
  acronym =             {{HSCC}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2034},
  pages =               {89-104},
  year =                {2001},
  month =               mar,
}
[ASY07] Eugene Asarin, Gerardo Schneider, and Sergio Yovine. Algorithmic analysis of polygonal hybrid systems, part I: Reachability. Theoretical Computer Science 379(1-2):231-265. Elsevier, June 2007. 
@article{tcs379(1-2)-ASY,
  author =              {Asarin, Eugene and Schneider, Gerardo and Yovine,
                         Sergio},
  title =               {Algorithmic analysis of polygonal hybrid systems,
                         part~{I}: Reachability},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {379},
  number =              {1-2},
  pages =               {231-265},
  year =                {2007},
  month =               jun,
}
[AT96] Rajeev Alur and Gadi Taubenfeld. Fast Timing-based Algorithms. Distributed Computing 10:1-10. Springer-Verlag, 1996. 
@article{discomp10(1)-AT,
  author =              {Alur, Rajeev and Taubenfeld, Gadi},
  title =               {Fast Timing-based Algorithms},
  publisher =           {Springer-Verlag},
  journal =             {Distributed Computing},
  volume =              {10},
  pages =               {1-10},
  year =                {1996},
}
[AT02] Karine Altisen and Stavros Tripakis. Tools for Controller Synthesis of Timed Systems. In RT-TOOLS'02. August 2002. 
@inproceedings{rttools2002-AT,
  author =              {Altisen, Karine and Tripakis, Stavros},
  title =               {Tools for Controller Synthesis of Timed Systems},
  editor =              {Pettersson, Paul and Yi, Wang},
  booktitle =           {{P}roceedings of the 2nd {W}orkshop on {R}eal-Time
                         {T}ools ({RT-TOOLS}'02)},
  acronym =             {{RT-TOOLS}'02},
  year =                {2002},
  month =               aug,
}
[AT05] Karine Altisen and Stavros Tripakis. Implementation of Timed Automata: An Issue of Semantics or Modeling?. In FORMATS'05, Lecture Notes in Computer Science 3829, pages 273-288. Springer-Verlag, September 2005. 
@inproceedings{formats2005-AT,
  author =              {Altisen, Karine and Tripakis, Stavros},
  title =               {Implementation of Timed Automata: An Issue of
                         Semantics or Modeling?},
  editor =              {Pettersson, Paul and Yi, Wang},
  booktitle =           {{P}roceedings of the 3rd {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'05)},
  acronym =             {{FORMATS}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3829},
  pages =               {273-288},
  year =                {2005},
  month =               sep,
}
[AT17] Rajeev Alur and Stavros Tripakis. Automatic Synthesis of Distributed Protocols. SIGACT News 48(1):55-90. ACM Press, March 2017. 
@article{sigact-news48(1)-AT,
  author =              {Alur, Rajeev and Tripakis, Stavros},
  title =               {Automatic Synthesis of Distributed Protocols},
  publisher =           {ACM Press},
  journal =             {SIGACT News},
  volume =              {48},
  number =              {1},
  pages =               {55-90},
  year =                {2017},
  month =               mar,
  doi =                 {10.1145/3061640.3061652},
}
[Ats02] Albert Atserias. Unsatisfiable Random Formulas are Hard to Certify. In LICS'02, pages 325-334. IEEE Comp. Soc. Press, July 2002. 
@inproceedings{lics2002-Ats,
  author =              {Atserias, Albert},
  title =               {Unsatisfiable Random Formulas are Hard to Certify},
  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 =               {325-334},
  year =                {2002},
  month =               jul,
}
[AVW03] André Arnold, Aymeric Vincent, and Igor Walukiewicz. Games for Synthesis of Controllers with Partial Observation. Theoretical Computer Science 303(1):7-34. Elsevier, June 2003. 
@article{tcs303(1)-AVW,
  author =              {Arnold, Andr{\'e} and Vincent, Aymeric and
                         Walukiewicz, Igor},
  title =               {Games for Synthesis of Controllers with Partial
                         Observation},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {303},
  number =              {1},
  pages =               {7-34},
  year =                {2003},
  month =               jun,
}
[AZZ+21] Jie An, Bohua Zhan, Naijun Zhan, and Miaomiao Zhang. Learning nondeterministic real-time automata. ACM Transactions on Embedded Computing Systems 20(5s):99:1-99:26. ACM Press, October 2021. 
@article{tecs20(5s)-AZZZ,
  author =              {An, Jie and Zhan, Bohua and Zhan, Naijun and Zhang,
                         Miaomiao},
  title =               {Learning nondeterministic real-time automata},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Embedded Computing Systems},
  volume =              {20},
  number =              {5s},
  pages =               {99:1-99:26},
  year =                {2021},
  month =               oct,
  doi =                 {10.1145/3477030},
}
B
[Bab85] László Babai. Trading Group Theory for Randomness. In STOC'85, pages 421-429. ACM Press, May 1985. 
@inproceedings{stoc1985-Bab,
  author =              {Babai, L{\'a}szl{\'o}},
  title =               {Trading Group Theory for Randomness},
  booktitle =           {{P}roceedings of the 17th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'85)},
  acronym =             {{STOC}'85},
  publisher =           {ACM Press},
  pages =               {421-429},
  year =                {1985},
  month =               may,
}
[BAS02] Armin Biere, Cyrille Artho, and Viktor Schuppan. Liveness Checking as Safety Checking. In FMICS'02, Electronic Notes in Theoretical Computer Science 66(2). Elsevier, July 2002. 
@inproceedings{fmics2002-BAS,
  author =              {Biere, Armin and Artho, Cyrille and Schuppan,
                         Viktor},
  title =               {Liveness Checking as Safety Checking},
  editor =              {Cleaveland, Rance and Garavel, Hubert},
  booktitle =           {{P}roceedings of the 7th {I}nternational {ERCIM}
                         {W}orkshop in {F}ormal {M}ethods for {I}ndustrial
                         {C}ritical {S}ystems ({FMICS}'02)},
  acronym =             {{FMICS}'02},
  publisher =           {Elsevier},
  series =              {Electronic Notes in Theoretical Computer Science},
  volume =              {66},
  number =              {2},
  year =                {2002},
  month =               jul,
}
[BB91] Jos C. M. Baeten and Jan A. Bergstra. Real Time Process Algebra. Formal Aspects of Computing 3(2):142-188. Springer-Verlag, 1991. 
@article{fac3(2)-BB,
  author =              {Baeten, Jos C. M. and Bergstra, Jan A.},
  title =               {Real Time Process Algebra},
  publisher =           {Springer-Verlag},
  journal =             {Formal Aspects of Computing},
  volume =              {3},
  number =              {2},
  pages =               {142-188},
  year =                {1991},
}
[BB02] Dietmar Berwanger and Achim Blumensath. The Monadic Theory of Tree-like Structures. In Erich Grädel, Wolfgang Thomas, and Thomas Wilke (eds.), Automata, Logics, and Infinite Games, Lecture Notes in Computer Science 2500, pages 285-302. Springer-Verlag, 2002. 
@incollection{lncs2500-BB,
  author =              {Berwanger, Dietmar and Blumensath, Achim},
  title =               {The Monadic Theory of Tree-like Structures},
  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 =               {285-302},
  year =                {2002},
}
[BB04] Laura Brandán Briones and Ed Brinksma. A Test Generation Framework for Quiescent Real-Time Systems. In FATES'04, Lecture Notes in Computer Science 3395, pages 64-78. Springer-Verlag, September 2004. 
@inproceedings{BB-fates2004,
  author =              {Briones, Laura Brand{\'a}n and Brinksma, Ed},
  title =               {A~Test Generation Framework for Quiescent Real-Time
                         Systems},
  editor =              {Grabowski, Jens and Nielsen, Brian},
  booktitle =           {{P}roceedings of the 4th {I}nternational {W}orkshop
                         on {F}ormal {A}pproaches to {S}oftware {T}esting
                         ({FATES}'04)},
  acronym =             {{FATES}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3395},
  pages =               {64-78},
  year =                {2004},
  month =               sep,
  doi =                 {10.1007/978-3-540-31848-4_5},
}
[BBB+09] Christel Baier, Nathalie Bertrand, Patricia Bouyer, and Thomas Brihaye. When are timed automata determinizable?. In ICALP'09, Lecture Notes in Computer Science 5556, pages 43-54. Springer-Verlag, July 2009. 
@inproceedings{icalp2009-BBBB,
  author =              {Baier, {\relax Ch}ristel and Bertrand, Nathalie and
                         Bouyer, Patricia and Brihaye, {\relax Th}omas},
  title =               {When are timed automata determinizable?},
  editor =              {Albers, Susanne and Marchetti{-}Spaccamela Alberto
                         and Matias, Yossi and Nikoletseas, Sotiris and
                         Thomas, Wolfgang},
  booktitle =           {{P}roceedings of the 36th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'09)~-- Part~{II}},
  acronym =             {{ICALP}'09},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5556},
  pages =               {43-54},
  year =                {2009},
  month =               jul,
  doi =                 {10.1007/978-3-642-02930-1_4},
}
[BBB+07] Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, and Marcus Größer. Probabilistic and Topological Semantics for Timed Automata. In FSTTCS'07, Lecture Notes in Computer Science 4855, pages 179-191. Springer-Verlag, December 2007. 
@inproceedings{fsttcs2007-BBBBG,
  author =              {Baier, {\relax Ch}ristel and Bertrand, Nathalie and
                         Bouyer, Patricia and Brihaye, {\relax Th}omas and
                         Gr{\"o}{\ss}er, Marcus},
  title =               {Probabilistic and Topological Semantics for Timed
                         Automata},
  editor =              {Arvind, Vikraman and Prasad, Sanjiva},
  booktitle =           {{P}roceedings of the 27th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'07)},
  acronym =             {{FSTTCS}'07},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4855},
  pages =               {179-191},
  year =                {2007},
  month =               dec,
}
[BBB+08] Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, and Marcus Größer. Almost-sure Model Checking of Infinite Paths in One-clock Timed Automata. In LICS'08, pages 217-226. IEEE Comp. Soc. Press, June 2008. 
@inproceedings{lics2008-BBBBG,
  author =              {Baier, {\relax Ch}ristel and Bertrand, Nathalie and
                         Bouyer, Patricia and Brihaye, {\relax Th}omas and
                         Gr{\"o}{\ss}er, Marcus},
  title =               {Almost-sure Model Checking of Infinite Paths in
                         One-clock Timed Automata},
  booktitle =           {{P}roceedings of the 23rd {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'08)},
  acronym =             {{LICS}'08},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {217-226},
  year =                {2008},
  month =               jun,
  doi =                 {10.1109/LICS.2008.25},
}
[BBB+07] Éric Badouel, Marek Bednarczyk, Andrzej Borzyszkowski, Benoît Caillaud, and Philippe Darondeau. Concurrent secrets. Discrete Event Dynamic Systems 17(4):425-446. Kluwer Academic, December 2007. 
@article{deds17(4)-BBBCD,
  author =              {Badouel, {\'E}ric and Bednarczyk, Marek and
                         Borzyszkowski, Andrzej and Caillaud, Beno{\^\i}t and
                         Darondeau, Philippe},
  title =               {Concurrent secrets},
  publisher =           {Kluwer Academic},
  journal =             {Discrete Event Dynamic Systems},
  volume =              {17},
  number =              {4},
  pages =               {425-446},
  year =                {2007},
  month =               dec,
  doi =                 {10.1007/s10626-007-0020-5},
}
[BBB+08] Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, and Nicolas Markey. Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics. In QEST'08, pages 55-64. IEEE Comp. Soc. Press, September 2008.
Abstract

In [Baier et al., Probabilistic and Topological Semantics for Timed Automata, FSTTCS'07] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL properties has been investigated, where the aim is to check whether a given LTL property holds with probability 1 in a timed automaton, and solved for the class of single-clock timed automata.

In this paper, we consider the quantitative model-checking problem for ω-regular properties: we aim at computing the exact probability that a given timed automaton satisfies an ω-regular property. We develop a framework in which we can compute a closed-form expression for this probability; we furthermore give an approximation algorithm, and finally prove that we can decide the threshold problem in that framework.

@inproceedings{qest2008-BBBM,
  author =              {Bertrand, Nathalie and Bouyer, Patricia and Brihaye,
                         {\relax Th}omas and Markey, Nicolas},
  title =               {Quantitative Model-Checking of One-Clock Timed
                         Automata under Probabilistic Semantics},
  booktitle =           {{P}roceedings of the 5th {I}nternational
                         {C}onference on {Q}uantitative {E}valuation of
                         {S}ystems ({QEST}'08)},
  acronym =             {{QEST}'08},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {55-64},
  year =                {2008},
  month =               sep,
  doi =                 {10.1109/QEST.2008.19},
  abstract =            {In [Baier \emph{et~al.}, \textit{Probabilistic and
                         Topological Semantics for Timed Automata},
                         FSTTCS'07] a probabilistic semantics for timed
                         automata has been defined in order to rule out
                         unlikely (sequences of) events. The qualitative
                         model-checking problem for LTL properties has been
                         investigated, where the aim is to check whether a
                         given LTL property holds with probability~\(1\) in a
                         timed automaton, and solved for the class of
                         single-clock timed automata.\par In this paper, we
                         consider the quantitative model-checking problem for
                         \(\omega\)-regular properties: we aim at computing
                         the exact probability that a given timed automaton
                         satisfies an \(\omega\)-regular property. We develop
                         a framework in which we can compute a closed-form
                         expression for this probability; we furthermore give
                         an approximation algorithm, and finally prove that
                         we can decide the threshold problem in that
                         framework.},
}
[BBB+14] Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Quentin Menet, Christel Baier, Marcus Größer, and Marcin Jurdziński. Stochastic Timed Automata. Logical Methods in Computer Science 10(4). December 2014. 
@article{lmcs10(4)-BBBMBGJ,
  author =              {Bertrand, Nathalie and Bouyer, Patricia and Brihaye,
                         {\relax Th}omas and Menet, Quentin and Baier,
                         {\relax Ch}ristel and Gr{\"o}{\ss}er, Marcus and
                         Jurdzi{\'n}ski, Marcin},
  title =               {Stochastic Timed Automata},
  journal =             {Logical Methods in Computer Science},
  volume =              {10},
  number =              {4},
  year =                {2014},
  month =               dec,
  doi =                 {10.2168/LMCS-10(4:6)2014},
}
[BBB+07] Patricia Bouyer, Thomas Brihaye, Véronique Bruyère, and Jean-François Raskin. On the Optimal Reachability Problem of Weighted Timed Automata. Formal Methods in System Design 31(2):135-175. Springer-Verlag, October 2007. 
@article{fmsd31(2)-BBBR,
  author =              {Bouyer, Patricia and Brihaye, {\relax Th}omas and
                         Bruy{\`e}re, V{\'e}ronique and Raskin, Jean-Fran{\c
                         c}ois},
  title =               {On the Optimal Reachability Problem of Weighted
                         Timed Automata},
  publisher =           {Springer-Verlag},
  journal =             {Formal Methods in System Design},
  volume =              {31},
  number =              {2},
  pages =               {135-175},
  year =                {2007},
  month =               oct,
  doi =                 {10.1007/s10703-007-0035-4},
}
[BBC92] Danièle Beauquier, Jean Berstel, and Philippe Chrétienne. Éléments d'algorithmique. Masson, 1992. 
@book{BBC92,
  author =              {Beauquier, Dani{\`e}le and Berstel, Jean and
                         Chr{\'e}tienne, {\relax Ph}ilippe},
  title =               {{\'E}l{\'e}ments d'algorithmique},
  publisher =           {Masson},
  year =                {1992},
}
[BBC10] Albert Benveniste, Anne Bouillard, and Paul Caspi. A unifying view of loosely time-triggered architectures. In EMSOFT'10, pages 189-198. ACM Press, October 2010. 
@inproceedings{emsoft2010-BBC,
  author =              {Benveniste, Albert and Bouillard, Anne and Caspi,
                         Paul},
  title =               {A~unifying view of loosely time-triggered
                         architectures},
  editor =              {Carloni, Luca P. and Tripakis, Stavros},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {E}mbedded {S}oftware ({EMSOFT}'10)},
  acronym =             {{EMSOFT}'10},
  publisher =           {ACM Press},
  pages =               {189-198},
  year =                {2010},
  month =               oct,
  doi =                 {10.1145/1879021.1879047},
}
[BBD14] Thomas Brihaye, Véronique Bruyère, and Julie De Pril. On Equilibria in Quantitative Games with Reachability/Safety Objectives. Theory of Computing Systems 54(2):150-189. Springer-Verlag, February 2014. 
@article{tcsyst54(2)-BBD,
  author =              {Brihaye, {\relax Th}omas and Bruy{\`e}re,
                         V{\'e}ronique and De{~}Pril, Julie},
  title =               {On Equilibria in Quantitative Games with
                         Reachability{{\slash}}Safety Objectives},
  publisher =           {Springer-Verlag},
  journal =             {Theory of Computing Systems},
  volume =              {54},
  number =              {2},
  pages =               {150-189},
  year =                {2014},
  month =               feb,
}
[BBD+11] Thomas Brihaye, Véronique Bruyère, Laurent Doyen, Marc Ducobu, and Jean-François Raskin. Antichain-based QBF Solving. In ATVA'11, Lecture Notes in Computer Science 6996, pages 183-197. Springer-Verlag, October 2011. 
@inproceedings{atva2011-BBDDR,
  author =              {Brihaye, {\relax Th}omas and Bruy{\`e}re,
                         V{\'e}ronique and Doyen, Laurent and Ducobu, Marc
                         and Raskin, Jean-Fran{\c c}ois},
  title =               {Antichain-based {QBF} Solving},
  editor =              {Bultan, Tevfik and Hsiung, Pao-Ann},
  booktitle =           {{P}roceedings of the 9th {I}nternational {S}ymposium
                         on {A}utomated {T}echnology for {V}erification and
                         {A}nalysis ({ATVA}'11)},
  acronym =             {{ATVA}'11},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6996},
  pages =               {183-197},
  year =                {2011},
  month =               oct,
}
[BBD+12] Thomas Brihaye, Véronique Bruyère, Julie De Pril, and Hugo Gimbert. Subgame Perfection for Equilibria in Quantitative Reachability Games. In FoSSaCS'12, Lecture Notes in Computer Science 7213, pages 286-300. Springer-Verlag, March 2012. 
@inproceedings{fossacs2012-BBDG,
  author =              {Brihaye, {\relax Th}omas and Bruy{\`e}re,
                         V{\'e}ronique and De{~}Pril, Julie and Gimbert,
                         Hugo},
  title =               {Subgame Perfection for Equilibria in Quantitative
                         Reachability Games},
  editor =              {Birkedal, Lars},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'12)},
  acronym =             {{FoSSaCS}'12},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7213},
  pages =               {286-300},
  year =                {2012},
  month =               mar,
}
[BBD+02] Gerd Behrmann, Johan Bengtsson, Alexandre David, Kim Guldstrand Larsen, Paul Pettersson, and Wang Yi. UPPAAL Implementation Secrets. In FTRTFT'02, Lecture Notes in Computer Science 2469, pages 3-22. Springer-Verlag, September 2002. 
@inproceedings{ftrtft2002-BBDLPY,
  author =              {Behrmann, Gerd and Bengtsson, Johan and David,
                         Alexandre and Larsen, Kim Guldstrand and Pettersson,
                         Paul and Yi, Wang},
  title =               {UPPAAL Implementation Secrets},
  editor =              {Damm, Werner and Olderog, Ernst R{\"u}diger},
  booktitle =           {{P}roceedings of the 7th {F}ormal {T}echniques in
                         {R}eal-Time and {F}ault-Tolerant {S}ystems
                         ({FTRTFT}'02)},
  acronym =             {{FTRTFT}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2469},
  pages =               {3-22},
  year =                {2002},
  month =               sep,
  doi =                 {10.1007/3-540-45739-9_1},
}
[BBF+06] Tomáš Brázdil, Václav Brožek, Vojtěch Forejt, and Antonín Kučera. Stochastic Games with Branching-Time Winning Objectives. In LICS'06, pages 349-358. IEEE Comp. Soc. Press, July 2006. 
@inproceedings{lics2006-BBFK,
  author =              {Br{\'a}zdil, Tom{\'a}{\v s} and V{\'a}clav
                         Bro{\v{z}}ek and Forejt, Vojt{\v{e}}ch and Ku{\v
                         c}era, Anton{\'\i}n},
  title =               {Stochastic Games with Branching-Time Winning
                         Objectives},
  booktitle =           {{P}roceedings of the 21st {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'06)},
  acronym =             {{LICS}'06},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {349-358},
  year =                {2006},
  month =               jul,
}
[BBF+03] Gerd Behrmann, Patricia Bouyer, Emmanuel Fleury, and Kim Guldstrand Larsen. Static Guard Analysis in Timed Automata Verification. In TACAS'03, Lecture Notes in Computer Science 2619, pages 254-270. Springer-Verlag, April 2003. 
@inproceedings{tacas2003-BBFL,
  author =              {Behrmann, Gerd and Bouyer, Patricia and Fleury,
                         Emmanuel and Larsen, Kim Guldstrand},
  title =               {Static Guard Analysis in Timed Automata
                         Verification},
  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 =               {254-270},
  year =                {2003},
  month =               apr,
}
[BBF+18] Giovanni Bacci, Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, and Pierre-Alain Reynier. Optimal and Robust Controller Synthesis Using Energy Timed Automata with Uncertainty. In FM'18, Lecture Notes in Computer Science 10951, pages 203-221. Springer-Verlag, July 2018.
Abstract

In this paper, we propose a novel framework for the synthesis of robust and optimal energy-aware controllers. The framework is based on energy timed automata, allowing for easy expression of timing-constraints and variable energy-rates. We prove decidability of the energy-constrained infinite-run problem in settings with both certainty and uncertainty of the energy-rates. We also consider the optimization problem of identifying the minimal upper bound that will permit existence of energy-constrained infinite runs. Our algorithms are based on quantifier elimination for linear real arithmetic. Using Mathematica and Mjollnir, we illustrate our framework through a real industrial example of a hydraulic oil pump. Compared with previous approaches our method is completely automated and provides improved results.

@inproceedings{fm2018-BBFLMR,
  author =              {Bacci, Giovanni and Bouyer, Patricia and Fahrenberg,
                         Uli and Larsen, Kim Guldstrand and Markey, Nicolas
                         and Reynier, Pierre-Alain},
  title =               {Optimal and Robust Controller Synthesis Using Energy
                         Timed Automata with Uncertainty},
  editor =              {Havelund, Klaus and Peleska, Jan and Roscoe, Bill W.
                         and de Vink, Erik},
  booktitle =           {{P}roceedings of the 22nd {I}nternational
                         {S}ymposium on {F}ormal {M}ethods ({FM}'18)},
  acronym =             {{FM}'18},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {10951},
  pages =               {203-221},
  year =                {2018},
  month =               jul,
  doi =                 {10.1007/978-3-319-95582-7_12},
  abstract =            {In this paper, we propose a novel framework for the
                         synthesis of robust and optimal energy-aware
                         controllers. The framework is based on energy timed
                         automata, allowing for easy expression of
                         timing-constraints and variable energy-rates. We
                         prove decidability of the energy-constrained
                         infinite-run problem in settings with both certainty
                         and uncertainty of the energy-rates. We also
                         consider the optimization problem of identifying the
                         minimal upper bound that will permit existence of
                         energy-constrained infinite runs. Our algorithms are
                         based on quantifier elimination for linear real
                         arithmetic. Using Mathematica and Mjollnir, we
                         illustrate our framework through a real industrial
                         example of a hydraulic oil pump. Compared with
                         previous approaches our method is completely
                         automated and provides improved results.},
}
[BBF+21] Giovanni Bacci, Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, and Pierre-Alain Reynier. Optimal and Robust Controller Synthesis Using Energy Timed Automata with Uncertainty. Formal Aspects of Computing 33(1):3-25. Springer-Verlag, January 2021.
Abstract

In this paper, we propose a novel framework for the synthesis of robust and optimal energy-aware controllers. The framework is based on energy timed automata, allowing for easy expression of timing-constraints and variable energy-rates. We prove decidability of the energy-constrained infinite-run problem in settings with both certainty and uncertainty of the energy-rates. We also consider the optimization problem of identifying the minimal upper bound that will permit existence of energy-constrained infinite runs. Our algorithms are based on quantifier elimination for linear real arithmetic. Using Mathematica and Mjollnir, we illustrate our framework through a real industrial example of a hydraulic oil pump. Compared with previous approaches our method is completely automated and provides improved results.

@article{fac2020-BBFLMR,
  author =              {Bacci, Giovanni and Bouyer, Patricia and Fahrenberg,
                         Uli and Larsen, Kim Guldstrand and Markey, Nicolas
                         and Reynier, Pierre-Alain},
  title =               {Optimal and Robust Controller Synthesis Using Energy
                         Timed Automata with Uncertainty},
  publisher =           {Springer-Verlag},
  journal =             {Formal Aspects of Computing},
  volume =              {33},
  number =              {1},
  pages =               {3-25},
  year =                {2021},
  month =               jan,
  doi =                 {10.1007/s00165-020-00521-4},
  abstract =            {In~this paper, we~propose a novel framework for the
                         synthesis of robust and optimal energy-aware
                         controllers. The~framework is based on energy timed
                         automata, allowing for easy expression of
                         timing-constraints and variable energy-rates.
                         We~prove decidability of the energy-constrained
                         infinite-run problem in settings with both certainty
                         and uncertainty of the energy-rates. We~also
                         consider the optimization problem of identifying the
                         minimal upper bound that will permit existence of
                         energy-constrained infinite runs. Our~algorithms are
                         based on quantifier elimination for linear real
                         arithmetic. Using Mathematica and Mjollnir,
                         we~illustrate our framework through a real
                         industrial example of a hydraulic oil pump. Compared
                         with previous approaches our method is completely
                         automated and provides improved results.},
}
[BBF+01] Béatrice Bérard, Michel Bidoit, Alain Finkel, François Laroussinie, Antoine Petit, Laure Petrucci, Philippe Schnoebelen, and Pierre McKenzie. Systems and Software Verification: Model-Checking Techniques and Tools. Springer-Verlag, 2001. 
@book{SSV2001-BBFLPPS,
  author =              {B{\'e}rard, B{\'e}atrice and Bidoit, Michel and
                         Finkel, Alain and Laroussinie, Fran{\c c}ois and
                         Petit, Antoine and Petrucci, Laure and Schnoebelen,
                         {\relax Ph}ilippe and McKenzie, Pierre},
  title =               {Systems and Software Verification: Model-Checking
                         Techniques and Tools},
  publisher =           {Springer-Verlag},
  year =                {2001},
}
[BBF+13] Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, and Jean-François Raskin. Synthesis from LTL Specifications with Mean-Payoff Objectives. In TACAS'13, Lecture Notes in Computer Science 7795, pages 169-184. Springer-Verlag, March 2013. 
@inproceedings{tacas2013-BBFR,
  author =              {Bohy, Aaron and Bruy{\`e}re, V{\'e}ronique and
                         Filiot, Emmanuel and Raskin, Jean-Fran{\c c}ois},
  title =               {Synthesis from {LTL} Specifications with Mean-Payoff
                         Objectives},
  editor =              {Piterman, Nir and Smolka, Scott A.},
  booktitle =           {{P}roceedings of the 19th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'13)},
  acronym =             {{TACAS}'13},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7795},
  pages =               {169-184},
  year =                {2013},
  month =               mar,
}
[BBG+07] Christel Baier, Tomáš Brázdil, Marcus Größer, and Antonín Kučera. Stochastic Game Logic. In QEST'07, pages 227-236. IEEE Comp. Soc. Press, September 2007. 
@inproceedings{qest2007-BBGK,
  author =              {Baier, {\relax Ch}ristel and Br{\'a}zdil,
                         Tom{\'a}{\v s} and Gr{\"o}{\ss}er, Marcus and Ku{\v
                         c}era, Anton{\'\i}n},
  title =               {Stochastic Game Logic},
  booktitle =           {{P}roceedings of the 4th {I}nternational
                         {C}onference on {Q}uantitative {E}valuation of
                         {S}ystems ({QEST}'07)},
  acronym =             {{QEST}'07},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {227-236},
  year =                {2007},
  month =               sep,
}
[BBG+12] Christel Baier, Tomáš Brázdil, Marcus Größer, and Antonín Kučera. Stochastic Game Logic. Acta Informatica 49(4):203-224. Springer-Verlag, June 2012. 
@article{acta49(4)-BBGK,
  author =              {Baier, {\relax Ch}ristel and Br{\'a}zdil,
                         Tom{\'a}{\v s} and Gr{\"o}{\ss}er, Marcus and Ku{\v
                         c}era, Anton{\'\i}n},
  title =               {Stochastic Game Logic},
  publisher =           {Springer-Verlag},
  journal =             {Acta Informatica},
  volume =              {49},
  number =              {4},
  pages =               {203-224},
  year =                {2012},
  month =               jun,
  doi =                 {10.1007/s00236-012-0156-0},
}
[BBG+19] Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, and Marie Van den Bogaard. The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games. In CONCUR'19, Leibniz International Proceedings in Informatics 140, pages 13:1-13:16. Leibniz-Zentrum für Informatik, August 2019. 
@inproceedings{concur2019-BBGRB,
  author =              {Brihaye, {\relax Th}omas and Bruy{\`e}re,
                         V{\'e}ronique and Goeminne, Aline and Raskin,
                         Jean-Fran{\c c}ois and Van{~}den{ }Bogaard, Marie},
  title =               {The~Complexity of Subgame Perfect Equilibria in
                         Quantitative Reachability Games},
  editor =              {Fokkink, Wan J. and van Glabbeek, Rob},
  booktitle =           {{P}roceedings of the 30th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'19)},
  acronym =             {{CONCUR}'19},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {140},
  pages =               {13:1-13:16},
  year =                {2019},
  month =               aug,
  doi =                 {10.4230/LIPIcs.CONCUR.2019.13},
}
[BBJ+14] Dimitri Bohlender, Harold Bruintjes, Sebastian Junges, Jens Katelaan, Viet Yen Nguyen, and Thomas Noll. A Review of Statistical Model Checking Pitfalls on Real-Time Stochastic Models. In ISoLA'14, Lecture Notes in Computer Science 8803, pages 177-192. Springer-Verlag, October 2014. 
@inproceedings{BBJKNN-isola2014,
  author =              {Bohlender, Dimitri and Bruintjes, Harold and Junges,
                         Sebastian and Katelaan, Jens and Nguyen, Viet Yen
                         and Noll, Thomas},
  title =               {A~Review of Statistical Model Checking Pitfalls on
                         Real-Time Stochastic Models},
  editor =              {Margaria, Tiziana and Steffen, Bernhard},
  booktitle =           {{P}roceedings of the 6th {I}nternational {S}ymposium
                         on {L}everaging {A}pplications of {F}ormal
                         {M}ethods, {V}erification and {V}alidation
                         ({IS}o{LA}'14)~-- {P}art~{II}: {S}pecialized
                         {T}echniques and {A}pplications},
  acronym =             {{IS}o{LA}'14},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8803},
  pages =               {177-192},
  year =                {2014},
  month =               oct,
  doi =                 {10.1007/978-3-662-45231-8_13},
}
[BBL04] Patricia Bouyer, Ed Brinksma, and Kim Guldstrand Larsen. Staying Alive as Cheaply as Possible. In HSCC'04, Lecture Notes in Computer Science 2993, pages 203-218. Springer-Verlag, March 2004. 
@inproceedings{hscc2004-BBL,
  author =              {Bouyer, Patricia and Brinksma, Ed and Larsen, Kim
                         Guldstrand},
  title =               {Staying Alive as Cheaply as Possible},
  editor =              {Alur, Rajeev and Pappas, George J.},
  booktitle =           {{P}roceedings of the 7th {I}nternational {W}orkshop
                         on {H}ybrid {S}ystems: {C}omputation and {C}ontrol
                         ({HSCC}'04)},
  acronym =             {{HSCC}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2993},
  pages =               {203-218},
  year =                {2004},
  month =               mar,
}
[BBL08] Patricia Bouyer, Ed Brinksma, and Kim Guldstrand Larsen. Optimal infinite scheduling for multi-priced timed automata. Formal Methods in System Design 32(1):2-23. Springer-Verlag, February 2008. 
@article{fmsd32(1)-BBL,
  author =              {Bouyer, Patricia and Brinksma, Ed and Larsen, Kim
                         Guldstrand},
  title =               {Optimal infinite scheduling for multi-priced timed
                         automata},
  publisher =           {Springer-Verlag},
  journal =             {Formal Methods in System Design},
  volume =              {32},
  number =              {1},
  pages =               {2-23},
  year =                {2008},
  month =               feb,
}
[BBL+13] Giorgio Bacci, Giovanni Bacci, Kim Guldstrand Larsen, and Radu Mardare. Computing Behavioral Distances, Compositionally. In MFCS'13, Lecture Notes in Computer Science 8087, pages 74-85. Springer-Verlag, August 2013. 
@inproceedings{mfcs2013-BBLM,
  author =              {Bacci, Giorgio and Bacci, Giovanni and Larsen, Kim
                         Guldstrand and Mardare, Radu},
  title =               {Computing Behavioral Distances, Compositionally},
  editor =              {Chatterjee, Krishnendu and Sgall, Ji{\v r}{\'\i}},
  booktitle =           {{P}roceedings of the 38th {I}nternational
                         {S}ymposium on {M}athematical {F}oundations of
                         {C}omputer {S}cience ({MFCS}'13)},
  acronym =             {{MFCS}'13},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8087},
  pages =               {74-85},
  year =                {2013},
  month =               aug,
  doi =                 {10.1007/978-3-642-40313-2_9},
}
[BBL+13] Giorgio Bacci, Giovanni Bacci, Kim Guldstrand Larsen, and Radu Mardare. The BisimDist Library: Efficient Computation of Bisimilarity Distances for Markovian Models. In QEST'13, pages 278-281. IEEE Comp. Soc. Press, August 2013. 
@inproceedings{qest2013-BBLM,
  author =              {Bacci, Giorgio and Bacci, Giovanni and Larsen, Kim
                         Guldstrand and Mardare, Radu},
  title =               {The BisimDist Library: Efficient Computation of
                         Bisimilarity Distances for {M}arkovian Models},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {Q}uantitative {E}valuation of
                         {S}ystems ({QEST}'13)},
  acronym =             {{QEST}'13},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {278-281},
  year =                {2013},
  month =               aug,
  doi =                 {10.1007/978-3-642-40196-1_23},
}
[BBL+04] Gerd Behrmann, Patricia Bouyer, Kim Guldstrand Larsen, and Radek Pelánek. Lower and Upper Bounds in Zone-Based Abstractions of Timed Automata. In TACAS'04, Lecture Notes in Computer Science 2988, pages 312-326. Springer-Verlag, March 2004. 
@inproceedings{tacas2004-BBLP,
  author =              {Behrmann, Gerd and Bouyer, Patricia and Larsen, Kim
                         Guldstrand and Pel{\'a}nek, Radek},
  title =               {Lower and Upper Bounds in Zone-Based Abstractions of
                         Timed Automata},
  editor =              {Jensen, Kurt and Podelski, Andreas},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'04)},
  acronym =             {{TACAS}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2988},
  pages =               {312-326},
  year =                {2004},
  month =               mar,
  doi =                 {10.1007/978-3-540-24730-2_25},
}
[BBL+06] Gerd Behrmann, Patricia Bouyer, Kim Guldstrand Larsen, and Radek Pelánek. Lower and Upper Bounds in Zone-Based Abstractions of Timed Automata. International Journal on Software Tools for Technology Transfer 8(3):204-215. Springer-Verlag, June 2006. 
@article{sttt8(3)-BBLP,
  author =              {Behrmann, Gerd and Bouyer, Patricia and Larsen, Kim
                         Guldstrand and Pel{\'a}nek, Radek},
  title =               {Lower and Upper Bounds in Zone-Based Abstractions of
                         Timed Automata},
  publisher =           {Springer-Verlag},
  journal =             {International Journal on Software Tools for
                         Technology Transfer},
  volume =              {8},
  number =              {3},
  pages =               {204-215},
  year =                {2006},
  month =               jun,
  doi =                 {10.1007/s10009-005-0190-0},
}
[BBL+15] Nikola Beneš, Petr Bezdek, Kim Guldstrand Larsen, and Jiří Srba. Language Emptiness of Continuous-Time Parametric Timed Automata. In ICALP'15, Lecture Notes in Computer Science 9135, pages 69-81. Springer-Verlag, July 2015. 
@inproceedings{icalp2015-BBLS,
  author =              {Bene{\v{s}}, Nikola and Bezdek, Petr and Larsen, Kim
                         Guldstrand and Srba, Ji{\v r}{\'\i}},
  title =               {Language Emptiness of Continuous-Time Parametric
                         Timed Automata},
  editor =              {Halld{\'o}rsson, Magn{\'u}s M. and Iwana, Kazuo and
                         Kobayashi, Naoki and Speckmann, Bettina},
  booktitle =           {{P}roceedings of the 42nd {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'15)~-- Part~{II}},
  acronym =             {{ICALP}'15},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9135},
  pages =               {69-81},
  year =                {2015},
  month =               jul,
  doi =                 {10.1007/978-3-662-47666-6_6},
}
[BBM06] Ramzi Ben Salah, Marius Bozga, and Oded Maler. On Interleaving in Timed Automata. In CONCUR'06, Lecture Notes in Computer Science 4137, pages 465-476. Springer-Verlag, August 2006. 
@inproceedings{concur2006-BBM,
  author =              {Ben{~}Salah, Ramzi and Bozga, Marius and Maler,
                         Oded},
  title =               {On Interleaving in Timed Automata},
  editor =              {Baier, {\relax Ch}ristel and Hermanns, Holger},
  booktitle =           {{P}roceedings of the 17th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'06)},
  acronym =             {{CONCUR}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4137},
  pages =               {465-476},
  year =                {2006},
  month =               aug,
}
[BBM06] Patricia Bouyer, Thomas Brihaye, and Nicolas Markey. Improved Undecidability Results on Weighted Timed Automata. Information Processing Letters 98(5):188-194. Elsevier, June 2006.
Abstract

In this paper, we improve two recent undecidability results of Brihaye, Bruyère and Raskin about weighted timed automata, an extension of timed automata with a cost variable. Our results rely on a new encoding of the two counters of a Minsky machine that only require three clocks and one stopwatch cost, while previous reductions required five clocks and one stopwatch cost.

@article{ipl98(5)-BBM,
  author =              {Bouyer, Patricia and Brihaye, {\relax Th}omas and
                         Markey, Nicolas},
  title =               {Improved Undecidability Results on Weighted Timed
                         Automata},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {98},
  number =              {5},
  pages =               {188-194},
  year =                {2006},
  month =               jun,
  doi =                 {10.1016/j.ipl.2006.01.012},
  abstract =            {In this paper, we improve two recent undecidability
                         results of Brihaye, Bruy{\`e}re and Raskin about
                         weighted timed automata, an extension of timed
                         automata with a cost variable. Our results rely on a
                         new encoding of the two counters of a Minsky machine
                         that only require three clocks and one stopwatch
                         cost, while previous reductions required five clocks
                         and one stopwatch cost.},
}
[BBM10] Patricia Bouyer, Romain Brenguier, and Nicolas Markey. Nash Equilibria for Reachability Objectives in Multi-player Timed Games. In CONCUR'10, Lecture Notes in Computer Science 6269, pages 192-206. Springer-Verlag, September 2010.
Abstract

We propose a procedure for computing Nash equilibria in multi-player timed games with reachability objectives. Our procedure is based on the construction of a finite concurrent game, and on a generic characterization of Nash equilibria in (possibly infinite) concurrent games. Along the way, we use our characterization to compute Nash equilibria in finite concurrent games.

@inproceedings{concur2010-BBM,
  author =              {Bouyer, Patricia and Brenguier, Romain and Markey,
                         Nicolas},
  title =               {{N}ash Equilibria for Reachability Objectives in
                         Multi-player Timed Games},
  editor =              {Gastin, Paul and Laroussinie, Fran{\c c}ois},
  booktitle =           {{P}roceedings of the 21st {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'10)},
  acronym =             {{CONCUR}'10},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6269},
  pages =               {192-206},
  year =                {2010},
  month =               sep,
  doi =                 {10.1007/978-3-642-15375-4_14},
  abstract =            {We propose a procedure for computing Nash equilibria
                         in multi-player timed games with reachability
                         objectives. Our procedure is based on the
                         construction of a finite concurrent game, and on a
                         generic characterization of Nash equilibria in
                         (possibly infinite) concurrent games. Along the way,
                         we~use our characterization to compute Nash
                         equilibria in finite concurrent games.},
}
[BBM10] Patricia Bouyer, Romain Brenguier, and Nicolas Markey. Computing Equilibria in Two-Player Timed Games via Turn-Based Finite Games. In FORMATS'10, Lecture Notes in Computer Science 6246, pages 62-76. Springer-Verlag, September 2010.
Abstract

We study two-player timed games where the objectives of the two players are not opposite. We focus on the standard notion of Nash equilibrium and propose a series of transformations that builds two finite turn-based games out of a timed game, with a precise correspondence between Nash equilibria in the original and in final games. This provides us with an algorithm to compute Nash equilibria in two-player timed games for large classes of properties.

@inproceedings{formats2010-BBM,
  author =              {Bouyer, Patricia and Brenguier, Romain and Markey,
                         Nicolas},
  title =               {Computing Equilibria in Two-Player Timed Games
                         {\textit{via}}~Turn-Based Finite Games},
  editor =              {Chatterjee, Krishnendu and Henzinger, Thomas A.},
  booktitle =           {{P}roceedings of the 8th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'10)},
  acronym =             {{FORMATS}'10},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6246},
  pages =               {62-76},
  year =                {2010},
  month =               sep,
  doi =                 {10.1007/978-3-642-15297-9_7},
  abstract =            {We study two-player timed games where the objectives
                         of the two players are not opposite. We focus on the
                         standard notion of Nash equilibrium and propose a
                         series of transformations that builds two finite
                         turn-based games out of a timed game, with a precise
                         correspondence between Nash equilibria in the
                         original and in final games. This provides us with
                         an algorithm to compute Nash equilibria in
                         two-player timed games for large classes of
                         properties.},
}
[BBM18] A. R. Balasubramanian, Nathalie Bertrand, and Nicolas Markey. Parameterized verification of synchronization in constrained reconfigurable broadcast networks. In TACAS'18 (Part II), Lecture Notes in Computer Science 10806, pages 38-54. Springer-Verlag, April 2018.
Abstract

Reconfigurable broadcast networks provide a convenient formalism for modelling and reasoning about networks of mobile agents broadcasting messages to other agents following some (evolving) communication topology. The parameterized verification of such models aims at checking whether a given property holds irrespective of the initial configuration (number of agents, initial states and initial communication topology). We focus here on the synchronization property, asking whether all agents converge to a set of target states after some execution. This problem is known to be decidable in polynomial time when no constraints are imposed on the evolution of the communication topology (while it is undecidable for static broadcast networks).

In this paper we investigate how various constraints on reconfigurations affect the decidability and complexity of the synchronization problem. In particular, we show that when bounding the number of reconfigured links between two communications steps by a constant, synchronization becomes undecidable; on the other hand, synchronization remains decidable in PTIME when the bound grows with the number of agents.

@inproceedings{tacas2018-2-BBM,
  author =              {Balasubramanian, A. R. and Bertrand, Nathalie and
                         Markey, Nicolas},
  title =               {Parameterized verification of synchronization in
                         constrained reconfigurable broadcast networks},
  editor =              {Beyer, Dirk and Huisman, Marieke},
  booktitle =           {{P}roceedings of the 24th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'18)~-- {P}art~{II}},
  acronym =             {{TACAS}'18 (Part~{II})},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {10806},
  pages =               {38-54},
  year =                {2018},
  month =               apr,
  doi =                 {10.1007/978-3-319-89963-3_3},
  abstract =            {Reconfigurable broadcast networks provide a
                         convenient formalism for modelling and reasoning
                         about networks of mobile agents broadcasting
                         messages to other agents following some (evolving)
                         communication topology. The parameterized
                         verification of such models aims at checking whether
                         a given property holds irrespective of the initial
                         configuration (number of agents, initial states and
                         initial communication topology). We~focus here on
                         the \emph{synchronization property}, asking whether
                         all agents converge to a set of target states after
                         some execution. This~problem is known to be
                         decidable in polynomial time when no constraints are
                         imposed on the evolution of the communication
                         topology (while~it~is undecidable for static
                         broadcast networks).\par In this paper we
                         investigate how various constraints on
                         reconfigurations affect the decidability and
                         complexity of the synchronization problem.
                         In~particular, we show that when bounding the number
                         of reconfigured links between two communications
                         steps by a constant, synchronization becomes
                         undecidable; on~the other hand, synchronization
                         remains decidable in PTIME when the bound grows with
                         the number of agents.},
}
[BBM+15] Thomas Brihaye, Véronique Bruyère, Noëmie Meunier, and Jean-François Raskin. Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability. In CSL'15, Leibniz International Proceedings in Informatics 41, pages 504-518. Leibniz-Zentrum für Informatik, September 2015. 
@inproceedings{csl2015-BBMR,
  author =              {Brihaye, {\relax Th}omas and Bruy{\`e}re,
                         V{\'e}ronique and Meunier, No{\"e}mie and Raskin,
                         Jean-Fran{\c c}ois},
  title =               {Weak Subgame Perfect Equilibria and their
                         Application to Quantitative Reachability},
  editor =              {Kreutzer, Stephan},
  booktitle =           {{P}roceedings of the 24th {EACSL} {A}nnual
                         {C}onference on {C}omputer {S}cience {L}ogic
                         ({CSL}'15)},
  acronym =             {{CSL}'15},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {41},
  pages =               {504-518},
  year =                {2015},
  month =               sep,
  doi =                 {10.4230/LIPIcs.CSL.2015.504},
}
[BBM+11] Patricia Bouyer, Romain Brenguier, Nicolas Markey, and Michael Ummels. Nash Equilibria in Concurrent Games with Büchi Objectives. In FSTTCS'11, Leibniz International Proceedings in Informatics 13, pages 375-386. Leibniz-Zentrum für Informatik, December 2011.
Abstract

We study the problem of the existence (and computation) of Nash equilibria in multi-player concurrent games with Büchi-definable objectives. First, when the objectives are Büchi conditions on the game, we prove that the existence problem can be solved in polynomial time. In a second part, we extend our technique to objectives defined by deterministic Büchi automata, and prove that the problem then becomes EXPTIME-complete. We prove PSPACE-completeness for the case where the Büchi automata are 1-weak.

@inproceedings{fsttcs2011-BBMU,
  author =              {Bouyer, Patricia and Brenguier, Romain and Markey,
                         Nicolas and Ummels, Michael},
  title =               {{N}ash Equilibria in Concurrent Games with
                         {B}{\"u}chi Objectives},
  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},
  pages =               {375-386},
  year =                {2011},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2011.375},
  abstract =            {We study the problem of the existence (and
                         computation) of Nash equilibria in multi-player
                         concurrent games with B{\"u}chi-definable
                         objectives. First, when the objectives are B{\"u}chi
                         conditions on the game, we prove that the existence
                         problem can be solved in polynomial time. In a
                         second part, we extend our technique to objectives
                         defined by deterministic B{\"u}chi automata, and
                         prove that the problem then becomes
                         EXPTIME-complete. We prove PSPACE-completeness for
                         the case where the B{\"u}chi automata are 1-weak.},
}
[BBM+12] Patricia Bouyer, Romain Brenguier, Nicolas Markey, and Michael Ummels. Concurrent games with ordered objectives. In FoSSaCS'12, Lecture Notes in Computer Science 7213, pages 301-315. Springer-Verlag, March 2012.
Abstract

We consider concurrent games played on graphs, in which each player has several qualitative (e.g. reachability or Büchi) objectives, and a preorder on these objectives (for instance the counting order, where the aim is to maximise the number of objectives that are fulfilled).

We study two fundamental problems in that setting: (1) the value problem, which aims at deciding the existence of a strategy that ensures a given payoff; (2) the Nash equilibrium problem, where we want to decide the existence of a Nash equilibrium (possibly with a condition on the payoffs). We characterise the exact complexities of these problems for several relevant preorders, and several kinds of objectives.

@inproceedings{fossacs2012-BBMU,
  author =              {Bouyer, Patricia and Brenguier, Romain and Markey,
                         Nicolas and Ummels, Michael},
  title =               {Concurrent games with ordered objectives},
  editor =              {Birkedal, Lars},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'12)},
  acronym =             {{FoSSaCS}'12},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7213},
  pages =               {301-315},
  year =                {2012},
  month =               mar,
  doi =                 {10.1007/978-3-642-28729-9_20},
  abstract =            {We consider concurrent games played on graphs, in
                         which each player has several qualitative (e.g.
                         reachability or B{\"u}chi) objectives, and a
                         preorder on these objectives (for instance the
                         counting order, where the aim is to maximise the
                         number of objectives that are fulfilled).\par We
                         study two fundamental problems in that setting:
                         (1)~the \emph{value problem}, which aims at deciding
                         the existence of a strategy that ensures a given
                         payoff; (2)~the \emph{Nash equilibrium problem},
                         where we want to decide the existence of a Nash
                         equilibrium (possibly with a condition on the
                         payoffs). We characterise the exact complexities of
                         these problems for several relevant preorders, and
                         several kinds of objectives.},
}
[BBM+15] Patricia Bouyer, Romain Brenguier, Nicolas Markey, and Michael Ummels. Pure Nash Equilibria in Concurrent Games. Logical Methods in Computer Science 11(2:9). June 2015.
Abstract

We study pure-strategy Nash equilibria in multiplayer concurrent games, for a variety of omega-regular objectives. For simple objectives (e.g. reachability, Büchi objectives), we transform the problem of deciding the existence of a Nash equilibrium in a given concurrent game into that of deciding the existence of a winning strategy in a turn-based two-player game (with a refined objective). We use that transformation to design algorithms for computing Nash equilibria, which in most cases have optimal worst-case complexity. For automata-defined objectives, we extend the above algorithms using a simulation relation which allows us to consider the product of the game with the automata defining the objectives. Building on previous algorithms for simple qualitative objectives, we define and study a semi-quantitative framework, where all players have several boolean objectives equipped with a preorder; a player may for instance want to satisfy all her objectives, or to maximise the number of objectives that she achieves. In most cases, we prove that the algorithms we obtain match the complexity of the problem they address.

@article{lmcs11(2)-BBMU,
  author =              {Bouyer, Patricia and Brenguier, Romain and Markey,
                         Nicolas and Ummels, Michael},
  title =               {Pure {N}ash Equilibria in Concurrent Games},
  journal =             {Logical Methods in Computer Science},
  volume =              {11},
  number =              {2:9},
  year =                {2015},
  month =               jun,
  doi =                 {10.2168/LMCS-11(2:9)2015},
  abstract =            {We study pure-strategy Nash equilibria in
                         multiplayer concurrent games, for a variety of
                         omega-regular objectives. For simple objectives
                         (e.g. reachability, B{\"u}chi objectives), we
                         transform the problem of deciding the existence of a
                         Nash equilibrium in a given concurrent game into
                         that of deciding the existence of a winning strategy
                         in a turn-based two-player game (with a refined
                         objective). We use that transformation to design
                         algorithms for computing Nash equilibria, which in
                         most cases have optimal worst-case complexity. For
                         automata-defined objectives, we extend the above
                         algorithms using a simulation relation which allows
                         us to consider the product of the game with the
                         automata defining the objectives. Building on
                         previous algorithms for simple qualitative
                         objectives, we define and study a semi-quantitative
                         framework, where all players have several boolean
                         objectives equipped with a preorder; a player may
                         for instance want to satisfy all her objectives, or
                         to maximise the number of objectives that she
                         achieves. In most cases, we prove that the
                         algorithms we obtain match the complexity of the
                         problem they address.},
}
[BBR04] Thomas Brihaye, Véronique Bruyère, and Jean-François Raskin. Model-checking for weighted timed automata. In FORMATS-FTRTFT'04, Lecture Notes in Computer Science 3253, pages 277-292. Springer-Verlag, September 2004. 
@inproceedings{formats2004-BBR,
  author =              {Brihaye, {\relax Th}omas and Bruy{\`e}re,
                         V{\'e}ronique and Raskin, Jean-Fran{\c c}ois},
  title =               {Model-checking for weighted timed automata},
  editor =              {Lakhnech, Yassine and Yovine, Sergio},
  booktitle =           {{P}roceedings of the {J}oint {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'04) and {F}ormal
                         {T}echniques in {R}eal-Time and {F}ault-Tolerant
                         {S}ystems ({FTRTFT}'04)},
  acronym =             {{FORMATS-FTRTFT}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3253},
  pages =               {277-292},
  year =                {2004},
  month =               sep,
}
[BBR05] Thomas Brihaye, Véronique Bruyère, and Jean-François Raskin. On Optimal Timed Strategies. In FORMATS'05, Lecture Notes in Computer Science 3829, pages 49-64. Springer-Verlag, September 2005. 
@inproceedings{formats2005-BBR,
  author =              {Brihaye, {\relax Th}omas and Bruy{\`e}re,
                         V{\'e}ronique and Raskin, Jean-Fran{\c c}ois},
  title =               {On Optimal Timed Strategies},
  editor =              {Pettersson, Paul and Yi, Wang},
  booktitle =           {{P}roceedings of the 3rd {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'05)},
  acronym =             {{FORMATS}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3829},
  pages =               {49-64},
  year =                {2005},
  month =               sep,
  doi =                 {10.1007/11603009_5},
}
[BBS01] Jiří Barnat, Luboš Brim, and Jitka Stříbrná. Distributed LTL Model-Checking in SPIN. In SPIN'01, Lecture Notes in Computer Science 2057, pages 200-216. Springer-Verlag, May 2001. 
@inproceedings{spin2001-BBS,
  author =              {Barnat, Ji{\v r}{\'\i} and Brim, Lubo{\v s} and
                         St{\v r}{\'\i}brn{\'a}, Jitka},
  title =               {Distributed {LTL} Model-Checking in {SPIN}},
  editor =              {Dwyer, Matthew B.},
  booktitle =           {{P}roceedings of the 8th {I}nternational {SPIN}
                         {W}orkshop ({SPIN}'01)},
  acronym =             {{SPIN}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2057},
  pages =               {200-216},
  year =                {2001},
  month =               may,
}
[BC03] Marco Benedetti and Alessandro Cimatti. Bounded Model Checking for Past LTL. In TACAS'03, Lecture Notes in Computer Science 2619, pages 18-33. Springer-Verlag, April 2003. 
@inproceedings{tacas2003-BC,
  author =              {Benedetti, Marco and Cimatti, Alessandro},
  title =               {Bounded Model Checking for Past {LTL}},
  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 =               {18-33},
  year =                {2003},
  month =               apr,
}
[BC05] Patricia Bouyer and Fabrice Chevalier. On Conciseness of Extensions of Timed Automata. Journal of Automata, Languages and Combinatorics 10(4):393-405. 2005. 
@article{jalc10(4)-BC,
  author =              {Bouyer, Patricia and Chevalier, Fabrice},
  title =               {On Conciseness of Extensions of Timed Automata},
  journal =             {Journal of Automata, Languages and Combinatorics},
  volume =              {10},
  number =              {4},
  pages =               {393-405},
  year =                {2005},
}
[BC06] Patricia Bouyer and Fabrice Chevalier. On the Control of Timed and Hybrid Systems. EATCS Bulletin 89:79-96. EATCS, June 2006. 
@article{eatcs-bull89()-BC,
  author =              {Bouyer, Patricia and Chevalier, Fabrice},
  title =               {On the Control of Timed and Hybrid Systems},
  publisher =           {EATCS},
  journal =             {EATCS Bulletin},
  volume =              {89},
  pages =               {79-96},
  year =                {2006},
  month =               jun,
}
[BC10] Luboš Brim and Jakub Chaloupka. Using Strategy Improvement to Stay Alive. Technical Report FIMU-RS-2010-03, Faculty of Informatics, Masaryk University, Brno, Czech Republic, March 2010. 
@techreport{FIMU-RS-2010-03-BC,
  author =              {Brim, Lubo{\v s} and Chaloupka, Jakub},
  title =               {Using Strategy Improvement to Stay Alive},
  number =              {FIMU-RS-2010-03},
  year =                {2010},
  month =               mar,
  institution =         {Faculty of Informatics, Masaryk University, Brno,
                         Czech Republic},
}
[BCC98] Sergey Berezin, Sérgio Vale Aguiar Campos, and Edmund M. Clarke. Compositional Reasoning in Model Checking. In COMPOS'97, Lecture Notes in Computer Science 1536, pages 81-102. Springer-Verlag, 1998. 
@inproceedings{compos1997-BCC,
  author =              {Berezin, Sergey and Campos, S{\'e}rgio Vale Aguiar
                         and Clarke, Edmund M.},
  title =               {Compositional Reasoning in Model Checking},
  editor =              {de Roever, Willem-Paul and Langmaack, Hans and
                         Pnueli, Amir},
  booktitle =           {{R}evised {L}ectures of the 1st {I}nternational
                         {S}ymposium on {C}ompositionality: {T}he
                         {S}ignificant {D}ifference ({COMPOS}'97)},
  acronym =             {{COMPOS}'97},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1536},
  pages =               {81-102},
  year =                {1998},
  confyear =            {1997},
  confmonth =           {9},
}
[BCC+03] Armin Biere, Alessandro Cimatti, Edmund M. Clarke, Ofer Strichman, and Yunshan Zhu. Bounded Model Checking. In Marvin Zelkowitz (eds.), Highly Dependable Software, Advances in Computers 58, pages 117-148. Academic Press, 2003. 
@incollection{AC58-BCCSZ,
  author =              {Biere, Armin and Cimatti, Alessandro and Clarke,
                         Edmund M. and Strichman, Ofer and Zhu, Yunshan},
  title =               {Bounded Model Checking},
  editor =              {Zelkowitz, Marvin},
  booktitle =           {Highly Dependable Software},
  publisher =           {Academic Press},
  series =              {Advances in Computers},
  volume =              {58},
  pages =               {117-148},
  chapter =             {3},
  year =                {2003},
}
[BCC+99] Armin Biere, Alessandro Cimatti, Edmund M. Clarke, and Yunshan Zhu. Symbolic Model Checking without BDDs. In TACAS'99, Lecture Notes in Computer Science 1579, pages 193-207. Springer-Verlag, March 1999. 
@inproceedings{tacas1999-BCCZ,
  author =              {Biere, Armin and Cimatti, Alessandro and Clarke,
                         Edmund M. and Zhu, Yunshan},
  title =               {Symbolic Model Checking without {BDD}s},
  editor =              {Cleaveland, Rance},
  booktitle =           {{P}roceedings of the 5th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'99)},
  acronym =             {{TACAS}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1579},
  pages =               {193-207},
  year =                {1999},
  month =               mar,
}
[BCD05] Patricia Bouyer, Fabrice Chevalier, and Deepak D'Souza. Fault Diagnosis Using Timed Automata. In FoSSaCS'05, Lecture Notes in Computer Science 3441, pages 219-233. Springer-Verlag, April 2005. 
@inproceedings{fossacs2005-BCD,
  author =              {Bouyer, Patricia and Chevalier, Fabrice and D'Souza,
                         Deepak},
  title =               {Fault Diagnosis Using Timed Automata},
  editor =              {Sassone, Vladimiro},
  booktitle =           {{P}roceedings of the 8th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'05)},
  acronym =             {{FoSSaCS}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3441},
  pages =               {219-233},
  year =                {2005},
  month =               apr,
  doi =                 {10.1007/978-3-540-31982-5_14},
}
[BCD+07] Gerd Behrmann, Agnès Cougnard, Alexandre David, Emmanuel Fleury, Kim Guldstrand Larsen, and Didier Lime. UPPAAL-Tiga: Time for Playing Games!. In CAV'07, Lecture Notes in Computer Science 4590, pages 121-125. Springer-Verlag, July 2007. 
@inproceedings{cav2007-BCDFLL,
  author =              {Behrmann, Gerd and Cougnard, Agn{\`e}s and David,
                         Alexandre and Fleury, Emmanuel and Larsen, Kim
                         Guldstrand and Lime, Didier},
  title =               {{UPPAAL-Tiga}: Time for Playing Games!},
  editor =              {Damm, Werner and Hermanns, Holger},
  booktitle =           {{P}roceedings of the 19th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'07)},
  acronym =             {{CAV}'07},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4590},
  pages =               {121-125},
  year =                {2007},
  month =               jul,
}
[BCD+11] Luboš Brim, Jakub Chaloupka, Laurent Doyen, Raffaella Gentilini, and Jean-François Raskin. Faster algorithms for mean-payoff games. Formal Methods in System Design 38(2):97-118. Springer-Verlag, April 2011. 
@article{fmsd38(2)-BCDGR,
  author =              {Brim, Lubo{\v s} and Chaloupka, Jakub and Doyen,
                         Laurent and Gentilini, Raffaella and Raskin,
                         Jean-Fran{\c c}ois},
  title =               {Faster algorithms for mean-payoff games},
  publisher =           {Springer-Verlag},
  journal =             {Formal Methods in System Design},
  volume =              {38},
  number =              {2},
  pages =               {97-118},
  year =                {2011},
  month =               apr,
  doi =                 {10.1007/s10703-010-0105-x},
}
[BCE+98] Jean-Jacques Borrelly, Ève Costemaniere, Bernard Espiau, Konstantinos Kapellos, Roger Pissard-Gibollet, Daniel Simon, and Nicolas Turro. The ORCCAD Architecture. International Journal of Robotics Research 17(4):338-359. April 1998. 
@article{ijrr17(4)-BCEKPST,
  author =              {Borrelly, Jean-Jacques and Costemaniere, {\`E}ve and
                         Espiau, Bernard and Kapellos, Konstantinos and
                         Pissard{-}Gibollet, Roger and Simon, Daniel and
                         Turro, Nicolas},
  title =               {The {ORCCAD} Architecture},
  journal =             {International Journal of Robotics Research},
  volume =              {17},
  number =              {4},
  pages =               {338-359},
  year =                {1998},
  month =               apr,
}
[BCF03] Harry Buhrman, Richard Chang, and Lance Fortnow. One Bit of Advice. In STACS'03, Lecture Notes in Computer Science 2607, pages 547-558. Springer-Verlag, February 2003. 
@inproceedings{stacs2003-BCF,
  author =              {Buhrman, Harry and Chang, Richard and Fortnow,
                         Lance},
  title =               {One Bit of Advice},
  editor =              {Alt, Helmut and Habib, Michel},
  booktitle =           {{P}roceedings of the 20th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'03)},
  acronym =             {{STACS}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2607},
  pages =               {547-558},
  year =                {2003},
  month =               feb,
}
[BCF+04] Patricia Bouyer, Franck Cassez, Emmanuel Fleury, and Kim Guldstrand Larsen. Optimal Strategies in Priced Timed Game Automata. In FSTTCS'04, Lecture Notes in Computer Science 3328, pages 148-160. Springer-Verlag, December 2004. 
@inproceedings{fsttcs2004-BCFL,
  author =              {Bouyer, Patricia and Cassez, Franck and Fleury,
                         Emmanuel and Larsen, Kim Guldstrand},
  title =               {Optimal Strategies in Priced Timed Game Automata},
  editor =              {Lodaya, Kamal and Mahajan, Meena},
  booktitle =           {{P}roceedings of the 24th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'04)},
  acronym =             {{FSTTCS}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3328},
  pages =               {148-160},
  year =                {2004},
  month =               dec,
}
[BCF+04] Patricia Bouyer, Franck Cassez, Emmanuel Fleury, and Kim Guldstrand Larsen. Optimal Strategies in Priced Timed Games. Research Report RS-04-4, Basic Research in Computer Science, Aalborg University, Denmark, February 2004. 
@techreport{TR-brics04-4,
  author =              {Bouyer, Patricia and Cassez, Franck and Fleury,
                         Emmanuel and Larsen, Kim Guldstrand},
  title =               {Optimal Strategies in Priced Timed Games},
  number =              {RS-04-4},
  year =                {2004},
  month =               feb,
  institution =         {Basic Research in Computer Science, Aalborg
                         University, Denmark},
  type =                {Research Report},
}
[BCG88] Michael C. Browne, Edmund M. Clarke, and Orna Grumberg. Characterizing Finite Kripke Structures in Propositional Temporal Logic. Theoretical Computer Science 59(1-2):115-131. Elsevier, July 1988. 
@article{tcs59(1-2)-BCG,
  author =              {Browne, Michael C. and Clarke, Edmund M. and
                         Grumberg, Orna},
  title =               {Characterizing Finite {K}ripke Structures in
                         Propositional Temporal Logic},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {59},
  number =              {1-2},
  pages =               {115-131},
  year =                {1988},
  month =               jul,
}
[BCG+92] Samuel R. Buss, Stephen A. Cook, Vineet Gupta, and Vijaya Ramachandran. An Optimal Parallel Algorithm for Formula Evaluation. SIAM Journal on Computing 21(4):755-780. Society for Industrial and Applied Math., August 1992. 
@article{siamcomp21(4)-BCGR,
  author =              {Buss, Samuel R. and Cook, Stephen A. and Gupta,
                         Vineet and Ramachandran, Vijaya},
  title =               {An Optimal Parallel Algorithm for Formula
                         Evaluation},
  publisher =           {Society for Industrial and Applied Math.},
  journal =             {SIAM Journal on Computing},
  volume =              {21},
  number =              {4},
  pages =               {755-780},
  year =                {1992},
  month =               aug,
}
[BCH+11] Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger, and Orna Kupferman. Temporal Specifications with Accumulative Values. In LICS'11, pages 43-52. IEEE Comp. Soc. Press, June 2011. 
@inproceedings{lics2011-BCHK,
  author =              {Boker, Udi and Chatterjee, Krishnendu and Henzinger,
                         Thomas A. and Kupferman, Orna},
  title =               {Temporal Specifications with Accumulative Values},
  booktitle =           {{P}roceedings of the 26th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'11)},
  acronym =             {{LICS}'11},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {43-52},
  year =                {2011},
  month =               jun,
  doi =                 {10.1109/LICS.2011.33},
}
[BCH+14] Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger, and Orna Kupferman. Temporal Specifications with Accumulative Values. ACM Transactions on Computational Logic 15(4):27:1-27:25. ACM Press, August 2014. 
@article{tocl15(4)-BCHK,
  author =              {Boker, Udi and Chatterjee, Krishnendu and Henzinger,
                         Thomas A. and Kupferman, Orna},
  title =               {Temporal Specifications with Accumulative Values},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Computational Logic},
  volume =              {15},
  number =              {4},
  pages =               {27:1-27:25},
  year =                {2014},
  month =               aug,
  doi =                 {10.1145/2629686},
}
[BCK+01] Luboš Brim, Ivana Černa, Pavel Krčál, and Radek Pelánek. Distributed LTL Model Checking Based on Negative Cycle Detection. In FSTTCS'01, Lecture Notes in Computer Science 2245, pages 96-107. Springer-Verlag, December 2001. 
@inproceedings{fsttcs2001-BCKP,
  author =              {Brim, Lubo{\v s} and {\v{C}}erna, Ivana and
                         Kr{\v{c}}{\'a}l, Pavel and Pel{\'a}nek, Radek},
  title =               {Distributed {LTL} Model Checking Based on Negative
                         Cycle Detection},
  editor =              {Hariharan, Ramesh and Mukund, Madhavan and Vinay,
                         V.},
  booktitle =           {{P}roceedings of the 21st {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'01)},
  acronym =             {{FSTTCS}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2245},
  pages =               {96-107},
  year =                {2001},
  month =               dec,
}
[BCM05] Patricia Bouyer, Fabrice Chevalier, and Nicolas Markey. On the Expressiveness of TPTL and MTL. In FSTTCS'05, Lecture Notes in Computer Science 3821, pages 432-443. Springer-Verlag, December 2005.
Abstract

TPTL and MTL are two classical timed extensions of LTL. In this paper, we positively answer a 15-year-old conjecture that TPTL is strictly more expressive than MTL. But we show that, surprisingly, the TPTL formula proposed by Alur and Henzinger for witnessing this conjecture can be expressed in MTL. More generally, we show that TPTL formulae using only the F modality can be translated into MTL.

@inproceedings{fsttcs2005-BCM,
  author =              {Bouyer, Patricia and Chevalier, Fabrice and Markey,
                         Nicolas},
  title =               {On the Expressiveness of {TPTL} and {MTL}},
  editor =              {Ramanujam, R. and Sen, Sandeep},
  booktitle =           {{P}roceedings of the 25th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'05)},
  acronym =             {{FSTTCS}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3821},
  pages =               {432-443},
  year =                {2005},
  month =               dec,
  doi =                 {10.1007/11590156_35},
  abstract =            {TPTL and MTL are two classical timed extensions of
                         LTL. In this paper, we positively answer a
                         15-year-old conjecture that TPTL is strictly more
                         expressive than MTL. But we show that, surprisingly,
                         the TPTL formula proposed by Alur and Henzinger for
                         witnessing this conjecture can be expressed in MTL.
                         More generally, we show that TPTL formulae using
                         only the \textbf{F} modality can be translated into
                         MTL.},
}
[BCM10] Patricia Bouyer, Fabrice Chevalier, and Nicolas Markey. On the Expressiveness of TPTL and MTL. Information and Computation 208(2):97-116. Elsevier, February 2010.
Abstract

TPTL and MTL are two classical timed extensions of LTL. In this paper, we prove the 20-year-old conjecture that TPTL is strictly more expressive than MTL. But we show that, surprisingly, the TPTL formula proposed by Alur and Henzinger for witnessing this conjecture can be expressed in MTL. More generally, we show that TPTL formulae using only modality F can be translated into MTL.

@article{icomp208(2)-BCM,
  author =              {Bouyer, Patricia and Chevalier, Fabrice and Markey,
                         Nicolas},
  title =               {On the Expressiveness of {TPTL} and {MTL}},
  publisher =           {Elsevier},
  journal =             {Information and Computation},
  volume =              {208},
  number =              {2},
  pages =               {97-116},
  year =                {2010},
  month =               feb,
  doi =                 {10.1016/j.ic.2009.10.004},
  abstract =            {TPTL and MTL are two classical timed extensions
                         of~LTL. In~this paper, we prove the 20-year-old
                         conjecture that TPTL is strictly more expressive
                         than~MTL. But we show that, surprisingly, the
                         TPTL~formula proposed by Alur and Henzinger for
                         witnessing this conjecture \emph{can} be expressed
                         in~MTL. More generally, we show that TPTL formulae
                         using only modality~F can be translated into~MTL.},
}
[BCM16] Patricia Bouyer, Maximilien Colange, and Nicolas Markey. Symbolic Optimal Reachability in Weighted Timed Automata. In CAV'16, Lecture Notes in Computer Science 9779, pages 513-530. Springer-Verlag, July 2016.
Abstract

Weighted timed automata have been defined in the early 2000's for modelling resource-consumption or -allocation problems in real-time systems. Optimal reachability is decidable in weighted timed automata, and a symbolic forward algorithm has been developed to solve that problem. This algorithm uses so-called priced zones, an extension of standard zones with cost functions. In order to ensure termination, the algorithm requires clocks to be bounded. For unpriced timed automata, much work has been done to develop sound abstractions adapted to the forward exploration of timed automata, ensuring termination of the model-checking algorithm without bounding the clocks. In this paper, we take advantage of recent developments on abstractions for timed automata, and propose an algorithm allowing for symbolic analysis of all weighted timed automata, without requiring bounded clocks.

@inproceedings{cav2016-BCM,
  author =              {Bouyer, Patricia and Colange, Maximilien and Markey,
                         Nicolas},
  title =               {Symbolic Optimal Reachability in Weighted Timed
                         Automata},
  editor =              {Chaudhuri, Swarat and Farzan, Azadeh},
  booktitle =           {{P}roceedings of the 28th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'16)},
  acronym =             {{CAV}'16},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9779},
  pages =               {513-530},
  year =                {2016},
  month =               jul,
  doi =                 {10.1007/978-3-319-41528-4_28},
  url =                 {http://arxiv.org/abs/1602.00481},
  abstract =            {Weighted timed automata have been defined in the
                         early 2000's for modelling resource-consumption or
                         -allocation problems in real-time systems. Optimal
                         reachability is decidable in weighted timed
                         automata, and a symbolic forward algorithm has been
                         developed to solve that problem. This algorithm uses
                         so-called priced zones, an extension of standard
                         zones with cost functions. In order to ensure
                         termination, the algorithm requires clocks to be
                         bounded. For unpriced timed automata, much work has
                         been done to develop sound abstractions adapted to
                         the forward exploration of timed automata, ensuring
                         termination of the model-checking algorithm without
                         bounding the clocks. In this paper, we take
                         advantage of recent developments on abstractions for
                         timed automata, and propose an algorithm allowing
                         for symbolic analysis of all weighted timed
                         automata, without requiring bounded clocks.},
}
[BCM+92] Jerry R. Burch, Edmund M. Clarke, Kenneth L. McMillan, David L. Dill, and L. J. Hwang. Symbolic model checking: 1020 states and beyond. Information and Computation 98(2):142-170. Academic Press, June 1992. 
@article{icomp98(2)-BCMDH,
  author =              {Burch, Jerry R. and Clarke, Edmund M. and McMillan,
                         Kenneth L. and Dill, David L. and Hwang, L. J.},
  title =               {Symbolic model checking: {\(10^{20}\)} states and
                         beyond},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {98},
  number =              {2},
  pages =               {142-170},
  year =                {1992},
  month =               jun,
}
[BCO+92] François Baccelli, Guy Cohen, Geert Jan Olsder, and Jean-Pierre Quadrat. Shynchronization and Linearity. An Algebra For Discrete Event Systems. John Wiley & Sons, 1992. 
@book{BCOQ-des2001,
  author =              {Baccelli, Fran{\c c}ois and Cohen, Guy and Olsder,
                         Geert Jan and Quadrat, Jean-Pierre},
  title =               {Shynchronization and Linearity. An Algebra For
                         Discrete Event Systems},
  publisher =           {John Wiley \& Sons},
  year =                {1992},
  url =                 {http://www-rocq.inria.fr/metalau/cohen/SED/book-online.html},
}
[BCZ99] Armin Biere, Edmund M. Clarke, and Yunshan Zhu. Combining Local and Global Model Checking. In SMC'99, Electronic Notes in Theoretical Computer Science 23(2). Elsevier, July 1999. 
@inproceedings{smc1999-BCZ,
  author =              {Biere, Armin and Clarke, Edmund M. and Zhu, Yunshan},
  title =               {Combining Local and Global Model Checking},
  editor =              {Cimatti, Alessandro and Grumberg, Orna},
  booktitle =           {{P}roceedings of the 1st {I}nternational {W}orkshop
                         on {S}ymbolic {M}odel {C}hecking ({SMC}'99)},
  acronym =             {{SMC}'99},
  publisher =           {Elsevier},
  series =              {Electronic Notes in Theoretical Computer Science},
  volume =              {23},
  number =              {2},
  year =                {1999},
  month =               jul,
}
[BD00] Béatrice Bérard and Catherine Dufourd. Timed Automata and Additive Clock Constraints. Information Processing Letters 75(1-2):1-7. Elsevier, July 2000. 
@article{ipl75(1-2)-BD,
  author =              {B{\'e}rard, B{\'e}atrice and Dufourd, Catherine},
  title =               {Timed Automata and Additive Clock Constraints},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {75},
  number =              {1-2},
  pages =               {1-7},
  year =                {2000},
  month =               jul,
}
[BDF+04] Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, and Antoine Petit. Updatable timed Automata. Theoretical Computer Science 321(2-3):291-345. Elsevier, August 2004. 
@article{tcs321(2-3)-BDFP,
  author =              {Bouyer, Patricia and Dufourd, Catherine and Fleury,
                         Emmanuel and Petit, Antoine},
  title =               {Updatable timed Automata},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {321},
  number =              {2-3},
  pages =               {291-345},
  year =                {2004},
  month =               aug,
  doi =                 {10.1016/j.tcs.2004.04.003},
}
[BDG+17] Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, and Hugo Gimbert. Controlling a population. In CONCUR'17, Leibniz International Proceedings in Informatics 85, pages 12:1-12:16. Leibniz-Zentrum für Informatik, September 2017. 
@inproceedings{concur2017-BDGG,
  author =              {Bertrand, Nathalie and Dewaskar, Miheer and Genest,
                         Blaise and Gimbert, Hugo},
  title =               {Controlling a population},
  editor =              {Meyer, Roland and Nestmann, Uwe},
  booktitle =           {{P}roceedings of the 28th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'17)},
  acronym =             {{CONCUR}'17},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {85},
  pages =               {12:1-12:16},
  year =                {2017},
  month =               sep,
  doi =                 {10.4230/LIPIcs.CONCUR.2017.12},
}
[BDG+11] Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, and James Worrell. On Reachability for Hybrid Automata over Bounded Time. In ICALP'11, Lecture Notes in Computer Science 6756, pages 416-427. Springer-Verlag, July 2011. 
@inproceedings{icalp2011(2)-BDGORW,
  author =              {Brihaye, {\relax Th}omas and Doyen, Laurent and
                         Geeraerts, Gilles and Ouaknine, Jo{\"e}l and Raskin,
                         Jean-Fran{\c c}ois and Worrell, James},
  title =               {On Reachability for Hybrid Automata over Bounded
                         Time},
  editor =              {Aceto, Luca and Henzinger, Monika and Sgall, Ji{\v
                         r}{\'\i}},
  booktitle =           {{P}roceedings of the 38th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'11)~-- Part~{II}},
  acronym =             {{ICALP}'11},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6756},
  pages =               {416-427},
  year =                {2011},
  month =               jul,
}
[BDG+98] Béatrice Bérard, Volker Diekert, Paul Gastin, and Antoine Petit. Characterization of the Expressive Power of Silent Transitions in Timed Automata. Fundamenta Informaticae 36(2-3):145-182. IOS Press, November 1998. 
@article{fundi36(2-3)-BDGP,
  author =              {B{\'e}rard, B{\'e}atrice and Diekert, Volker and
                         Gastin, Paul and Petit, Antoine},
  title =               {Characterization of the Expressive Power of Silent
                         Transitions in Timed Automata},
  publisher =           {IOS Press},
  journal =             {Fundamenta Informaticae},
  volume =              {36},
  number =              {2-3},
  pages =               {145-182},
  year =                {1998},
  month =               nov,
}
[BDH+06] Dietmar Berwanger, Anuj Dawar, Paul Hunter, and Stephan Kreutzer. DAG-Width and Parity Games. In STACS'06, Lecture Notes in Computer Science 3884, pages 524-536. Springer-Verlag, February 2006. 
@inproceedings{stacs2006-BDHK,
  author =              {Berwanger, Dietmar and Dawar, Anuj and Hunter, Paul
                         and Kreutzer, Stephan},
  title =               {{DAG}-Width and Parity Games},
  editor =              {Durand, Bruno and Thomas, Wolfgang},
  booktitle =           {{P}roceedings of the 23rd {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'06)},
  acronym =             {{STACS}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3884},
  pages =               {524-536},
  year =                {2006},
  month =               feb,
  doi =                 {10.1007/11672142_43},
}
[BDJ+16] Thomas Brihaye, Benoît Delahaye, Loïg Jezequel, Nicolas Markey, and Jiří Srba (eds.) Proceedings of the Cassting Workshop on Games for the Synthesis of Complex Systems (Cassting'16) and of the 3rd International Workshop on Synthesis of Complex Parameters (SynCoP'16). Electronic Proceedings in Theoretical Computer Science 220. July 2016. 
@proceedings{cassting-syncop2016-DJMS,
  title =               {{P}roceedings of the {C}assting Workshop on {G}ames
                         for the {S}ynthesis of {C}omplex {S}ystems
                         ({C}assting'16) and of the 3rd {I}nternational
                         {W}orkshop on {S}ynthesis of {C}omplex {P}arameters
                         ({S}yn{C}o{P}'16)},
  editor =              {Brihaye, {\relax Th}omas and Delahaye, Beno{\^\i}t
                         and Jezequel, Lo{\"\i}g and Markey, Nicolas and
                         Srba, Ji{\v r}{\'\i}},
  booktitle =           {{P}roceedings of the {C}assting Workshop on {G}ames
                         for the {S}ynthesis of {C}omplex {S}ystems
                         ({C}assting'16) and of the 3rd {I}nternational
                         {W}orkshop on {S}ynthesis of {C}omplex {P}arameters
                         ({S}yn{C}o{P}'16)},
  acronym =             {{C}assting{{\slash}}{S}yn{C}o{P}'16},
  series =              {Electronic Proceedings in Theoretical Computer
                         Science},
  volume =              {220},
  year =                {2016},
  month =               jul,
  confyear =            {2016},
  confmonth =           {4},
  doi =                 {10.4204/EPTCS.220},
  url =                 {http://eptcs.web.cse.unsw.edu.au/
                         content.cgi?CASSTINGSynCoP2016},
}
[BDL04] Gerd Behrmann, Alexandre David, and Kim Guldstrand Larsen. A Tutorial on Uppaal. In SFM-RT'04, Lecture Notes in Computer Science 3185, pages 200-236. Springer-Verlag, September 2004. 
@inproceedings{sfm2004-BDL,
  author =              {Behrmann, Gerd and David, Alexandre and Larsen, Kim
                         Guldstrand},
  title =               {A~Tutorial on {U}ppaal},
  editor =              {Bernardo, Marco and Corradini, Flavio},
  booktitle =           {{F}ormal {M}ethods for the {D}esign of {R}eal-{T}ime
                         {S}ystems~--- {R}evised {L}ectures of the
                         {I}nternational {S}chool on {F}ormal {M}ethods for
                         the {D}esign of {C}omputer, {C}ommunication and
                         {S}oftware {S}ystems ({SFM-RT}'04)},
  acronym =             {{SFM-RT}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3185},
  pages =               {200-236},
  year =                {2004},
  month =               sep,
  doi =                 {10.1007/978-3-540-30080-9_7},
}
[BDL12] Benedikt Bollig, Normann Decker, and Martin Leucker. Frequency Linear-time Temporal Logic. In TASE'12, pages 85-92. IEEE Comp. Soc. Press, July 2012. 
@inproceedings{tase2012-BDL,
  author =              {Bollig, Benedikt and Decker, Normann and Leucker,
                         Martin},
  title =               {Frequency Linear-time Temporal Logic},
  editor =              {Margaria, Tiziana and Qiu, Zongyang and Yang,
                         Hongli},
  booktitle =           {{P}roceedings of the 6th {I}nternational {S}ymposium
                         on {T}heoretical {A}spects of {S}oftware
                         {E}ngineering ({TASE}'12)},
  acronym =             {{TASE}'12},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {85-92},
  year =                {2012},
  month =               jul,
  doi =                 {10.1109/TASE.2012.43},
}
[BDL+06] Gerd Behrmann, Alexandre David, Kim Guldstrand Larsen, John Håkansson, Paul Pettersson, Wang Yi, and Martijn Hendriks. UPPAAL 4.0. In QEST'06, pages 125-126. IEEE Comp. Soc. Press, September 2006. 
@inproceedings{qest2006-BDLHPYH,
  author =              {Behrmann, Gerd and David, Alexandre and Larsen, Kim
                         Guldstrand and H{\aa}kansson, John and Pettersson,
                         Paul and Yi, Wang and Hendriks, Martijn},
  title =               {UPPAAL~4.0},
  booktitle =           {{P}roceedings of the 3rd {I}nternational
                         {C}onference on {Q}uantitative {E}valuation of
                         {S}ystems ({QEST}'06)},
  acronym =             {{QEST}'06},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {125-126},
  year =                {2006},
  month =               sep,
  doi =                 {10.1109/QEST.2006.59},
}
[BDL+14] Peter Bulychev, Alexandre David, Kim Guldstrand Larsen, and Guangyuan Li. Efficient Controller Synthesis for a fragment of MTL0,&infin. Acta Informatica 51(3-4):165-192. Springer-Verlag, June 2014. 
@article{acta51(3-4)-BDLL,
  author =              {Bulychev, Peter and David, Alexandre and Larsen, Kim
                         Guldstrand and Li, Guangyuan},
  title =               {Efficient Controller Synthesis for a fragment of
                         {{\(\textsf{MTL}_{0,\infty}\)}}},
  publisher =           {Springer-Verlag},
  journal =             {Acta Informatica},
  volume =              {51},
  number =              {3-4},
  pages =               {165-192},
  year =                {2014},
  month =               jun,
  doi =                 {10.1007/s00236-013-0189-z},
}
[BDL+12] Peter Bulychev, Alexandre David, Kim Guldstrand Larsen, Axel Legay, Guangyuan Li, Danny Bøgsted Poulsen, and Amélie Stainer. Monitor-based statistical model checking for weighted metric temporal logic. In LPAR'12, Lecture Notes in Computer Science 7180, pages 168-182. Springer-Verlag, March 2012. 
@inproceedings{lpar2012-BDLLLPS,
  author =              {Bulychev, Peter and David, Alexandre and Larsen, Kim
                         Guldstrand and Legay, Axel and Li, Guangyuan and
                         Poulsen, Danny B{\o}gsted and Stainer, Am{\'e}lie},
  title =               {Monitor-based statistical model checking for
                         weighted metric temporal logic},
  editor =              {Bj{\o}rner, Nikolaj and Voronkov, Andrei},
  booktitle =           {{P}roceedings of the 18th {I}nternational
                         {C}onference {L}ogic {P}rogramming and {A}utomated
                         {R}easoning ({LPAR}'12)},
  acronym =             {{LPAR}'12},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7180},
  pages =               {168-182},
  year =                {2012},
  month =               mar,
  doi =                 {10.1007/978-3-642-28717-6_15},
}
[BDL+12] Peter Bulychev, Alexandre David, Kim Guldstrand Larsen, Axel Legay, Marius Mikučionis, and Danny Bøgsted Poulsen. Checking and Distributing Statistical Model Checking. In NFM'12, Lecture Notes in Computer Science 7226, pages 449-463. Springer-Verlag, April 2012. 
@inproceedings{nasaFM2012-BDLLMP,
  author =              {Bulychev, Peter and David, Alexandre and Larsen, Kim
                         Guldstrand and Legay, Axel and Miku{\v{c}}ionis,
                         Marius and Poulsen, Danny B{\o}gsted},
  title =               {Checking and Distributing Statistical Model
                         Checking},
  editor =              {Goodloe, Alwyn and Person, Suzette},
  booktitle =           {{P}roceedings of the 4th {NASA} {F}ormal {M}ethods
                         {S}ymposium ({NFM}'12)},
  acronym =             {{NFM}'12},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7226},
  pages =               {449-463},
  year =                {2012},
  month =               apr,
}
[BDL+09] Thomas Brihaye, Arnaud Da Costa, François Laroussinie, and Nicolas Markey. ATL with Strategy Contexts and Bounded Memory. In LFCS'09, Lecture Notes in Computer Science 5407, pages 92-106. Springer-Verlag, January 2009.
Abstract

We extend the alternating-time temporal logics ATL and ATL* with strategy contexts and memory constraints: the first extension make strategy quantifiers to not "forget" the strategies being executed by the other players. The second extension allows strategy quantifiers to restrict to memoryless or bounded-memory strategies.

We first consider expressiveness issues. We show that our logics can express important properties such as equilibria, and we formally compare them with other similar formalisms (ATL, ATL*, Game Logic, Strategy Logic, ...). We then address the problem of model-checking for our logics, providing a PSPACE algoritm for the sublogics involving only memoryless strategies and an EXPSPACE algorithm for the bounded-memory case.

@inproceedings{lfcs2009-BDLM,
  author =              {Brihaye, {\relax Th}omas and Da{~}Costa, Arnaud and
                         Laroussinie, Fran{\c c}ois and Markey, Nicolas},
  title =               {{ATL} with Strategy Contexts and Bounded Memory},
  editor =              {Artemov, Sergei N. and Nerode, Anil},
  booktitle =           {{P}roceedings of the {I}nternational {S}ymposium
                         {L}ogical {F}oundations of {C}omputer {S}cience
                         ({LFCS}'09)},
  acronym =             {{LFCS}'09},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5407},
  pages =               {92-106},
  year =                {2009},
  month =               jan,
  doi =                 {10.1007/978-3-540-92687-0_7},
  abstract =            {We extend the alternating-time temporal logics ATL
                         and ATL\textsuperscript{*} with \emph{strategy
                         contexts} and \emph{memory constraints}: the first
                         extension make strategy quantifiers to not
                         {"}forget{"} the strategies being executed by the
                         other players. The second extension allows strategy
                         quantifiers to restrict to memoryless or
                         bounded-memory strategies.\par We first consider
                         expressiveness issues. We show that our logics can
                         express important properties such as equilibria, and
                         we formally compare them with other similar
                         formalisms (ATL, ATL\textsuperscript{*}, Game Logic,
                         Strategy Logic,~...). We~then address the problem of
                         model-checking for our logics, providing a PSPACE
                         algoritm for the sublogics involving only memoryless
                         strategies and an EXPSPACE algorithm for the
                         bounded-memory case.},
}
[BDL+97] Joshua Berman, Arthur Drisko, François Lemieux, Cristopher Moore, and Denis Thérien. Circuit and Expressions with Non-Associative Gates. In CoCo'97, pages 193-203. IEEE Comp. Soc. Press, June 1997. 
@inproceedings{coco1997-BDLMT,
  author =              {Berman, Joshua and Drisko, Arthur and Lemieux,
                         Fran{\c c}ois and Moore, Cristopher and Th{\'e}rien,
                         Denis},
  title =               {Circuit and Expressions with Non-Associative Gates},
  booktitle =           {{P}roceedings of the 12th {A}nnual {IEEE}
                         {C}onference on {C}omputational {C}omplexity
                         ({CoCo}'97)},
  acronym =             {{CoCo}'97},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {193-203},
  year =                {1997},
  month =               jun,
}
[BDL+11] Gerd Behrmann, Alexandre David, Kim Guldstrand Larsen, Paul Pettersson, and Wang Yi. Developing UPPAAL over 15 years. Software – Practice and Experience 41(2):133-142. IEEE Comp. Soc. Press, February 2011. 
@article{spe41(2)-ADGPY,
  author =              {Behrmann, Gerd and David, Alexandre and Larsen, Kim
                         Guldstrand and Pettersson, Paul and Yi, Wang},
  title =               {Developing {UPPAAL} over 15~years},
  publisher =           {IEEE Comp. Soc. Press},
  journal =             {Software~-- Practice and Experience},
  volume =              {41},
  number =              {2},
  pages =               {133-142},
  year =                {2011},
  month =               feb,
}
[BDM+03] Patricia Bouyer, Deepak D'Souza, Parthasarathy Madhusudan, and Antoine Petit. Timed Control with Partial Observability. In CAV'03, Lecture Notes in Computer Science 2725, pages 180-192. Springer-Verlag, July 2003. 
@inproceedings{cav2003-BDMP,
  author =              {Bouyer, Patricia and D'Souza, Deepak and Madhusudan,
                         Parthasarathy and Petit, Antoine},
  title =               {Timed Control with Partial Observability},
  editor =              {Hunt, Jr, Warren A. and Somenzi, Fabio},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'03)},
  acronym =             {{CAV}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2725},
  pages =               {180-192},
  year =                {2003},
  month =               jul,
}
[BDM+09] Patricia Bouyer, Marie Duflot, Nicolas Markey, and Gabriel Renault. Measuring Permissivity in Finite Games. In CONCUR'09, Lecture Notes in Computer Science 5710, pages 196-210. Springer-Verlag, September 2009.
Abstract

In this paper, we extend the classical notion of strategies in turn-based finite games by allowing several moves to be selected. We define and study a quantitative measure for permissivity of such strategies by assigning penalties when blocking transitions. We prove that for reachability objectives, most permissive strategies exist, can be chosen memoryless, and can be computed in polynomial time, while it is in NP∩coNP for discounted and mean penalties.

@inproceedings{concur2009-BDMR,
  author =              {Bouyer, Patricia and Duflot, Marie and Markey,
                         Nicolas and Renault, Gabriel},
  title =               {Measuring Permissivity in Finite Games},
  editor =              {Bravetti, Mario and Zavattaro, Gianluigi},
  booktitle =           {{P}roceedings of the 20th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'09)},
  acronym =             {{CONCUR}'09},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5710},
  pages =               {196-210},
  year =                {2009},
  month =               sep,
  doi =                 {10.1007/978-3-642-04081-8_14},
  abstract =            {In this paper, we extend the classical notion of
                         strategies in turn-based finite games by allowing
                         several moves to be selected. We~define and study a
                         quantitative measure for permissivity of such
                         strategies by assigning penalties when blocking
                         transitions. We~prove that for reachability
                         objectives, most permissive strategies exist, can be
                         chosen memoryless, and can be computed in polynomial
                         time, while it is in
                         \(\textsf{NP}\cap\textsf{coNP}\) for discounted and
                         mean penalties.},
}
[BDR03] Véronique Bruyère, Emmanuel Dall'Olio, and Jean-François Raskin. Durations, Parametric Model Checking in Timed Automata with Presburger Arithmetic. In STACS'03, Lecture Notes in Computer Science 2607, pages 687-698. Springer-Verlag, February 2003. 
@inproceedings{stacs2003-BDR,
  author =              {Bruy{\`e}re, V{\'e}ronique and Dall'Olio, Emmanuel
                         and Raskin, Jean-Fran{\c c}ois},
  title =               {Durations, Parametric Model Checking in Timed
                         Automata with {P}resburger Arithmetic},
  editor =              {Alt, Helmut and Habib, Michel},
  booktitle =           {{P}roceedings of the 20th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'03)},
  acronym =             {{STACS}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2607},
  pages =               {687-698},
  year =                {2003},
  month =               feb,
}
[BDS+09] Hans Bherer, Jules Desharnais, and Richard St-Denis. Control of Parameterized Discrete Event Systems. Discrete Event Dynamic Systems 19(2):213-165. Kluwer Academic, June 2009. 
@article{deds19(2)-BDSD,
  author =              {Bherer, Hans and Desharnais, Jules and St-Denis,
                         Richard},
  title =               {Control of Parameterized Discrete Event Systems},
  publisher =           {Kluwer Academic},
  journal =             {Discrete Event Dynamic Systems},
  volume =              {19},
  number =              {2},
  pages =               {213-165},
  year =                {2009},
  month =               jun,
  doi =                 {10.1007/s10626-008-0040-9},
}
[Bea03] Danièle Beauquier. On probabilistic timed automata. Theoretical Computer Science 292(1):65-84. Elsevier, January 2003. 
@article{tcs292(1)-Bea,
  author =              {Beauquier, Dani{\`e}le},
  title =               {On~probabilistic timed automata},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {292},
  number =              {1},
  pages =               {65-84},
  year =                {2003},
  month =               jan,
  doi =                 {10.1016/S0304-3975(01)00215-8},
}
[Bed01] Nicolas Bedon. Logic over Words on Denumerable Ordinals. Journal of Computer and System Sciences 63(3):394-431. Academic Press, November 2001. 
@article{jcss63(3)-Bed,
  author =              {Bedon, Nicolas},
  title =               {Logic over Words on Denumerable Ordinals},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {63},
  number =              {3},
  pages =               {394-431},
  year =                {2001},
  month =               nov,
}
[BEG+15] Endre Boros, Khaled Elbassioni, Vladimir Gurvich, and Kazuhisa Makino. Markov Decision Processes and Stochastic Games with Total Effective Payoff. In STACS'15, Leibniz International Proceedings in Informatics 30, pages 103-115. Leibniz-Zentrum für Informatik, March 2015. 
@inproceedings{stacs2015-BEGM,
  author =              {Boros, Endre and Elbassioni, Khaled and Gurvich,
                         Vladimir and Makino, Kazuhisa},
  title =               {{M}arkov Decision Processes and Stochastic Games
                         with Total Effective Payoff},
  editor =              {Mayr, Ernst W. and Ollinger, Nicolas},
  booktitle =           {{P}roceedings of the 32nd {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'15)},
  acronym =             {{STACS}'15},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {30},
  pages =               {103-115},
  year =                {2015},
  month =               mar,
  doi =                 {10.4230/LIPIcs.STACS.2015.103},
}
[Bei91] Richard Beigel. Bounded Queries to SAT and the Boolean Hierarchy. Theoretical Computer Science 84(2):199-223. Elsevier, 1991. 
@article{tcs84(2)-Bei,
  author =              {Beigel, Richard},
  title =               {Bounded Queries to {SAT} and the {B}oolean
                         Hierarchy},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {84},
  number =              {2},
  pages =               {199-223},
  year =                {1991},
}
[BEK18] Michael Blondin, Javier Esparza, and Antonín Kučera. Automatic Analysis of Expected Termination Time for Population Protocols. In CONCUR'18, Leibniz International Proceedings in Informatics 118, pages 33:1-33:16. Leibniz-Zentrum für Informatik, September 2018. 
@inproceedings{concur2018-BEK,
  author =              {Blondin, Michael and Esparza, Javier and Ku{\v
                         c}era, Anton{\'\i}n},
  title =               {Automatic Analysis of Expected Termination Time for
                         Population Protocols},
  editor =              {Schewe, Sven and Zhang, Lijun},
  booktitle =           {{P}roceedings of the 29th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'18)},
  acronym =             {{CONCUR}'18},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {118},
  pages =               {33:1-33:16},
  year =                {2018},
  month =               sep,
  doi =                 {10.4230/LIPIcs.CONCUR.2018.33},
}
[Bel57] Richard Bellman. Dynamic Programming. Princeton University Press, 1957. 
@book{DP-Bel,
  author =              {Bellman, Richard},
  title =               {Dynamic Programming},
  publisher =           {Princeton University Press},
  year =                {1957},
}
[Bel58] Richard Bellman. On a Routing Problem. Quarterly of Applied Mathematics 16(1):87-90. 1958. 
@article{qam16(1)-Bel,
  author =              {Bellman, Richard},
  title =               {On a Routing Problem},
  journal =             {Quarterly of Applied Mathematics},
  volume =              {16},
  number =              {1},
  pages =               {87-90},
  year =                {1958},
}
[Bel06] Houda Bel Mokadem. Vérification des propriétés temporisées des automates programmables industriels. Thèse de doctorat, Lab. Spécification & Vérification, ENS Cachan, France, September 2006. 
@phdthesis{phd-belmokadem,
  author =              {Bel{~}Mokadem, Houda},
  title =               {V{\'e}rification des propri{\'e}t{\'e}s
                         temporis{\'e}es des automates programmables
                         industriels},
  year =                {2006},
  month =               sep,
  school =              {Lab.~Sp\'ecification \& V\'erification, ENS Cachan,
                         France},
  type =                {Th\`ese de doctorat},
}
[BEM96] Julian C. Bradfield, Javier Esparza, and Angelika Mader. An effective tableau system for the linear time mu-calculus. In ICALP'96, Lecture Notes in Computer Science 1099, pages 98-109. Springer-Verlag, July 1996. 
@inproceedings{icalp1996-BEM,
  author =              {Bradfield, Julian C. and Esparza, Javier and Mader,
                         Angelika},
  title =               {An effective tableau system for the linear time
                         mu-calculus},
  editor =              {Meyer auf der Heide, Friedhelm and Monien, Burkhard},
  booktitle =           {{P}roceedings of the 23rd {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'96)},
  acronym =             {{ICALP}'96},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1099},
  pages =               {98-109},
  year =                {1996},
  month =               jul,
}
[Ber00] Gérard Berry. The foundations of Esterel. In Gordon D. Plotkin, Colin Stirling, and Mads Tofte (eds.), Proof, Language, and Interaction – Essays in Honour of Robin Milner. MIT Press, 2000. 
@incollection{PLI2000-Ber,
  author =              {Berry, G{\'e}rard},
  title =               {The foundations of {E}sterel},
  editor =              {Plotkin, Gordon D. and Stirling, Colin and Tofte,
                         Mads},
  booktitle =           {Proof, Language, and Interaction~-- Essays in Honour
                         of {R}obin {M}ilner},
  publisher =           {MIT Press},
  pages =               {425-454},
  year =                {2000},
}
[Bey01] Dirk Beyer. Rabbit: Verification of Real-Time Systems. In RT-TOOLS'01, pages 13-21. August 2001. 
@inproceedings{rttools2001-Bey,
  author =              {Beyer, Dirk},
  title =               {Rabbit: Verification of Real-Time Systems},
  editor =              {Pettersson, Paul and Yovine, Sergio},
  booktitle =           {{P}roceedings of the 1st {W}orkshop on {R}eal-Time
                         {T}ools ({RT-TOOLS}'01)},
  acronym =             {{RT-TOOLS}'01},
  pages =               {13-21},
  year =                {2001},
  month =               aug,
}
[BF09] Patricia Bouyer and Vojtěch Forejt. Reachability in Stochastic Timed Games. In ICALP'09, Lecture Notes in Computer Science 5556, pages 103-114. Springer-Verlag, July 2009. 
@inproceedings{icalp2009-BF,
  author =              {Bouyer, Patricia and Forejt, Vojt{\v{e}}ch},
  title =               {Reachability in Stochastic Timed Games},
  editor =              {Albers, Susanne and Marchetti{-}Spaccamela Alberto
                         and Matias, Yossi and Nikoletseas, Sotiris and
                         Thomas, Wolfgang},
  booktitle =           {{P}roceedings of the 36th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'09)~-- Part~{II}},
  acronym =             {{ICALP}'09},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5556},
  pages =               {103-114},
  year =                {2009},
  month =               jul,
}
[BF18] Ezio Bartocci and Yliès Falcone. Lectures on Runtime Verification. Lecture Notes in Computer Science 10457. Springer-Verlag, 2018. 
@book{lectRV-BF18,
  title =               {Lectures on Runtime Verification},
  editor =              {Bartocci, Ezio and Falcone, Yli{\`e}s},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {10457},
  year =                {2018},
  doi =                 {10.1007/978-3-319-75632-5},
}
[BFA15] Umang Bhaskar, Lisa Fleischer, and Elliot Anshelevich. A Stackelberg strategy for routing flow over time. Games and Economic Behavior 92:232-247. July 2015. 
@article{geb92()-BFA,
  author =              {Bhaskar, Umang and Fleischer, Lisa and Anshelevich,
                         Elliot},
  title =               {A~{S}tackelberg strategy for routing flow over time},
  journal =             {Games and Economic Behavior},
  volume =              {92},
  pages =               {232-247},
  year =                {2015},
  month =               jul,
  doi =                 {10.1016/j.geb.2013.09.004},
}
[BFD02] Alexander Bolotov, Michael J. Fischer, and Clare Dixon. On the Relationship between ω-Automata and Temporal Logic Normal Forms. Journal of Logic and Computation 12(4):561-581. Oxford University Press, August 2002. 
@article{jlc12(4)-BFD,
  author =              {Bolotov, Alexander and Fischer, Michael J. and
                         Dixon, Clare},
  title =               {On the Relationship between {\(\omega\)}-Automata
                         and Temporal Logic Normal Forms},
  publisher =           {Oxford University Press},
  journal =             {Journal of Logic and Computation},
  volume =              {12},
  number =              {4},
  pages =               {561-581},
  year =                {2002},
  month =               aug,
}
[BFF+20] Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Sophie Pinchinat, Sasha Rubin, and Olivier Serre. Alternating Tree Automata with Qualitative Semantics. Technical Report 2002-03664, arXiv, February 2020. 
@techreport{arxiv2002.03664-BFFGMMPPRS,
  author =              {Berthon, Rapha{\"e}l and Fijalkow, Nathana{\"e}l and
                         Filiot, Emmanuel and Guha, Shibashis and Maubert,
                         Bastien and Murano, Aniello and Pinault, Laureline
                         and Pinchinat, Sophie and Rubin, Sasha and Serre,
                         Olivier},
  title =               {Alternating Tree Automata with Qualitative
                         Semantics},
  number =              {2002-03664},
  year =                {2020},
  month =               feb,
  institution =         {arXiv},
}
[BFF+21] Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Sophie Pinchinat, Sasha Rubin, and Olivier Serre. Alternating Tree Automata with Qualitative Semantics. ACM Transactions on Computational Logic 22(1):7:1-7:24. ACM Press, January 2021. 
@article{tocl22(1)-BFFGMMPPRS,
  author =              {Berthon, Rapha{\"e}l and Fijalkow, Nathana{\"e}l and
                         Filiot, Emmanuel and Guha, Shibashis and Maubert,
                         Bastien and Murano, Aniello and Pinault, Laureline
                         and Pinchinat, Sophie and Rubin, Sasha and Serre,
                         Olivier},
  title =               {Alternating Tree Automata with Qualitative
                         Semantics},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Computational Logic},
  volume =              {22},
  number =              {1},
  pages =               {7:1-7:24},
  year =                {2021},
  month =               jan,
  doi =                 {10.1145/3431860},
}
[BFF+11] Vittorio Bilò, Angelo Fanelli, Michele Flammini, and Luca Moscardelli. Graphical congestion games. Algorithmica 61(2):274-297. Springer-Verlag, October 2011. 
@article{alga61(2)-BFFM,
  author =              {Bil{\`o}, Vittorio and Fanelli, Angelo and Flammini,
                         Michele and Moscardelli, Luca},
  title =               {Graphical congestion games},
  publisher =           {Springer-Verlag},
  journal =             {Algorithmica},
  volume =              {61},
  number =              {2},
  pages =               {274-297},
  year =                {2011},
  month =               oct,
  doi =                 {10.1007/s00453-010-9417-x},
}
[BFH09] Felix Brandt, Felix Fischer, and Markus Holzer. Symmetries and the complexity of pure Nash equilibrium. Journal of Computer and System Sciences 75(3):163-177. Elsevier, May 2009. 
@article{jcss75(3)-BFH,
  author =              {Brandt, Felix and Fischer, Felix and Holzer, Markus},
  title =               {Symmetries and the complexity of pure {N}ash
                         equilibrium},
  publisher =           {Elsevier},
  journal =             {Journal of Computer and System Sciences},
  volume =              {75},
  number =              {3},
  pages =               {163-177},
  year =                {2009},
  month =               may,
}
[BFH+03] Albert Benveniste, Éric Fabre, Stefan Haar, and Claude Jard. Diagnosis of asynchronous discrete event systems: A net-unfolding approach. IEEE Transactions on Automatic Control 48(5):714-727. IEEE Comp. Soc. Press, 2003. 
@article{tac48(5)-BFHJ,
  author =              {Benveniste, Albert and Fabre, {\'E}ric and Haar,
                         Stefan and Jard, Claude},
  title =               {Diagnosis of asynchronous discrete event systems:
                         A~net-unfolding approach},
  publisher =           {IEEE Comp. Soc. Press},
  journal =             {IEEE Transactions on Automatic Control},
  volume =              {48},
  number =              {5},
  pages =               {714-727},
  year =                {2003},
  doi =                 {10.1109/TAC.2003.811249},
}
[BFH+01] Gerd Behrmann, Ansgar Fehnker, Thomas Hune, Kim Guldstrand Larsen, Paul Pettersson, and Judi Romijn. Efficient Guiding Towards Cost-Optimality in UPPAAL. In TACAS'01, Lecture Notes in Computer Science 2031, pages 174-188. Springer-Verlag, April 2001. 
@inproceedings{tacas2001-BFHLPR,
  author =              {Behrmann, Gerd and Fehnker, Ansgar and Hune, Thomas
                         and Larsen, Kim Guldstrand and Pettersson, Paul and
                         Romijn, Judi},
  title =               {Efficient Guiding Towards Cost-Optimality in UPPAAL},
  editor =              {Margaria, Tiziana and Yi, Wang},
  booktitle =           {{P}roceedings of the 7th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'01)},
  acronym =             {{TACAS}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2031},
  pages =               {174-188},
  year =                {2001},
  month =               apr,
}
[BFH+01] Gerd Behrmann, Ansgar Fehnker, Thomas Hune, Kim Guldstrand Larsen, Paul Pettersson, Judi Romijn, and Frits Vaandrager. Minimum-Cost Reachability for Priced Timed Automata. In HSCC'01, Lecture Notes in Computer Science 2034, pages 147-161. Springer-Verlag, March 2001. 
@inproceedings{hscc2001-BFHLPRV,
  author =              {Behrmann, Gerd and Fehnker, Ansgar and Hune, Thomas
                         and Larsen, Kim Guldstrand and Pettersson, Paul and
                         Romijn, Judi and Vaandrager, Frits},
  title =               {Minimum-Cost Reachability for Priced Timed Automata},
  editor =              {Di{~}Benedetto, Maria Domenica and
                         Sangiovani{-}Vincentelli, Alberto L.},
  booktitle =           {{P}roceedings of the 4th {I}nternational {W}orkshop
                         on {H}ybrid {S}ystems: {C}omputation and {C}ontrol
                         ({HSCC}'01)},
  acronym =             {{HSCC}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2034},
  pages =               {147-161},
  year =                {2001},
  month =               mar,
  doi =                 {10.1007/3-540-45351-2_15},
}
[BFL+10] Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, and Nicolas Markey. Timed Automata with Observers under Energy Constraints. In HSCC'10, pages 61-70. ACM Press, April 2010.
Abstract

In this paper, we study one-clock priced timed automata in which prices can grow linearly (dp/dt=k) or exponentially (dp/dt=kp), with discontinuous updates on edges. We propose EXPTIME algorithms to decide the existence of controllers that ensure existence of infinite runs or reachability of some goal location with non-negative observer value all along the run. These algorithms consist in computing the optimal delays that should be elapsed in each location along a run, so that the final observer value is maximized (and never goes below zero).

@inproceedings{hscc2010-BFLM,
  author =              {Bouyer, Patricia and Fahrenberg, Uli and Larsen, Kim
                         Guldstrand and Markey, Nicolas},
  title =               {Timed Automata with Observers under Energy
                         Constraints},
  editor =              {Johansson, Karl Henrik and Yi, Wang},
  booktitle =           {{P}roceedings of the 13th {I}nternational {W}orkshop
                         on {H}ybrid {S}ystems: {C}omputation and {C}ontrol
                         ({HSCC}'10)},
  acronym =             {{HSCC}'10},
  publisher =           {ACM Press},
  pages =               {61-70},
  year =                {2010},
  month =               apr,
  doi =                 {10.1145/1755952.1755963},
  abstract =            {In this paper, we study one-clock priced timed
                         automata in which prices can grow linearly
                         (\(\frac{dp}{dt}=k\)) or exponentially
                         (\(\frac{dp}{dt}=kp\)), with discontinuous updates
                         on edges. We propose EXPTIME algorithms to decide
                         the existence of controllers that ensure existence
                         of infinite runs or reachability of some goal
                         location with non-negative observer value all along
                         the run. These algorithms consist in computing the
                         optimal delays that should be elapsed in each
                         location along a run, so that the final observer
                         value is maximized (and never goes below zero).},
}
[BFL+11] Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, and Nicolas Markey. Quantitative analysis of real-time systems using priced timed automata. Communications of the ACM 54(9):78-87. ACM Press, September 2011.
Abstract

The problems of time-dependent behavior in general, and dynamic resource allocation in particular, pervade many aspects of modern life. Prominent examples range from reliability and efficient use of communication resources in a telecommunication network to the allocation of tracks in a continental railway network, from scheduling the usage of computational resources on a chip for durations of nano-seconds to the weekly, monthly, or longer-range reactive planning in a factory or a supply chain.

@article{cacm54(9)-BFLM,
  author =              {Bouyer, Patricia and Fahrenberg, Uli and Larsen, Kim
                         Guldstrand and Markey, Nicolas},
  title =               {Quantitative analysis of real-time systems using
                         priced timed automata},
  publisher =           {ACM Press},
  journal =             {Communications of the ACM},
  volume =              {54},
  number =              {9},
  pages =               {78-87},
  year =                {2011},
  month =               sep,
  doi =                 {10.1145/1995376.1995396},
  abstract =            {The problems of time-dependent behavior in general,
                         and dynamic resource allocation in particular,
                         pervade many aspects of modern life. Prominent
                         examples range from reliability and efficient use of
                         communication resources in a telecommunication
                         network to the allocation of tracks in a continental
                         railway network, from scheduling the usage of
                         computational resources on a chip for durations of
                         nano-seconds to the weekly, monthly, or longer-range
                         reactive planning in a factory or a supply chain.},
}
[BFL+18] Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, Joël Ouaknine, and James Worrell. Model Checking Real-Time Systems. In Edmund M. Clarke, Thomas A. Henzinger, Helmut Veith, and Roderick Bloem (eds.), Handbook of Model Checking. Springer-Verlag, May 2018.
Abstract

This chapter surveys timed automata as a formalism for model checking real-time systems. We begin with introducing the model, as an extension of finite-state automata with real-valued variables for measuring time. We then present the main model-checking results in this framework, and give a hint about some recent extensions (namely weighted timed automata and timed games).

@incollection{hmc2018-BFLMOW,
  author =              {Bouyer, Patricia and Fahrenberg, Uli and Larsen, Kim
                         Guldstrand and Markey, Nicolas and Ouaknine,
                         Jo{\"e}l and Worrell, James},
  title =               {Model Checking Real-Time Systems},
  editor =              {Clarke, Edmund M. and Henzinger, Thomas A. and
                         Veith, Helmut and Bloem, Roderick},
  booktitle =           {Handbook of Model Checking},
  publisher =           {Springer-Verlag},
  pages =               {1001-1046},
  chapter =             {29},
  year =                {2018},
  month =               may,
  doi =                 {10.1007/978-3-319-10575-8_29},
  abstract =            {This chapter surveys timed automata as a formalism
                         for model checking real-time systems. We begin with
                         introducing the model, as an extension of
                         finite-state automata with real-valued variables for
                         measuring time. We then present the main
                         model-checking results in this framework, and give a
                         hint about some recent extensions (namely weighted
                         timed automata and timed games).},
}
[BFL+08] Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, and Jiří Srba. Infinite Runs in Weighted Timed Automata with Energy Constraints. In FORMATS'08, Lecture Notes in Computer Science 5215, pages 33-47. Springer-Verlag, September 2008.
Abstract

We study the problems of existence and construction of infinite schedules for finite weighted automata and one-clock weighted timed automata, subject to boundary constraints on the accumulated weight. More specifically, we consider automata equipped with positive and negative weights on transitions and locations, corresponding to the production and consumption of some resource (e.g. energy). We ask the question whether there exists an infinite path for which the accumulated weight for any finite prefix satisfies certain constraints (e.g. remains between 0 and some given upper-bound). We also consider a game version of the above, where certain transitions may be uncontrollable.

@inproceedings{formats2008-BFLMS,
  author =              {Bouyer, Patricia and Fahrenberg, Uli and Larsen, Kim
                         Guldstrand and Markey, Nicolas and Srba, Ji{\v
                         r}{\'\i}},
  title =               {Infinite Runs in Weighted Timed Automata with Energy
                         Constraints},
  editor =              {Cassez, Franck and Jard, Claude},
  booktitle =           {{P}roceedings of the 6th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'08)},
  acronym =             {{FORMATS}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5215},
  pages =               {33-47},
  year =                {2008},
  month =               sep,
  doi =                 {10.1007/978-3-540-85778-5_4},
  abstract =            {We~study the problems of existence and construction
                         of infinite schedules for finite weighted automata
                         and one-clock weighted timed automata, subject to
                         boundary constraints on the accumulated weight. More
                         specifically, we~consider automata equipped with
                         positive and negative weights on transitions and
                         locations, corresponding to the production and
                         consumption of some resource (\emph{e.g.}~energy).
                         We~ask the question whether there exists an infinite
                         path for which the accumulated weight for any finite
                         prefix satisfies certain constraints
                         (\emph{e.g.}~remains between~\(0\) and some given
                         upper-bound). We~also consider a game version of the
                         above, where certain transitions may be
                         uncontrollable.},
}
[BFM15] Patricia Bouyer, Erwin Fang, and Nicolas Markey. Permissive strategies in timed automata and games. In AVOCS'15, Electronic Communications of the EASST 72. European Association of Software Science and Technology, September 2015.
Abstract

Timed automata are a convenient framework for modelling and reasoning about real-time systems. While these models are now very well-understood, they do not offer a convenient way of taking timing imprecisions into account. Several solutions (e.g. parametric guard enlargement) have recently been proposed over the last ten years to take such imprecisions into account. In this paper, we propose a new approach for handling robust reachability, based on permissive strategies. While classical strategies propose to play an action at an exact point in time, permissive strategies return an interval of possible dates when to play the selected action. With such a permissive strategy, we associate a penalty, which is the inverse of the length of the proposed interval, and accumulates along the run. We show that in that setting, optimal strategies can be computed in polynomial time for one-clock timed automata.

@inproceedings{avocs2015-BFM,
  author =              {Bouyer, Patricia and Fang, Erwin and Markey,
                         Nicolas},
  title =               {Permissive strategies in timed automata and games},
  editor =              {Grov, Gudmund and Ireland, Andrew},
  booktitle =           {{P}roceedings of the 15th {I}nternational {W}orkshop
                         on {A}utomated {V}erification of {C}ritical
                         {S}ystems ({AVOCS}'15)},
  acronym =             {{AVOCS}'15},
  publisher =           {European Association of Software Science and
                         Technology},
  series =              {Electronic Communications of the EASST},
  volume =              {72},
  year =                {2015},
  month =               sep,
  doi =                 {10.14279/tuj.eceasst.72.1015},
  abstract =            {Timed automata are a convenient framework for
                         modelling and reasoning about real-time systems.
                         While these models are now very well-understood,
                         they do not offer a convenient way of taking timing
                         imprecisions into account. Several solutions (e.g.
                         parametric guard enlargement) have recently been
                         proposed over the last ten years to take such
                         imprecisions into account. In this paper, we propose
                         a new approach for handling robust reachability,
                         based on permissive strategies. While classical
                         strategies propose to play an action at an exact
                         point in time, permissive strategies return an
                         interval of possible dates when to play the selected
                         action. With such a permissive strategy, we
                         associate a penalty, which is the inverse of the
                         length of the proposed interval, and accumulates
                         along the run. We show that in that setting, optimal
                         strategies can be computed in polynomial time for
                         one-clock timed automata.},
}
[BFM23] Nathalie Bertrand, Hugo Francon, and Nicolas Markey. Synchronizing words under LTL constraints. Information Processing Letters 182. Elsevier, August 2023.
Abstract

Synchronizing a (deterministic, finite-state) automaton is the problem of finding a sequence of actions to be played in the automaton in order to end up in the same state independently of the starting state. We consider synchronization with LTL constraints on the executions leading to synchronization, extending the results of [Petra Wolf. Synchronization under dynamic constraints. FSTTCS'20] by showing that the problem is PSPACE-complete for LTL as well as for restricted fragments (involving only modality F or G), while it is NP-complete for constraints expressed using only modality X.

@article{ipl182()-BFM,
  author =              {Bertrand, Nathalie and Francon, Hugo and Markey,
                         Nicolas},
  title =               {Synchronizing words under {LTL} constraints},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {182},
  year =                {2023},
  month =               aug,
  doi =                 {10.1016/j.ipl.2023.106392},
  abstract =            {Synchronizing a (deterministic, finite-state)
                         automaton is the problem of finding a sequence of
                         actions to be played in the automaton in order to
                         end up in the same state independently of the
                         starting state. We~consider synchronization
                         with~\textsf{LTL} constraints on the executions
                         leading to synchronization, extending the results
                         of~[Petra~Wolf. Synchronization under dynamic
                         constraints. FSTTCS'20] by~showing that the problem
                         is \textsf{PSPACE}-complete for~\textsf{LTL} as well
                         as for restricted fragments (involving only
                         modality~\textsf{F} or~\textsf{G}), while it is
                         \textsf{NP}-complete for constraints expressed using
                         only modality~\textsf{X}.},
}
[BFP+73] Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, and Robert Endre Tarjan. Time Bounds for Selection. Journal of Computer and System Sciences 7(4):448-461. Academic Press, August 1973. 
@article{jcss7(4)-BFPRT,
  author =              {Blum, Manuel and Floyd, Robert W. and Pratt, Vaughan
                         R. and Rivest, Ronald L. and Tarjan, Robert Endre},
  title =               {Time Bounds for Selection},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {7},
  number =              {4},
  pages =               {448-461},
  year =                {1973},
  month =               aug,
}
[BFS14] Nathalie Bertrand, Paulin Fournier, and Arnaud Sangnier. Playing with Probabilities in Reconfigurable Broadcast Networks. In FoSSaCS'14, Lecture Notes in Computer Science 8412, pages 134-148. Springer-Verlag, April 2014. 
@inproceedings{fossacs2014-BFS,
  author =              {Bertrand, Nathalie and Fournier, Paulin and
                         Sangnier, Arnaud},
  title =               {Playing with Probabilities in Reconfigurable
                         Broadcast Networks},
  editor =              {Muscholl, Anca},
  booktitle =           {{P}roceedings of the 17th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'14)},
  acronym =             {{FoSSaCS}'14},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8412},
  pages =               {134-148},
  year =                {2014},
  month =               apr,
  doi =                 {10.1007/978-3-642-54830-7_9},
}
[BFS15] Nathalie Bertrand, Paulin Fournier, and Arnaud Sangnier. Distributed Local Strategies in Broadcast Networks. In CONCUR'15, Leibniz International Proceedings in Informatics 42, pages 44-57. Leibniz-Zentrum für Informatik, September 2015. 
@inproceedings{concur2015-BFS,
  author =              {Bertrand, Nathalie and Fournier, Paulin and
                         Sangnier, Arnaud},
  title =               {Distributed Local Strategies in Broadcast Networks},
  editor =              {Aceto, Luca and de Frutos{-}Escrig, David},
  booktitle =           {{P}roceedings of the 26th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'15)},
  acronym =             {{CONCUR}'15},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {42},
  pages =               {44-57},
  year =                {2015},
  month =               sep,
  doi =                 {10.4230/LIPIcs.CONCUR.2015.44},
}
[BG85] John P. Burgess and Yuri Gurevich. The Decision Problem for Linear Temporal Logic. Notre Dame Journal of Formal Logic 26(2):115-128. April 1985. 
@article{ndjfl26(2)-BG,
  author =              {Burgess,John P. and Gurevich, Yuri},
  title =               {The Decision Problem for Linear Temporal Logic},
  journal =             {Notre Dame Journal of Formal Logic},
  volume =              {26},
  number =              {2},
  pages =               {115-128},
  year =                {1985},
  month =               apr,
}
[BG93] Orna Bernholtz and Orna Grumberg. Branching Time Temporal Logic and A m o r p H O u s Tree Automata. In CONCUR'93, Lecture Notes in Computer Science 715, pages 262-277. Springer-Verlag, August 1993. 
@inproceedings{concur1993-BG,
  author =              {Bernholtz, Orna and Grumberg, Orna},
  title =               {Branching Time Temporal Logic and {{\(\mathcal{A}
                         \textup{m} \textbf{o} r \textsc{p} \mathcal{H}
                         \texttt{O} u \textbf{s}\)}} Tree Automata},
  editor =              {Best, Eike},
  booktitle =           {{P}roceedings of the 4th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'93)},
  acronym =             {{CONCUR}'93},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {715},
  pages =               {262-277},
  year =                {1993},
  month =               aug,
}
[BG99] Glenn Bruns and Patrice Godefroid. Model Checking Partial State Spaces with 3-Valued Temporal Logics. In CAV'99, Lecture Notes in Computer Science 1633, pages 274-287. Springer-Verlag, July 1999. 
@inproceedings{cav1999-BG,
  author =              {Bruns, Glenn and Godefroid, Patrice},
  title =               {Model Checking Partial State Spaces with
                         {\(3\)}-Valued Temporal Logics},
  editor =              {Halbwachs, Nicolas and Peled, Doron A.},
  booktitle =           {{P}roceedings of the 11th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'99)},
  acronym =             {{CAV}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1633},
  pages =               {274-287},
  year =                {1999},
  month =               jul,
}
[BG01] Glenn Bruns and Patrice Godefroid. Temporal Logic Query Checking (Extended Abstract). In LICS'01, pages 409-417. IEEE Comp. Soc. Press, June 2001. 
@inproceedings{lics2001-BG,
  author =              {Bruns, Glenn and Godefroid, Patrice},
  title =               {Temporal Logic Query Checking (Extended Abstract)},
  booktitle =           {{P}roceedings of the 16th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'01)},
  acronym =             {{LICS}'01},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {409-417},
  year =                {2001},
  month =               jun,
}
[BG02] Robert Baumgartner and Georg Gottlob. Propositional Default Logics made Easier: Computational Complexity of Model Checking. Theoretical Computer Science 289(1):591-627. Elsevier, October 2002. 
@article{tcs289(1)-BG,
  author =              {Baumgartner, Robert and Gottlob, Georg},
  title =               {Propositional Default Logics made Easier:
                         Computational Complexity of Model Checking},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {289},
  number =              {1},
  pages =               {591-627},
  year =                {2002},
  month =               oct,
}
[BG03] Régis Barbanchon and Étienne Grandjean. The Minimal Logically-Defined NP-Complete Problem. In STACS'04, Lecture Notes in Computer Science 2996, pages 338-349. Springer-Verlag, March 2003. 
@inproceedings{stacs2004-BG,
  author =              {Barbanchon, R{\'e}gis and Grandjean, {\'E}tienne},
  title =               {The Minimal Logically-Defined {NP}-Complete Problem},
  editor =              {Diekert, Volker and Habib, Michel},
  booktitle =           {{P}roceedings of the 21st {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'04)},
  acronym =             {{STACS}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2996},
  pages =               {338-349},
  year =                {2003},
  month =               mar,
}
[BG04] Dietmar Berwanger and Erich Grädel. Fixed-Point Logics and Solitaire Games. Theory of Computing Systems 37(6):675-694. Springer-Verlag, December 2004. 
@article{TCSyst37(6)-BG,
  author =              {Berwanger, Dietmar and Gr{\"a}del, Erich},
  title =               {Fixed-Point Logics and Solitaire Games},
  publisher =           {Springer-Verlag},
  journal =             {Theory of Computing Systems},
  volume =              {37},
  number =              {6},
  pages =               {675-694},
  year =                {2004},
  month =               dec,
  doi =                 {10.1007/s00224-004-1147-5},
}
[BG05] Dietmar Berwanger and Erich Grädel. Entanglement – A Measure for the Complexity of Directed Graphs with Applications to Logic and Games. In LPAR'04, Lecture Notes in Computer Science 3452, pages 209-223. Springer-Verlag, March 2005. 
@inproceedings{lpar2004-BG,
  author =              {Berwanger, Dietmar and Gr{\"a}del, Erich},
  title =               {Entanglement~-- {A}~Measure for the Complexity of
                         Directed Graphs with Applications to Logic and
                         Games},
  editor =              {Baader, Franz and Voronkov, Andrei},
  booktitle =           {{P}roceedings of the 11th {I}nternational
                         {C}onference {L}ogic {P}rogramming and {A}utomated
                         {R}easoning ({LPAR}'04)},
  acronym =             {{LPAR}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3452},
  pages =               {209-223},
  year =                {2005},
  month =               mar,
}
[BG11] Nathalie Bertrand and Blaise Genest. Minimal Disclosure in Partially Observable Markov Decision Processes. In FSTTCS'11, Leibniz International Proceedings in Informatics 13, pages 411-422. Leibniz-Zentrum für Informatik, December 2011. 
@inproceedings{fsttcs2011-BG,
  author =              {Bertrand, Nathalie and Genest, Blaise},
  title =               {Minimal Disclosure in {P}artially {O}bservable
                         {M}arkov {D}ecision {P}rocesses},
  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},
  pages =               {411-422},
  year =                {2011},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2011.411},
}
[BG13] Nils Bulling and Valentin Goranko. How to Be Both Rich and Happy: Combining Quantitative and Qualitative Strategic Reasoning about Multi-Player Games (Extended Abstract). In SR'13, Electronic Proceedings in Theoretical Computer Science 112, pages 33-41. March 2013. 
@inproceedings{sr2013-BG,
  author =              {Bulling, Nils and Goranko, Valentin},
  title =               {How to Be Both Rich and Happy: Combining
                         Quantitative and Qualitative Strategic Reasoning
                         about Multi-Player Games (Extended Abstract)},
  booktitle =           {{P}roceedings of the 1st {I}nternational {W}orkshop
                         on {S}trategic {R}easoning ({SR}'13)},
  acronym =             {{SR}'13},
  series =              {Electronic Proceedings in Theoretical Computer
                         Science},
  volume =              {112},
  pages =               {33-41},
  year =                {2013},
  month =               mar,
  doi =                 {10.4204/EPTCS.112.8},
}
[BGG17] Nathalie Bertrand, Blaise Genest, and Hugo Gimbert. Qualitative Determinacy and Decidability of Stochastic Games with Signals. Journal of the ACM 64(5):33:1-33:48. ACM Press, October 2017. 
@article{jacm64(5)-BGG,
  author =              {Bertrand, Nathalie and Genest, Blaise and Gimbert,
                         Hugo},
  title =               {Qualitative Determinacy and Decidability of
                         Stochastic Games with Signals},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {64},
  number =              {5},
  pages =               {33:1-33:48},
  year =                {2017},
  month =               oct,
  doi =                 {10.1145/3107926},
}
[BGH13] Olivier Bournez, Daniel S. Graça, and Emmanuel Hainry. Computation with perturbed dynamical systems. Journal of Computer and System Sciences 79(5):714-724. Elsevier, August 2013. 
@article{jcss79(5)-BGH,
  author =              {Bournez, Olivier and Gra{\c c}a, Daniel S. and
                         Hainry, Emmanuel},
  title =               {Computation with perturbed dynamical systems},
  publisher =           {Elsevier},
  journal =             {Journal of Computer and System Sciences},
  volume =              {79},
  number =              {5},
  pages =               {714-724},
  year =                {2013},
  month =               aug,
}
[BGH+09] Roderick Bloem, Karin Greimel, Thomas A. Henzinger, and Barbara Jobstmann. Synthesizing robust systems. In FMCAD'09, pages 85-92. IEEE Comp. Soc. Press, November 2009. 
@inproceedings{fmcad2009-BGHJ,
  author =              {Bloem, Roderick and Greimel, Karin and Henzinger,
                         Thomas A. and Jobstmann, Barbara},
  title =               {Synthesizing robust systems},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference on {F}ormal {M}ethods in
                         {C}omputer-{A}ided {D}esign ({FMCAD}'09)},
  acronym =             {{FMCAD}'09},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {85-92},
  year =                {2009},
  month =               nov,
}
[BGH+15] Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, and Benjamin Monmege. Simple priced timed games are not that simple. In FSTTCS'15, Leibniz International Proceedings in Informatics 45, pages 278-292. Leibniz-Zentrum für Informatik, December 2015. 
@inproceedings{fsttcs2005-BGHLM,
  author =              {Brihaye, {\relax Th}omas and Geeraerts, Gilles and
                         Haddad, Axel and Lefaucheux, Engel and Monmege,
                         Benjamin},
  title =               {Simple priced timed games are not that simple},
  editor =              {Harsha, Prahladh and Ramalingam, G.},
  booktitle =           {{P}roceedings of the 35th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'15)},
  acronym =             {{FSTTCS}'15},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {45},
  pages =               {278-292},
  year =                {2015},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2015.278},
}
[BGH+17] Thomas Brihaye, Gilles Geeraerts, Axel Haddad, and Benjamin Monmege. Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability game. Acta Informatica 54(1):85-125. Springer-Verlag, February 2017. 
@article{acta54(1)-BGHM,
  author =              {Brihaye, {\relax Th}omas and Geeraerts, Gilles and
                         Haddad, Axel and Monmege, Benjamin},
  title =               {Pseudopolynomial iterative algorithm to solve
                         total-payoff games and min-cost reachability game},
  publisher =           {Springer-Verlag},
  journal =             {Acta Informatica},
  volume =              {54},
  number =              {1},
  pages =               {85-125},
  year =                {2017},
  month =               feb,
  doi =                 {10.1007/s00236-016-0276-z},
}
[BGI+01] Boaz Barak, Oded Goldreich, Rusell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, and Ke Yang. On the (Im)possibility of Obfuscating Programs. In CRYPTO'01, Lecture Notes in Computer Science 2139, pages 1-18. Springer-Verlag, August 2001. 
@inproceedings{crypto2001-BGIRSVY,
  author =              {Barak, Boaz and Goldreich, Oded and Impagliazzo,
                         Rusell and Rudich, Steven and Sahai, Amit and
                         Vadhan, Salil and Yang, Ke},
  title =               {On the (Im)possibility of Obfuscating Programs},
  editor =              {Kilian, Joe},
  booktitle =           {{P}roceedings of the 21st {A}nnual {I}nternational
                         {C}ryptology {C}onference ({CRYPTO}'01)},
  acronym =             {{CRYPTO}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2139},
  pages =               {1-18},
  year =                {2001},
  month =               aug,
}
[BGI+01] Boaz Barak, Oded Goldreich, Rusell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, and Ke Yang. On the (Im)possibility of Obfuscating Programs. Research Report 01-057, Electronic Colloquium on Computational Complexity, August 2001. 
@techreport{eccc2001-BGIRSVY,
  author =              {Barak, Boaz and Goldreich, Oded and Impagliazzo,
                         Rusell and Rudich, Steven and Sahai, Amit and
                         Vadhan, Salil and Yang, Ke},
  title =               {On the (Im)possibility of Obfuscating Programs},
  number =              {01-057},
  year =                {2001},
  month =               aug,
  institution =         {Electronic Colloquium on Computational Complexity},
  type =                {Research Report},
}
[BGK+96] Johan Bengtsson, W. O. David Griffioen, Kåre J. Kristoffersen, Kim Guldstrand Larsen, Fredrik Larsson, Paul Pettersson, and Wang Yi. Verification of an Audio Protocol with Bus Collision Using Uppaal. In CAV'96, Lecture Notes in Computer Science 1102, pages 244-256. Springer-Verlag, July 1996. 
@inproceedings{cav1996-BGKLLPY,
  author =              {Bengtsson, Johan and Griffioen, W. O. David and
                         Kristoffersen, K{\aa}re J. and Larsen, Kim
                         Guldstrand and Larsson, Fredrik and Pettersson, Paul
                         and Yi, Wang},
  title =               {Verification of an Audio Protocol with Bus Collision
                         Using {\scshape {U}ppaal}},
  editor =              {Alur, Rajeev and Henzinger, Thomas A.},
  booktitle =           {{P}roceedings of the 8th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'96)},
  acronym =             {{CAV}'96},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1102},
  pages =               {244-256},
  year =                {1996},
  month =               jul,
}
[BGM14] Patricia Bouyer, Patrick Gardy, and Nicolas Markey. Quantitative verification of weighted Kripke structures. In ATVA'14, Lecture Notes in Computer Science 8837, pages 64-80. Springer-Verlag, November 2014.
Abstract

Extending formal verification techniques to handle quantitative aspects, both for the models and for the properties to be checked, has become a central research topic over the last twenty years. Following several recent works, we study model checking for (one-dimensional) weighted Kripke structures with positive and negative weights, and temporal logics constraining the total and/or average weight. We prove decidability when only accumulated weight is constrained, while allowing average-weight constraints alone already is undecidable.

@inproceedings{atva2014-BGM,
  author =              {Bouyer, Patricia and Gardy, Patrick and Markey,
                         Nicolas},
  title =               {Quantitative verification of weighted {K}ripke
                         structures},
  editor =              {Cassez, Franck and Raskin, Jean-Fran{\c c}ois},
  booktitle =           {{P}roceedings of the 12th {I}nternational
                         {S}ymposium on {A}utomated {T}echnology for
                         {V}erification and {A}nalysis ({ATVA}'14)},
  acronym =             {{ATVA}'14},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8837},
  pages =               {64-80},
  year =                {2014},
  month =               nov,
  doi =                 {10.1007/978-3-319-11936-6_6},
  abstract =            {Extending formal verification techniques to handle
                         quantitative aspects, both for the models and for
                         the properties to be checked, has become a central
                         research topic over the last twenty years. Following
                         several recent works, we study model checking for
                         (one-dimensional) weighted Kripke structures with
                         positive and negative weights, and temporal logics
                         constraining the total and/or average weight. We
                         prove decidability when only accumulated weight is
                         constrained, while allowing average-weight
                         constraints alone already is undecidable.},
}
[BGM15] Patricia Bouyer, Patrick Gardy, and Nicolas Markey. Weighted strategy logic with boolean goals over one-counter games. In FSTTCS'15, Leibniz International Proceedings in Informatics 45, pages 69-83. Leibniz-Zentrum für Informatik, December 2015.
Abstract

Strategy Logic is a powerful specification language for expressing non-zero-sum properties of multi-player games. SL conveniently extends the logic ATL with explicit quantification and assignment of strategies. In this paper, we consider games over one-counter automata, and a quantitative extension 1cSL of SL with assertions over the value of the counter. We prove two results: we first show that, if decidable, model checking the so-called Boolean-goal fragment of 1cSL has non-elementary complexity; we actually prove the result for the Boolean-goal fragment of SL over finite-state games, which was an open question in (Mogavero et al. Reasoning about strategies: On the model-checking problem. 2014). As a first step towards proving decidability, we then show that the Boolean-goal fragment of 1cSL over one-counter games enjoys a nice periodicity property.

@inproceedings{fsttcs2015-BGM,
  author =              {Bouyer, Patricia and Gardy, Patrick and Markey,
                         Nicolas},
  title =               {Weighted strategy logic with boolean goals over
                         one-counter games},
  editor =              {Harsha, Prahladh and Ramalingam, G.},
  booktitle =           {{P}roceedings of the 35th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'15)},
  acronym =             {{FSTTCS}'15},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {45},
  pages =               {69-83},
  year =                {2015},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2015.69},
  abstract =            {Strategy Logic is a powerful specification language
                         for expressing non-zero-sum properties of
                         multi-player games. SL conveniently extends the
                         logic ATL with explicit quantification and
                         assignment of strategies. In this paper, we consider
                         games over one-counter automata, and a quantitative
                         extension 1cSL of SL with assertions over the value
                         of the counter. We prove two results: we first show
                         that, if decidable, model checking the so-called
                         Boolean-goal fragment of 1cSL has non-elementary
                         complexity; we actually prove the result for the
                         Boolean-goal fragment of SL over finite-state games,
                         which was an open question in (Mogavero
                         \emph{et~al.} Reasoning about strategies: On the
                         model-checking problem. 2014). As a first step
                         towards proving decidability, we then show that the
                         Boolean-goal fragment of 1cSL over one-counter games
                         enjoys a nice periodicity property.},
}
[BGM16] Patricia Bouyer, Patrick Gardy, and Nicolas Markey. On the semantics of Strategy Logic. Information Processing Letters 116(2):75-79. Elsevier, February 2016.
Abstract

We define and study a slight variation on the semantics of Strategy Logic: while in the classical semantics, all strategies are shifted during the evaluation of temporal modalities, we propose to only shift the strategies that have been assigned to a player, thus matching the intuition that we can assign the very same strategy to the players at different points in time. We prove that surprisingly, this renders the model-checking problem undecidable.

@article{ipl116(2)-BGM,
  author =              {Bouyer, Patricia and Gardy, Patrick and Markey,
                         Nicolas},
  title =               {On the semantics of Strategy Logic},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {116},
  number =              {2},
  pages =               {75-79},
  year =                {2016},
  month =               feb,
  doi =                 {10.1016/j.ipl.2015.10.004},
  abstract =            {We define and study a slight variation on the
                         semantics of Strategy Logic: while in the classical
                         semantics, all strategies are shifted during the
                         evaluation of temporal modalities, we propose to
                         only shift the strategies that have been assigned to
                         a player, thus matching the intuition that we can
                         assign the very same strategy to the players at
                         different points in time. We prove that
                         surprisingly, this renders the model-checking
                         problem undecidable.},
}
[BGM+08] Thomas Brihaye, Mohamed Ghannem, Nicolas Markey, and Lionel Rieg. Good friends are hard to find!. In TIME'08, pages 32-40. IEEE Comp. Soc. Press, June 2008.
Abstract

We focus on the problem of finding (the size of) a minimal winning coalition in a multi-player game. More precisely, we prove that deciding whether there is a winning coalition of size at most k is NP-complete, while deciding whether k is the optimal size is DP-complete. We also study different variants of our original problem: the function problem, where the aim is to effectively compute the coalition; more succinct encoding of the game; and richer families of winning objectives.

@inproceedings{time2008-BGMR,
  author =              {Brihaye, {\relax Th}omas and Ghannem, Mohamed and
                         Markey, Nicolas and Rieg, Lionel},
  title =               {Good friends are hard to find!},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {S}ymposium on {T}emporal {R}epresentation and
                         {R}easoning ({TIME}'08)},
  acronym =             {{TIME}'08},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {32-40},
  year =                {2008},
  month =               jun,
  doi =                 {10.1109/TIME.2008.10},
  abstract =            {We focus on the problem of finding (the~size of)
                         a~minimal winning coalition in a multi-player game.
                         More precisely, we~prove that deciding whether there
                         is a winning coalition of size at most~\(k\) is
                         NP-complete, while deciding whether \(k\) is the
                         optimal size is DP-complete. We~also study different
                         variants of our original problem: the function
                         problem, where the aim is to effectively compute the
                         coalition; more succinct encoding of the game; and
                         richer families of winning objectives.},
}
[BGM+18] Damien Busatto-Gaston, Benjamin Monmege, and Pierre-Alain Reynier. Symbolic Approximation of Weighted Timed Games. In FSTTCS'18, Leibniz International Proceedings in Informatics 122, pages 28:1-28:16. Leibniz-Zentrum für Informatik, December 2018. 
@inproceedings{fsttcs2018-BMR,
  author =              {Busatto-Gaston, Damien and Monmege, Benjamin and
                         Reynier, Pierre-Alain},
  title =               {Symbolic Approximation of Weighted Timed Games},
  editor =              {Ganguli, Sumit and Pandya, Paritosh K.},
  booktitle =           {{P}roceedings of the 38th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'18)},
  acronym =             {{FSTTCS}'18},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {122},
  pages =               {28:1-28:16},
  year =                {2018},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2018.28},
}
[BGM+18] Patricia Bouyer, Mauricio González, Nicolas Markey, and Mickael Randour. Multi-weighted Markov Decision Processes with Reachability Objectives. In GandALF'18, Electronic Proceedings in Theoretical Computer Science 277, pages 250-264. September 2018.
Abstract

In this paper, we are interested in the synthesis of schedulers in double-weighted Markov decision processes, which satisfy both a percentile constraint over a weighted reachability condition, and a quantitative constraint on the expected value of a random variable defined using a weighted reachability condition. This problem is inspired by the modelization of an electric-vehicle charging problem. We study the cartography of the problem, when one parameter varies, and show how a partial cartography can be obtained via two sequences of opimization problems. We discuss completeness and feasability of the method.

@inproceedings{gandalf2018-BGMR,
  author =              {Bouyer, Patricia and Gonz{\'a}lez, Mauricio and
                         Markey, Nicolas and Randour, Mickael},
  title =               {Multi-weighted Markov Decision Processes with
                         Reachability Objectives},
  editor =              {Orlandini, Andrea and Zimmermann, Martin},
  booktitle =           {{P}roceedings of the 9th {I}nternational {S}ymposium
                         on {G}ames, {A}utomata, {L}ogics and {F}ormal
                         {V}erification ({GandALF}'18)},
  acronym =             {{GandALF}'18},
  series =              {Electronic Proceedings in Theoretical Computer
                         Science},
  volume =              {277},
  pages =               {250-264},
  year =                {2018},
  month =               sep,
  doi =                 {10.4204/EPTCS.277.18},
  abstract =            {In~this paper, we~are interested in the synthesis of
                         schedulers in double-weighted Markov decision
                         processes, which satisfy both a percentile
                         constraint over a weighted reachability condition,
                         and a quantitative constraint on the expected value
                         of a random variable defined using a weighted
                         reachability condition. This~problem is inspired by
                         the modelization of an electric-vehicle charging
                         problem. We study the cartography of the problem,
                         when one parameter varies, and show how a partial
                         cartography can be obtained via two sequences of
                         opimization problems. We~discuss completeness and
                         feasability of the method.},
}
[BGM+19] Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier, and Ocan Sankur. Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach. In CAV'19, Lecture Notes in Computer Science 11561, pages 572-590. Springer-Verlag, July 2019. 
@inproceedings{cav2019-BMRS,
  author =              {Busatto-Gaston, Damien and Monmege, Benjamin and
                         Reynier, Pierre-Alain and Sankur, Ocan},
  title =               {Robust Controller Synthesis in Timed B{\"u}chi
                         Automata: A~Symbolic Approach},
  editor =              {Dillig, I{\c s}il and Ta{\c s}iran, Serdar},
  booktitle =           {{P}roceedings of the 31st {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'19)},
  acronym =             {{CAV}'19},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {11561},
  pages =               {572-590},
  year =                {2019},
  month =               jul,
  doi =                 {10.1007/978-3-030-25540-4_33},
}
[BGN+14] Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, and Ashutosh Trivedi. Adding negative prices to priced timed games. In CONCUR'14, Lecture Notes in Computer Science 8704, pages 560-575. Springer-Verlag, September 2014. 
@inproceedings{concur2014-BGKMMT,
  author =              {Brihaye, {\relax Th}omas and Geeraerts, Gilles and
                         Narayanan Krishna, Shankara and Manasa, Lakshmi and
                         Monmege, Benjamin and Trivedi, Ashutosh},
  title =               {Adding negative prices to priced timed games},
  editor =              {Baldan, Paolo and Gorla, Daniele},
  booktitle =           {{P}roceedings of the 25th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'14)},
  acronym =             {{CONCUR}'14},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8704},
  pages =               {560-575},
  year =                {2014},
  month =               sep,
  doi =                 {10.1007/978-3-662-44584-6_38},
}
[BGP96] Béatrice Bérard, Paul Gastin, and Antoine Petit. Timed Automata with non Observable Actions: Expressive power and refinement. In STACS'96, Lecture Notes in Computer Science 1046, pages 257-268. Springer-Verlag, February 1996. 
@inproceedings{stacs1996-BGP,
  author =              {B{\'e}rard, B{\'e}atrice and Gastin, Paul and Petit,
                         Antoine},
  title =               {Timed Automata with non Observable Actions:
                         Expressive power and refinement},
  editor =              {Puech, Claude and Reischuk, R{\"u}diger},
  booktitle =           {{P}roceedings of the 13th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'96)},
  acronym =             {{STACS}'96},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1046},
  pages =               {257-268},
  year =                {1996},
  month =               feb,
}
[BGS92] José Balcázar, Joaquim Gabarró, and Miklós Sántha. Deciding bisimilarity is P-complete. Formal Aspects of Computing 4(1 supplement):638-648. Springer-Verlag, November 1992. 
@article{fac4(1sup)-BGS,
  author =              {Balc{\'a}zar, Jos{\'e} and Gabarr{\'o}, Joaquim and
                         S{\'a}ntha, Mikl{\'o}s},
  title =               {Deciding bisimilarity is {P}-complete},
  publisher =           {Springer-Verlag},
  journal =             {Formal Aspects of Computing},
  volume =              {4},
  number =              {1 supplement},
  pages =               {638-648},
  year =                {1992},
  month =               nov,
}
[BGS14] Benedikt Bollig, Paul Gastin, and Jana Schubert. Parameterized verification of communicating automata under context bounds. In RP'14, Lecture Notes in Computer Science 8762, pages 45-57. Springer-Verlag, September 2014. 
@inproceedings{rp2014-BGS,
  author =              {Bollig, Benedikt and Gastin, Paul and Schubert,
                         Jana},
  title =               {Parameterized verification of communicating automata
                         under context bounds},
  editor =              {Ouaknine, Jo{\"e}l and Potapov, Igor and Worrell,
                         James},
  booktitle =           {{P}roceedings of the 8th {W}orkshop on
                         {R}eachability {P}roblems in {C}omputational
                         {M}odels ({RP}'14)},
  acronym =             {{RP}'14},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8762},
  pages =               {45-57},
  year =                {2014},
  month =               sep,
  doi =                 {10.1007/978-3-319-11439-2_4},
}
[BGW01] Nikita Borisov, Ian Goldberg, and Klaus W. Wagner. Intercepting Mobile Communications: The Insecurity of 802.11. In MOBICOM'01, pages 180-189. ACM Press, July 2001. 
@inproceedings{mobicom2001-BGW,
  author =              {Borisov, Nikita and Goldberg, Ian and Wagner, Klaus
                         W.},
  title =               {Intercepting Mobile Communications: The Insecurity
                         of~{\(802.11\)}},
  booktitle =           {{P}roceedings of the 7th {A}nnual {I}nternational
                         {C}onference on {M}obile {C}omputing and
                         {N}etworking ({MOBICOM}'01)},
  acronym =             {{MOBICOM}'01},
  publisher =           {ACM Press},
  pages =               {180-189},
  year =                {2001},
  month =               jul,
}
[BH67] Manuel Blum and Carl Hewitt. Automata on a 2-Dimensional Tape. In FOCS'67, pages 155-160. IEEE Comp. Soc. Press, October 1967. 
@inproceedings{focs1967-BH,
  author =              {Blum, Manuel and Hewitt, Carl},
  title =               {Automata on a 2-Dimensional Tape},
  booktitle =           {{P}roceedings of the 8th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'67)},
  acronym =             {{FOCS}'67},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {155-160},
  year =                {1967},
  month =               oct,
}
[BH81] Arthur J. Bernstein and Jr. Harter. Proving Real-Time Properties of Programs with Temporal Logic. In SOSP'81, Operating System Review 15(5), pages 1-11. ACM Press, December 1981. 
@inproceedings{sosp1981-BH,
  author =              {Bernstein, Arthur J. and Harter, Paul K., Jr.},
  title =               {Proving Real-Time Properties of Programs with
                         Temporal Logic},
  booktitle =           {{P}roceedings of the 8th {ACM} {S}ymposium on
                         {O}perating {S}ystems {P}rinciples ({SOSP}'81)},
  acronym =             {{SOSP}'81},
  publisher =           {ACM Press},
  series =              {Operating System Review},
  volume =              {15},
  number =              {5},
  pages =               {1-11},
  year =                {1981},
  month =               dec,
}
[BH04] Anne Bergeron and Sylvie Hamel. From Cascade Decompositions to Bit-Vector Algorithms. Theoretical Computer Science 313(1):3-16. Elsevier, February 2004. 
@article{tcs313(1)-BH,
  author =              {Bergeron, Anne and Hamel, Sylvie},
  title =               {From Cascade Decompositions to Bit-Vector
                         Algorithms},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {313},
  number =              {1},
  pages =               {3-16},
  year =                {2004},
  month =               feb,
}
[BH05] Dragan Bosnacki and Gerard J. Holzmann. Improving Spin's Partial-Order Reduction for Breadth-First Search. In SPIN'05, Lecture Notes in Computer Science 3639, pages 91-105. Springer-Verlag, April 2005. 
@inproceedings{spin2005-BH,
  author =              {Bosnacki, Dragan and Holzmann, Gerard J.},
  title =               {Improving {S}pin's Partial-Order Reduction for
                         Breadth-First Search},
  editor =              {Godefroid, Patrice},
  booktitle =           {{P}roceedings of the 12th {I}nternational {SPIN}
                         {W}orkshop ({SPIN}'05)},
  acronym =             {{SPIN}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3639},
  pages =               {91-105},
  year =                {2005},
  month =               apr,
  doi =                 {10.1007/11537328_10},
}
[BH06] Bernard Boigelot and Frédéric Herbreteau. The Power of Hybrid Acceleration. In CAV'06, Lecture Notes in Computer Science 4144, pages 438-451. Springer-Verlag, July 2006. 
@inproceedings{cav2006-BH,
  author =              {Boigelot, Bernard and Herbreteau, Fr{\'e}d{\'e}ric},
  title =               {The Power of Hybrid Acceleration},
  editor =              {Ball, Thomas and Jones, Robert},
  booktitle =           {{P}roceedings of the 18th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'06)},
  acronym =             {{CAV}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4144},
  pages =               {438-451},
  year =                {2006},
  month =               jul,
  doi =                 {10.1007/11817963_40},
}
[Bhe09] Hans Bherer. Controller Synthesis for Parameterized Discrete Event Systems. PhD thesis, Université Laval, Québec, Canada, 2009. 
@phdthesis{bherer09,
  author =              {Bherer, Hans},
  title =               {Controller Synthesis for Parameterized Discrete
                         Event Systems},
  year =                {2009},
  school =              {Universit{\'e} Laval, Qu\'ebec, Canada},
}
[BHJ03] Bernard Boigelot, Frédéric Herbreteau, and Sébastien Jodogne. Hybrid Acceleration using Real Vector Automata (extended abstract). In CAV'03, Lecture Notes in Computer Science 2725, pages 193-205. Springer-Verlag, July 2003. 
@inproceedings{cav2003-BHJ,
  author =              {Boigelot, Bernard and Herbreteau, Fr{\'e}d{\'e}ric
                         and Jodogne, S{\'e}bastien},
  title =               {Hybrid Acceleration using Real Vector Automata
                         (extended abstract)},
  editor =              {Hunt, Jr, Warren A. and Somenzi, Fabio},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'03)},
  acronym =             {{CAV}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2725},
  pages =               {193-205},
  year =                {2003},
  month =               jul,
  doi =                 {10.1007/978-3-540-45069-6_19},
}
[BHJ03] Bernard Boigelot, Frédéric Herbreteau, and Sébastien Jodogne. Hybrid Acceleration using Real Vector Automata. Technical Report 2003.18, Centre Fédéré en Vérification, Bruxelles, Belgium, 2003. 
@techreport{TR-cfv0318,
  author =              {Boigelot, Bernard and Herbreteau, Fr{\'e}d{\'e}ric
                         and Jodogne, S{\'e}bastien},
  title =               {Hybrid Acceleration using Real Vector Automata},
  number =              {2003.18},
  year =                {2003},
  institution =         {Centre F\'ed\'er\'e en V\'erification, Bruxelles,
                         Belgium},
  type =                {Technical Report},
}
[BHJ+21] Patricia Bouyer, Léo Henry, Samy Jaziri, Thierry Jéron, and Nicolas Markey. Diagnosing timed automata using timed markings. International Journal on Software Tools for Technology Transfer 23(2):229-253. Springer-Verlag, April 2021.
Abstract

We consider the problems of efficiently diagnosing (and predicting) what did (and will) happen after a given sequence of observations of the execution of a partially-observable one-clock timed automaton. This is made difficult by the facts that timed automata are infinite-state systems, and that they can in general not be determinized.

We introduce timed markings as a formalism to keep track of the evolution of the set of reachable configurations over time. We show how timed markings can be used to efficiently represent the closure under silent transitions of such automata. We report on our implementation of this approach compared to the approach of [Tripakis, Fault diagnosis for timed automata, 2002], and provide some insight to a generalization of our approach to n-clock timed automata.

@article{sttt23(2)-BHJJM,
  author =              {Bouyer, Patricia and Henry, L{\'e}o and Jaziri, Samy
                         and J{\'e}ron, Thierry and Markey, Nicolas},
  title =               {Diagnosing timed automata using timed markings},
  publisher =           {Springer-Verlag},
  journal =             {International Journal on Software Tools for
                         Technology Transfer},
  volume =              {23},
  number =              {2},
  pages =               {229-253},
  year =                {2021},
  month =               apr,
  doi =                 {10.1007/s10009-021-00606-2},
  abstract =            {We~consider the problems of efficiently diagnosing
                         (and~predicting) what did (and~will) happen after a
                         given sequence of observations of the execution of a
                         partially-observable one-clock timed automaton. This
                         is made difficult by the facts that timed automata
                         are infinite-state systems, and that they can in
                         general not be determinized. \par We~introduce timed
                         markings as a formalism to keep track of the
                         evolution of the set of reachable configurations
                         over time. We show how timed markings can be used to
                         efficiently represent the closure under silent
                         transitions of such automata. We report on our
                         implementation of this approach compared to the
                         approach of [Tripakis, Fault diagnosis for timed
                         automata,~2002], and provide some insight to a
                         generalization of our approach to {{\(n\)}}-clock
                         timed automata.},
}
[BHK00] Steven Bradley, William Henderson, and David Kendall. Using Timed Automata for Response Time Analysis and Distributed Real-Time Systems. In WRTP'99, pages 143-148. Pergamon Press, January 2000. 
@inproceedings{wrtp1999-BHK,
  author =              {Bradley, Steven and Henderson, William and Kendall,
                         David},
  title =               {Using Timed Automata for Response Time Analysis and
                         Distributed Real-Time Systems},
  editor =              {Frigeri, Alceu Heinke and Halang, Wolfgang A. and
                         Son, Sang H.},
  booktitle =           {{P}roceedings of the 24th {IFAC}/{IFIP} {W}orkshop
                         on {R}eal-{T}ime {P}rogramming ({WRTP}'99)},
  acronym =             {{WRTP}'99},
  publisher =           {Pergamon Press},
  pages =               {143-148},
  year =                {2000},
  month =               jan,
  confyear =            {1999},
  confmonth =           {5},
}
[BHL14] Nathalie Bertrand, Serge Haddad, and Engel Lefaucheux. Foundation of Diagnosis and Predictability in Probabilistic Systems. In FSTTCS'14, Leibniz International Proceedings in Informatics 29, pages 417-429. Leibniz-Zentrum für Informatik, December 2014. 
@inproceedings{fsttcs2014-BHL,
  author =              {Bertrand, Nathalie and Haddad, Serge and Lefaucheux,
                         Engel},
  title =               {Foundation of Diagnosis and Predictability in
                         Probabilistic Systems},
  editor =              {Raman, Venkatesh and Suresh, S. P.},
  booktitle =           {{P}roceedings of the 34th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'14)},
  acronym =             {{FSTTCS}'14},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {29},
  pages =               {417-429},
  year =                {2014},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2014.417},
}
[BHL+22] Sougata Bose, Thomas A. Henzinger, Karoliina Lehtinen, Sven Schewe, and Patrick Totzke. History-deterministic timed automata are not determinizable. In RP'22, Lecture Notes in Computer Science 13608, pages 67-76. Springer-Verlag, October 2022. 
@inproceedings{rp2022-BHLST,
  author =              {Bose, Sougata and Henzinger, Thomas A. and Lehtinen,
                         Karoliina and Schewe, Sven and Totzke, Patrick},
  title =               {History-deterministic timed automata are not
                         determinizable},
  editor =              {Lin, Anthony W. and Zetzsche, Georg and Potapov,
                         Igor},
  booktitle =           {{P}roceedings of the 16th {W}orkshop on
                         {R}eachability {P}roblems in {C}omputational
                         {M}odels ({RP}'22)},
  acronym =             {{RP}'22},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {13608},
  pages =               {67-76},
  year =                {2022},
  month =               oct,
  doi =                 {10.1007/978-3-031-19135-0_5},
}
[BHM08] Aske Wiid Brekling, Michael R. Hansen, and Jan Madsen. Models and formal verification of multiprocessor system-on-chips. Journal of Logic and Algebraic Programming 77(1-2):1-19. Elsevier, October 2008. 
@article{jlap77(1-2)-BHM,
  author =              {Brekling, Aske Wiid and Hansen, Michael R. and
                         Madsen, Jan},
  title =               {Models and formal verification of multiprocessor
                         system-on-chips},
  publisher =           {Elsevier},
  journal =             {Journal of Logic and Algebraic Programming},
  volume =              {77},
  number =              {1-2},
  pages =               {1-19},
  year =                {2008},
  month =               oct,
}
[BHM14] Bernard Boigelot, Frédéric Herbreteau, and Isabelle Mainz. Acceleration of Affine Hybrid Transformations. In ATVA'14, Lecture Notes in Computer Science 8837, pages 31-46. Springer-Verlag, November 2014. 
@inproceedings{atva2014-BHM,
  author =              {Boigelot, Bernard and Herbreteau, Fr{\'e}d{\'e}ric
                         and Mainz, Isabelle},
  title =               {Acceleration of Affine Hybrid Transformations},
  editor =              {Cassez, Franck and Raskin, Jean-Fran{\c c}ois},
  booktitle =           {{P}roceedings of the 12th {I}nternational
                         {S}ymposium on {A}utomated {T}echnology for
                         {V}erification and {A}nalysis ({ATVA}'14)},
  acronym =             {{ATVA}'14},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8837},
  pages =               {31-46},
  year =                {2014},
  month =               nov,
  doi =                 {10.1007/978-3-319-11936-6_4},
}
[BHM17] Béatrice Bérard, Loïc Hélouët, and John Mullins. Non-interference in partial order models. ACM Transactions on Embedded Computing Systems. ACM Press, 2017. To appear. 
@article{tecs-BHM,
  author =              {B{\'e}rard, B{\'e}atrice and H{\'e}lou{\"e}t,
                         Lo{\"\i}c and Mullins, John},
  title =               {Non-interference in partial order models},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Embedded Computing Systems},
  year =                {2017},
  note =                {To~appear},
}
[BHM+17] Patricia Bouyer, Piotr Hofman, Nicolas Markey, Mickael Randour, and Martin Zimmermann. Bounding Average-energy Games. In FoSSaCS'17, Lecture Notes in Computer Science 10203, pages 179-195. Springer-Verlag, April 2017.
Abstract

We consider average-energy games, where the goal is to minimize the long-run average of the accumulated energy. Decidability of average-energy games with a lower-bound constraint on the energy level (but no upper bound) is an open problem; in particular, there is no known upper bound on the memory that is required for winning strategies.

By reducing average-energy games with lower-bounded energy to infinite-state mean-payoff games and analyzing the frequency of low-energy configurations, we show an almost tight doubly-exponential upper bound on the necessary memory, and that the winner of average-energy games with lower-bounded energy can be determined in doubly-exponential time. We also prove EXPSPACE-hardness of this problem.

Finally, we consider multi-dimensional extensions of all types of average-energy games: without bounds, with only a lower bound, and with both a lower and an upper bound on the energy. We show that the fully-bounded version is the only case to remain decidable in multiple dimensions.

@inproceedings{fossacs2017-BHMRZ,
  author =              {Bouyer, Patricia and Hofman, Piotr and Markey,
                         Nicolas and Randour, Mickael and Zimmermann, Martin},
  title =               {Bounding Average-energy Games},
  editor =              {Esparza, Javier and Murawski, Andrzej},
  booktitle =           {{P}roceedings of the 20th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'17)},
  acronym =             {{FoSSaCS}'17},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {10203},
  pages =               {179-195},
  year =                {2017},
  month =               apr,
  doi =                 {10.1007/978-3-662-54458-7_11},
  abstract =            {We~consider average-energy games, where the goal is
                         to minimize the long-run average of the accumulated
                         energy. Decidability of average-energy games with a
                         lower-bound constraint on the energy level (but~no
                         upper bound) is an open problem; in~particular,
                         there is no known upper bound on the memory that is
                         required for winning strategies.\par By~reducing
                         average-energy games with lower-bounded energy to
                         infinite-state mean-payoff games and analyzing the
                         frequency of low-energy configurations, we~show an
                         almost tight doubly-exponential upper bound on the
                         necessary memory, and that the winner of
                         average-energy games with lower-bounded energy can
                         be determined in doubly-exponential time. We~also
                         prove EXPSPACE-hardness of this problem.\par
                         Finally, we~consider multi-dimensional extensions of
                         all types of average-energy games: without bounds,
                         with only a lower bound, and with both a lower and
                         an upper bound on the energy. We show that the
                         fully-bounded version is the only case to remain
                         decidable in multiple dimensions.},
}
[BHP+07] Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Prabhu, and Jean-François Raskin. Minimum-Time Reachability in Timed Games. In ICALP'07, Lecture Notes in Computer Science 4596, pages 825-837. Springer-Verlag, July 2007. 
@inproceedings{icalp2007-BHPR,
  author =              {Brihaye, {\relax Th}omas and Henzinger, Thomas A.
                         and Prabhu, Vinayak S. and Raskin, Jean-Fran{\c
                         c}ois},
  title =               {Minimum-Time Reachability in Timed Games},
  editor =              {Arge, Lars and Cachin, Christian and Jurdzi{\'n}ski,
                         Tomasz and Tarlecki, Andrzej},
  booktitle =           {{P}roceedings of the 34th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'07)},
  acronym =             {{ICALP}'07},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4596},
  pages =               {825-837},
  year =                {2007},
  month =               jul,
}
[BHR06] Patricia Bouyer, Serge Haddad, and Pierre-Alain Reynier. Timed Unfoldings for Networks of Timed Automata. In ATVA'06, Lecture Notes in Computer Science 4218, pages 292-306. Springer-Verlag, October 2006. 
@inproceedings{atva2006-BHR,
  author =              {Bouyer, Patricia and Haddad, Serge and Reynier,
                         Pierre-Alain},
  title =               {Timed Unfoldings for Networks of Timed Automata},
  editor =              {Graf, Susanne and Zhang, Wenhui},
  booktitle =           {{P}roceedings of the 4th {I}nternational {S}ymposium
                         on {A}utomated {T}echnology for {V}erification and
                         {A}nalysis ({ATVA}'06)},
  acronym =             {{ATVA}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4218},
  pages =               {292-306},
  year =                {2006},
  month =               oct,
  doi =                 {10.1007/11901914_23},
}
[BHR09] Patricia Bouyer, Serge Haddad, and Pierre-Alain Reynier. Undecidability Results for Timed Automata with Silent Transitions. Fundamenta Informaticae 92(1-2):1-25. IOS Press, 2009. 
@article{fundi92(1-2)-BHR,
  author =              {Bouyer, Patricia and Haddad, Serge and Reynier,
                         Pierre-Alain},
  title =               {Undecidability Results for Timed Automata with
                         Silent Transitions},
  publisher =           {IOS Press},
  journal =             {Fundamenta Informaticae},
  volume =              {92},
  number =              {1-2},
  pages =               {1-25},
  year =                {2009},
}
[BHR+02] Danièle Beauquier, Yoram Hirshfeld, Alexander Rabinovich, and Anatol Slissenko. The Probablity Nesting Game. In EXPRESS'02, Electronic Notes in Theoretical Computer Science 68(2), pages 3-13. Elsevier, August 2002. 
@inproceedings{express2002-BHRS,
  author =              {Beauquier, Dani{\`e}le and Hirshfeld, Yoram and
                         Rabinovich, Alexander and Slissenko, Anatol},
  title =               {The Probablity Nesting Game},
  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 =               {3-13},
  year =                {2002},
  month =               aug,
}
[BHT07] Dirk Beyer, Thomas A. Henzinger, and Grégory Théoduloz. Configurable Software Verification: Concretizing the Convergence of Model Checking and Program Analysis. In CAV'07, Lecture Notes in Computer Science 4590. Springer-Verlag, July 2007. 
@inproceedings{cav2007-BHT,
  author =              {Beyer, Dirk and Henzinger, Thomas A. and
                         Th{\'e}oduloz, Gr{\'e}gory},
  title =               {Configurable Software Verification: Concretizing the
                         Convergence of Model Checking and Program Analysis},
  editor =              {Damm, Werner and Hermanns, Holger},
  booktitle =           {{P}roceedings of the 19th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'07)},
  acronym =             {{CAV}'07},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4590},
  year =                {2007},
  month =               jul,
  doi =                 {10.1007/978-3-540-73368-3_51},
}
[BIL06] Marius Bozga, Radu Iosif, and Yassine Lakhnech. Flat Parametric Counter Automata. Research Report TR-2005-15, Lab. VERIMAG, Grenoble, France, March 2006. 
@techreport{TR-verimag2005-15,
  author =              {Bozga, Marius and Iosif, Radu and Lakhnech, Yassine},
  title =               {Flat Parametric Counter Automata},
  number =              {TR-2005-15},
  year =                {2006},
  month =               mar,
  institution =         {Lab. VERIMAG, Grenoble, France},
  type =                {Research Report},
}
[BIL06] Marius Bozga, Radu Iosif, and Yassine Lakhnech. Flat Parametric Counter Automata. In ICALP'06, Lecture Notes in Computer Science 4052, pages 577-588. Springer-Verlag, July 2006. 
@inproceedings{icalp2006-BIL,
  author =              {Bozga, Marius and Iosif, Radu and Lakhnech, Yassine},
  title =               {Flat Parametric Counter Automata},
  editor =              {Bugliesi, Michele and Preneel, Bart and Sassone,
                         Vladimiro and Wegener, Ingo},
  booktitle =           {{P}roceedings of the 33rd {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'06))~-- Part~{II}},
  acronym =             {{ICALP}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4052},
  pages =               {577-588},
  year =                {2006},
  month =               jul,
  doi =                 {10.1007/11787006_49},
}
[BIS90] David A. Mix Barrington, Neil Immerman, and Howard Straubing. On Uniformity Within NC1. Journal of Computer and System Sciences 41(3):274-306. Academic Press, December 1990. 
@article{jcss41(3)-BIS,
  author =              {Barrington, David A. Mix and Immerman, Neil and
                         Straubing, Howard},
  title =               {On Uniformity Within {{\(\mathit{NC}^1\)}}},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {41},
  number =              {3},
  pages =               {274-306},
  year =                {1990},
  month =               dec,
}
[BJ10] Nils Bulling and Wojciech Jamroga. Model Checking Agents with Memory Is Harder than It Seemed. In AAMAS'10, pages 633-640. International Foundation for Autonomous Agents and Multiagent Systems, May 2010. 
@inproceedings{aamas2010-BJ,
  author =              {Bulling, Nils and Jamroga, Wojciech},
  title =               {Model Checking Agents with Memory Is Harder than It
                         Seemed},
  editor =              {van der Hoek, Wiebe and Kaminka, Gal A. and
                         Lesp{\'e}rance, Yves and Luck, Michael and Sen,
                         Sandeep},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference on {A}utonomous {A}gents and
                         {M}ultiagent {S}ystems ({AAMAS}'10)},
  acronym =             {{AAMAS}'10},
  publisher =           {International Foundation for Autonomous Agents and
                         Multiagent Systems},
  pages =               {633-640},
  year =                {2010},
  month =               may,
}
[BJK10] Tomáš Brázdil, Petr Jančar, and Antonín Kučera. Reachability Games on Extended Vector Addition Systems with States. In ICALP'10, Lecture Notes in Computer Science 6199, pages 478-489. Springer-Verlag, July 2010. 
@inproceedings{icalp2010-BJK,
  author =              {Br{\'a}zdil, Tom{\'a}{\v s} and Jan{\v c}ar, Petr
                         and Ku{\v c}era, Anton{\'\i}n},
  title =               {Reachability Games on Extended Vector Addition
                         Systems with States},
  editor =              {Abramsky, Samson and Gavoille, Cyril and Kirchner,
                         Claude and Meyer auf der Heide, Friedhelm and
                         Spirakis, Paul G.},
  booktitle =           {{P}roceedings of the 37th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'10)~-- Part~{II}},
  acronym =             {{ICALP}'10},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6199},
  pages =               {478-489},
  year =                {2010},
  month =               jul,
  doi =                 {10.1007/978-3-642-14162-1_40},
}
[BJK+05] Manfred Broy, Bengt Jonsson, Joost-Pieter Katoen, Martin Leucker, and Alexander Pretschner. Model-Based Testing of Reactive Systems – Advanced lectures. Lecture Notes in Computer Science 3472. Springer-Verlag, 2005. 
@book{mbt-bjklp,
  author =              {Broy, Manfred and Jonsson, Bengt and Katoen,
                         Joost-Pieter and Leucker, Martin and Pretschner,
                         Alexander},
  title =               {Model-Based Testing of Reactive Systems~-- Advanced
                         lectures},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3472},
  year =                {2005},
}
[BJL+10] Thomas Brihaye, Marc Jungers, Samson Lasaulce, Nicolas Markey, and Ghassan Oreiby. Using Model Checking for Analyzing Distributed Power Control Problems. EURASIP Journal on Wireless Communications and Networking 2010(861472). Hindawi Publishing Corp., June 2010.
Abstract

Model checking (MC) is a formal verification technique which has been known and still knows a resounding success in the computer science community. Realizing that the distributed power control (PC) problem can be modeled by a timed game between a given transmitter and its environment, the authors wanted to know whether this approach can be applied to distributed PC. It turns out that it can be applied successfully and allows one to analyze realistic scenarios including the case of discrete transmit powers and games with incomplete information. The proposed methodology is as follows. We state some objectives a transmitter-receiver pair would like to reach. The network is modeled by a game where transmitters are considered as timed automata interacting with each other. The objectives are then translated into timed alternating-time temporal logic formulae and MC is exploited to know whether the desired properties are verified and determine a winning strategy.

@article{jwcn2010(861472)-BJLMO,
  author =              {Brihaye, {\relax Th}omas and Jungers, Marc and
                         Lasaulce, Samson and Markey, Nicolas and Oreiby,
                         Ghassan},
  title =               {Using Model Checking for Analyzing Distributed Power
                         Control Problems},
  publisher =           {Hindawi Publishing Corp.},
  journal =             {EURASIP Journal on Wireless Communications and
                         Networking},
  volume =              {2010},
  number =              {861472},
  year =                {2010},
  month =               jun,
  doi =                 {10.1155/2010/861472},
  abstract =            {Model checking~(MC) is a formal verification
                         technique which has been known and still knows a
                         resounding success in the computer science
                         community. Realizing that the distributed power
                         control~(PC) problem can be modeled by a timed game
                         between a given transmitter and its environment, the
                         authors wanted to know whether this approach can be
                         applied to distributed~PC. It~turns out that it can
                         be applied successfully and allows one to analyze
                         realistic scenarios including the case of discrete
                         transmit powers and games with incomplete
                         information. The proposed methodology is as follows.
                         We state some objectives a transmitter-receiver pair
                         would like to reach. The network is modeled by a
                         game where transmitters are considered as timed
                         automata interacting with each other. The objectives
                         are then translated into timed alternating-time
                         temporal logic formulae and MC is exploited to know
                         whether the desired properties are verified and
                         determine a winning strategy.},
}
[BJL+98] Johan Bengtsson, Bengt Jonsson, Johan Lilius, and Wang Yi. Partial-Order Reductions for Timed Systems. In CONCUR'98, Lecture Notes in Computer Science 1466, pages 485-500. Springer-Verlag, September 1998. 
@inproceedings{concur1998-BJLY,
  author =              {Bengtsson, Johan and Jonsson, Bengt and Lilius,
                         Johan and Yi, Wang},
  title =               {Partial-Order Reductions for Timed Systems},
  editor =              {Sangiorgi, Davide and de Simone, Robert},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'98)},
  acronym =             {{CONCUR}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1466},
  pages =               {485-500},
  year =                {1998},
  month =               sep,
  doi =                 {10.1007/BFb0055643},
}
[BJM15] Patricia Bouyer, Samy Jaziri, and Nicolas Markey. On the Value Problem in Weighted Timed Games. In CONCUR'15, Leibniz International Proceedings in Informatics 42, pages 311-324. Leibniz-Zentrum für Informatik, September 2015.
Abstract

A weighted timed game is a timed game with extra quantitative information representing e.g. energy consumption. Optimizing the cost for reaching a target is a natural question, which has been investigated for ten years. Existence of optimal strategies is known to be undecidable in general, and only very restricted classes of games have been described for which optimal cost and almost-optimal strategies can be computed.

In this paper, we show that the value problem is undecidable in general weighted timed games. The undecidability proof relies on that for the existence of optimal strategies and on a diagonalization construction recently designed in the context of quantitative temporal logics. We then provide an algorithm to compute arbitrary approximations of the value in a game, and almost-optimal strategies. The algorithm applies in a large subclass of weighted timed games, and is the first approximation scheme which is designed in the current context.

@inproceedings{concur2015-BJM,
  author =              {Bouyer, Patricia and Jaziri, Samy and Markey,
                         Nicolas},
  title =               {On~the Value Problem in Weighted Timed Games},
  editor =              {Aceto, Luca and de Frutos{-}Escrig, David},
  booktitle =           {{P}roceedings of the 26th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'15)},
  acronym =             {{CONCUR}'15},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {42},
  pages =               {311-324},
  year =                {2015},
  month =               sep,
  doi =                 {10.4230/LIPIcs.CONCUR.2015.311},
  abstract =            {A~weighted timed game is a timed game with extra
                         quantitative information representing e.g. energy
                         consumption. Optimizing the cost for reaching a
                         target is a natural question, which has been
                         investigated for ten years. Existence of optimal
                         strategies is known to be undecidable in general,
                         and only very restricted classes of games have been
                         described for which optimal cost and almost-optimal
                         strategies can be computed.\par In this paper, we
                         show that the value problem is undecidable in
                         general weighted timed games. The undecidability
                         proof relies on that for the existence of optimal
                         strategies and on a diagonalization construction
                         recently designed in the context of quantitative
                         temporal logics. We then provide an algorithm to
                         compute arbitrary approximations of the value in a
                         game, and almost-optimal strategies. The algorithm
                         applies in a large subclass of weighted timed games,
                         and is the first approximation scheme which is
                         designed in the current context.},
}
[BJM17] Patricia Bouyer, Samy Jaziri, and Nicolas Markey. On the determinization of timed systems. In FORMATS'17, Lecture Notes in Computer Science 10419, pages 25-41. Springer-Verlag, September 2017.
Abstract

We introduce a new formalism called automata over a timed domain which provides an adequate framework for the determinization of timed systems. In this formalism, determinization w.r.t. timed language is always possible at the cost of changing the timed domain. We give a condition for determinizability of automata over a timed domain without changing the timed domain, which allows us to recover several known determinizable classes of timed systems, such as strongly-non-zeno timed automata, integer-reset timed automata, perturbed timed automata, etc. Moreover in the case of timed automata this condition encompasses most determinizability conditions from the literature.

@inproceedings{formats2017-BJM,
  author =              {Bouyer, Patricia and Jaziri, Samy and Markey,
                         Nicolas},
  title =               {On the determinization of timed systems},
  editor =              {Abate, Alessandro and Geeraerts, Gilles},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'17)},
  acronym =             {{FORMATS}'17},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {10419},
  pages =               {25-41},
  year =                {2017},
  month =               sep,
  doi =                 {10.1007/978-3-319-65765-3_2},
  abstract =            {We introduce a new formalism called \emph{automata
                         over a timed domain} which provides an adequate
                         framework for the determinization of timed systems.
                         In~this formalism, determinization w.r.t. timed
                         language is always possible at the cost of changing
                         the timed domain. We~give a condition for
                         determinizability of automata over a timed domain
                         without changing the timed domain, which allows us
                         to recover several known determinizable classes of
                         timed systems, such as strongly-non-zeno timed
                         automata, integer-reset timed automata, perturbed
                         timed automata, etc. Moreover in the case of timed
                         automata this condition encompasses most
                         determinizability conditions from the literature.},
}
[BJM17] Patricia Bouyer, Vincent Jugé, and Nicolas Markey. Courcelle's Theorem Made Dynamic. Technical Report 1702.05183, arXiv, February 2017.
Abstract

Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of model checking a fixed monadic second-order formula over evolving subgraphs of a fixed maximal graph having bounded tree-width; here the subgraph evolves by losing or gaining edges (from the maximal graph). We show that this problem is in DynFO (with LOGSPACE precomputation), via a reduction to a Dyck reachability problem on an acyclic automaton.

@techreport{arxiv1702.05183-BJM,
  author =              {Bouyer, Patricia and Jug{\'e}, Vincent and Markey,
                         Nicolas},
  title =               {{C}ourcelle's Theorem Made Dynamic},
  number =              {1702.05183},
  year =                {2017},
  month =               feb,
  institution =         {arXiv},
  abstract =            {Dynamic complexity is concerned with updating the
                         output of a problem when the input is slightly
                         changed. We study the dynamic complexity of model
                         checking a fixed monadic second-order formula over
                         evolving subgraphs of a fixed maximal graph having
                         bounded tree-width; here the subgraph evolves by
                         losing or gaining edges (from the maximal graph).
                         We~show that this problem is in DynFO (with LOGSPACE
                         precomputation), via a reduction to a Dyck
                         reachability problem on an acyclic automaton.},
}
[BJM18] Patricia Bouyer, Samy Jaziri, and Nicolas Markey. Efficient timed diagnosis using automata with timed domains. In RV'18, Lecture Notes in Computer Science 11237, pages 205-221. Springer-Verlag, November 2018.
Abstract

We consider the problems of efficiently diagnosing and predicting what did (or will) happen in a partially-observable one-clock timed automaton. We introduce timed sets as a formalism to keep track of the evolution of the reachable configurations over time, and use our previous work on automata over timed domains to build a candidate diagnoser for our timed automaton. We report on our implementation of this approach compared to the approach of [Tripakis, Fault diagnosis for timed autmata, 2002].

@inproceedings{rv2018-BJM,
  author =              {Bouyer, Patricia and Jaziri, Samy and Markey,
                         Nicolas},
  title =               {Efficient timed diagnosis using automata with timed
                         domains},
  editor =              {Colombo, Christian and Leucker, Martin},
  booktitle =           {{P}roceedings of the 18th {I}nternational {W}orkshop
                         on {R}untime {V}erification ({RV}'18)},
  acronym =             {{RV}'18},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {11237},
  pages =               {205-221},
  year =                {2018},
  month =               nov,
  doi =                 {10.1007/978-3-030-03769-7_12},
  abstract =            {We consider the problems of efficiently diagnosing
                         and predicting what did (or~will) happen in a
                         partially-observable one-clock timed automaton.
                         We~introduce timed sets as a formalism to keep track
                         of the evolution of the reachable configurations
                         over time, and use our previous work on automata
                         over timed domains to build a candidate diagnoser
                         for our timed automaton. We~report on our
                         implementation of this approach compared to the
                         approach of [Tripakis, Fault diagnosis for timed
                         autmata,~2002].},
}
[BJM+02] Marius Bozga, Hou Jianmin, Oded Maler, and Sergio Yovine. Verification of Asynchronous Circuits using Timed Automata. In TPTS'02, Electronic Notes in Theoretical Computer Science 65(6), pages 47-59. Elsevier, April 2002. 
@inproceedings{tpts2002-BJMY,
  author =              {Bozga, Marius and Jianmin, Hou and Maler, Oded and
                         Yovine, Sergio},
  title =               {Verification of Asynchronous Circuits using Timed
                         Automata},
  editor =              {Asarin, Eugene and Maler, Oded and Yovine, Sergio},
  booktitle =           {{P}roceedings of the 1st {W}orkshop on {T}heory and
                         {P}ractice of {T}imed {S}ystems ({TPTS}'02)},
  acronym =             {{TPTS}'02},
  publisher =           {Elsevier},
  series =              {Electronic Notes in Theoretical Computer Science},
  volume =              {65},
  number =              {6},
  pages =               {47-59},
  year =                {2002},
  month =               apr,
}
[BJS09] Joakim Byg, Kenneth Yrke Jørgensen, and Jiří Srba. TAPAAL: Editor, Simulator and Verifier of Timed-Arc Petri Nets. In ATVA'09, Lecture Notes in Computer Science 5799, pages 84-89. Springer-Verlag, October 2009. 
@inproceedings{atva2009-BJS,
  author =              {Byg, Joakim and J{\o}rgensen, Kenneth Yrke and Srba,
                         Ji{\v r}{\'\i}},
  title =               {{TAPAAL}: Editor, Simulator and Verifier of
                         Timed-Arc {P}etri Nets},
  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 =               {84-89},
  year =                {2009},
  month =               oct,
  doi =                 {10.1007/978-3-642-04761-9_7},
}
[BJS+12] Nathalie Bertrand, Thierry Jéron, Amélie Stainer, and Moez Krichen. Off-line test selection with test purposes for non-deterministic timed automata. Logical Methods in Computer Science 8(4). 2012. 
@article{lmcs8(4)-BJSK,
  author =              {Bertrand, Nathalie and J{\'e}ron, Thierry and
                         Stainer, Am{\'e}lie and Krichen, Moez},
  title =               {Off-line test selection with test purposes for
                         non-deterministic timed automata},
  journal =             {Logical Methods in Computer Science},
  volume =              {8},
  number =              {4},
  year =                {2012},
  doi =                 {10.2168/LMCS-8(4:8)2012},
}
[BJV10] Jasper Berendsen, David N. Jansen, and Frits Vaandrager. Fortuna: model checking priced probabilistic timed automata. In QEST'10, pages 273-281. IEEE Comp. Soc. Press, September 2010. 
@inproceedings{qest2010-BJV,
  author =              {Berendsen, Jasper and Jansen, David N. and
                         Vaandrager, Frits},
  title =               {Fortuna: model checking priced probabilistic timed
                         automata},
  booktitle =           {{P}roceedings of the 7th {I}nternational
                         {C}onference on {Q}uantitative {E}valuation of
                         {S}ystems ({QEST}'10)},
  acronym =             {{QEST}'10},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {273-281},
  year =                {2010},
  month =               sep,
}
[BJW02] Julien Bernet, David Janin, and Igor Walukiewicz. Permissive strategies: from parity games to safety games. RAIRO – Theoretical Informatics and Applications 36(3):261-275. EDP Sciences, 2002. 
@article{rairo-tia36(3)-BJW,
  author =              {Bernet, Julien and Janin, David and Walukiewicz,
                         Igor},
  title =               {Permissive strategies: from parity games to safety
                         games},
  publisher =           {EDP Sciences},
  journal =             {RAIRO~-- Theoretical Informatics and Applications},
  volume =              {36},
  number =              {3},
  pages =               {261-275},
  year =                {2002},
}
[BK08] Christel Baier and Joost-Pieter Katoen. Principles of Model-Checking. MIT Press, May 2008. 
@book{PoMC2008-BK,
  author =              {Baier, {\relax Ch}ristel and Katoen, Joost-Pieter},
  title =               {Principles of Model-Checking},
  publisher =           {MIT Press},
  year =                {2008},
  month =               may,
}
[BK18] Marc Bagnol and Denis Kuperberg. Büchi Good-for-game Automata are Efficiently Recognizable. In FSTTCS'18, Leibniz International Proceedings in Informatics 122, pages 16:1-16:14. Leibniz-Zentrum für Informatik, December 2018. 
@inproceedings{fsttcs2018-BK,
  author =              {Bagnol, Marc and Kuperberg, Denis},
  title =               {B{\"u}chi Good-for-game Automata are Efficiently
                         Recognizable},
  editor =              {Ganguli, Sumit and Pandya, Paritosh K.},
  booktitle =           {{P}roceedings of the 38th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'18)},
  acronym =             {{FSTTCS}'18},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {122},
  pages =               {16:1-16:14},
  year =                {2018},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2018.16},
}
[BKK11] Christel Baier, Joachim Klein, and Sascha Klüppelholz. A Compositional Framework for Controller Synthesis. In CONCUR'11, Lecture Notes in Computer Science 6901, pages 512-527. Springer-Verlag, September 2011. 
@inproceedings{concur2011-BKK,
  author =              {Baier, {\relax Ch}ristel and Klein, Joachim and
                         Kl{\"u}ppelholz, Sascha},
  title =               {A Compositional Framework for Controller Synthesis},
  editor =              {Katoen, Joost-Pieter and K{\"o}nig, Barbara},
  booktitle =           {{P}roceedings of the 22nd {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'11)},
  acronym =             {{CONCUR}'11},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6901},
  pages =               {512-527},
  year =                {2011},
  month =               sep,
}
[BKK+14] Tomáš Brázdil, David Klaška, Antonín Kučera, and Petr Novotný. Minimizing Running Costs in Consumption Systems. In CAV'14, Lecture Notes in Computer Science 8559, pages 457-472. Springer-Verlag, July 2014. 
@inproceedings{cav2014-BKKN,
  author =              {Br{\'a}zdil, Tom{\'a}{\v s} and Kla{\v{s}}ka, David
                         and Ku{\v c}era, Anton{\'\i}n and Novotn{\'y}, Petr},
  title =               {Minimizing Running Costs in Consumption Systems},
  editor =              {Biere, Armin and Bloem, Roderick},
  booktitle =           {{P}roceedings of the 26th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'14)},
  acronym =             {{CAV}'14},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8559},
  pages =               {457-472},
  year =                {2014},
  month =               jul,
}
[BKK+13] Udi Boker, Denis Kuperberg, Orna Kupferman, and Michal Skrzypczak. Nondeterminism in the Presence of a Diverse or Unknown Future. In ICALP'13, Lecture Notes in Computer Science 7966, pages 89-100. Springer-Verlag, July 2013. 
@inproceedings{icalp2013-BKKS,
  author =              {Boker, Udi and Kuperberg, Denis and Kupferman, Orna
                         and Skrzypczak, Michal},
  title =               {Nondeterminism in the Presence of a Diverse or
                         Unknown Future},
  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 =               {89-100},
  year =                {2013},
  month =               jul,
  doi =                 {10.1007/978-3-642-39212-2_11},
}
[BKL+20] Udi Boker, Denis Kuperberg, Karoliina Lehtinen, and Michal Skrzypczak. On succinctness and recognisability of alternating good-for-games automata. In FSTTCS'20, Leibniz International Proceedings in Informatics 182, pages 41:1-41:13. Leibniz-Zentrum für Informatik, December 2020. 
@inproceedings{fsttcs2020-BKLS,
  author =              {Boker, Udi and Kuperberg, Denis and Lehtinen,
                         Karoliina and Skrzypczak, Michal},
  title =               {On succinctness and recognisability of alternating
                         good-for-games automata},
  editor =              {Saxena, Nitin and Simon, Sunil},
  booktitle =           {{P}roceedings of the 40th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'20)},
  acronym =             {{FSTTCS}'20},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {182},
  pages =               {41:1-41:13},
  year =                {2020},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2020.41},
}
[BKM+19] Patricia Bouyer, Orna Kupferman, Nicolas Markey, Bastien Maubert, Aniello Murano, and Giuseppe Perelli. Reasoning about Quality and Fuzziness of Strategic Behaviours. In IJCAI'19, pages 1588-1594. IJCAI organization, August 2019.
Abstract

We introduce and study SL[F]—a quantitative extension of SL (Strategy Logic), one of the most natural and expressive logics describing strategic behaviours. The satisfaction value of an SL[F] formula is a real value in [0,1], reflecting "how much" or "how well" the strategic on-going objectives of the underlying agents are satisfied. We demonstrate the applications of SL[F] in quantitative reasoning about multi-agent systems, by showing how it can express concepts of stability in multi-agent systems, and how it generalises some fuzzy temporal logics. We also provide a model-checking algorithm for our logic, based on a quantitative extension of Quantified CTL.

@inproceedings{ijcai2019-BKMMMP,
  author =              {Bouyer, Patricia and Kupferman, Orna and Markey,
                         Nicolas and Maubert, Bastien and Murano, Aniello and
                         Perelli, Giuseppe},
  title =               {Reasoning about Quality and Fuzziness of Strategic
                         Behaviours},
  editor =              {Kraus, Sarit},
  booktitle =           {{P}roceedings of the 28th {I}nternational {J}oint
                         {C}onference on {A}rtificial {I}ntelligence
                         ({IJCAI}'19)},
  acronym =             {{IJCAI}'19},
  publisher =           {IJCAI organization},
  pages =               {1588-1594},
  year =                {2019},
  month =               aug,
  doi =                 {10.24963/ijcai.2019/220},
  abstract =            {We~introduce and study
                         {\(\textsf{SL}[\mathcal{F}]\)}---a~quantitative
                         extension of {\(\textsf{SL}\)} (Strategy Logic),
                         one~of the most natural and expressive logics
                         describing strategic behaviours. The satisfaction
                         value of an {\(\textsf{SL}[\mathcal{F}]\)} formula
                         is a real value in~{\([0,1]\)}, reflecting {"}how
                         much{"} or {"}how well{"} the strategic on-going
                         objectives of the underlying agents are satisfied.
                         We~demonstrate the applications of
                         {\(\textsf{SL}[\mathcal{F}]\)} in quantitative
                         reasoning about multi-agent systems, by showing how
                         it can express concepts of stability in multi-agent
                         systems, and how it generalises some fuzzy temporal
                         logics. We~also provide a model-checking algorithm
                         for our logic, based on a quantitative extension of
                         Quantified~\textsf{CTL}.},
}
[BKM+23] Patricia Bouyer, Orna Kupferman, Nicolas Markey, Bastien Maubert, Aniello Murano, and Giuseppe Perelli. Reasoning about Quality and Fuzziness of Strategic Behaviours. ACM Transactions on Computational Logic 24(3):21:1-21:38. ACM Press, July 2023.
Abstract

Temporal logics are extensively used for the specification of on-going behaviors of computer systems. Two significant developments in this area are the extension of traditional temporal logics with modalities that enable the specification of on-going strategic behaviors in multi-agent systems, and the transition of temporal logics to a quantitative setting, where different satisfaction values enable the specifier to formalize concepts such as certainty or quality. In the first class, SL (Strategy Logic) is one of the most natural and expressive logics describing strategic behaviors. In the second class, a notable logic is LTL[F], which extends LTL with quality operators.

In this work we introduce and study SL[F], which enables the specification of quantitative strategic behaviors. The satisfaction value of an SL[F] formula is a real value in [0,1], reflecting "how much" or "how well" the strategic on-going objectives of the underlying agents are satisfied. We demonstrate the applications of SL[F] in quantitative reasoning about multi-agent systems, showing how it can express and measure concepts like stability in multi-agent systems, and how it generalizes some fuzzy temporal logics. We also provide a model-checking algorithm for SL[F], based on a quantitative extension of Quantified CTL*. Our algorithm provides the first decidability result for a quantitative extension of Strategy Logic. In addition, it can be used for synthesizing strategies that maximize the quality of the systems' behavior

@article{tocl24(3)-BKMMMP,
  author =              {Bouyer, Patricia and Kupferman, Orna and Markey,
                         Nicolas and Maubert, Bastien and Murano, Aniello and
                         Perelli, Giuseppe},
  title =               {Reasoning about Quality and Fuzziness of Strategic
                         Behaviours},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Computational Logic},
  volume =              {24},
  number =              {3},
  pages =               {21:1-21:38},
  year =                {2023},
  month =               jul,
  doi =                 {10.1145/3582498},
  abstract =            {Temporal logics are extensively used for the
                         specification of on-going behaviors of computer
                         systems. Two significant developments in this area
                         are the extension of traditional temporal logics
                         with modalities that enable the specification of
                         on-going strategic behaviors in multi-agent systems,
                         and the transition of temporal logics to a
                         quantitative setting, where different satisfaction
                         values enable the specifier to formalize concepts
                         such as certainty or quality. In~the first class,
                         SL~(Strategy~Logic)~is one of the most natural and
                         expressive logics describing strategic behaviors. In
                         the second class, a notable logic is
                         \(\textsf{LTL}[\mathcal{F}]\), which extends
                         \textsf{LTL} with quality operators. \par In~this
                         work we introduce and study
                         \(\textsf{SL}[\mathcal{F}]\), which enables the
                         specification of quantitative strategic behaviors.
                         The satisfaction value of an
                         \(\textsf{SL}[\mathcal{F}]\) formula is a real value
                         in \([0,1]\), reflecting {"}how~much{"} or
                         {"}how~well{"} the strategic on-going objectives of
                         the underlying agents are satisfied. We demonstrate
                         the applications of \(\textsf{SL}[\mathcal{F}]\) in
                         quantitative reasoning about multi-agent systems,
                         showing how it can express and measure concepts like
                         stability in multi-agent systems, and how it
                         generalizes some fuzzy temporal logics. We also
                         provide a model-checking algorithm for
                         \(\textsf{SL}[\mathcal{F}]\), based on a
                         quantitative extension of
                         Quantified~\(\textsf{CTL}^*\). Our~algorithm
                         provides the first decidability result for a
                         quantitative extension of Strategy Logic. In
                         addition, it can be used for synthesizing strategies
                         that maximize the quality of the systems' behavior},
}
[BKM+06] Jeremy W. Bryans, Maciej Koutny, Laurent Mazaré, and Peter Y. A. Ryan. Opacity generalised to transition systems. In FAST'05, Lecture Notes in Computer Science 3866, pages 81-95. Springer-Verlag, 2006. 
@inproceedings{fast2005-BKMR,
  author =              {Bryans, Jeremy W. and Koutny, Maciej and Mazar{\'e},
                         Laurent and Ryan, Peter Y. A.},
  title =               {Opacity generalised to transition systems},
  editor =              {Dimitrakos, Theo and Martinelli, Fabio and Ryan,
                         Peter Y. A. and Schneider, Steve},
  booktitle =           {{R}evised {S}elected {P}apers of the 3rd
                         {I}nternational {W}orkshop on {F}ormal {A}spects in
                         {S}ecurity and {T}rust ({FAST}'05)},
  acronym =             {{FAST}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3866},
  pages =               {81-95},
  year =                {2006},
  confyear =            {2005},
  confmonth =           {7},
  doi =                 {10.1007/11679219_7},
}
[BKO+08] Thomas Bøgholm, Henrik Kargh-hansen, Petur Olsen, Bent Thomsen, and Kim Guldstrand Larsen. Model-based schedulability analysis of safety critical hard real-time Java programs. In JTRES'08, ACM International Conference Proceeding Series 343, pages 106-114. ACM Press, September 2008. 
@inproceedings{jtres2008-BKOTL,
  author =              {B{\o}gholm, Thomas and Kargh{-}hansen, Henrik and
                         Olsen, Petur and Thomsen, Bent and Larsen, Kim
                         Guldstrand},
  title =               {Model-based schedulability analysis of safety
                         critical hard real-time Java programs},
  editor =              {Bollella, Gregory and Locke, C. Douglas},
  booktitle =           {{P}roceedings of the 6th {I}nternational {W}orkshop
                         on {J}ava {T}echnologies for {R}eal-time and
                         {E}mbedded {S}ystems ({JTRES}'08)},
  acronym =             {{JTRES}'08},
  publisher =           {ACM Press},
  series =              {ACM International Conference Proceeding Series},
  volume =              {343},
  pages =               {106-114},
  year =                {2008},
  month =               sep,
  doi =                 {10.1145/1434790.1434807},
}
[BKP86] Howard Barringer, Ruurd Kuiper, and Amir Pnueli. A Really Abstract Concurrent Model and its Temporal Logic. In POPL'86, pages 173-183. ACM Press, January 1986. 
@inproceedings{popl1986-BKP,
  author =              {Barringer, Howard and Kuiper, Ruurd and Pnueli,
                         Amir},
  title =               {A Really Abstract Concurrent Model and its Temporal
                         Logic},
  booktitle =           {Conference Record of the 13th {ACM} {S}ymposium on
                         {P}rinciples of {P}rogramming {L}anguages
                         ({POPL}'86)},
  acronym =             {{POPL}'86},
  publisher =           {ACM Press},
  pages =               {173-183},
  year =                {1986},
  month =               jan,
}
[BKP11] Dietmar Berwanger, łukasz Kaiser, and Bernd Puchala. A Perfect-Information Construction for Coordination in Games. In FSTTCS'11, Leibniz International Proceedings in Informatics 13, pages 387-398. Leibniz-Zentrum für Informatik, December 2011. 
@inproceedings{fsttcs2011-BKP,
  author =              {Berwanger, Dietmar and Kaiser, {\L}ukasz and
                         Puchala, Bernd},
  title =               {A~Perfect-Information Construction for Coordination
                         in Games},
  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},
  pages =               {387-398},
  year =                {2011},
  month =               dec,
}
[BL69] Julius R. Büchi and Lawrence H. Landweber. Solving Sequential Conditions by Finite-State Strategies. Transactions of the American Mathematical Society 138:295-311. American Mathematical Society, April 1969. 
@article{TAMS138-BL,
  author =              {B{\"u}chi, Julius R. and Landweber, Lawrence H.},
  title =               {Solving Sequential Conditions by Finite-State
                         Strategies},
  publisher =           {American Mathematical Society},
  journal =             {Transactions of the American Mathematical Society},
  volume =              {138},
  pages =               {295-311},
  year =                {1969},
  month =               apr,
}
[BL95] Ahmed Bouajjani and Yassine Lakhnech. Temporal Logic + Timed Automata: Expressiveness and Decidability. In CONCUR'95, Lecture Notes in Computer Science 962, pages 531-545. Springer-Verlag, August 1995. 
@inproceedings{concur1995-BL,
  author =              {Bouajjani, Ahmed and Lakhnech, Yassine},
  title =               {Temporal Logic + Timed Automata: Expressiveness and
                         Decidability},
  editor =              {Lee, Insup and Smolka, Scott A.},
  booktitle =           {{P}roceedings of the 6th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'95)},
  acronym =             {{CONCUR}'95},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {962},
  pages =               {531-545},
  year =                {1995},
  month =               aug,
}
[BL12] Mikołaj Bojańczyk and Sławomir Lasota. A Machine-Independent Characterization of Timed Languages. In ICALP'12, Lecture Notes in Computer Science 7392, pages 92-103. Springer-Verlag, July 2012. 
@inproceedings{icalp2012-BL,
  author =              {Boja{\'n}czyk, Miko{\l}aj and Lasota, S{\l}awomir},
  title =               {A~Machine-Independent Characterization of Timed
                         Languages},
  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 =               {92-103},
  year =                {2012},
  month =               jul,
  doi =                 {10.1007/978-3-642-31585-5_12},
}
[BL19] Udi Boker and Karoliina Lehtinen. Good-for-game Automata: from Non-determinism to Alternation. In CONCUR'19, Leibniz International Proceedings in Informatics 140, pages 19:1-19:16. Leibniz-Zentrum für Informatik, August 2019. 
@inproceedings{concur2019-BL,
  author =              {Boker, Udi and Lehtinen, Karoliina},
  title =               {Good-for-game Automata: from Non-determinism to
                         Alternation},
  editor =              {Fokkink, Wan J. and van Glabbeek, Rob},
  booktitle =           {{P}roceedings of the 30th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'19)},
  acronym =             {{CONCUR}'19},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {140},
  pages =               {19:1-19:16},
  year =                {2019},
  month =               aug,
  doi =                 {10.4230/LIPIcs.CONCUR.2019.19},
}
[BL21] Udi Boker and Karoliina Lehtinen. History Determinism vs. Good for Gameness in Quantitative Automata. In FSTTCS'21, Leibniz International Proceedings in Informatics 213, pages 38:1-38:20. Leibniz-Zentrum für Informatik, December 2021. 
@inproceedings{fsttcs2021-BK,
  author =              {Boker, Udi and Lehtinen, Karoliina},
  title =               {History Determinism vs.~Good for Gameness in
                         Quantitative Automata},
  editor =              {Boja{\'n}czyk, Miko{\l}aj and Chekuri, Chandra},
  booktitle =           {{P}roceedings of the 41st {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'21)},
  acronym =             {{FSTTCS}'21},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {213},
  pages =               {38:1-38:20},
  year =                {2021},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2021.38},
}
[BL22] Udi Boker and Karoliina Lehtinen. Token Games and History-Deterministic Quantitative Automata. In FoSSaCS'22, Lecture Notes in Computer Science 13242, pages 120-139. Springer-Verlag, April 2022. 
@inproceedings{fossacs2022-BL,
  author =              {Boker, Udi and Lehtinen, Karoliina},
  title =               {Token Games and History-Deterministic Quantitative
                         Automata},
  editor =              {Bouyer, Patricia and Schr{\"o}der, Lutz},
  booktitle =           {{P}roceedings of the 25th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'22)},
  acronym =             {{FoSSaCS}'22},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {13242},
  pages =               {120-139},
  year =                {2022},
  month =               apr,
  doi =                 {10.1007/978-3-030-99253-8_7},
}
[BL23] Udi Boker and Karoliina Lehtinen. When a Little Nondeterminism Goes a Long Way: an Introduction to History-Determinism. SIGLOG News 35:24-51. ACM Press, January 2023. 
@article{siglog-news35()-BL,
  author =              {Boker, Udi and Lehtinen, Karoliina},
  title =               {When a Little Nondeterminism Goes a Long Way: an
                         Introduction to History-Determinism},
  publisher =           {ACM Press},
  journal =             {SIGLOG News},
  volume =              {35},
  pages =               {24-51},
  year =                {2023},
  month =               jan,
}
[Bla00] Patrick Blackburn. Representations, Reasoning and Relational Structures: a Hybrid Logic Manifesto. Logic Journal of the IGPL 8(3):339-365. Oxford University Press, May 2000. 
@article{jigpl8(3)-Bla,
  author =              {Blackburn, Patrick},
  title =               {Representations, Reasoning and Relational
                         Structures: a Hybrid Logic Manifesto},
  publisher =           {Oxford University Press},
  journal =             {Logic Journal of the IGPL},
  volume =              {8},
  number =              {3},
  pages =               {339-365},
  year =                {2000},
  month =               may,
}
[BLM07] Patricia Bouyer, Kim Guldstrand Larsen, and Nicolas Markey. Model Checking One-clock Priced Timed Automata. In FoSSaCS'07, Lecture Notes in Computer Science 4423, pages 108-122. Springer-Verlag, March 2007.
Abstract

We consider the model of priced (a.k.a. weighted) timed automata, an extension of timed automata with cost information on both locations and transitions. We prove that model-checking this class of models against the logic WCTL, CTL with cost-constrained modalities, is PSPACE-complete under the "single-clock" assumption. In contrast, it has been recently proved that the model-checking problem is undecidable for this model as soon as the system has three clocks. We also prove that the model-checking of WCTL becomes undecidable, even under this "single-clock" assumption.

@inproceedings{fossacs2007-BLM,
  author =              {Bouyer, Patricia and Larsen, Kim Guldstrand and
                         Markey, Nicolas},
  title =               {Model Checking One-clock Priced Timed Automata},
  editor =              {Seidl, Helmut},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'07)},
  acronym =             {{FoSSaCS}'07},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4423},
  pages =               {108-122},
  year =                {2007},
  month =               mar,
  doi =                 {10.1007/978-3-540-71389-0_9},
  abstract =            {We consider the model of priced (a.k.a.~weighted)
                         timed automata, an extension of timed automata with
                         cost information on both locations and transitions.
                         We prove that model-checking this class of models
                         against the logic~WCTL, CTL~with cost-constrained
                         modalities, is PSPACE-complete under the
                         {"}single-clock{"} assumption. In~contrast, it~has
                         been recently proved that the model-checking problem
                         is undecidable for this model as soon as the system
                         has three clocks. We also prove that the
                         model-checking of~WCTL becomes undecidable, even
                         under this {"}single-clock{"} assumption.},
}
[BLM08] Patricia Bouyer, Kim Guldstrand Larsen, and Nicolas Markey. Model Checking One-clock Priced Timed Automata. Logical Methods in Computer Science 4(2). May 2008.
Abstract

We consider the model of priced (a.k.a. weighted) timed automata, an extension of timed automata with cost information on both locations and transitions, and we study various model-checking problems for that model based on extensions of classical temporal logics with cost constraints on modalities. We prove that, under the assumption that the model has only one clock, model-checking this class of models against the logic WCTL, CTL with cost-constrained modalities, is PSPACE-complete (while it has been shown undecidable as soon as the model has three clocks). We also prove that model checking WMTL (LTL with cost-constrained modalities) is decidable only if there is a single clock in the model and a single stopwatch cost variable (i.e., whose slopes lie in {0,1}).

@article{lmcs4(2)-BLM,
  author =              {Bouyer, Patricia and Larsen, Kim Guldstrand and
                         Markey, Nicolas},
  title =               {Model Checking One-clock Priced Timed Automata},
  journal =             {Logical Methods in Computer Science},
  volume =              {4},
  number =              {2},
  year =                {2008},
  month =               may,
  doi =                 {10.2168/LMCS-4(2:9)2008},
  abstract =            {We consider the model of priced (a.k.a.~weighted)
                         timed automata, an extension of timed automata with
                         cost information on both locations and transitions,
                         and we study various model-checking problems for
                         that model based on extensions of classical temporal
                         logics with cost constraints on modalities. We prove
                         that, under the assumption that the model has only
                         one clock, model-checking this class of models
                         against the logic~WCTL, CTL with cost-constrained
                         modalities, is PSPACE-complete (while it has been
                         shown undecidable as soon as the model has three
                         clocks). We~also prove that model checking WMTL (LTL
                         with cost-constrained modalities) is decidable only
                         if there is a single clock in the model and a single
                         stopwatch cost variable (\textit{i.e.}, whose slopes
                         lie in~\(\{0,1\}\)).},
}
[BLM12] Patricia Bouyer, Kim Guldstrand Larsen, and Nicolas Markey. Lower-Bound Constrained Runs in Weighted Timed Automata. In QEST'12, pages 128-137. IEEE Comp. Soc. Press, September 2012.
Abstract

We investigate a number of problems related to infinite runs of weighted timed automata, subject to lower-bound constraints on the accumulated weight. Closing an open problem from [Bouyer et al., "Infinite runs in weighted timed automata with energy constraints", FORMATS'08], we show that the existence of an infinite lower-bound-constrained run is—for us somewhat unexpectedly—undecidable for weighted timed automata with four or more clocks.

This undecidability result assumes a fixed and know initial credit. We show that the related problem of existence of an initial credit for which there ex- ist a feasible run is decidable in PSPACE. We also investigate the variant of these problems where only bounded-duration runs are considered, showing that this restriction makes our original problem decidable in NEXPTIME. Finally, we prove that the universal versions of all those problems (i.e, checking that all the considered runs satisfy the lower-bound constraint) are decidable in PSPACE.

@inproceedings{qest2012-BLM,
  author =              {Bouyer, Patricia and Larsen, Kim Guldstrand and
                         Markey, Nicolas},
  title =               {Lower-Bound Constrained Runs in Weighted Timed
                         Automata},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference on {Q}uantitative {E}valuation of
                         {S}ystems ({QEST}'12)},
  acronym =             {{QEST}'12},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {128-137},
  year =                {2012},
  month =               sep,
  doi =                 {10.1109/QEST.2012.28},
  abstract =            {We investigate a number of problems related to
                         infinite runs of weighted timed automata, subject to
                         lower-bound constraints on the accumulated weight.
                         Closing an open problem from [Bouyer
                         \textit{et~al.}, {"}Infinite runs in weighted timed
                         automata with energy constraints{"}, FORMATS'08], we
                         show that the existence of an infinite
                         lower-bound-constrained run is---for us somewhat
                         unexpectedly---undecidable for weighted timed
                         automata with four or more clocks.\par This
                         undecidability result assumes a fixed and know
                         initial credit. We show that the related problem of
                         existence of an initial credit for which there ex-
                         ist a feasible run is decidable in PSPACE. We also
                         investigate the variant of these problems where only
                         bounded-duration runs are considered, showing that
                         this restriction makes our original problem
                         decidable in NEXPTIME. Finally, we prove that the
                         universal versions of all those problems (i.e,
                         checking that all the considered runs satisfy the
                         lower-bound constraint) are decidable in PSPACE.},
}
[BLM14] Patricia Bouyer, Kim Guldstrand Larsen, and Nicolas Markey. Lower-Bound Constrained Runs in Weighted Timed Automata. Performance Evaluation 73:91-109. Elsevier, March 2014.
Abstract

We investigate a number of problems related to infinite runs of weighted timed automata (with a single weight variable), subject to lower-bound constraints on the accumulated weight. Closing an open problem from an earlier paper, we show that the existence of an infinite lower-bound-constrained run is–for us somewhat unexpectedly–undecidable for weighted timed automata with four or more clocks.

This undecidability result assumes a fixed and known initial credit. We show that the related problem of existence of an initial credit for which there exists a feasible run is decidable in PSPACE. We also investigate the variant of these problems where only bounded-duration runs are considered, showing that this restriction makes our original problem decidable in NEXPTIME. We prove that the universal versions of all those problems (i.e, checking that all the considered runs satisfy the lower-bound constraint) are decidable in PSPACE.

Finally, we extend this study to multi-weighted timed automata: the existence of a feasible run becomes undecidable even for bounded duration, but the existence of initial credits remains decidable (in PSPACE).

@article{peva73()-BLM,
  author =              {Bouyer, Patricia and Larsen, Kim Guldstrand and
                         Markey, Nicolas},
  title =               {Lower-Bound Constrained Runs in Weighted Timed
                         Automata},
  publisher =           {Elsevier},
  journal =             {Performance Evaluation},
  volume =              {73},
  pages =               {91-109},
  year =                {2014},
  month =               mar,
  doi =                 {10.1016/j.peva.2013.11.002},
  abstract =            {We investigate a number of problems related to
                         infinite runs of weighted timed automata (with a
                         single weight variable), subject to lower-bound
                         constraints on the accumulated weight. Closing an
                         open problem from an earlier paper, we show that the
                         existence of an infinite lower-bound-constrained run
                         is--for us somewhat unexpectedly--undecidable for
                         weighted timed automata with four or more
                         clocks.\par This undecidability result assumes a
                         fixed and known initial credit. We show that the
                         related problem of existence of an initial credit
                         for which there exists a feasible run is decidable
                         in PSPACE. We also investigate the variant of these
                         problems where only bounded-duration runs are
                         considered, showing that this restriction makes our
                         original problem decidable in NEXPTIME. We prove
                         that the universal versions of all those problems
                         (i.e, checking that all the considered runs satisfy
                         the lower-bound constraint) are decidable in
                         PSPACE.\par Finally, we extend this study to
                         multi-weighted timed automata: the existence of a
                         feasible run becomes undecidable even for bounded
                         duration, but the existence of initial credits
                         remains decidable (in~PSPACE).},
}
[BLM+07] Thomas Brihaye, François Laroussinie, Nicolas Markey, and Ghassan Oreiby. Timed Concurrent Game Structures. In CONCUR'07, Lecture Notes in Computer Science 4703, pages 445-459. Springer-Verlag, September 2007.
Abstract

We propose a new model for timed games, based on concurrent game structures (CGSs). Compared to the classical timed game automata of Asarin et al., our timed CGSs are "more concurrent", in the sense that they always allow all the agents to act on the system, independently of the delay they want to elapse before their action. Timed CGSs weaken the "element of surprise" of timed game automata reported by de Alfaro et al.

We prove that our model has nice properties, in particular that model-checking timed CGSs against timed ATL is decidable via region abstraction, and in particular that strategies are "region-stable" if winning objectives are. We also propose a new extension of TATL, containing ATL*, which we call TALTL. We prove that model-checking this logic remains decidable on timed CGSs. Last, we explain how our algorithms can be adapted in order to rule out Zeno (co-)strategies, based on the ideas of Henzinger et al.

@inproceedings{concur2007-BLMO,
  author =              {Brihaye, {\relax Th}omas and Laroussinie, Fran{\c
                         c}ois and Markey, Nicolas and Oreiby, Ghassan},
  title =               {Timed Concurrent Game Structures},
  editor =              {Caires, Lu{\'\i}s and Vasconcelos, Vasco T.},
  booktitle =           {{P}roceedings of the 18th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'07)},
  acronym =             {{CONCUR}'07},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4703},
  pages =               {445-459},
  year =                {2007},
  month =               sep,
  doi =                 {10.1007/978-3-540-74407-8_30},
  abstract =            {We propose a new model for timed games, based on
                         concurrent game structures~(CGSs). Compared to the
                         classical \emph{timed game automata} of~Asarin
                         \emph{et~al.}, our timed~CGSs are {"}more
                         concurrent{"}, in the sense that they always allow
                         all the agents to act on the system, independently
                         of the delay they want to elapse before their
                         action. Timed CGSs weaken the {"}element of
                         surprise{"} of timed game automata reported by
                         de~Alfaro \emph{et~al.}\par We prove that our model
                         has nice properties, in particular that
                         model-checking timed CGSs against timed
                         \(\textsf{ATL}\) is decidable \emph{via} region
                         abstraction, and in particular that strategies are
                         {"}region-stable{"} if winning objectives are. We
                         also propose a new extension of \(\textsf{TATL}\),
                         containing~\(\textsf{ATL}^{*}\), which we
                         call~\(\textsf{TALTL}\). We~prove that
                         model-checking this logic remains decidable on timed
                         CGSs. Last, we explain how our algorithms can be
                         adapted in order to rule out Zeno (co-)strategies,
                         based on the ideas of Henzinger \emph{et~al.}},
}
[BLM+17] Patricia Bouyer, François Laroussinie, Nicolas Markey, Joël Ouaknine, and James Worrell. Timed temporal logics. In Luca Aceto, Giorgio Bacci, Giovanni Bacci, Anna Ingólfsdóttir, Axel Legay, and Radu Mardare (eds.), Models, Algorithms, Logics and Tools: Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday, Lecture Notes in Computer Science 10460, pages 211-230. Springer-Verlag, August 2017.
Abstract

Since the early 1990's, classical temporal logics have been extended with timing constraints. While temporal logics only express contraints on the order of events, their timed extensions can add quantitative constraints on delays between those events. We survey expressiveness and algorithmic results on those logics, and discuss semantic choices that may look unimportant but do have an impact on the questions we consider.

@incollection{kimfest2017-BLMOW,
  author =              {Bouyer, Patricia and Laroussinie, Fran{\c c}ois and
                         Markey, Nicolas and Ouaknine, Jo{\"e}l and Worrell,
                         James},
  title =               {Timed temporal logics},
  editor =              {Aceto, Luca and Bacci, Giorgio and Bacci, Giovanni
                         and Ing{\'o}lfsd{\'o}ttir, Anna and Legay, Axel and
                         Mardare, Radu},
  booktitle =           {Models, Algorithms, Logics and Tools: Essays
                         Dedicated to Kim Guldstrand Larsen on the Occasion
                         of His 60th Birthday},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {10460},
  pages =               {211-230},
  year =                {2017},
  month =               aug,
  doi =                 {10.1007/978-3-319-63121-9_11},
  abstract =            {Since the early 1990's, classical temporal logics
                         have been extended with timing constraints. While
                         temporal logics only express contraints on the order
                         of events, their timed extensions can add
                         quantitative constraints on delays between those
                         events. We survey expressiveness and algorithmic
                         results on those logics, and discuss semantic
                         choices that may look unimportant but do have an
                         impact on the questions we consider.},
}
[BLM+06] Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey, and Jacob Illum Rasmussen. Almost Optimal Strategies in One-Clock Priced Timed Automata. In FSTTCS'06, Lecture Notes in Computer Science 4337, pages 345-356. Springer-Verlag, December 2006.
Abstract

We consider timed games extended with cost information, and prove computability of the optimal cost and of ε-optimal memoryless strategies in timed games with one clock. In contrast, this problem has recently been proved undecidable for timed games with three clocks.

@inproceedings{fsttcs2006-BLMR,
  author =              {Bouyer, Patricia and Larsen, Kim Guldstrand and
                         Markey, Nicolas and Rasmussen, Jacob Illum},
  title =               {Almost Optimal Strategies in One-Clock Priced Timed
                         Automata},
  editor =              {Arun-Kumar, S. and Garg, Naveen},
  booktitle =           {{P}roceedings of the 26th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'06)},
  acronym =             {{FSTTCS}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4337},
  pages =               {345-356},
  year =                {2006},
  month =               dec,
  doi =                 {10.1007/11944836_32},
  abstract =            {We consider timed games extended with cost
                         information, and prove computability of the optimal
                         cost and of \(\epsilon\)-optimal memoryless
                         strategies in timed games with one~clock.
                         In~contrast, this problem has recently been proved
                         undecidable for timed games with three clocks.},
}
[BLM+97] David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, and Sven Skyum. On Uniformity Within NC1. Research Report 97-044, Electronic Colloquium on Computational Complexity, September 1997. 
@techreport{eccc1997-BLMS,
  author =              {Barrington, David A. Mix and Lu, Chi-Jen and
                         Miltersen, Peter Bro and Skyum, Sven},
  title =               {On Uniformity Within {{\(\mathit{NC}^1\)}}},
  number =              {97-044},
  year =                {1997},
  month =               sep,
  institution =         {Electronic Colloquium on Computational Complexity},
  type =                {Research Report},
}
[BLM+11] Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey, Ocan Sankur, and Claus Thrane. Timed automata can always be made implementable. In CONCUR'11, Lecture Notes in Computer Science 6901, pages 76-91. Springer-Verlag, September 2011.
Abstract

Timed automata follow a mathematical semantics, which assumes perfect precision and synchrony of clocks. Since this hypothesis does not hold in digital systems, properties proven formally on a timed automaton may be lost at implementation. In order to ensure implementability, several approaches have been considered, corresponding to different hypotheses on the implementation platform. We address two of these: a timed automaton is samplable if its semantics is preserved under a discretization of time; it is robust if its semantics is preserved when all timing constraints are relaxed by some small positive parameter. We propose a construction which makes timed automata implementable in the above sense: From any timed automaton A, we build a timed automaton A' that exhibits the same behaviour as A, and moreover is both robust and samplable by construction.

@inproceedings{concur2011-BLMST,
  author =              {Bouyer, Patricia and Larsen, Kim Guldstrand and
                         Markey, Nicolas and Sankur, Ocan and Thrane, Claus},
  title =               {Timed automata can always be made implementable},
  editor =              {Katoen, Joost-Pieter and K{\"o}nig, Barbara},
  booktitle =           {{P}roceedings of the 22nd {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'11)},
  acronym =             {{CONCUR}'11},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6901},
  pages =               {76-91},
  year =                {2011},
  month =               sep,
  doi =                 {10.1007/978-3-642-23217-6_6},
  abstract =            {Timed automata follow a mathematical semantics,
                         which assumes perfect precision and synchrony of
                         clocks. Since this hypothesis does not hold in
                         digital systems, properties proven formally on a
                         timed automaton may be lost at implementation. In
                         order to ensure implementability, several approaches
                         have been considered, corresponding to different
                         hypotheses on the implementation platform. We
                         address two of these: a~timed automaton is samplable
                         if its semantics is preserved under a discretization
                         of time; it is robust if its semantics is preserved
                         when all timing constraints are relaxed by some
                         small positive parameter. We propose a construction
                         which makes timed automata implementable in the
                         above sense: From any timed
                         automaton~\(\mathcal{A}\), we build a timed
                         automaton~\(\mathcal{A}'\) that exhibits the same
                         behaviour as~\(\mathcal{A}\), and moreover is both
                         robust and samplable by construction.},
}
[BLN03] Dirk Beyer, Claus Lewerentz, and Andreas Noack. Rabbit: A Tool for BDD-Based Verification of Real-Time Systems. In CAV'03, Lecture Notes in Computer Science 2725, pages 122-125. Springer-Verlag, July 2003. 
@inproceedings{cav2003-BLN,
  author =              {Beyer, Dirk and Lewerentz, Claus and Noack, Andreas},
  title =               {Rabbit: A~Tool for {BDD}-Based Verification of
                         Real-Time Systems},
  editor =              {Hunt, Jr, Warren A. and Somenzi, Fabio},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'03)},
  acronym =             {{CAV}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2725},
  pages =               {122-125},
  year =                {2003},
  month =               jul,
  doi =                 {10.1007/978-3-540-45069-6_13},
}
[Blo93] Johannes Blömer. Computing Sums of Radicals in Polynomial Time. Technical Report B93-13, Department of Computer Science, University of Paderborn, Germany, August 1993. 
@techreport{UPad-B93-13-Blo,
  author =              {Bl{\"o}mer, Johannes},
  title =               {Computing Sums of Radicals in Polynomial Time},
  number =              {B93-13},
  year =                {1993},
  month =               aug,
  institution =         {Department of Computer Science, University of
                         Paderborn, Germany},
}
[BLP03] Gerd Behrmann, Kim Guldstrand Larsen, and Radek Pelánek. To Store or not to Store. In CAV'03, Lecture Notes in Computer Science 2725, pages 433-445. Springer-Verlag, July 2003. 
@inproceedings{cav2003-BLP,
  author =              {Behrmann, Gerd and Larsen, Kim Guldstrand and
                         Pel{\'a}nek, Radek},
  title =               {To Store or not to Store},
  editor =              {Hunt, Jr, Warren A. and Somenzi, Fabio},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'03)},
  acronym =             {{CAV}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2725},
  pages =               {433-445},
  year =                {2003},
  month =               jul,
}
[BLP+98] Gerd Behrmann, Kim Guldstrand Larsen, Justin Pearson, Carsten Weise, and Wang Yi. Efficient Timed Reachability Analysis using Clock Difference Diagrams. Research Report RS-98-47, Basic Research in Computer Science, Aalborg University, Denmark, December 1998. 
@techreport{TR-brics9847,
  author =              {Behrmann, Gerd and Larsen, Kim Guldstrand and
                         Pearson, Justin and Weise, Carsten and Yi, Wang},
  title =               {Efficient Timed Reachability Analysis using Clock
                         Difference Diagrams},
  number =              {RS-98-47},
  year =                {1998},
  month =               dec,
  institution =         {Basic Research in Computer Science, Aalborg
                         University, Denmark},
  type =                {Research Report},
}
[BLP+99] Gerd Behrmann, Kim Guldstrand Larsen, Justin Pearson, Carsten Weise, and Wang Yi. Efficient Timed Reachability Analysis using Clock Difference Diagrams. In CAV'99, Lecture Notes in Computer Science 1633, pages 341-353. Springer-Verlag, July 1999. 
@inproceedings{cav1999-BLPWY,
  author =              {Behrmann, Gerd and Larsen, Kim Guldstrand and
                         Pearson, Justin and Weise, Carsten and Yi, Wang},
  title =               {Efficient Timed Reachability Analysis using Clock
                         Difference Diagrams},
  editor =              {Halbwachs, Nicolas and Peled, Doron A.},
  booktitle =           {{P}roceedings of the 11th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'99)},
  acronym =             {{CAV}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1633},
  pages =               {341-353},
  year =                {1999},
  month =               jul,
}
[BLR05] Patricia Bouyer, François Laroussinie, and Pierre-Alain Reynier. Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems. In FORMATS'05, Lecture Notes in Computer Science 3829, pages 112-126. Springer-Verlag, September 2005. 
@inproceedings{formats2005-BLR,
  author =              {Bouyer, Patricia and Laroussinie, Fran{\c c}ois and
                         Reynier, Pierre-Alain},
  title =               {Diagonal Constraints in Timed Automata: Forward
                         Analysis of Timed Systems},
  editor =              {Pettersson, Paul and Yi, Wang},
  booktitle =           {{P}roceedings of the 3rd {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'05)},
  acronym =             {{FORMATS}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3829},
  pages =               {112-126},
  year =                {2005},
  month =               sep,
  doi =                 {10.1007/11603009_10},
}
[BLR05] Gerd Behrmann, Kim Guldstrand Larsen, and Jacob Illum Rasmussen. Optimal scheduling using priced timed automata. SIGMETRICS Performance Evaluation Review 32(4):34-40. March 2005. 
@article{SIGper32(4)-BLR,
  author =              {Behrmann, Gerd and Larsen, Kim Guldstrand and
                         Rasmussen, Jacob Illum},
  title =               {Optimal scheduling using priced timed automata},
  journal =             {SIGMETRICS Performance Evaluation Review},
  volume =              {32},
  number =              {4},
  pages =               {34-40},
  year =                {2005},
  month =               mar,
}
[BLS22] Udi Boker, Karoliina Lehtinen, and Salomon Sickert. On the Translation of Automata to Linear Temporal Logic. In FoSSaCS'22, Lecture Notes in Computer Science 13242, pages 140-160. Springer-Verlag, April 2022. 
@inproceedings{fossacs2022-BLS,
  author =              {Boker, Udi and Lehtinen, Karoliina and Sickert,
                         Salomon},
  title =               {On the Translation of Automata to Linear Temporal
                         Logic},
  editor =              {Bouyer, Patricia and Schr{\"o}der, Lutz},
  booktitle =           {{P}roceedings of the 25th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'22)},
  acronym =             {{FoSSaCS}'22},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {13242},
  pages =               {140-160},
  year =                {2022},
  month =               apr,
  doi =                 {10.1007/978-3-030-99253-8_8},
}
[BLW01] Benedikt Bollig, Martin Leucker, and Michael Weber. Local Parallel Model Checking for the Alternation Free μ-Calculus. Technical Report AIB-2001-04, Aachener Informatik Berichte, Aachen, Germany, March 2001. 
@techreport{TR-Aachen0104,
  author =              {Bollig, Benedikt and Leucker, Martin and Weber,
                         Michael},
  title =               {Local Parallel Model Checking for the Alternation
                         Free {\(\mu\)}-Calculus},
  number =              {AIB-2001-04},
  year =                {2001},
  month =               mar,
  institution =         {Aachener Informatik Berichte, Aachen, Germany},
  type =                {Technical Report},
}
[BM83] Bernard Berthomieu and Miguel Menasche. An Enumerative Approach for Analyzing Time Petri Nets. In WCC'83, pages 41-46. North-Holland/IFIP, September 1983. 
@inproceedings{ifipwcc1983-BM,
  author =              {Berthomieu, Bernard and Menasche, Miguel},
  title =               {An Enumerative Approach for Analyzing Time {P}etri
                         Nets},
  editor =              {Mason, R. E. A.},
  booktitle =           {{I}nformation {P}rocessing~83~-- {P}roceedings of
                         the 9th {IFIP} {W}orld {C}omputer {C}ongress
                         ({WCC}'83)},
  acronym =             {{WCC}'83},
  publisher =           {North-Holland/IFIP},
  pages =               {41-46},
  year =                {1983},
  month =               sep,
}
[BM95] Michael S. Branicky and Sanjoy K. Mitter. Algorithms for Optimal Hybrid Control. In CDC'95, pages 2661-2666. IEEE Comp. Soc. Press, December 1995. 
@inproceedings{cdc1995-BM,
  author =              {Branicky, Michael S. and Mitter, Sanjoy K.},
  title =               {Algorithms for Optimal Hybrid Control},
  booktitle =           {{P}roceedings of the 34th {IEEE} {C}onference on
                         {D}ecision and {C}ontrol ({CDC}'95)},
  acronym =             {{CDC}'95},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {2661-2666},
  year =                {1995},
  month =               dec,
}
[BM00] Ed Brinksma and Angelika Mader. Verification and Optimization of a PLC Control Schedule. In SPIN'00, Lecture Notes in Computer Science 1885, pages 73-92. Springer-Verlag, August 2000. 
@inproceedings{spin2000-BM,
  author =              {Brinksma, Ed and Mader, Angelika},
  title =               {Verification and Optimization of a {PLC} Control
                         Schedule},
  editor =              {Havelund, Klaus and Penix, John and Viser, Willem},
  booktitle =           {{P}roceedings of the 7th {I}nternational {SPIN}
                         {W}orkshop ({SPIN}'00)},
  acronym =             {{SPIN}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1885},
  pages =               {73-92},
  year =                {2000},
  month =               aug,
}
[BM07] Patricia Bouyer and Nicolas Markey. Costs are Expensive!. In FORMATS'07, Lecture Notes in Computer Science 4763, pages 53-68. Springer-Verlag, October 2007.
Abstract

We study the model-checking problem for WMTL, a cost-extension of the linear-time timed temporal logic MTL, that is interpreted over weighted timed automata. We draw a complete picture of the decidability for that problem: it is decidable only for the class of one-clock weighted timed automata with a restricted stopwatch cost, and any slight extension of this model leads to undecidability. We finally give some consequences on the undecidability of linear hybrid automata.

@inproceedings{formats2007-BM,
  author =              {Bouyer, Patricia and Markey, Nicolas},
  title =               {Costs are Expensive!},
  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 =               {53-68},
  year =                {2007},
  month =               oct,
  doi =                 {10.1007/978-3-540-75454-1_6},
  abstract =            {We study the model-checking problem for WMTL,
                         a~cost-extension of the linear-time timed temporal
                         logic MTL, that is interpreted over weighted timed
                         automata. We~draw a complete picture of the
                         decidability for that problem: it~is decidable only
                         for the class of one-clock weighted timed automata
                         with a restricted stopwatch cost, and any slight
                         extension of this model leads to undecidability.
                         We~finally give some consequences on the
                         undecidability of linear hybrid automata.},
}
[BM09] Costas Busch and Malik Magdon-Ismail. Atomic routing games on maximum congestion. Theoretical Computer Science 410(36):3337-3347. Elsevier, August 2009. 
@article{tcs410(36)-BMI,
  author =              {Busch, Costas and Magdon{-}Ismail, Malik},
  title =               {Atomic routing games on maximum congestion},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {410},
  number =              {36},
  pages =               {3337-3347},
  year =                {2009},
  month =               aug,
  doi =                 {10.1016/j.tcs.2009.04.015},
}
[BMF02] Ed Brinksma, Angelika Mader, and Ansgar Fehnker. Verification and Optimization of a PLC Control Schedule. International Journal on Software Tools for Technology Transfer 4(1):21-33. Springer-Verlag, 2002. 
@article{sttt4(1)-BMF,
  author =              {Brinksma, Ed and Mader, Angelika and Fehnker,
                         Ansgar},
  title =               {Verification and Optimization of a {PLC} Control
                         Schedule},
  publisher =           {Springer-Verlag},
  journal =             {International Journal on Software Tools for
                         Technology Transfer},
  volume =              {4},
  number =              {1},
  pages =               {21-33},
  year =                {2002},
}
[BMM14] Patricia Bouyer, Nicolas Markey, and Raj Mohan Matteplackel. Averaging in LTL. In CONCUR'14, Lecture Notes in Computer Science 8704, pages 266-280. Springer-Verlag, September 2014.
Abstract

For the accurate analysis of computerized systems, powerful quantitative formalisms have been designed, together with efficient verification algorithms. However, verification has mostly remained boolean—either a property is true, or it is false. We believe that this is too crude in a context where quantitative information and constraints are crucial: correctness should be quantified!

In a recent line of works, several authors have proposed quantitative semantics for temporal logics, using e.g. discounting modalities (which give less importance to distant events). In the present paper, we define and study a quantitative semantics of LTL with averaging modalities, either on the long run or within an until modality. This, in a way, relaxes the classical Boolean semantics of LTL, and provides a measure of certain properties of a model. We prove that computing and even approximating the value of a formula in this logic is undecidable.

@inproceedings{concur2014-BMM,
  author =              {Bouyer, Patricia and Markey, Nicolas and
                         Matteplackel, Raj~Mohan},
  title =               {Averaging in~{LTL}},
  editor =              {Baldan, Paolo and Gorla, Daniele},
  booktitle =           {{P}roceedings of the 25th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'14)},
  acronym =             {{CONCUR}'14},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8704},
  pages =               {266-280},
  year =                {2014},
  month =               sep,
  doi =                 {10.1007/978-3-662-44584-6_19},
  abstract =            {For the accurate analysis of computerized systems,
                         powerful quantitative formalisms have been designed,
                         together with efficient verification algorithms.
                         However, verification has mostly remained
                         boolean---either a property is~true, or it~is false.
                         We~believe that this is too crude in a context where
                         quantitative information and constraints are
                         crucial: correctness should be quantified!\par In a
                         recent line of works, several authors have proposed
                         quantitative semantics for temporal logics, using
                         e.g. \emph{discounting} modalities (which give less
                         importance to distant events). In~the present paper,
                         we define and study a quantitative semantics of~LTL
                         with \emph{averaging} modalities, either on the long
                         run or within an until modality. This, in a way,
                         relaxes the classical Boolean semantics of~LTL, and
                         provides a measure of certain properties of a model.
                         We~prove that computing and even approximating the
                         value of a formula in this logic is undecidable.},
}
[BMM17] Raphaël Berthon, Bastien Maubert, and Aniello Murano. Decidability Results for ATL* with Imperfect Information and Perfect Recall. In AAMAS'17, pages 1250-1258. International Foundation for Autonomous Agents and Multiagent Systems, May 2017. 
@inproceedings{aamas2017-BMM,
  author =              {Berthon, Rapha{\"e}l and Maubert, Bastien and
                         Murano, Aniello},
  title =               {Decidability Results for {ATL\textsuperscript{*}}
                         with Imperfect Information and Perfect Recall},
  editor =              {Das, Sanmay and Durfee, Ed and Larson, Kate and
                         Winikoff, Michael},
  booktitle =           {{P}roceedings of the 16th {I}nternational
                         {C}onference on {A}utonomous {A}gents and
                         {M}ultiagent {S}ystems ({AAMAS}'17)},
  acronym =             {{AAMAS}'17},
  publisher =           {International Foundation for Autonomous Agents and
                         Multiagent Systems},
  pages =               {1250-1258},
  year =                {2017},
  month =               may,
}
[BMM+17] Raphaël Berthon, Bastien Maubert, Aniello Murano, Sasha Rubin, and Moshe Y. Vardi. Strategy Logic with Imperfect Information. In LICS'17, pages 1-12. IEEE Comp. Soc. Press, June 2017. 
@inproceedings{lics2017-BMMRV,
  author =              {Berthon, Rapha{\"e}l and Maubert, Bastien and
                         Murano, Aniello and Rubin, Sasha and Vardi, Moshe
                         Y.},
  title =               {Strategy Logic with Imperfect Information},
  booktitle =           {{P}roceedings of the 32nd {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'17)},
  acronym =             {{LICS}'17},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {1-12},
  year =                {2017},
  month =               jun,
  doi =                 {10.1109/LICS.2017.8005136},
}
[BMM+00] Jean-Camille Birget, Stuart W. Margolis, John C. Meakin, and Pascal Weil. PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups. Theoretical Computer Science 242(1-2):247-281. Elsevier, July 2000. 
@article{tcs242(1-2)-BMMW,
  author =              {Birget, Jean-Camille and Margolis, Stuart W. and
                         Meakin, John C. and Weil, Pascal},
  title =               {{PSPACE}-Completeness of Certain Algorithmic
                         Problems on the Subgroups of Free Groups},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {242},
  number =              {1-2},
  pages =               {247-281},
  year =                {2000},
  month =               jul,
}
[BMO+08] Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, and James Worrell. On Termination for Faulty Channel Machines. In STACS'08, Leibniz International Proceedings in Informatics 1, pages 121-132. Leibniz-Zentrum für Informatik, February 2008.
Abstract

A channel machine consists of a finite controller together with several fifo channels; the controller can read messages from the head of a channel and write messages to the tail of a channel. In this paper, we focus on channel machines with insertion errors, i.e., machines in whose channels messages can spontaneously appear. Such devices have been previously introduced in the study of Metric Temporal Logic. We consider the termination problem: are all the computations of a given insertion channel machine finite? We show that this problem has non-elementary, yet primitive recursive complexity.

@inproceedings{stacs2008-BMOSW,
  author =              {Bouyer, Patricia and Markey, Nicolas and Ouaknine,
                         Jo{\"e}l and Schnoebelen, {\relax Ph}ilippe and
                         Worrell, James},
  title =               {On Termination for Faulty Channel Machines},
  editor =              {Albers, Susanne and Weil, Pascal},
  booktitle =           {{P}roceedings of the 25th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'08)},
  acronym =             {{STACS}'08},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {1},
  pages =               {121-132},
  year =                {2008},
  month =               feb,
  doi =                 {10.4230/LIPIcs.STACS.2008.1339},
  abstract =            {A channel machine consists of a finite controller
                         together with several fifo channels; the controller
                         can read messages from the head of a channel and
                         write messages to the tail of a channel. In this
                         paper, we focus on channel machines with
                         \emph{insertion errors}, \textit{i.e.}, machines in
                         whose channels messages can spontaneously appear.
                         Such devices have been previously introduced in the
                         study of Metric Temporal Logic. We~consider the
                         termination problem: are all the computations of a
                         given insertion channel machine finite? We~show that
                         this problem has non-elementary, yet primitive
                         recursive complexity.},
}
[BMO+12] Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, and James Worrell. On Termination and Invariance for Faulty Channel Systems. Formal Aspects of Computing 24(4-6):595-607. Springer-Verlag, July 2012.
Abstract

A channel machine consists of a finite controller together with several fifo channels; the controller can read messages from the head of a channel and write messages to the tail of a channel. In this paper we focus on channel machines with insertion errors, i.e., machines in whose channels messages can spontaneously appear. We consider the invariance problem: does a given insertion channel machine have an infinite computation all of whose configurations satisfy a given predicate? We show that this problem is primitive-recursive if the predicate is closed under message losses. We also give a non-elementary lower bound for the invariance problem under this restriction. Finally, using the previous result, we show that the satisfiability problem for the safety fragment of Metric Temporal Logic is non-elementary.

@article{fac24(4-6)-BMOSW,
  author =              {Bouyer, Patricia and Markey, Nicolas and Ouaknine,
                         Jo{\"e}l and Schnoebelen, {\relax Ph}ilippe and
                         Worrell, James},
  title =               {On Termination and Invariance for Faulty Channel
                         Systems},
  publisher =           {Springer-Verlag},
  journal =             {Formal Aspects of Computing},
  volume =              {24},
  number =              {4-6},
  pages =               {595-607},
  year =                {2012},
  month =               jul,
  doi =                 {10.1007/s00165-012-0234-7},
  abstract =            {A~\emph{channel machine} consists of a finite
                         controller together with several fifo channels; the
                         controller can read messages from the head of a
                         channel and write messages to the tail of a channel.
                         In this paper we focus on channel machines with
                         \emph{insertion errors}, i.e., machines in whose
                         channels messages can spontaneously appear. We
                         consider the invariance problem: does a given
                         insertion channel machine have an infinite
                         computation all of whose configurations satisfy a
                         given predicate? We show that this problem is
                         primitive-recursive if the predicate is closed under
                         message losses. We also give a non-elementary lower
                         bound for the invariance problem under this
                         restriction. Finally, using the previous result, we
                         show that the satisfiability problem for the safety
                         fragment of Metric Temporal Logic is
                         non-elementary.},
}
[BMO+11] Patricia Bouyer, Nicolas Markey, Jörg Olschewski, and Michael Ummels. Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited. In ATVA'11, Lecture Notes in Computer Science 6996, pages 135-149. Springer-Verlag, October 2011.
Abstract

We study nondeterministic strategies in parity games with the aim of computing a most permissive winning strategy. Following earlier work, we measure permissiveness in terms of the average number/weight of transitions blocked by a strategy. Using a translation into mean-payoff parity games, we prove that deciding (the permissiveness of) a most permissive winning strategy is in NP∩coNP. Along the way, we provide a new study of mean-payoff parity games. In particular, we give a new algorithm for solving these games, which beats all previously known algorithms for this problem.

@inproceedings{atva2011-BMOU,
  author =              {Bouyer, Patricia and Markey, Nicolas and Olschewski,
                         J{\"o}rg and Ummels, Michael},
  title =               {Measuring Permissiveness in Parity Games:
                         Mean-Payoff Parity Games Revisited},
  editor =              {Bultan, Tevfik and Hsiung, Pao-Ann},
  booktitle =           {{P}roceedings of the 9th {I}nternational {S}ymposium
                         on {A}utomated {T}echnology for {V}erification and
                         {A}nalysis ({ATVA}'11)},
  acronym =             {{ATVA}'11},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6996},
  pages =               {135-149},
  year =                {2011},
  month =               oct,
  doi =                 {10.1007/978-3-642-24372-1_11},
  abstract =            {We study nondeterministic strategies in parity games
                         with the aim of computing a most permissive winning
                         strategy. Following earlier work, we measure
                         permissiveness in terms of the average
                         number{\slash}weight of transitions blocked by a
                         strategy. Using a translation into mean-payoff
                         parity games, we prove that deciding (the
                         permissiveness~of) a~most permissive winning
                         strategy is in \(\textsf{NP}\cap\textsf{coNP}\).
                         Along the way, we~provide a new study of mean-payoff
                         parity games. In particular, we give a new algorithm
                         for solving these games, which beats all previously
                         known algorithms for this problem.},
}
[BMO+07] Patricia Bouyer, Nicolas Markey, Joël Ouaknine, and James Worrell. The Cost of Punctuality. In LICS'07, pages 109-118. IEEE Comp. Soc. Press, July 2007.
Abstract

In an influential paper titled "The Benefits of Relaxing Punctuality", Alur, Feder, and Henzinger introduced Metric Interval Temporal Logic (MITL) as a fragment of the real-time logic Metric Temporal Logic (MTL) in which exact or punctual timing constraints are banned. Their main result showed that model checking and satisfiability for MITL are both EXPSPACE-Complete.

Until recently, it was widely believed that admitting even the simplest punctual specifications in any linear-time temporal logic would automatically lead to undecidability. Although this was recently disproved, until now no punctual fragment of MTL was known to have even primitive recursive complexity (with certain decidable fragments having provably non-primitive recursive complexity).

In this paper we identify a `co-flat' subset of MTL that is capable of expressing a large class of punctual specifications and for which model checking (although not satisfiability) has no complexity cost over MITL. Our logic is moreover qualitatively different from MITL in that it can express properties that are not timed-regular. Correspondingly, our decision procedures do not involve translating formulas into finite-state automata, but rather into certain kinds of reversal-bounded Turing machines. Using this translation we show that the model checking problem for our logic is EXPSPACE-Complete, and is even PSPACE-Complete if timing constraints are encoded in unary.

@inproceedings{lics2007-BMOW,
  author =              {Bouyer, Patricia and Markey, Nicolas and Ouaknine,
                         Jo{\"e}l and Worrell, James},
  title =               {The Cost of Punctuality},
  booktitle =           {{P}roceedings of the 22nd {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'07)},
  acronym =             {{LICS}'07},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {109-118},
  year =                {2007},
  month =               jul,
  doi =                 {10.1109/LICS.2007.49},
  abstract =            {In an influential paper titled {"}The Benefits of
                         Relaxing Punctuality{"}, Alur, Feder, and~Henzinger
                         introduced Metric Interval Temporal Logic~(MITL) as
                         a fragment of the real-time logic Metric Temporal
                         Logic~(MTL) in which exact or punctual timing
                         constraints are banned. Their main result showed
                         that model checking and satisfiability for~MITL are
                         both EXPSPACE-Complete.\par Until recently, it was
                         widely believed that admitting even the simplest
                         punctual specifications in any linear-time temporal
                         logic would automatically lead to undecidability.
                         Although this was recently disproved, until now no
                         punctual fragment of~MTL was known to have even
                         primitive recursive complexity (with certain
                         decidable fragments having provably non-primitive
                         recursive complexity).\par In this paper we identify
                         a `co-flat' subset of~MTL that is capable of
                         expressing a large class of punctual specifications
                         and for which model checking (although not
                         satisfiability) has no complexity cost over~MITL.
                         Our logic is moreover qualitatively different
                         from~MITL in that it can express properties that are
                         not timed-regular. Correspondingly, our decision
                         procedures do not involve translating formulas into
                         finite-state automata, but rather into certain kinds
                         of reversal-bounded Turing machines. Using this
                         translation we show that the model checking problem
                         for our logic is EXPSPACE-Complete, and is even
                         PSPACE-Complete if timing constraints are encoded in
                         unary.},
}
[BMO+08] Patricia Bouyer, Nicolas Markey, Joël Ouaknine, and James Worrell. On Expressiveness and Complexity in Real-time Model Checking. In ICALP'08, Lecture Notes in Computer Science 5126, pages 124-135. Springer-Verlag, July 2008.
Abstract

Metric Interval Temporal Logic (MITL) is a popular formalism for expressing real-time specifications. This logic achieves decidability by restricting the precision of timing constraints, in particular, by banning so-called punctual specifications. In this paper we introduce a significantly more expressive logic that can express a wide variety of punctual specifications, but whose model-checking problem has the same complexity as that of MITL. We conclude that for model checking the most commonly occurring specifications, such as invariance and bounded response, punctuality can be accommodated at no cost.

@inproceedings{icalp2008-BMOW,
  author =              {Bouyer, Patricia and Markey, Nicolas and Ouaknine,
                         Jo{\"e}l and Worrell, James},
  title =               {On Expressiveness and Complexity in Real-time Model
                         Checking},
  editor =              {Aceto, Luca and Damg{\aa}rd, Ivan and Goldberg,
                         Leslie Ann and Halld{\'o}rsson, Magn{\'u}s M. and
                         Ing{\'o}lfsd{\'o}ttir, Anna and Walukiewicz, Igor},
  booktitle =           {{P}roceedings of the 35th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'08)~-- Part~{II}},
  acronym =             {{ICALP}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5126},
  pages =               {124-135},
  year =                {2008},
  month =               jul,
  doi =                 {10.1007/978-3-540-70583-3_11},
  abstract =            {Metric Interval Temporal Logic (MITL) is a popular
                         formalism for expressing real-time specifications.
                         This logic achieves decidability by restricting the
                         precision of timing constraints, in particular, by
                         banning so-called \emph{punctual} specifications.
                         In~this paper we~introduce a significantly more
                         expressive logic that can express a wide variety of
                         punctual specifications, but whose model-checking
                         problem has the same complexity as that of~MITL.
                         We~conclude that for model checking the most
                         commonly occurring specifications, such as
                         invariance and bounded response, punctuality can be
                         accommodated at no cost.},
}
[BMP10] Laura Bozzelli, Aniello Murano, and Adriano Peron. Pushdown module checking. Formal Methods in System Design 36(1):65-95. Springer-Verlag, February 2010. 
@article{fmsd36(1)-BMP,
  author =              {Bozzelli, Laura and Murano, Aniello and Peron,
                         Adriano},
  title =               {Pushdown module checking},
  publisher =           {Springer-Verlag},
  journal =             {Formal Methods in System Design},
  volume =              {36},
  number =              {1},
  pages =               {65-95},
  year =                {2010},
  month =               feb,
}
[BMP+15] Patricia Bouyer, Nicolas Markey, Nicolas Perrin, and Philipp Schlehuber-Caissier. Timed automata abstraction of switched dynamical systems using control funnels. In FORMATS'15, Lecture Notes in Computer Science 9268, pages 60-75. Springer-Verlag, September 2015.
Abstract

The development of formal methods for control design is an important challenge with potential applications in a wide range of safety-critical cyber-physical systems. Focusing on switched dynamical systems, we propose a new abstraction, based on time-varying regions of invariance (the control funnels), that models behaviors of systems as timed automata. The main advantage of this method is that it allows automated verification of formal specifications and reactive controller synthesis without discretizing the evolution of the state of the system. Efficient constructions are possible in the case of linear dynamics. We demonstrate the potential of our approach with two examples.

@inproceedings{formats2015-BMPS,
  author =              {Bouyer, Patricia and Markey, Nicolas and Perrin,
                         Nicolas and Schlehuber{-}Caissier, Philipp},
  title =               {Timed automata abstraction of switched dynamical
                         systems using control funnels},
  editor =              {Sankaranarayanan, Sriram and Vicario, Enrico},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'15)},
  acronym =             {{FORMATS}'15},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9268},
  pages =               {60-75},
  year =                {2015},
  month =               sep,
  doi =                 {10.1007/978-3-319-22975-1_5},
  abstract =            {The~development of formal methods for control design
                         is an important challenge with potential
                         applications in a wide range of safety-critical
                         cyber-physical systems. Focusing on switched
                         dynamical systems, we~propose a new abstraction,
                         based on time-varying regions of invariance
                         (the~\emph{control funnels}), that models behaviors
                         of systems as timed automata. The main advantage of
                         this method is that it allows automated verification
                         of formal specifications and reactive controller
                         synthesis without discretizing the evolution of the
                         state of the system. Efficient constructions are
                         possible in the case of linear dynamics.
                         We~demonstrate the potential of our approach with
                         two examples.},
}
[BMP+17] Patricia Bouyer, Nicolas Markey, Nicolas Perrin, and Philipp Schlehuber-Caissier. Timed automata abstraction of switched dynamical systems using control funnels. Real-Time Systems 53(3):327-353. Kluwer Academic, May 2017.
Abstract

The development of formal methods for control design is an important challenge with potential applications in a wide range of safety-critical cyber-physical systems. Focusing on switched dynamical systems, we propose a new abstraction, based on time-varying regions of invariance (control funnels), that models behaviors of systems as timed automata. The main advantage of this method is that it allows for the automated verification and reactive controller synthesis without discretizing the evolution of the state of the system. Efficient and analytic constructions are possible in the case of linear dynamics whereas bounding funnels with conjectured properties based on numerical simulations can be used for general nonlinear dynamics. We demonstrate the potential of our approach with three examples.

@article{rts53(3)-BMPS,
  author =              {Bouyer, Patricia and Markey, Nicolas and Perrin,
                         Nicolas and Schlehuber{-}Caissier, Philipp},
  title =               {Timed automata abstraction of switched dynamical
                         systems using control funnels},
  publisher =           {Kluwer Academic},
  journal =             {Real-Time Systems},
  volume =              {53},
  number =              {3},
  pages =               {327-353},
  year =                {2017},
  month =               may,
  doi =                 {10.1007/s11241-016-9262-3},
  abstract =            {The development of formal methods for control design
                         is an important challenge with potential
                         applications in a wide range of safety-critical
                         cyber-physical systems. Focusing on switched
                         dynamical systems, we propose a new abstraction,
                         based on time-varying regions of invariance (control
                         funnels), that models behaviors of systems as timed
                         automata. The~main advantage of this method is that
                         it allows for the automated verification and
                         reactive controller synthesis without discretizing
                         the evolution of the state of the system. Efficient
                         and analytic constructions are possible in the case
                         of linear dynamics whereas bounding funnels with
                         conjectured properties based on numerical
                         simulations can be used for general nonlinear
                         dynamics. We~demonstrate the potential of our
                         approach with three examples.},
}
[BMP+97] Martin Beaudry, Pierre McKenzie, Pierre Péladeau, and Denis Thérien. Finite Monoids: From Word to Circuit Evaluation. SIAM Journal on Computing 26(1):138-152. Society for Industrial and Applied Math., February 1997. 
@article{siamcomp26(1)-BMPT,
  author =              {Beaudry, Martin and McKenzie, Pierre and
                         P{\'e}ladeau, Pierre and Th{\'e}rien, Denis},
  title =               {Finite Monoids: From Word to Circuit Evaluation},
  publisher =           {Society for Industrial and Applied Math.},
  journal =             {SIAM Journal on Computing},
  volume =              {26},
  number =              {1},
  pages =               {138-152},
  year =                {1997},
  month =               feb,
}
[BMR06] Patricia Bouyer, Nicolas Markey, and Pierre-Alain Reynier. Robust Model-Checking of Linear-Time Properties in Timed Automata. In LATIN'06, Lecture Notes in Computer Science 3887, pages 238-249. Springer-Verlag, March 2006.
Abstract

Formal verification of timed systems is well understood, but their implementation is still challenging. Recent works by Raskin et al. have brought out a model of parameterized timed automata that can be used to prove implementability of timed systems for safety properties. We define here a more general notion of robust model-checking for linear-time properties, which consists in verifying whether a property still holds even if the transitions are slightly delayed or expedited. We provide PSPACE algorithms for the robust model-checking of Büchi-like and LTL properties. We also verify bounded-response-time properties.

@inproceedings{latin2006-BMR,
  author =              {Bouyer, Patricia and Markey, Nicolas and Reynier,
                         Pierre-Alain},
  title =               {Robust Model-Checking of Linear-Time Properties in
                         Timed Automata},
  editor =              {Correa, Jos{\'e} R. and Hevia, Alejandro and Kiwi,
                         Marcos},
  booktitle =           {{P}roceedings of the 7th {L}atin {A}merican
                         {S}ymposium on {T}heoretical {IN}formatics
                         ({LATIN}'06)},
  acronym =             {{LATIN}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3887},
  pages =               {238-249},
  year =                {2006},
  month =               mar,
  doi =                 {10.1007/11682462_25},
  abstract =            {Formal verification of timed systems is well
                         understood, but their \emph{implementation} is still
                         challenging. Recent works by Raskin \emph{et al.}
                         have brought out a model of parameterized timed
                         automata that can be used to prove
                         \emph{implementability} of timed systems for safety
                         properties. We define here a more general notion of
                         robust model-checking for linear-time properties,
                         which consists in verifying whether a property still
                         holds even if the transitions are slightly delayed
                         or expedited. We provide PSPACE algorithms for the
                         robust model-checking of B{\"u}chi-like and LTL
                         properties. We also verify bounded-response-time
                         properties.},
}
[BMR08] Patricia Bouyer, Nicolas Markey, and Pierre-Alain Reynier. Robust Analysis of Timed Automata via Channel Machines. In FoSSaCS'08, Lecture Notes in Computer Science 4962, pages 157-171. Springer-Verlag, March 2008.
Abstract

Whereas formal verification of timed systems has become a very active field of research, the idealised mathematical semantics of timed automata cannot be faithfully implemented. Several works have thus focused on a modified semantics of timed automata which ensures implementability, and robust model-checking algorithms for safety, and later LTL properties have been designed. Recently, a new approach has been proposed, which reduces (standard) model-checking of timed automata to other verification problems on channel machines. Thanks to a new encoding of the modified semantics as a network of timed systems, we propose an original combination of both approaches, and prove that robust model-checking for coFlat-MTL, a large fragment of MTL, is EXPSPACE-Complete.

@inproceedings{fossacs2008-BMR,
  author =              {Bouyer, Patricia and Markey, Nicolas and Reynier,
                         Pierre-Alain},
  title =               {Robust Analysis of Timed Automata via Channel
                         Machines},
  editor =              {Amadio, Roberto},
  booktitle =           {{P}roceedings of the 11th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'08)},
  acronym =             {{FoSSaCS}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4962},
  pages =               {157-171},
  year =                {2008},
  month =               mar,
  doi =                 {10.1007/978-3-540-78499-9_12},
  abstract =            {Whereas formal verification of timed systems has
                         become a very active field of research, the
                         idealised mathematical semantics of timed automata
                         cannot be faithfully implemented. Several works have
                         thus focused on a modified semantics of timed
                         automata which ensures implementability, and robust
                         model-checking algorithms for safety, and later LTL
                         properties have been designed. Recently, a~new
                         approach has been proposed, which reduces (standard)
                         model-checking of timed automata to other
                         verification problems on channel machines. Thanks to
                         a new encoding of the modified semantics as a
                         network of timed systems, we propose an original
                         combination of both approaches, and prove that
                         robust model-checking for coFlat-MTL, a large
                         fragment of~MTL, is EXPSPACE-Complete.},
}
[BMR14] Véronique Bruyère, Noëmie Meunier, and Jean-François Raskin. Secure Equilibria in Weighted Games. In CSL/ LICS'14. ACM Press, July 2014. 
@inproceedings{csllics2014-BMR,
  author =              {Bruy{\`e}re, V{\'e}ronique and Meunier, No{\"e}mie
                         and Raskin, Jean-Fran{\c c}ois},
  title =               {Secure Equilibria in Weighted Games},
  booktitle =           {{P}roceedings of the Joint Meeting of the 23rd
                         {EACSL} {A}nnual {C}onference on {C}omputer
                         {S}cience {L}ogic and the 29th {A}nnual {ACM\slash
                         IEEE} {S}ymposium on {L}ogic {I}n {C}omputer
                         {S}cience ({CSL\slash LICS}'14)},
  acronym =             {{CSL\slash LICS}'14},
  publisher =           {ACM Press},
  chapter =             {26},
  year =                {2014},
  month =               jul,
  doi =                 {10.1145/2603088.2603109},
}
[BMR+15] Patricia Bouyer, Nicolas Markey, Mickael Randour, Kim Guldstrand Larsen, and Simon Laursen. Average-energy games. In GandALF'15, Electronic Proceedings in Theoretical Computer Science 193, pages 1-15. September 2015.
Abstract

Two-player quantitative zero-sum games provide a natural framework to synthesize controllers with performance guarantees for reactive systems within an uncontrollable environment. Classical settings include mean-payoff games, where the objective is to optimize the long-run average gain per action, and energy games, where the system has to avoid running out of energy.

We study average-energy games, where the goal is to optimize the long-run average of the accumulated energy. We show that this objective arises naturally in several applications, and that it yields interesting connections with previous concepts in the literature. We prove that deciding the winner in such games is in NP∩coNP and at least as hard as solving mean-payoff games, and we establish that memoryless strategies suffice to win. We also consider the case where the system has to minimize the average-energy while maintaining the accumulated energy within predefined bounds at all times: this corresponds to operating with a finite-capacity storage for energy. We give results for one-player and two-player games, and establish complexity bounds and memory requirements.

@inproceedings{gandalf2015-BMRLL,
  author =              {Bouyer, Patricia and Markey, Nicolas and Randour,
                         Mickael and Larsen, Kim Guldstrand and Laursen,
                         Simon},
  title =               {Average-energy games},
  editor =              {Esparza, Javier and Tronci, Enrico},
  booktitle =           {{P}roceedings of the 6th {I}nternational {S}ymposium
                         on {G}ames, {A}utomata, {L}ogics and {F}ormal
                         {V}erification ({GandALF}'15)},
  acronym =             {{GandALF}'15},
  series =              {Electronic Proceedings in Theoretical Computer
                         Science},
  volume =              {193},
  pages =               {1-15},
  year =                {2015},
  month =               sep,
  doi =                 {10.4204/EPTCS.193.1},
  abstract =            {Two-player quantitative zero-sum games provide a
                         natural framework to synthesize controllers with
                         performance guarantees for reactive systems within
                         an uncontrollable environment. Classical settings
                         include mean-payoff games, where the objective is to
                         optimize the long-run average gain per action, and
                         energy games, where the system has to avoid running
                         out of energy.\par We study \emph{average-energy}
                         games, where the goal is to optimize the long-run
                         average of the accumulated energy. We show that this
                         objective arises naturally in several applications,
                         and that it yields interesting connections with
                         previous concepts in the literature. We prove that
                         deciding the winner in such games is in
                         \textsf{NP}{{\(\cap\)}}\textsf{coNP} and at least as
                         hard as solving mean-payoff games, and we establish
                         that memoryless strategies suffice to win. We also
                         consider the case where the system has to minimize
                         the average-energy while maintaining the accumulated
                         energy within predefined bounds at all times: this
                         corresponds to operating with a finite-capacity
                         storage for energy. We give results for one-player
                         and two-player games, and establish complexity
                         bounds and memory requirements.},
}
[BMR+18] Patricia Bouyer, Nicolas Markey, Mickael Randour, Kim Guldstrand Larsen, and Simon Laursen. Average-energy games. Acta Informatica 55(2):91-127. Springer-Verlag, March 2018.
Abstract

Two-player quantitative zero-sum games provide a natural framework to synthesize controllers with performance guarantees for reactive systems within an uncontrollable environment. Classical settings include mean-payoff games, where the objective is to optimize the long-run average gain per action, and energy games, where the system has to avoid running out of energy. We study average-energy games, where the goal is to optimize the long-run average of the accumulated energy. We show that this objective arises naturally in several applications, and that it yields interesting connections with previous concepts in the literature. We prove that deciding the winner in such games is in NP∩coNP and at least as hard as solving mean-payoff games, and we establish that memoryless strategies suffice to win. We also consider the case where the system has to minimize the average-energy while maintaining the accumulated energy within predefined bounds at all times: this corresponds to operating with a finite-capacity storage for energy. We give results for one-player and two-player games, and establish complexity bounds and memory requirements.

@article{acta55(2)-BMRLL,
  author =              {Bouyer, Patricia and Markey, Nicolas and Randour,
                         Mickael and Larsen, Kim Guldstrand and Laursen,
                         Simon},
  title =               {Average-energy games},
  publisher =           {Springer-Verlag},
  journal =             {Acta Informatica},
  volume =              {55},
  number =              {2},
  pages =               {91-127},
  year =                {2018},
  month =               mar,
  doi =                 {10.1007/s00236-016-0274-1},
  abstract =            {Two-player quantitative zero-sum games provide a
                         natural framework to synthesize controllers with
                         performance guarantees for reactive systems within
                         an uncontrollable environment. Classical settings
                         include mean-payoff games, where the objective is to
                         optimize the long-run average gain per action, and
                         energy games, where the system has to avoid running
                         out of energy. We study average-energy games, where
                         the goal is to optimize the long-run average of the
                         accumulated energy. We show that this objective
                         arises naturally in several applications, and that
                         it yields interesting connections with previous
                         concepts in the literature. We prove that deciding
                         the winner in such games is in
                         \(\textsf{NP}\cap\textsf{coNP}\) and at least as
                         hard as solving mean-payoff games, and we establish
                         that memoryless strategies suffice to win. We also
                         consider the case where the system has to minimize
                         the average-energy while maintaining the accumulated
                         energy within predefined bounds at all times: this
                         corresponds to operating with a finite-capacity
                         storage for energy. We give results for one-player
                         and two-player games, and establish complexity
                         bounds and memory requirements.},
}
[BMR+16] Patricia Bouyer, Nicolas Markey, Mickael Randour, Arnaud Sangnier, and Daniel Stan. Reachability in Networks of Register Protocols under Stochastic Schedulers. In ICALP'16, Leibniz International Proceedings in Informatics 55, pages 106:1-106:14. Leibniz-Zentrum für Informatik, July 2016.
Abstract

We study the almost-sure reachability problem in a distributed system obtained as the asynchronous composition of N copies (called processes) of the same automaton (called protocol), that can communicate via a shared register with finite domain. The automaton has two types of transitions: write-transitions update the value of the register, while read-transitions move to a new state depending on the content of the register. Non-determinism is resolved by a stochastic scheduler. Given a protocol, we focus on almost-sure reachability of a target state by one of the processes. The answer to this problem naturally depends on the number N of processes. However, we prove that our setting has a cut-off property : the answer to the almost-sure reachability problem is constant when N is large enough; we then develop an EXPSPACE algorithm deciding whether this constant answer is positive or negative.

@inproceedings{icalp2016-BMRSS,
  author =              {Bouyer, Patricia and Markey, Nicolas and Randour,
                         Mickael and Sangnier, Arnaud and Stan, Daniel},
  title =               {Reachability in Networks of Register Protocols under
                         Stochastic Schedulers},
  editor =              {Chatzigiannakis, Ioannis and Mitzenmacher, Michael
                         and Rabani, Yuval and Sangiorgi, Davide},
  booktitle =           {{P}roceedings of the 43rd {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'16)~-- Part~{II}},
  acronym =             {{ICALP}'16},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {55},
  pages =               {106:1-106:14},
  year =                {2016},
  month =               jul,
  doi =                 {10.4230/LIPIcs.ICALP.2016.106},
  abstract =            {We study the almost-sure reachability problem in a
                         distributed system obtained as the asynchronous
                         composition of~\(N\) copies (called
                         \emph{processes}) of the same automaton (called
                         \emph{protocol}), that can communicate via a shared
                         register with finite domain. The automaton has two
                         types of transitions: write-transitions update the
                         value of the register, while read-transitions move
                         to a new state depending on the content of the
                         register. Non-determinism is resolved by a
                         stochastic scheduler. Given a protocol, we focus on
                         almost-sure reachability of a target state by one of
                         the processes. The answer to this problem naturally
                         depends on the number~\(N\) of processes. However,
                         we prove that our setting has a cut-off property :
                         the answer to the almost-sure reachability problem
                         is constant when \(N\) is large enough; we~then
                         develop an EXPSPACE algorithm deciding whether this
                         constant answer is positive or negative.},
}
[BMS11] Patricia Bouyer, Nicolas Markey, and Ocan Sankur. Robust Model-Checking of Timed Automata via Pumping in Channel Machines. In FORMATS'11, Lecture Notes in Computer Science 6919, pages 97-112. Springer-Verlag, September 2011.
Abstract

Timed automata are governed by a mathematical semantics which assumes perfectly continuous and precise clocks. This requirement is not satised by digital hardware on which the models are implemented. In fact, it was shown that the presence of imprecisions, however small they may be, may yield extra behaviours. Therefore correctness proven on the formal model does not imply correctness of the real system.

The problem of robust model-checking was then dened to circumvent this inconsistency. It consists in computing a bound on the imprecision under which the system will be correct.

In this work, we show that robust model-checking against ω-regular properties for timed automata can be reduced to standard model-checking of timed automata, by computing an adequate bound on the imprecision. This yields a new algorithm for robust model-checking of ω-regular properties, which is both optimal and valid for general timed automata.

@inproceedings{formats2011-BMS,
  author =              {Bouyer, Patricia and Markey, Nicolas and Sankur,
                         Ocan},
  title =               {Robust Model-Checking of Timed Automata via Pumping
                         in Channel Machines},
  editor =              {Fahrenberg, Uli and Tripakis, Stavros},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'11)},
  acronym =             {{FORMATS}'11},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6919},
  pages =               {97-112},
  year =                {2011},
  month =               sep,
  doi =                 {10.1007/978-3-642-24310-3_8},
  abstract =            {Timed automata are governed by a mathematical
                         semantics which assumes perfectly continuous and
                         precise clocks. This requirement is not satised by
                         digital hardware on which the models are
                         implemented. In~fact, it~was shown that the presence
                         of imprecisions, however small they may be, may
                         yield extra behaviours. Therefore correctness proven
                         on the formal model does not imply correctness of
                         the real system.\par The problem of robust
                         model-checking was then dened to circumvent this
                         inconsistency. It consists in computing a bound on
                         the imprecision under which the system will be
                         correct.\par In this work, we show that robust
                         model-checking against \(\omega\)-regular properties
                         for timed automata can be reduced to standard
                         model-checking of timed automata, by computing an
                         adequate bound on the imprecision. This yields a new
                         algorithm for robust model-checking of
                         \(\omega\)-regular properties, which is both optimal
                         and valid for general timed automata.},
}
[BMS12] Patricia Bouyer, Nicolas Markey, and Ocan Sankur. Robust reachability in timed automata: a game-based approach. In ICALP'12, Lecture Notes in Computer Science 7392, pages 128-140. Springer-Verlag, July 2012.
Abstract

Reachability checking is one of the most basic problems in verification. By solving this problem, one synthesizes a strategy that dictates the actions to be performed for ensuring that the target location is reached. In this work, we are interested in synthesizing "robust" strategies for ensuring reachability of a location in a timed automaton; with "robust", we mean that it must still ensure reachability even when the delays are perturbed by the environment. We model this perturbed semantics as a game between the controller and its environment, and solve the parameterized robust reachability problem: we show that the existence of an upper bound on the perturbations under which there is a strategy reaching a target location is EXPTIME-complete.

@inproceedings{icalp2012-BMS,
  author =              {Bouyer, Patricia and Markey, Nicolas and Sankur,
                         Ocan},
  title =               {Robust reachability in timed automata: a~game-based
                         approach},
  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 =               {128-140},
  year =                {2012},
  month =               jul,
  doi =                 {10.1007/978-3-642-31585-5_15},
  abstract =            {Reachability checking is one of the most basic
                         problems in verification. By solving this problem,
                         one synthesizes a strategy that dictates the actions
                         to be performed for ensuring that the target
                         location is reached. In this work, we are interested
                         in synthesizing {"}robust{"} strategies for ensuring
                         reachability of a location in a timed automaton;
                         with {"}robust{"}, we mean that it must still ensure
                         reachability even when the delays are perturbed by
                         the environment. We model this perturbed semantics
                         as a game between the controller and its
                         environment, and solve the parameterized robust
                         reachability problem: we show that the existence of
                         an upper bound on the perturbations under which
                         there is a strategy reaching a target location is
                         EXPTIME-complete.},
}
[BMS13] Patricia Bouyer, Nicolas Markey, and Ocan Sankur. Robustness in timed automata. In RP'13, Lecture Notes in Computer Science 8169, pages 1-18. Springer-Verlag, September 2013.
Abstract

In this paper we survey several approaches to the robustness of timed automata, that is, the ability of a system to resist to slight perturbations or errors. We will concentrate on robustness against timing errors which can be due to measuring errors, imprecise clocks, and unexpected runtime behaviors such as execution times that are longer or shorter than expected.

We consider the perturbation model of guard enlargement and formulate several robust verification problems that have been studied recently, including robustness analysis, robust implementation, and robust control.

@inproceedings{rp2013-BMS,
  author =              {Bouyer, Patricia and Markey, Nicolas and Sankur,
                         Ocan},
  title =               {Robustness in timed automata},
  editor =              {Abdulla, Parosh Aziz and Potapov, Igor},
  booktitle =           {{P}roceedings of the 7th {W}orkshop on
                         {R}eachability {P}roblems in {C}omputational
                         {M}odels ({RP}'13)},
  acronym =             {{RP}'13},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8169},
  pages =               {1-18},
  year =                {2013},
  month =               sep,
  doi =                 {10.1007/978-3-642-41036-9_1},
  abstract =            {In this paper we survey several approaches to the
                         robustness of timed automata, that~is, the ability
                         of a system to resist to slight perturbations or
                         errors. We will concentrate on robustness against
                         timing errors which can be due to measuring errors,
                         imprecise clocks, and unexpected runtime behaviors
                         such as execution times that are longer or shorter
                         than expected.\par We consider the perturbation
                         model of guard enlargement and formulate several
                         robust verification problems that have been studied
                         recently, including robustness analysis, robust
                         implementation, and robust control.},
}
[BMS13] Patricia Bouyer, Nicolas Markey, and Ocan Sankur. Robust Weighted Timed Automata and Games. In FORMATS'13, Lecture Notes in Computer Science 8053, pages 31-46. Springer-Verlag, August 2013.
Abstract

Weighted timed automata extend timed automata with cost variables that can be used to model the evolution of various quantities. Although cost-optimal reachability is decidable (in polynomial space) on this model, it becomes undecidable on weighted timed games. This paper studies cost-optimal reachability problems on weighted timed automata and games under robust semantics. More precisely, we consider two perturbation game semantics that introduce imprecisions in the standard semantics, and bring robustness properties w.r.t. timing imprecisions to controllers. We give a polynomial-space algorithm for weighted timed automata, and prove the undecidability of cost-optimal reachability on weighted timed games, showing that the problem is robustly undecidable.

@inproceedings{formats2013-BMS,
  author =              {Bouyer, Patricia and Markey, Nicolas and Sankur,
                         Ocan},
  title =               {Robust Weighted Timed Automata and Games},
  editor =              {Braberman, V{\'\i}ctor and Fribourg, Laurent},
  booktitle =           {{P}roceedings of the 11th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'13)},
  acronym =             {{FORMATS}'13},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8053},
  pages =               {31-46},
  year =                {2013},
  month =               aug,
  doi =                 {10.1007/978-3-642-40229-6_3},
  abstract =            {Weighted timed automata extend timed automata with
                         cost variables that can be used to model the
                         evolution of various quantities. Although
                         cost-optimal reachability is decidable (in
                         polynomial space) on this model, it becomes
                         undecidable on weighted timed games. This paper
                         studies cost-optimal reachability problems on
                         weighted timed automata and games under robust
                         semantics. More precisely, we consider two
                         perturbation game semantics that introduce
                         imprecisions in the standard semantics, and bring
                         robustness properties w.r.t. timing imprecisions to
                         controllers. We give a polynomial-space algorithm
                         for weighted timed automata, and prove the
                         undecidability of cost-optimal reachability on
                         weighted timed games, showing that the problem is
                         robustly undecidable.},
}
[BMS14] Patricia Bouyer, Nicolas Markey, and Daniel Stan. Mixed Nash Equilibria in Concurrent Games. In FSTTCS'14, Leibniz International Proceedings in Informatics 29, pages 351-363. Leibniz-Zentrum für Informatik, December 2014.
Abstract

We study mixed-strategy Nash equilibria in multiplayer deterministic concurrent games played on graphs, with terminal-reward payoffs (that is, absorbing states with a value for each player). We show undecidability of the existence of a constrained Nash equilibrium (the constraint requiring that one player should have maximal payoff), with only three players and 0/1-rewards (i.e., reachability objectives). This has to be compared with the undecidability result by Ummels and Wojtczak for turn-based games which requires 14 players and general rewards. Our proof has various interesting consequences: (i) the undecidability of the existence of a Nash equilibrium with a constraint on the social welfare; (ii) the undecidability of the existence of an (unconstrained) Nash equilibrium in concurrent games with terminal-reward payoffs.

@inproceedings{fsttcs2014-BMS,
  author =              {Bouyer, Patricia and Markey, Nicolas and Stan,
                         Daniel},
  title =               {Mixed {N}ash Equilibria in Concurrent Games},
  editor =              {Raman, Venkatesh and Suresh, S. P.},
  booktitle =           {{P}roceedings of the 34th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'14)},
  acronym =             {{FSTTCS}'14},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {29},
  pages =               {351-363},
  year =                {2014},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2014.351},
  abstract =            {We study mixed-strategy Nash equilibria in
                         multiplayer deterministic concurrent games played on
                         graphs, with terminal-reward payoffs (that is,
                         absorbing states with a value for each player). We
                         show undecidability of the existence of a
                         constrained Nash equilibrium (the constraint
                         requiring that one player should have maximal
                         payoff), with only three players and 0/1-rewards
                         (i.e., reachability objectives). This has to be
                         compared with the undecidability result by Ummels
                         and Wojtczak for turn-based games which requires 14
                         players and general rewards. Our proof has various
                         interesting consequences: (i)~the~undecidability of
                         the existence of a Nash equilibrium with a
                         constraint on the social welfare;
                         (ii)~the~undecidability of the existence of an
                         (unconstrained) Nash equilibrium in concurrent games
                         with terminal-reward payoffs.},
}
[BMS15] Patricia Bouyer, Nicolas Markey, and Ocan Sankur. Robust Reachability in Timed Automata and Games: A Game-based Approach. Theoretical Computer Science 563:43-74. Elsevier, January 2015.
Abstract

Reachability checking is one of the most basic problems in verification. By solving this problem in a game, one can synthesize a strategy that dictates the actions to be performed for ensuring that the target location is reached. In this work, we are interested in synthesizing "robust" strategies for ensuring reachability of a location in timed automata. By robust, we mean that it must still ensure reachability even when the delays are perturbed by the environment. We model this perturbed semantics as a game between the controller and its environment, and solve the parameterized robust reachability problem: we show that the existence of an upper bound on the perturbations under which there is a strategy reaching a target location is EXPTIME-complete. We also extend our algorithm, with the same complexity, to turn-based timed games, where the successor state is entirely determined by the environment in some locations.

@article{tcs563()-BMS,
  author =              {Bouyer, Patricia and Markey, Nicolas and Sankur,
                         Ocan},
  title =               {Robust Reachability in Timed Automata and Games:
                         A~Game-based Approach},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {563},
  pages =               {43-74},
  year =                {2015},
  month =               jan,
  doi =                 {10.1016/j.tcs.2014.08.014},
  abstract =            {Reachability checking is one of the most basic
                         problems in verification. By solving this problem in
                         a game, one can synthesize a strategy that dictates
                         the actions to be performed for ensuring that the
                         target location is reached. In this work, we are
                         interested in synthesizing {"}robust{"} strategies
                         for ensuring reachability of a location in timed
                         automata. By robust, we mean that it must still
                         ensure reachability even when the delays are
                         perturbed by the environment. We model this
                         perturbed semantics as a game between the controller
                         and its environment, and solve the parameterized
                         robust reachability problem: we show that the
                         existence of an upper bound on the perturbations
                         under which there is a strategy reaching a target
                         location is EXPTIME-complete. We also extend our
                         algorithm, with the same complexity, to turn-based
                         timed games, where the successor state is entirely
                         determined by the environment in some locations.},
}
[BMS16] Patricia Bouyer, Nicolas Markey, and Daniel Stan. Stochastic Equilibria under Imprecise Deviations in Terminal-Reward Concurrent Games. In GandALF'16, Electronic Proceedings in Theoretical Computer Science 226, pages 61-75. September 2016.
Abstract

We study the existence of mixed-strategy equilibria in concurrent games played on graphs. While existence is guaranteed with safety objectives for each player, Nash equilibria need not exist when players are given arbitrary terminal-reward objectives, and their existence is undecidable with qualitative reachability objectives (and only three players). However, these results rely on the fact that the players can enforce infinite plays while trying to improve their payoffs. In this paper, we introduce a relaxed notion of equilibria, where deviations are imprecise. We prove that contrary to Nash equilibria, such (stationary) equilibria always exist, and we develop a PSPACE algorithm to compute one.

@inproceedings{gandalf2016-BMS,
  author =              {Bouyer, Patricia and Markey, Nicolas and Stan,
                         Daniel},
  title =               {Stochastic Equilibria under Imprecise Deviations in
                         Terminal-Reward Concurrent Games},
  editor =              {Cantone, Domenico and Delzanno, Giorgio},
  booktitle =           {{P}roceedings of the 7th {I}nternational {S}ymposium
                         on {G}ames, {A}utomata, {L}ogics and {F}ormal
                         {V}erification ({GandALF}'16)},
  acronym =             {{GandALF}'16},
  series =              {Electronic Proceedings in Theoretical Computer
                         Science},
  volume =              {226},
  pages =               {61-75},
  year =                {2016},
  month =               sep,
  doi =                 {10.4204/EPTCS.226.5},
  abstract =            {We study the existence of mixed-strategy equilibria
                         in concurrent games played on graphs. While
                         existence is guaranteed with safety objectives for
                         each player, Nash equilibria need not exist when
                         players are given arbitrary terminal-reward
                         objectives, and their existence is undecidable with
                         qualitative reachability objectives (and~only three
                         players). However, these results rely on the fact
                         that the players can enforce infinite plays while
                         trying to improve their payoffs. In this paper, we
                         introduce a relaxed notion of equilibria, where
                         deviations are imprecise. We prove that contrary to
                         Nash equilibria, such (stationary) equilibria always
                         exist, and we develop a PSPACE algorithm to compute
                         one.},
}
[BMS+20] Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, and Ocan Sankur. Dynamic network congestion games. In FSTTCS'20, Leibniz International Proceedings in Informatics 182, pages 40:1-40:16. Leibniz-Zentrum für Informatik, December 2020.
Abstract

Congestion games are a classical type of games studied in game theory, in which n players choose a resource, and their individual cost increases with the number of other players choosing the same resource. In network congestion games (NCGs), the resources correspond to simple paths in a graph, e.g. representing routing options from a source to a target. In this paper, we introduce a variant of NCGs, referred to as dynamic NCGs: in this setting, players take transitions synchronously, they select their next transitions dynamically, and they are charged a cost that depends on the number of players simultaneously using the same transition.

We study, from a complexity perspective, standard concepts of game theory in dynamic NCGs: social optima, Nash equilibria, and subgame perfect equilibria. Our contributions are the following: the existence of a strategy profile with social cost bounded by a constant is in PSPACE and NP-hard. (Pure) Nash equilibria always exist in dynamic NCGs; the existence of a Nash equilibrium with bounded cost can be decided in EXPSPACE, and computing a witnessing strategy profile can be done in doubly-exponential time. The existence of a subgame perfect equilibrium with bounded cost can be decided in 2EXPSPACE, and a witnessing strategy profile can be computed in triply-exponential time.

@inproceedings{fsttcs2020-BMSS,
  author =              {Bertrand, Nathalie and Markey, Nicolas and
                         Sadhukhan, Suman and Sankur, Ocan},
  title =               {Dynamic network congestion games},
  editor =              {Saxena, Nitin and Simon, Sunil},
  booktitle =           {{P}roceedings of the 40th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'20)},
  acronym =             {{FSTTCS}'20},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {182},
  pages =               {40:1-40:16},
  year =                {2020},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2020.40},
  abstract =            {Congestion games are a classical type of games
                         studied in game theory, in which n players choose a
                         resource, and their individual cost increases with
                         the number of other players choosing the same
                         resource. In network congestion games~(NCGs), the
                         resources correspond to simple paths in a graph,
                         e.g.~representing routing options from a source to a
                         target. In this paper, we introduce a variant
                         of~NCGs, referred to as dynamic~NCGs: in~this
                         setting, players take transitions synchronously,
                         they select their next transitions dynamically, and
                         they are charged a cost that depends on the number
                         of players simultaneously using the same transition.
                         \par We~study, from a complexity perspective,
                         standard concepts of game theory in dynamic NCGs:
                         social optima, Nash equilibria, and subgame perfect
                         equilibria. Our contributions are the following: the
                         existence of a strategy profile with social cost
                         bounded by a constant is in PSPACE and NP-hard.
                         (Pure)~Nash equilibria always exist in dynamic~NCGs;
                         the existence of a Nash equilibrium with bounded
                         cost can be decided in EXPSPACE, and computing a
                         witnessing strategy profile can be done in
                         doubly-exponential time. The~existence of a subgame
                         perfect equilibrium with bounded cost can be decided
                         in 2EXPSPACE, and a witnessing strategy profile can
                         be computed in triply-exponential~time.},
}
[BMS+22] Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, and Ocan Sankur. Semilinear Representations for Series-Parallel Atomic Congestion Games. In FSTTCS'22, Leibniz International Proceedings in Informatics 250, pages 32:1-32:20. Leibniz-Zentrum für Informatik, December 2022.
Abstract

We consider atomic congestion games on series-parallel networks, and study the structure of the sets of Nash equilibria and social local optima on a given network when the number of players varies. We establish that these sets are definable in Presburger arithmetic and that they admit semilinear representations whose all period vectors have a common direction. As an application, we prove that the prices of anarchy and stability converge to 1 as the number of players goes to infinity, and show how to exploit these semilinear representations to compute these ratios precisely for a given network and number of players.

@inproceedings{fsttcs2022-BMSS,
  author =              {Bertrand, Nathalie and Markey, Nicolas and
                         Sadhukhan, Suman and Sankur, Ocan},
  title =               {Semilinear Representations for Series-Parallel
                         Atomic Congestion Games},
  editor =              {Dawar, Anuj and Guruswami, Venkatesan},
  booktitle =           {{P}roceedings of the 42nd {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'22)},
  acronym =             {{FSTTCS}'22},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {250},
  pages =               {32:1-32:20},
  year =                {2022},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2022.32},
  abstract =            {We~consider atomic congestion games on
                         series-parallel networks, and study the structure of
                         the sets of Nash equilibria and social local optima
                         on a given network when the number of players
                         varies. We establish that these sets are definable
                         in Presburger arithmetic and that they admit
                         semilinear representations whose all period vectors
                         have a common direction. As~an~application, we~prove
                         that the prices of anarchy and stability converge
                         to~1 as the number of players goes to infinity, and
                         show how to exploit these semilinear representations
                         to compute these ratios precisely for a given
                         network and number of players.},
}
[BMS+22] Nathalie Bertrand, Nicolas Markey, Ocan Sankur, and Nicolas Waldburger. Parameterized safety verification of round-based shared-memory systems. In ICALP'22, Leibniz International Proceedings in Informatics, pages 113:1-113:20. Leibniz-Zentrum für Informatik, July 2022.
Abstract

We consider the parameterized verification problem for distributed algorithms where the goal is to develop techniques to prove the correctness of a given algorithm regardless of the number of participating processes. Motivated by an asynchronous binary consensus algorithm of [J. Aspnes; Fast deterministic consensus in a noisy environment; J. Algorithms, 2002], we consider round-based distributed algorithms communicating with shared memory. A particular challenge in these systems is that 1) the number of processes is unbounded, and, more importantly, 2) there is a fresh set of registers at each round. A verification algorithm thus needs to manage both sources of infinity. In this setting, we prove that the safety verification problem, which consists in deciding whether all possible executions avoid a given error state, is PSPACE-complete. For negative instances of the safety verification problem, we also provide exponential lower and upper bounds on the minimal number of processes needed for an error execution and on the minimal round on which the error state can be covered.

@inproceedings{icalp2022-BMSW,
  author =              {Bertrand, Nathalie and Markey, Nicolas and Sankur,
                         Ocan and Waldburger, Nicolas},
  title =               {Parameterized safety verification of round-based
                         shared-memory systems},
  editor =              {Woodruff, David and Boja{\'n}czyk, Miko{\l}aj},
  booktitle =           {{P}roceedings of the 49th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'22)},
  acronym =             {{ICALP}'22},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  pages =               {113:1-113:20},
  year =                {2022},
  month =               jul,
  doi =                 {10.4230/LIPIcs.ICALP.2022.113},
  abstract =            {We consider the parameterized verification problem
                         for distributed algorithms where the goal is to
                         develop techniques to prove the correctness of a
                         given algorithm regardless of the number of
                         participating processes. Motivated by an
                         asynchronous binary consensus algorithm~of
                         [J.~Aspnes; Fast deterministic consensus in a noisy
                         environment; J.~Algorithms,~2002], we~consider
                         round-based distributed algorithms communicating
                         with shared memory. A~particular challenge in these
                         systems is that 1)~the~number of processes is
                         unbounded, and, more importantly, 2)~there is a
                         fresh set of registers at each round. A~verification
                         algorithm thus needs to manage both sources of
                         infinity. In~this setting, we~prove that the safety
                         verification problem, which consists in deciding
                         whether all possible executions avoid a given error
                         state, is PSPACE-complete. For~negative instances of
                         the safety verification problem, we~also provide
                         exponential lower and upper bounds on the minimal
                         number of processes needed for an error execution
                         and on the minimal round on which the error state
                         can be covered.},
}
[BMT99] Augustin Baziramwabo, Pierre McKenzie, and Denis Thérien. Modular Temporal Logic. In LICS'99, pages 344-351. IEEE Comp. Soc. Press, July 1999. 
@inproceedings{lics1999-BMT,
  author =              {Baziramwabo, Augustin and McKenzie, Pierre and
                         Th{\'e}rien, Denis},
  title =               {Modular Temporal Logic},
  booktitle =           {{P}roceedings of the 14th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'99)},
  acronym =             {{LICS}'99},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {344-351},
  year =                {1999},
  month =               jul,
}
[BMV14] Patricia Bouyer, Nicolas Markey, and Steen Vester. Nash Equilibria in Symmetric Games with Partial Observation. In SR'14, Electronic Proceedings in Theoretical Computer Science 146, pages 49-55. March 2014.
Abstract

We investigate a model for representing large multiplayer games, which satisfy strong symmetry properties. This model is made of multiple copies of an arena; each player plays in his own arena, and can partially observe what the other players do. Therefore, this game has partial information and symmetry constraints, which make the computation of Nash equilibria difficult. We show several undecidability results, and for bounded-memory strategies, we precisely characterize the complexity of computing pure Nash equilibria (for qualitative objectives) in this game model.

@inproceedings{sr2014-BMV,
  author =              {Bouyer, Patricia and Markey, Nicolas and Vester,
                         Steen},
  title =               {Nash Equilibria in Symmetric Games with Partial
                         Observation},
  booktitle =           {{P}roceedings of the 2nd {I}nternational {W}orkshop
                         on {S}trategic {R}easoning ({SR}'14)},
  acronym =             {{SR}'14},
  series =              {Electronic Proceedings in Theoretical Computer
                         Science},
  volume =              {146},
  pages =               {49-55},
  year =                {2014},
  month =               mar,
  doi =                 {10.4204/EPTCS.146.7},
  abstract =            {We investigate a model for representing large
                         multiplayer games, which satisfy strong symmetry
                         properties. This model is made of multiple copies of
                         an arena; each player plays in his own arena, and
                         can partially observe what the other players do.
                         Therefore, this game has partial information and
                         symmetry constraints, which make the computation of
                         Nash equilibria difficult. We show several
                         undecidability results, and for bounded-memory
                         strategies, we precisely characterize the complexity
                         of computing pure Nash equilibria (for qualitative
                         objectives) in this game model.},
}
[BMV15] Dietmar Berwanger, Anup Basil Mathew, and Marie Van den Bogaard. Hierarchical Information Patterns and Distributed Strategy Synthesis. In ATVA'15, Lecture Notes in Computer Science 9364, pages 378-393. Springer-Verlag, October 2015. 
@inproceedings{atva2015-BMV,
  author =              {Berwanger, Dietmar and Mathew, Anup Basil and
                         Van{~}den{ }Bogaard, Marie},
  title =               {Hierarchical Information Patterns and Distributed
                         Strategy Synthesis},
  editor =              {Finkbeiner, Bernd and Pu, Geguang and Zhang, Lijun},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {S}ymposium on {A}utomated {T}echnology for
                         {V}erification and {A}nalysis ({ATVA}'15)},
  acronym =             {{ATVA}'15},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9364},
  pages =               {378-393},
  year =                {2015},
  month =               oct,
}
[BMV17] Patricia Bouyer, Nicolas Markey, and Steen Vester. Nash Equilibria in Symmetric Graph Games with Partial Observation. Information and Computation 254(2):238-258. Elsevier, June 2017.
Abstract

We investigate a model for representing large multiplayer games, which satisfy strong symmetry properties. This model is made of multiple copies of an arena; each player plays in his own arena, and can partially observe what the other players do. Therefore, this game has partial information and symmetry constraints, which make the computation of Nash equilibria difficult. We show several undecidability results, and for bounded-memory strategies, we precisely characterize the complexity of computing pure Nash equilibria (for qualitative objectives) in this game model.

@article{icomp254()-BMV,
  author =              {Bouyer, Patricia and Markey, Nicolas and Vester,
                         Steen},
  title =               {{N}ash Equilibria in Symmetric Graph Games with
                         Partial Observation},
  publisher =           {Elsevier},
  journal =             {Information and Computation},
  volume =              {254},
  number =              {2},
  pages =               {238-258},
  year =                {2017},
  month =               jun,
  doi =                 {10.1016/j.ic.2016.10.010},
  abstract =            {We investigate a model for representing large
                         multiplayer games, which satisfy strong symmetry
                         properties. This model is made of multiple copies of
                         an arena; each player plays in his own arena, and
                         can partially observe what the other players do.
                         Therefore, this game has partial information and
                         symmetry constraints, which make the computation of
                         Nash equilibria difficult. We show several
                         undecidability results, and for bounded-memory
                         strategies, we precisely characterize the complexity
                         of computing pure Nash equilibria (for qualitative
                         objectives) in this game model.},
}
[BO04] Stephen J. Bellantoni and Isabel Oitavem. Separating NC along the δ axis. Theoretical Computer Science 318(1-2):57-78. Elsevier, June 2004. 
@article{tcs318(1-2)-BO,
  author =              {Bellantoni, Stephen J. and Oitavem, Isabel},
  title =               {Separating {{\(\mathrm{NC}\)}} along the
                         {{\(\delta\)}} axis},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {318},
  number =              {1-2},
  pages =               {57-78},
  year =                {2004},
  month =               jun,
  doi =                 {10.1016/j.tcs.2003.10.021},
}
[BO16] Randal E. Bryant and David R. O'Hallaron. Computer Systems – A programmer's perspective. Pearson, 2016. 
@book{BO16-CSAPP,
  author =              {Bryant, Randal E. and O'Hallaron, David R.},
  title =               {Computer Systems~-- A~programmer's perspective},
  publisher =           {Pearson},
  year =                {2016},
}
[Bod88] Hans L. Bodlaender. Dynamic Programming on Graphs with Bounded Treewidth. In ICALP'88, Lecture Notes in Computer Science 317, pages 105-118. Springer-Verlag, July 1988. 
@inproceedings{icalp1988-Bod,
  author =              {Bodlaender, Hans L.},
  title =               {Dynamic Programming on Graphs with Bounded
                         Treewidth},
  editor =              {Lepist{\"o}, Timo and Salomaa, Arto},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'88)},
  acronym =             {{ICALP}'88},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {317},
  pages =               {105-118},
  year =                {1988},
  month =               jul,
  doi =                 {10.1007/3-540-19488-6_110},
}
[Bod93] Hans L. Bodlaender. A Tourist Guide through Treewidth. Acta Cybernetica 11(1-2):1-21. Institute of Informatics, University of Szeged, 1993. 
@article{actacyb11(1-2)-Bod,
  author =              {Bodlaender, Hans L.},
  title =               {A~Tourist Guide through Treewidth},
  publisher =           {Institute of Informatics, University of Szeged},
  journal =             {Acta Cybernetica},
  volume =              {11},
  number =              {1-2},
  pages =               {1-21},
  year =                {1993},
}
[Bod96] Hans L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing 25(6):1305-1317. Society for Industrial and Applied Math., December 1996. 
@article{siamcomp25(6)-Bod,
  author =              {Bodlaender, Hans L.},
  title =               {A~linear-time algorithm for finding
                         tree-decompositions of small treewidth},
  publisher =           {Society for Industrial and Applied Math.},
  journal =             {SIAM Journal on Computing},
  volume =              {25},
  number =              {6},
  pages =               {1305-1317},
  year =                {1996},
  month =               dec,
  doi =                 {10.1137/S0097539793251219},
}
[Boj08] Mikołaj Bojańczyk. The Common Fragment of ACTL and LTL. In FoSSaCS'08, Lecture Notes in Computer Science 4962, pages 172-185. Springer-Verlag, March 2008. 
@inproceedings{fossacs2008-Boj,
  author =              {Boja{\'n}czyk, Miko{\l}aj},
  title =               {The Common Fragment of {ACTL} and~{LTL}},
  editor =              {Amadio, Roberto},
  booktitle =           {{P}roceedings of the 11th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'08)},
  acronym =             {{FoSSaCS}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4962},
  pages =               {172-185},
  year =                {2008},
  month =               mar,
}
[Bok18] Udi Boker. Why these automata types?. In LPAR'18, EPiC Series in Computing 57, pages 143-163. EasyChair, November 2018. 
@inproceedings{lpar2018-Bok,
  author =              {Boker, Udi},
  title =               {Why these automata types?},
  editor =              {Barthe, Gilles and Sutcliffe, Geoff and Veanes,
                         Margus},
  booktitle =           {{P}roceedings of the 22nd {I}nternational
                         {C}onference {L}ogic {P}rogramming and {A}utomated
                         {R}easoning ({LPAR}'18)},
  acronym =             {{LPAR}'18},
  publisher =           {EasyChair},
  series =              {EPiC Series in Computing},
  volume =              {57},
  pages =               {143-163},
  year =                {2018},
  month =               nov,
  doi =                 {10.29007/c3bj},
}
[Bou01] Charles L. Bouton. Nim, a game with a complete mathematical theory. Annals of Mathematics 3(1-4):35-39. Princeton University Press, 1901. 
@article{am3(1-4)-Bou,
  author =              {Bouton, Charles L.},
  title =               {Nim, a~game with a complete mathematical theory},
  publisher =           {Princeton University Press},
  journal =             {Annals of Mathematics},
  volume =              {3},
  number =              {1-4},
  pages =               {35-39},
  year =                {1901},
}
[Bou98] Patricia Bouyer. Automates temporisés et modularité. Mémoire de D.E.A., Lab. Spécification & Vérification, ENS Cachan, France, June 1998. 
@mastersthesis{dea-Bouyer,
  author =              {Bouyer, Patricia},
  title =               {Automates temporis{\'e}s et modularit{\'e}},
  year =                {1998},
  month =               jun,
  school =              {Lab.~Sp\'ecification \& V\'erification, ENS Cachan,
                         France},
  type =                {M\'emoire de D.E.A.},
}
[Bou02] Patricia Bouyer. Timed Automata May Cause some Troubles. Research Report LSV-02-09, Lab. Spécification & Vérification, ENS Cachan, France, July 2002. 
@techreport{LSV0209-Bou,
  author =              {Bouyer, Patricia},
  title =               {Timed Automata May Cause some Troubles},
  number =              {LSV-02-09},
  year =                {2002},
  month =               jul,
  institution =         {Lab.~Sp\'ecification \& V\'erification, ENS Cachan,
                         France},
  type =                {Research Report},
}
[Bou03] Patricia Bouyer. Untameable Timed Automata!. In STACS'03, Lecture Notes in Computer Science 2607, pages 620-631. Springer-Verlag, February 2003. 
@inproceedings{stacs2003-Bou,
  author =              {Bouyer, Patricia},
  title =               {Untameable Timed Automata!},
  editor =              {Alt, Helmut and Habib, Michel},
  booktitle =           {{P}roceedings of the 20th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'03)},
  acronym =             {{STACS}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2607},
  pages =               {620-631},
  year =                {2003},
  month =               feb,
  doi =                 {10.1007/3-540-36494-3_54},
}
[Bou04] Patricia Bouyer. Forward Analysis of Updatable Timed Automata. Formal Methods in System Design 24(3):281-320. Kluwer Academic, May 2004. 
@article{fmsd24(3)-Bou,
  author =              {Bouyer, Patricia},
  title =               {Forward Analysis of Updatable Timed Automata},
  publisher =           {Kluwer Academic},
  journal =             {Formal Methods in System Design},
  volume =              {24},
  number =              {3},
  pages =               {281-320},
  year =                {2004},
  month =               may,
  doi =                 {10.1023/B:FORM.0000026093.21513.31},
}
[Boz08] Laura Bozzelli. The complexity of CTL* + Linear Past. In FoSSaCS'08, Lecture Notes in Computer Science 4962, pages 186-200. Springer-Verlag, March 2008. 
@inproceedings{fossacs2008-Boz,
  author =              {Bozzelli, Laura},
  title =               {The complexity of CTL\textsuperscript{*} + Linear
                         Past},
  editor =              {Amadio, Roberto},
  booktitle =           {{P}roceedings of the 11th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'08)},
  acronym =             {{FoSSaCS}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4962},
  pages =               {186-200},
  year =                {2008},
  month =               mar,
}
[BP03] Bruno Blanchet and Andreas Podelski. Verification of Cryptographic Protocols: Tagging Enforces Temrination. In FoSSaCS'03, Lecture Notes in Computer Science 2620, pages 136-152. Springer-Verlag, April 2003. 
@inproceedings{fossacs2003-BP,
  author =              {Blanchet, Bruno and Podelski, Andreas},
  title =               {Verification of Cryptographic Protocols: Tagging
                         Enforces Temrination},
  editor =              {Gordon, Andrew D.},
  booktitle =           {{P}roceedings of the 6th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'03)},
  acronym =             {{FoSSaCS}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2620},
  pages =               {136-152},
  year =                {2003},
  month =               apr,
}
[BPM81] Mordechai Ben-Ari, Amir Pnueli, and Zohar Manna. The Temporal Logic of Branching Time. In POPL'81, pages 164-176. ACM Press, January 1981. 
@inproceedings{popl1981-BPM,
  author =              {Ben{-}Ari, Mordechai and Pnueli, Amir and Manna,
                         Zohar},
  title =               {The Temporal Logic of Branching Time},
  booktitle =           {Conference Record of the 8th {ACM} {S}ymposium on
                         {P}rinciples of {P}rogramming {L}anguages
                         ({POPL}'81)},
  acronym =             {{POPL}'81},
  publisher =           {ACM Press},
  pages =               {164-176},
  year =                {1981},
  month =               jan,
}
[BPM83] Mordechai Ben-Ari, Amir Pnueli, and Zohar Manna. The Temporal Logic of Branching Time. Acta Informatica 20:207-226. Springer-Verlag, 1983. 
@article{acta20()-BPM,
  author =              {Ben{-}Ari, Mordechai and Pnueli, Amir and Manna,
                         Zohar},
  title =               {The Temporal Logic of Branching Time},
  publisher =           {Springer-Verlag},
  journal =             {Acta Informatica},
  volume =              {20},
  pages =               {207-226},
  year =                {1983},
}
[BPR+16] Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, and Mathieu Sassolas. Admissibility in Quantitative Graph Games. In FSTTCS'16, Leibniz International Proceedings in Informatics, pages 42:1-42:14. Leibniz-Zentrum für Informatik, December 2016. 
@inproceedings{fsttcs2016-BPRS,
  author =              {Brenguier, Romain and P{\'e}rez, Guillermo A. and
                         Raskin, Jean-Fran{\c c}ois and Sassolas, Mathieu},
  title =               {Admissibility in Quantitative Graph Games},
  editor =              {Akshay, S. and Lal, Akash and Saurabh, Saket and
                         Sen, Sandeep},
  booktitle =           {{P}roceedings of the 36th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'16)},
  acronym =             {{FSTTCS}'16},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  pages =               {42:1-42:14},
  year =                {2016},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2016.42},
}
[BR01] Thomas Ball and Sriram Rajamani. The SLAM toolkit. In CAV'01, Lecture Notes in Computer Science 2102, pages 260-264. Springer-Verlag, July 2001. 
@inproceedings{cav2001-BR,
  author =              {Ball, Thomas and Rajamani, Sriram},
  title =               {The {SLAM} toolkit},
  editor =              {Berry, G{\'e}rard and Comon, Hubert and Finkel,
                         Alain},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'01)},
  acronym =             {{CAV}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2102},
  pages =               {260-264},
  year =                {2001},
  month =               jul,
}
[BR02] Danièle Beauquier and Alexander Rabinovich. Monadic Logic of Order over Naturals has no Finite Base. Journal of Logic and Computation 12(2):243-253. Oxford University Press, April 2002. 
@article{jlc12(2)-BR,
  author =              {Beauquier, Dani{\`e}le and Rabinovich, Alexander},
  title =               {Monadic Logic of Order over Naturals has no Finite
                         Base},
  publisher =           {Oxford University Press},
  journal =             {Journal of Logic and Computation},
  volume =              {12},
  number =              {2},
  pages =               {243-253},
  year =                {2002},
  month =               apr,
}
[BR03] Véronique Bruyère and Jean-François Raskin. Real-Time Model-Checking: Parameters Everywhere. In FSTTCS'03, Lecture Notes in Computer Science 2914, pages 100-111. Springer-Verlag, December 2003. 
@inproceedings{fsttcs2003-BR,
  author =              {Bruy{\`e}re, V{\'e}ronique and Raskin, Jean-Fran{\c
                         c}ois},
  title =               {Real-Time Model-Checking: {P}arameters Everywhere},
  editor =              {Pandya, Paritosh K. and Radhakrishnan, Jaikumar},
  booktitle =           {{P}roceedings of the 23rd {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'03)},
  acronym =             {{FSTTCS}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2914},
  pages =               {100-111},
  year =                {2003},
  month =               dec,
}
[Bra98] Julian C. Bradfield. The Modal Mu-Calculus Alternation Hierarchy is Strict. Theoretical Computer Science 195(2):133-153. Elsevier, March 1998. 
@article{tcs195(2)-Bra,
  author =              {Bradfield, Julian C.},
  title =               {The Modal Mu-Calculus Alternation Hierarchy is
                         Strict},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {195},
  number =              {2},
  pages =               {133-153},
  year =                {1998},
  month =               mar,
}
[BRB90] Karl S. Brace, Richard L. Ruddel, and Randal E. Bryant. Efficient Implementation of a BDD package. In DAC'90, pages 40-45. IEEE Comp. Soc. Press, June 1990. 
@inproceedings{dac1990-BRB,
  author =              {Brace, Karl S. and Ruddel, Richard L. and Bryant,
                         Randal E.},
  title =               {Efficient Implementation of a {BDD} package},
  booktitle =           {{P}roceedings of the 27th {D}esign {A}utomation
                         {C}onference ({DAC}'90)},
  acronym =             {{DAC}'90},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {40-45},
  year =                {1990},
  month =               jun,
}
[Bre12] Romain Brenguier. Nash Equilibria in Concurrent Games –Application to Timed Games. Thèse de doctorat, Lab. Spécification & Vérification, ENS Cachan, France, November 2012. 
@phdthesis{phd-brenguier,
  author =              {Brenguier, Romain},
  title =               {Nash Equilibria in Concurrent Games~--Application to
                         Timed Games},
  year =                {2012},
  month =               nov,
  school =              {Lab.~Sp\'ecification \& V\'erification, ENS Cachan,
                         France},
  type =                {Th\`ese de doctorat},
}
[Bre16] Romain Brenguier. Optimal Assumptions for Synthesis. In CONCUR'16, Leibniz International Proceedings in Informatics 59, pages 8:1-8:15. Leibniz-Zentrum für Informatik, August 2016. 
@inproceedings{concur2016-Bre,
  author =              {Brenguier, Romain},
  title =               {Optimal Assumptions for Synthesis},
  editor =              {Desharnais, Jules and Jagadeesan, Radha},
  booktitle =           {{P}roceedings of the 27th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'16)},
  acronym =             {{CONCUR}'16},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {59},
  pages =               {8:1-8:15},
  year =                {2016},
  month =               aug,
  doi =                 {10.4230/LIPIcs.CONCUR.2016.8},
}
[BRS13] Marcello Maria Bersani, Matteo Rossi, and Pierluigi San Pietro. Deciding the Satisfiability of MITL Specifications. In GandALF'13, Electronic Proceedings in Theoretical Computer Science 119, pages 64-78. August 2013. 
@inproceedings{gandalf2013-BRS,
  author =              {Bersani, Marcello Maria and Rossi, Matteo and
                         San{~}Pietro, Pierluigi},
  title =               {Deciding the Satisfiability of {MITL}
                         Specifications},
  editor =              {Puppis, Gabriele and Villa, Tiziano},
  booktitle =           {{P}roceedings of the 4th {I}nternational {S}ymposium
                         on {G}ames, {A}utomata, {L}ogics and {F}ormal
                         {V}erification ({GandALF}'13)},
  acronym =             {{GandALF}'13},
  series =              {Electronic Proceedings in Theoretical Computer
                         Science},
  volume =              {119},
  pages =               {64-78},
  year =                {2013},
  month =               aug,
  doi =                 {10.4204/EPTCS.119.8},
}
[BRS14] Romain Brenguier, Jean-François Raskin, and Mathieu Sassolas. The complexity of admissibility in omega-regular games. In CSL/ LICS'14, pages 23:1-23:10. ACM Press, July 2014. 
@inproceedings{csllics2014-BRS,
  author =              {Brenguier, Romain and Raskin, Jean-Fran{\c c}ois and
                         Sassolas, Mathieu},
  title =               {The complexity of admissibility in omega-regular
                         games},
  booktitle =           {{P}roceedings of the Joint Meeting of the 23rd
                         {EACSL} {A}nnual {C}onference on {C}omputer
                         {S}cience {L}ogic and the 29th {A}nnual {ACM\slash
                         IEEE} {S}ymposium on {L}ogic {I}n {C}omputer
                         {S}cience ({CSL\slash LICS}'14)},
  acronym =             {{CSL\slash LICS}'14},
  publisher =           {ACM Press},
  pages =               {23:1-23:10},
  year =                {2014},
  month =               jul,
  doi =                 {10.1145/2603088.2603143},
}
[BRS17] Romain Brenguier, Jean-François Raskin, and Ocan Sankur. Assume-admissible synthesis. Acta Informatica 54(1):41-83. Springer-Verlag, February 2017. 
@article{acta54(1)-BRS,
  author =              {Brenguier, Romain and Raskin, Jean-Fran{\c c}ois and
                         Sankur, Ocan},
  title =               {Assume-admissible synthesis},
  publisher =           {Springer-Verlag},
  journal =             {Acta Informatica},
  volume =              {54},
  number =              {1},
  pages =               {41-83},
  year =                {2017},
  month =               feb,
  doi =                 {10.1007/s00236-016-0273-2},
}
[Bru13] Benedikt Brütsch. Synthesizing structured reactive programs via deterministic tree automata. In SR'13, Electronic Proceedings in Theoretical Computer Science 112, pages 107-113. March 2013. 
@inproceedings{sr2013-Bru,
  author =              {Br{\"u}tsch, Benedikt},
  title =               {Synthesizing structured reactive programs via
                         deterministic tree automata},
  booktitle =           {{P}roceedings of the 1st {I}nternational {W}orkshop
                         on {S}trategic {R}easoning ({SR}'13)},
  acronym =             {{SR}'13},
  series =              {Electronic Proceedings in Theoretical Computer
                         Science},
  volume =              {112},
  pages =               {107-113},
  year =                {2013},
  month =               mar,
  doi =                 {10.4204/EPTCS.112.16},
}
[Bry86] Randal E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers 35(8):677-691. IEEE Comp. Soc. Press, August 1986. 
@article{tc35(8)-Bry,
  author =              {Bryant, Randal E.},
  title =               {Graph-Based Algorithms for Boolean Function
                         Manipulation},
  publisher =           {IEEE Comp. Soc. Press},
  journal =             {IEEE Transactions on Computers},
  volume =              {35},
  number =              {8},
  pages =               {677-691},
  year =                {1986},
  month =               aug,
}
[BS91] Janusz A. Brzozowski and Carl-Johan H. Seger. Advances in Asynchronous Circuit Theory Part II: Bounded Inertial Delay Models, MOS Circuits, Design Techniques. EATCS Bulletin 43:199-263. EATCS, February 1991. 
@article{eatcs-bull43()-BS,
  author =              {Brzozowski, Janusz A. and Seger, Carl-Johan H.},
  title =               {Advances in Asynchronous Circuit Theory Part~{II}:
                         Bounded Inertial Delay Models, {MOS} Circuits,
                         Design Techniques},
  publisher =           {EATCS},
  journal =             {EATCS Bulletin},
  volume =              {43},
  pages =               {199-263},
  year =                {1991},
  month =               feb,
}
[BS95] Patrick Blackburn and Jerry Seligman. Hybrid Languages. Journal of Logic, Language and Information 4(3):251-272. Kluwer Academic, 1995. 
@article{jolli4(3)-BS,
  author =              {Blackburn, Patrick and Seligman, Jerry},
  title =               {Hybrid Languages},
  publisher =           {Kluwer Academic},
  journal =             {Journal of Logic, Language and Information},
  volume =              {4},
  number =              {3},
  pages =               {251-272},
  year =                {1995},
}
[BS98] Patrick Blackburn and Jerry Seligman. What are Hybrid Languages?. In AIML'96, pages 41-62. CSLI Publications, 1998. 
@inproceedings{aiml1996-BS,
  author =              {Blackburn, Patrick and Seligman, Jerry},
  title =               {What are Hybrid Languages?},
  editor =              {Kracht, Marcus and de Rijke, Marteen and Wansing,
                         Heinrich and Zakharyaschev, Michael},
  booktitle =           {{P}roceedings of the 1st {W}orkshop on {A}dvances in
                         {M}odal {L}ogic ({AIML}'96)},
  acronym =             {{AIML}'96},
  publisher =           {CSLI Publications},
  pages =               {41-62},
  year =                {1998},
  confyear =            {1996},
  confmonth =           {10},
}
[BS01] Julian C. Bradfield and Colin Stirling. Modal Logics and Mu-Calculi: An Introduction. In Jan A. Bergstra, Alban Ponse, and Scott A. Smolka (eds.), Handbook of Process Algebra. Elsevier, 2001. 
@incollection{HPA-BS,
  author =              {Bradfield, Julian C. and Stirling, Colin},
  title =               {Modal Logics and Mu-Calculi: An Introduction},
  editor =              {Bergstra, Jan A. and Ponse, Alban and Smolka, Scott
                         A.},
  booktitle =           {Handbook of Process Algebra},
  publisher =           {Elsevier},
  chapter =             {1.4},
  year =                {2001},
}
[BS12] Nathalie Bertrand and Sven Schewe. Playing Optimally on Timed Automata with Random Delays. In FORMATS'12, Lecture Notes in Computer Science 7595, pages 43-58. Springer-Verlag, September 2012. 
@inproceedings{formats2012-BS,
  author =              {Bertrand, Nathalie and Schewe, Sven},
  title =               {Playing Optimally on Timed Automata with Random
                         Delays},
  editor =              {Jurdzi{\'n}ski, Marcin and Nickovic, Dejan},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'12)},
  acronym =             {{FORMATS}'12},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7595},
  pages =               {43-58},
  year =                {2012},
  month =               sep,
  doi =                 {10.1007/978-3-642-33365-1_5},
}
[BSJ+15] Nathalie Bertrand, Amélie Stainer, Thierry Jéron, and Moez Krichen. A game approach to determinize timed automata. Formal Methods in System Design 46(1):42-80. Springer-Verlag, February 2015. 
@article{fmsd46(1)-BSJK,
  author =              {Bertrand, Nathalie and Stainer, Am{\'e}lie and
                         J{\'e}ron, Thierry and Krichen, Moez},
  title =               {A~game approach to determinize timed automata},
  publisher =           {Springer-Verlag},
  journal =             {Formal Methods in System Design},
  volume =              {46},
  number =              {1},
  pages =               {42-80},
  year =                {2015},
  month =               feb,
  doi =                 {10.1007/s10703-014-0220-1},
}
[BST98] Sébastien Bornot, Joseph Sifakis, and Stavros Tripakis. Modeling Urgency in Timed Systems. In COMPOS'97, Lecture Notes in Computer Science 1536, pages 103-129. Springer-Verlag, 1998. 
@inproceedings{compos1997-BST,
  author =              {Bornot, S{\'e}bastien and Sifakis, Joseph and
                         Tripakis, Stavros},
  title =               {Modeling Urgency in Timed Systems},
  editor =              {de Roever, Willem-Paul and Langmaack, Hans and
                         Pnueli, Amir},
  booktitle =           {{R}evised {L}ectures of the 1st {I}nternational
                         {S}ymposium on {C}ompositionality: {T}he
                         {S}ignificant {D}ifference ({COMPOS}'97)},
  acronym =             {{COMPOS}'97},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1536},
  pages =               {103-129},
  year =                {1998},
  confyear =            {1997},
  confmonth =           {9},
}
[BST98] Paul Beame, Michael Saks, and Jayram S. Thathachar. Time-Space Tradeoffs for Branching Programs. Research Report 98-053, Electronic Colloquium on Computational Complexity, September 1998. 
@techreport{eccc1998-BST,
  author =              {Beame, Paul and Saks, Michael and Thathachar, Jayram
                         S.},
  title =               {Time-Space Tradeoffs for Branching Programs},
  number =              {98-053},
  year =                {1998},
  month =               sep,
  institution =         {Electronic Colloquium on Computational Complexity},
  type =                {Research Report},
}
[BSV04] Henrik Björklund, Sven Sandberg, and Sergei Vorobyov. Memoryless Determinacy of Parity and Mean Payoff Games: A Simple Proof. Theoretical Computer Science 310(1-3):365-378. Elsevier, January 2004. 
@article{tcs310(1-3)-BSV,
  author =              {Bj{\"o}rklund, Henrik and Sandberg, Sven and
                         Vorobyov, Sergei},
  title =               {Memoryless Determinacy of Parity and Mean Payoff
                         Games: A~Simple Proof},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {310},
  number =              {1-3},
  pages =               {365-378},
  year =                {2004},
  month =               jan,
  doi =                 {10.1016/S0304-3975(03)00427-4},
}
[BT89] Dimitri P. Bertsekas and John N. Tsitsiklis. Parallel and distributed computation: numerical methods. Prentice Hall, 1989. 
@book{BP-pdc1989,
  author =              {Bertsekas, Dimitri P. and Tsitsiklis, John N.},
  title =               {Parallel and distributed computation: numerical
                         methods},
  publisher =           {Prentice Hall},
  year =                {1989},
}
[BT96] Dimitri P. Bertsekas and John N. Tsitsiklis. Neuro-Dynamic Programming. Anthropological Field Studies 3. Athena Scientific, 1996. 
@book{NDP-BT,
  author =              {Bertsekas, Dimitri P. and Tsitsiklis, John N.},
  title =               {Neuro-Dynamic Programming},
  publisher =           {Athena Scientific},
  series =              {Anthropological Field Studies},
  volume =              {3},
  year =                {1996},
}
[BT99] Patrick Blackburn and Miroslava Tzakova. Hybrid Languages and Temporal Logic. Logic Journal of the IGPL 7(1):27-54. Oxford University Press, January 1999. 
@article{jigpl7(1)-BT,
  author =              {Blackburn, Patrick and Tzakova, Miroslava},
  title =               {Hybrid Languages and Temporal Logic},
  publisher =           {Oxford University Press},
  journal =             {Logic Journal of the IGPL},
  volume =              {7},
  number =              {1},
  pages =               {27-54},
  year =                {1999},
  month =               jan,
}
[BT05] Harry Buhrman and Leen Torenvliet. A Post's Program for Complexity Theory. EATCS Bulletin 85:41-51. EATCS, February 2005. 
@article{eatcs-bull85()-BT,
  author =              {Buhrman, Harry and Torenvliet, Leen},
  title =               {A {P}ost's Program for Complexity Theory},
  publisher =           {EATCS},
  journal =             {EATCS Bulletin},
  volume =              {85},
  pages =               {41-51},
  year =                {2005},
  month =               feb,
}
[BTK+02] Cécile Bui Thanh, Hanna Klaudel, and Franck Pommereau. Petri Nets with Causal Time for System Verification. In MTCS'02, Electronic Notes in Theoretical Computer Science 68(5). Elsevier, August 2002. 
@inproceedings{mtcs2003-BKP,
  author =              {Bui Thanh, C{\'e}cile and Klaudel, Hanna and
                         Pommereau, Franck},
  title =               {{P}etri Nets with Causal Time for System
                         Verification},
  editor =              {Vogler, Walter and Larsen, Kim Guldstrand},
  booktitle =           {{P}roceedings of the 3rd {I}nternational {W}orkshop
                         on {M}odels for {T}ime-Critical {S}ystems
                         ({MTCS}'02)},
  acronym =             {{MTCS}'02},
  publisher =           {Elsevier},
  series =              {Electronic Notes in Theoretical Computer Science},
  volume =              {68},
  number =              {5},
  year =                {2002},
  month =               aug,
}
[BTY97] Ahmed Bouajjani, Stavros Tripakis, and Sergio Yovine. On-the-Fly Symbolic Model Checking for Real-Time Systems. In RTSS'97, pages 25-35. IEEE Comp. Soc. Press, December 1997. 
@inproceedings{rts1997-BTY,
  author =              {Bouajjani, Ahmed and Tripakis, Stavros and Yovine,
                         Sergio},
  title =               {On-the-Fly Symbolic Model Checking for Real-Time
                         Systems},
  booktitle =           {{P}roceedings of the 18th {S}ymposium on {R}eal-Time
                         {S}ystems ({RTSS}'97)},
  acronym =             {{RTSS}'97},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {25-35},
  year =                {1997},
  month =               dec,
}
[Buc62] Julius R. Büchi. On a Decision Method in Restricted Second Order Arithmetic. In LMPS'60, pages 1-11. Stanford University Press, June 1962. 
@inproceedings{lmps1960-Buc,
  author =              {B{\"u}chi, Julius R.},
  title =               {On a Decision Method in Restricted Second Order
                         Arithmetic},
  editor =              {Nagel, Ernest and Suppes, Patrick and Tarski,
                         Alfred},
  booktitle =           {{P}roceedings of the 1960 {I}nternational {C}ongress
                         on {L}ogic, {M}ethodology and {P}hilosophy of
                         {S}cience ({LMPS}'60)},
  acronym =             {{LMPS}'60},
  publisher =           {Stanford University Press},
  pages =               {1-11},
  year =                {1962},
  month =               jun,
  confyear =            {1960},
}
[Bur79] John P. Burgess. Logic and Time. Journal of Symbolic Logic 44(4):566-582. Association for Symbolic Logic, December 1979. 
@article{jsl44(4)-Bur,
  author =              {Burgess,John P.},
  title =               {Logic and Time},
  publisher =           {Association for Symbolic Logic},
  journal =             {Journal of Symbolic Logic},
  volume =              {44},
  number =              {4},
  pages =               {566-582},
  year =                {1979},
  month =               dec,
}
[Bur80] John P. Burgess. Decidability for Branching Time. Studia Logica 39(2-3):203-218. Kluwer Academic, 1980. 
@article{studlog39(2-3)-Bur,
  author =              {Burgess,John P.},
  title =               {Decidability for Branching Time},
  publisher =           {Kluwer Academic},
  journal =             {Studia Logica},
  volume =              {39},
  number =              {2-3},
  pages =               {203-218},
  year =                {1980},
}
[Bus87] Samuel R. Buss. The Boolean Formula Value Problem is in ALOGTIME. In STOC'87, pages 123-131. ACM Press, May 1987. 
@inproceedings{stoc1987-Bus,
  author =              {Buss, Samuel R.},
  title =               {The Boolean Formula Value Problem is in {ALOGTIME}},
  booktitle =           {{P}roceedings of the 19th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'87)},
  acronym =             {{STOC}'87},
  publisher =           {ACM Press},
  pages =               {123-131},
  year =                {1987},
  month =               may,
}
[Bus93] Samuel R. Buss. Algorithms for Boolean Formula Evaluation and for Tree Contraction. In Peter Clote and Jan Krajíček (eds.), Proof Theory, Complexity, and Arithmetic. Oxford University Press, 1993. 
@incollection{PTCA-Bus,
  author =              {Buss, Samuel R.},
  title =               {Algorithms for Boolean Formula Evaluation and for
                         Tree Contraction},
  editor =              {Clote, Peter and Kraj{\'\i}{\v c}ek, Jan},
  booktitle =           {Proof Theory, Complexity, and Arithmetic},
  publisher =           {Oxford University Press},
  pages =               {96-115},
  year =                {1993},
}
[Bus97] Samuel R. Buss. ALOGTIME Algorithm for Tree Isomorphism, Comparison, and Canonization. In KGC'97, Lecture Notes in Computer Science 1289, pages 18-33. Springer-Verlag, August 1997. 
@inproceedings{kgc1997-Bus,
  author =              {Buss, Samuel R.},
  title =               {{ALOGTIME} Algorithm for Tree Isomorphism,
                         Comparison, and Canonization},
  editor =              {Gottlob, Georg and Leitsch, Alexander and Mundici,
                         Daniele},
  booktitle =           {{P}roceedings of the 5th {K}urt {G}{\"o}del
                         {C}olloquium ({KGC}'97)},
  acronym =             {{KGC}'97},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1289},
  pages =               {18-33},
  year =                {1997},
  month =               aug,
}
[BV07] Henrik Björklund and Sergei Vorobyov. A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games. Discrete Applied Mathematics 155(2):210-229. Elsevier, January 2007. 
@article{dam155(2)-BV,
  author =              {Bj{\"o}rklund, Henrik and Vorobyov, Sergei},
  title =               {A combinatorial strongly subexponential strategy
                         improvement algorithm for mean payoff games},
  publisher =           {Elsevier},
  journal =             {Discrete Applied Mathematics},
  volume =              {155},
  number =              {2},
  pages =               {210-229},
  year =                {2007},
  month =               jan,
  doi =                 {10.1016/j.dam.2006.04.029},
}
[BVW94] Orna Bernholtz, Moshe Y. Vardi, and Pierre Wolper. An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract). In CAV'94, Lecture Notes in Computer Science 818, pages 142-155. Springer-Verlag, June 1994. 
@inproceedings{cav1994-BVW,
  author =              {Bernholtz, Orna and Vardi, Moshe Y. and Wolper,
                         Pierre},
  title =               {An Automata-Theoretic Approach to Branching-Time
                         Model Checking (Extended Abstract)},
  editor =              {Dill, David L.},
  booktitle =           {{P}roceedings of the 6th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'94)},
  acronym =             {{CAV}'94},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {818},
  pages =               {142-155},
  year =                {1994},
  month =               jun,
}
[BW94] Bertil A. Brandin and W. Murray Wonham. Supervisory Control of Timed Discrete-Event Systems. IEEE Transactions on Automatic Control 39(2):329-342. IEEE Comp. Soc. Press, February 1994. 
@article{tac39(2)-BW,
  author =              {Brandin, Bertil A. and Wonham, W. Murray},
  title =               {Supervisory Control of Timed Discrete-Event Systems},
  publisher =           {IEEE Comp. Soc. Press},
  journal =             {IEEE Transactions on Automatic Control},
  volume =              {39},
  number =              {2},
  pages =               {329-342},
  year =                {1994},
  month =               feb,
}
[BW17] Julian C. Bradfield and Igor Walukiewicz. The mu-calculus and model-checking. In Edmund M. Clarke, Thomas A. Henzinger, and Helmut Veith (eds.), Handbook of Model Checking. Springer-Verlag, 2017. To appear. 
@incollection{HMC-BW,
  author =              {Bradfield, Julian C. and Walukiewicz, Igor},
  title =               {The mu-calculus and model-checking},
  editor =              {Clarke, Edmund M. and Henzinger, Thomas A. and
                         Veith, Helmut},
  booktitle =           {Handbook of Model Checking},
  publisher =           {Springer-Verlag},
  year =                {2017},
  note =                {To~appear},
}
[BY03] Johan Bengtsson and Wang Yi. On Clock Difference Constraints and Termination in Reachability Analysis of Timed Automata. In ICFEM'03. Springer-Verlag, November 2003. 
@incollection{icfem2003-BY,
  author =              {Bengtsson, Johan and Yi, Wang},
  title =               {On Clock Difference Constraints and Termination in
                         Reachability Analysis of Timed Automata},
  booktitle =           {{P}roceedings of the 5th {I}nternational
                         {C}onference on {F}ormal {E}ngineering {M}ethods
                         ({ICFEM}'03)},
  acronym =             {{ICFEM}'03},
  publisher =           {Springer-Verlag},
  pages =               {491-503},
  year =                {2003},
  month =               nov,
}
[BY04] Johan Bengtsson and Wang Yi. Timed Automata: Semantics, Algorithms and Tools. In Jörg Desel, Wolfgang Reisig, and Grzegorz Rozenberg (eds.), Lectures on Concurrency and Petri Nets, Lecture Notes in Computer Science 2098, pages 87-124. Springer-Verlag, 2004. 
@incollection{lncs3098-BY,
  author =              {Bengtsson, Johan and Yi, Wang},
  title =               {Timed Automata: Semantics, Algorithms and Tools},
  editor =              {Desel, J{\"o}rg and Reisig, Wolfgang and Rozenberg,
                         Grzegorz},
  booktitle =           {Lectures on Concurrency and {P}etri Nets},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2098},
  pages =               {87-124},
  year =                {2004},
  doi =                 {10.1007/b98282},
}
C
[tC06] Balder ten Cate. Expressivity of Second Order Propositional Modal Logic. Journal of Philosophical Logic 35(2):209-223. Springer-Verlag, September 2006. 
@article{jpl35(2)-Cat,
  author =              {ten Cate, Balder},
  title =               {Expressivity of Second Order Propositional Modal
                         Logic},
  publisher =           {Springer-Verlag},
  journal =             {Journal of Philosophical Logic},
  volume =              {35},
  number =              {2},
  pages =               {209-223},
  year =                {2006},
  month =               sep,
}
[Cac03] Thierry Cachat. Games on Pushdown Graphs and Extensions. Thèse de doctorat, RWTH Aachen, Germany, December 2003. 
@phdthesis{phd-cachat,
  author =              {Cachat, Thierry},
  title =               {Games on Pushdown Graphs and Extensions},
  year =                {2003},
  month =               dec,
  school =              {RWTH Aachen, Germany},
  type =                {Th\`ese de doctorat},
}
[Cac06] Thierry Cachat. Tree Automata Make Ordinal Theory Easy. In FSTTCS'06, Lecture Notes in Computer Science 4337, pages 285-296. Springer-Verlag, December 2006. 
@inproceedings{fsttcs2006-Cac,
  author =              {Cachat, Thierry},
  title =               {Tree Automata Make Ordinal Theory Easy},
  editor =              {Arun-Kumar, S. and Garg, Naveen},
  booktitle =           {{P}roceedings of the 26th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'06)},
  acronym =             {{FSTTCS}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4337},
  pages =               {285-296},
  year =                {2006},
  month =               dec,
}
[CdA+06] Krishnendu Chatterjee, Luca de Alfaro, and Thomas A. Henzinger. The Complexity of Quantitative Concurrent Parity Games. In SODA'06, pages 678-687. Society for Industrial and Applied Math., January 2006. 
@inproceedings{soda2006-CdAH,
  author =              {Chatterjee, Krishnendu and de Alfaro, Luca and
                         Henzinger, Thomas A.},
  title =               {The Complexity of Quantitative Concurrent Parity
                         Games},
  booktitle =           {{P}roceedings of the 17th {A}nnual {ACM}-{SIAM}
                         {S}ymposium on {D}iscrete {A}lgorithms ({SODA}'06)},
  acronym =             {{SODA}'06},
  publisher =           {Society for Industrial and Applied Math.},
  pages =               {678-687},
  year =                {2006},
  month =               jan,
  doi =                 {10.1145/1109557.1109631},
}
[CdA+06] Krishnendu Chatterjee, Luca de Alfaro, and Thomas A. Henzinger. Strategy Improvement for Concurrent Reachability Games. In QEST'06, pages 291-300. IEEE Comp. Soc. Press, September 2006. 
@inproceedings{qest2006-CdAH,
  author =              {Chatterjee, Krishnendu and de Alfaro, Luca and
                         Henzinger, Thomas A.},
  title =               {Strategy Improvement for Concurrent Reachability
                         Games},
  booktitle =           {{P}roceedings of the 3rd {I}nternational
                         {C}onference on {Q}uantitative {E}valuation of
                         {S}ystems ({QEST}'06)},
  acronym =             {{QEST}'06},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {291-300},
  year =                {2006},
  month =               sep,
  doi =                 {10.1109/QEST.2006.48},
}
[CdA+03] Arindam Chakrabarti, Luca de Alfaro, Thomas A. Henzinger, and Mariëlle Stoelinga. Resource Interfaces. In EMSOFT'03, Lecture Notes in Computer Science 2855, pages 117-133. Springer-Verlag, October 2003. 
@inproceedings{emsoft2003-CdAHS,
  author =              {Chakrabarti, Arindam and de Alfaro, Luca and
                         Henzinger, Thomas A. and Stoelinga, Mari{\"e}lle},
  title =               {Resource Interfaces},
  editor =              {Alur, Rajeev and Lee, Insup},
  booktitle =           {{P}roceedings of the 3rd {I}nternational
                         {C}onference on {E}mbedded {S}oftware ({EMSOFT}'03)},
  acronym =             {{EMSOFT}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2855},
  pages =               {117-133},
  year =                {2003},
  month =               oct,
  doi =                 {10.1007/978-3-540-45212-6_9},
}
[Cai03] Benoît Caillaud. Project-Team S4. Activity Report, IRISA, Rennes, France, 2003. 
@techreport{AR-s4-2003,
  author =              {Caillaud, Beno{\^\i}t},
  title =               {Project-Team {S4}},
  year =                {2003},
  institution =         {IRISA, Rennes, France},
  type =                {Activity Report},
}
[CAM+04] Scott Cotton, Eugene Asarin, Oded Maler, and Peter Niebert. Some Progress in Satisfiability Checking for Difference Logic. In FORMATS-FTRTFT'04, Lecture Notes in Computer Science 3253, pages 263-276. Springer-Verlag, September 2004. 
@inproceedings{formats2004-CAMN,
  author =              {Cotton, Scott and Asarin, Eugene and Maler, Oded and
                         Niebert, Peter},
  title =               {Some Progress in Satisfiability Checking for
                         Difference Logic},
  editor =              {Lakhnech, Yassine and Yovine, Sergio},
  booktitle =           {{P}roceedings of the {J}oint {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'04) and {F}ormal
                         {T}echniques in {R}eal-Time and {F}ault-Tolerant
                         {S}ystems ({FTRTFT}'04)},
  acronym =             {{FORMATS-FTRTFT}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3253},
  pages =               {263-276},
  year =                {2004},
  month =               sep,
}
[Cas87] Ilaria Castellani. Bisimulations and abstraction homomorphisms. Journal of Computer and System Sciences 34(2-3):210-235. Academic Press, April 1987. 
@article{jcss34(2-3)-Cas,
  author =              {Castellani, Ilaria},
  title =               {Bisimulations and abstraction homomorphisms},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {34},
  number =              {2-3},
  pages =               {210-235},
  year =                {1987},
  month =               apr,
}
[Cas09] Franck Cassez. A note on fault diagnosis algorithms. In CDC'09, pages 6941-6946. IEEE Comp. Soc. Press, December 2009. 
@inproceedings{cdc2009-Cas,
  author =              {Cassez, Franck},
  title =               {A~note on fault diagnosis algorithms},
  booktitle =           {{P}roceedings of the 48th {IEEE} {C}onference on
                         {D}ecision and {C}ontrol ({CDC}'09)},
  acronym =             {{CDC}'09},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {6941-6946},
  year =                {2009},
  month =               dec,
  doi =                 {10.1109/CDC.2009.5399968},
}
[CB13] Franck Cassez and Jean-Luc Béchennec. Timing Analysis of Binary Programs with UPPAAL. In ACSD'13, pages 41-50. IEEE Comp. Soc. Press, July 2013. 
@inproceedings{acsd2013-CB,
  author =              {Cassez, Franck and B{\'e}chennec, Jean-Luc},
  title =               {Timing Analysis of Binary Programs with {UPPAAL}},
  editor =              {Carmona, Josep and Lazarescu, Mihai T. and
                         Pietkiewicz-Koutny, Marta},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onference on {A}pplication of {C}oncurrency to
                         {S}ystem {D}esign ({ACSD}'13)},
  acronym =             {{ACSD}'13},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {41-50},
  year =                {2013},
  month =               jul,
  doi =                 {10.1109/ACSD.2013.7},
}
[CBC13] Christophe Chareton, Julien Brunel, and David Chemouil. Towards an Updatable Strategy Logic. In SR'13, Electronic Proceedings in Theoretical Computer Science 112, pages 91-98. March 2013. 
@inproceedings{sr2013-BCC,
  author =              {Chareton, Christophe and Brunel, Julien and
                         Chemouil, David},
  title =               {Towards an Updatable Strategy Logic},
  booktitle =           {{P}roceedings of the 1st {I}nternational {W}orkshop
                         on {S}trategic {R}easoning ({SR}'13)},
  acronym =             {{SR}'13},
  series =              {Electronic Proceedings in Theoretical Computer
                         Science},
  volume =              {112},
  pages =               {91-98},
  year =                {2013},
  month =               mar,
  doi =                 {10.4204/EPTCS.112.14},
}
[CBK+13] Maximilien Colange, Souheib Baarir, Fabrice Kordon, and Yann Thierry-Mieg. Towards Distributed Software Model-Checking using Decision Diagrams. In CAV'13, Lecture Notes in Computer Science 8044, pages 830-845. Springer-Verlag, July 2013. 
@inproceedings{cav2013-CBKT,
  author =              {Colange, Maximilien and Baarir, Souheib and Kordon,
                         Fabrice and Thierry{-}Mieg, Yann},
  title =               {Towards Distributed Software Model-Checking using
                         Decision Diagrams},
  editor =              {Sharygina, Natasha and Veith, Helmut},
  booktitle =           {{P}roceedings of the 25th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'13)},
  acronym =             {{CAV}'13},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8044},
  pages =               {830-845},
  year =                {2013},
  month =               jul,
  doi =                 {10.1007/978-3-642-39799-8_58},
}
[CC77] Patrick Cousot and Radhia Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In POPL'77, pages 238-252. ACM Press, January 1977. 
@inproceedings{popl1977-CC,
  author =              {Cousot, Patrick and Cousot, Radhia},
  title =               {Abstract Interpretation: A~Unified Lattice Model for
                         Static Analysis of Programs by Construction or
                         Approximation of Fixpoints},
  booktitle =           {Conference Record of the 4th {ACM} {S}ymposium on
                         {P}rinciples of {P}rogramming {L}anguages
                         ({POPL}'77)},
  acronym =             {{POPL}'77},
  publisher =           {ACM Press},
  pages =               {238-252},
  year =                {1977},
  month =               jan,
  doi =                 {10.1145/512950.512973},
}
[CC79] Patrick Cousot and Radhia Cousot. Constructive Versions of Tarski's Fixed Point Theorems. Pacific Journal of Mathematics 82(1):43-57. 1979. 
@article{pjm82(1)-CC,
  author =              {Cousot, Patrick and Cousot, Radhia},
  title =               {Constructive Versions of {T}arski's Fixed Point
                         Theorems},
  journal =             {Pacific Journal of Mathematics},
  volume =              {82},
  number =              {1},
  pages =               {43-57},
  year =                {1979},
}
[CC94] Sérgio Vale Aguiar Campos and Edmund M. Clarke. Real-Time Symbolic Model Checking for Discrete Time Models. Technical Report CMU-CS-94-146, Computer Science Deparment, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA, May 1994. 
@techreport{TR-CMU-CS-94-146,
  author =              {Campos, S{\'e}rgio Vale Aguiar and Clarke, Edmund
                         M.},
  title =               {Real-Time Symbolic Model Checking for Discrete Time
                         Models},
  number =              {CMU-CS-94-146},
  year =                {1994},
  month =               may,
  institution =         {Computer Science Deparment, Carnegie Mellon
                         University, Pittsburgh, Pennsylvania, USA},
  type =                {Technical Report},
}
[CC95] Sérgio Vale Aguiar Campos and Edmund M. Clarke. Real-time symbolic model checking for discrete time models. In Teodor Rus and Charles Rattray (eds.), Real-time symbolic model checking for discrete time models, AMAST Series in Computing 2, pages 129-145. World Scientific, January 1995. 
@incollection{tertsd1995-CC,
  author =              {Campos, S{\'e}rgio Vale Aguiar and Clarke, Edmund
                         M.},
  title =               {Real-time symbolic model checking for discrete time
                         models},
  editor =              {Rus, Teodor and Rattray, Charles},
  booktitle =           {Real-time symbolic model checking for discrete time
                         models},
  publisher =           {World Scientific},
  series =              {AMAST Series in Computing},
  volume =              {2},
  pages =               {129-145},
  year =                {1995},
  month =               jan,
}
[CC99] Sérgio Vale Aguiar Campos and Edmund M. Clarke. Analysis and verification of real-time systems using quantitative symbolic algorithms. International Journal on Software Tools for Technology Transfer 2(3):260-269. Springer-Verlag, November 1999. 
@article{sttt2(3)-CC,
  author =              {Campos, S{\'e}rgio Vale Aguiar and Clarke, Edmund
                         M.},
  title =               {Analysis and verification of real-time systems using
                         quantitative symbolic algorithms},
  publisher =           {Springer-Verlag},
  journal =             {International Journal on Software Tools for
                         Technology Transfer},
  volume =              {2},
  number =              {3},
  pages =               {260-269},
  year =                {1999},
  month =               nov,
  doi =                 {10.1007/s100090050033},
}
[CC00] Hubert Comon and Véronique Cortier. Flatness is not Weakness. In CSL'00, Lecture Notes in Computer Science 1862, pages 262-276. Springer-Verlag, August 2000. 
@inproceedings{csl2000-CC,
  author =              {Comon, Hubert and Cortier, V{\'e}ronique},
  title =               {Flatness is not Weakness},
  editor =              {Clote, Peter and Schwichtenberg, Helmut},
  booktitle =           {{P}roceedings of the 14th {I}nternational {W}orkshop
                         on {C}omputer {S}cience {L}ogic ({CSL}'00)},
  acronym =             {{CSL}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1862},
  pages =               {262-276},
  year =                {2000},
  month =               aug,
}
[CC01] Sérgio Vale Aguiar Campos and Edmund M. Clarke. The Verus Language: Representing Time Efficiently with BDDs. Theoretical Computer Science 253(1):95-118. Elsevier, February 2001. 
@article{tcs253(1)-CC,
  author =              {Campos, S{\'e}rgio Vale Aguiar and Clarke, Edmund
                         M.},
  title =               {The {V}erus Language: Representing Time Efficiently
                         with {BDD}s},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {253},
  number =              {1},
  pages =               {95-118},
  year =                {2001},
  month =               feb,
}
[CC02] Cristian S. Calude and Elena Calude. The Bridge Crossing Problem. EATCS Bulletin 77:180-190. EATCS, June 2002. 
@article{eatcs-bull77()-CC,
  author =              {Calude, Cristian S. and Calude, Elena},
  title =               {The Bridge Crossing Problem},
  publisher =           {EATCS},
  journal =             {EATCS Bulletin},
  volume =              {77},
  pages =               {180-190},
  year =                {2002},
  month =               jun,
}
[CCG+02] Alessandro Cimatti, Edmund M. Clarke, Enrico Giunchiglia, Fausto Giunchiglia, Marco Pistore, Marco Roveri, Roberto Sebastiani, and Armando Tacchella. NuSMV2: An OpenSource Tool for Symbolic Model Checking. In CAV'02, Lecture Notes in Computer Science 2404, pages 359-364. Springer-Verlag, July 2002. 
@inproceedings{cav2002-CCGGPRST,
  author =              {Cimatti, Alessandro and Clarke, Edmund M. and
                         Giunchiglia, Enrico and Giunchiglia, Fausto and
                         Pistore, Marco and Roveri, Marco and Sebastiani,
                         Roberto and Tacchella, Armando},
  title =               {{NuSMV2}: An OpenSource Tool for Symbolic Model
                         Checking},
  editor =              {Brinksma, Ed and Larsen, Kim Guldstrand},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'02)},
  acronym =             {{CAV}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2404},
  pages =               {359-364},
  year =                {2002},
  month =               jul,
}
[CCG+99] Alessandro Cimatti, Edmund M. Clarke, Fausto Giunchiglia, and Marco Roveri. NuSMV: A New Symbolic Model Verifier. In CAV'99, Lecture Notes in Computer Science 1633, pages 495-499. Springer-Verlag, July 1999. 
@inproceedings{cav1999-CCGR,
  author =              {Cimatti, Alessandro and Clarke, Edmund M. and
                         Giunchiglia, Fausto and Roveri, Marco},
  title =               {{NuSMV}: A New Symbolic Model Verifier},
  editor =              {Halbwachs, Nicolas and Peled, Doron A.},
  booktitle =           {{P}roceedings of the 11th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'99)},
  acronym =             {{CAV}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1633},
  pages =               {495-499},
  year =                {1999},
  month =               jul,
}
[CCG+00] Alessandro Cimatti, Edmund M. Clarke, Fausto Giunchiglia, and Marco Roveri. NuSMV: A New Symbolic Model Checker. International Journal on Software Tools for Technology Transfer 2(4):410-425. Springer-Verlag, March 2000. 
@article{sttt2(4)-CCGR,
  author =              {Cimatti, Alessandro and Clarke, Edmund M. and
                         Giunchiglia, Fausto and Roveri, Marco},
  title =               {{NuSMV}: A New Symbolic Model Checker},
  publisher =           {Springer-Verlag},
  journal =             {International Journal on Software Tools for
                         Technology Transfer},
  volume =              {2},
  number =              {4},
  pages =               {410-425},
  year =                {2000},
  month =               mar,
}
[CCJ06] Franck Cassez, Thomas Chatain, and Claude Jard. Symbolic Unfoldings for Networks of Timed Automata. In ATVA'06, Lecture Notes in Computer Science 4218, pages 307-321. Springer-Verlag, October 2006. 
@inproceedings{atva2006-CCJ,
  author =              {Cassez, Franck and Chatain, {\relax Th}omas and
                         Jard, Claude},
  title =               {Symbolic Unfoldings for Networks of Timed Automata},
  editor =              {Graf, Susanne and Zhang, Wenhui},
  booktitle =           {{P}roceedings of the 4th {I}nternational {S}ymposium
                         on {A}utomated {T}echnology for {V}erification and
                         {A}nalysis ({ATVA}'06)},
  acronym =             {{ATVA}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4218},
  pages =               {307-321},
  year =                {2006},
  month =               oct,
  doi =                 {10.1007/11901914_24},
}
[CCM+95] Sérgio Vale Aguiar Campos, Edmund M. Clarke, Wilfredo R. Marrero, and Marius Minea. Verifying the performance of the PCI local bus using symbolic techniques. In ICCD'95, pages 72-78. IEEE Comp. Soc. Press, October 1995. 
@inproceedings{iccd1995-CCMM,
  author =              {Campos, S{\'e}rgio Vale Aguiar and Clarke, Edmund M.
                         and Marrero, Wilfredo R. and Minea, Marius},
  title =               {Verifying the performance of the PCI local bus using
                         symbolic techniques},
  booktitle =           {{P}roceedings of the 5th {I}nternational
                         {C}onference on {C}omputer {D}esign ({ICCD}'95)},
  acronym =             {{ICCD}'95},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {72-78},
  year =                {1995},
  month =               oct,
}
[CCM+94] Sérgio Vale Aguiar Campos, Edmund M. Clarke, Wilfredo R. Marrero, Marius Minea, and Hiromi Hiraishi. Computing Quantitative Characteristics of Finite-State Real-Time Systems. Technical Report CMU-CS-94-147, Computer Science Deparment, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA, May 1994. 
@techreport{TR-CMU-CS-94-147,
  author =              {Campos, S{\'e}rgio Vale Aguiar and Clarke, Edmund M.
                         and Marrero, Wilfredo R. and Minea, Marius and
                         Hiraishi, Hiromi},
  title =               {Computing Quantitative Characteristics of
                         Finite-State Real-Time Systems},
  number =              {CMU-CS-94-147},
  year =                {1994},
  month =               may,
  institution =         {Computer Science Deparment, Carnegie Mellon
                         University, Pittsburgh, Pennsylvania, USA},
  type =                {Technical Report},
}
[CCM+20] Riccardo Colini-Baldeschi, Roberto Cominetti, Panayotis Mertikopoulos, and Marco Scarsini. When is selfish routing bad? The price of anarchy in light and heavy traffic. Operations Research 68(2):411-434. Informs, April 2020. 
@article{or68(2)-CCMS,
  author =              {Colini{-}Baldeschi, Riccardo and Cominetti, Roberto
                         and Mertikopoulos, Panayotis and Scarsini, Marco},
  title =               {When is selfish routing bad? {T}he~price of anarchy
                         in light and heavy traffic},
  publisher =           {Informs},
  journal =             {Operations Research},
  volume =              {68},
  number =              {2},
  pages =               {411-434},
  year =                {2020},
  month =               apr,
  doi =                 {10.1287/opre.2019.1894},
}
[CD88] Edmund M. Clarke and I. A. Draghicescu. Expressibility Results for Linear-Time and Branching-Time Logics. In REX'88, Lecture Notes in Computer Science 354, pages 428-437. Springer-Verlag, May 1988. 
@inproceedings{rex1988-CD,
  author =              {Clarke, Edmund M. and Draghicescu, I. A.},
  title =               {Expressibility Results for Linear-Time and
                         Branching-Time Logics},
  editor =              {de~Bakker, Jaco W. and de Roever, Willem-Paul and
                         Rozenberg, Grzegorz},
  booktitle =           {{L}inear {T}ime, {B}ranching {T}ime and {P}artial
                         {O}rder in {L}ogics and {M}odels for
                         {C}oncurrency~--- {P}roceedings of {REX}
                         {S}chool{\slash}{W}orkshop~1988 ({REX}'88)},
  acronym =             {{REX}'88},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {354},
  pages =               {428-437},
  year =                {1988},
  month =               may,
}
[CD10] Krishnendu Chatterjee and Laurent Doyen. Energy Parity Games. In ICALP'10, Lecture Notes in Computer Science 6199, pages 599-610. Springer-Verlag, July 2010. 
@inproceedings{icalp2010-CD,
  author =              {Chatterjee, Krishnendu and Doyen, Laurent},
  title =               {Energy Parity Games},
  editor =              {Abramsky, Samson and Gavoille, Cyril and Kirchner,
                         Claude and Meyer auf der Heide, Friedhelm and
                         Spirakis, Paul G.},
  booktitle =           {{P}roceedings of the 37th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'10)~-- Part~{II}},
  acronym =             {{ICALP}'10},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6199},
  pages =               {599-610},
  year =                {2010},
  month =               jul,
}
[CD12] Krishnendu Chatterjee and Laurent Doyen. Energy Parity Games. Theoretical Computer Science 458:49-60. Elsevier, November 2012. 
@article{tcs458-CD,
  author =              {Chatterjee, Krishnendu and Doyen, Laurent},
  title =               {Energy Parity Games},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {458},
  pages =               {49-60},
  year =                {2012},
  month =               nov,
  doi =                 {10.1016/j.tcs.2012.07.038},
}
[CD16] Krishnendu Chatterjee and Laurent Doyen. Computation Tree Logic for Synchronization Properties. In ICALP'16, Leibniz International Proceedings in Informatics 55, pages 98:1-98:14. Leibniz-Zentrum für Informatik, July 2016. 
@inproceedings{icalp2016-CD,
  author =              {Chatterjee, Krishnendu and Doyen, Laurent},
  title =               {Computation Tree Logic for Synchronization
                         Properties},
  editor =              {Chatzigiannakis, Ioannis and Mitzenmacher, Michael
                         and Rabani, Yuval and Sangiorgi, Davide},
  booktitle =           {{P}roceedings of the 43rd {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'16)~-- Part~{II}},
  acronym =             {{ICALP}'16},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {55},
  pages =               {98:1-98:14},
  year =                {2016},
  month =               jul,
  doi =                 {10.4230/LIPIcs.ICALP.2016.98},
}
[CDC04] Krishnendu Chatterjee, Pallab Dasgupta, and P. P. Chakrabarti. The power of first-order quantification over states in branching and linear time temporal logics. Information Processing Letters 91(5):201-210. Elsevier, September 2004. 
@article{ipl91(5)-CDC,
  author =              {Chatterjee, Krishnendu and Dasgupta, Pallab and
                         Chakrabarti, P. P.},
  title =               {The power of first-order quantification over states
                         in branching and linear time temporal logics},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {91},
  number =              {5},
  pages =               {201-210},
  year =                {2004},
  month =               sep,
}
[CDF+05] Franck Cassez, Alexandre David, Emmanuel Fleury, Kim Guldstrand Larsen, and Didier Lime. Efficient On-the-fly Algorithms for the Analysis of Timed Games. In CONCUR'05, Lecture Notes in Computer Science 3653, pages 66-80. Springer-Verlag, August 2005. 
@inproceedings{concur2005-CDFLL,
  author =              {Cassez, Franck and David, Alexandre and Fleury,
                         Emmanuel and Larsen, Kim Guldstrand and Lime,
                         Didier},
  title =               {Efficient On-the-fly Algorithms for the Analysis of
                         Timed Games},
  editor =              {Abadi, Mart{\'\i}n and de Alfaro, Luca},
  booktitle =           {{P}roceedings of the 16th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'05)},
  acronym =             {{CONCUR}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3653},
  pages =               {66-80},
  year =                {2005},
  month =               aug,
  doi =                 {10.1007/11539452_9},
}
[CDF+14] Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot, and Jean-François Raskin. Doomsday Equilibria for Omega-Regular Games. In VMCAI'14, Lecture Notes in Computer Science 8318, pages 78-97. Springer-Verlag, January 2014. 
@inproceedings{vmcai2014-CDFR,
  author =              {Chatterjee, Krishnendu and Doyen, Laurent and
                         Filiot, Emmanuel and Raskin, Jean-Fran{\c c}ois},
  title =               {Doomsday Equilibria for Omega-Regular Games},
  editor =              {McMillan, Kenneth L. and Rival, Xavier},
  booktitle =           {{P}roceedings of the 15th {I}nternational {W}orkshop
                         on {V}erification, {M}odel {C}hecking, and
                         {A}bstract {I}nterpretation ({VMCAI}'14)},
  acronym =             {{VMCAI}'14},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8318},
  pages =               {78-97},
  year =                {2014},
  month =               jan,
  doi =                 {10.1007/978-3-642-54013-4_5},
}
[CDH08] Krishnendu Chatterjee, Laurent Doyen, and Thomas A. Henzinger. Quantitative Languages. In CSL'08, Lecture Notes in Computer Science 5213, pages 385-400. Springer-Verlag, September 2008. 
@inproceedings{csl2008-CDH,
  author =              {Chatterjee, Krishnendu and Doyen, Laurent and
                         Henzinger, Thomas A.},
  title =               {Quantitative Languages},
  editor =              {Kaminski, Michael and Martini, Simone},
  booktitle =           {{P}roceedings of the 22nd {I}nternational {W}orkshop
                         on {C}omputer {S}cience {L}ogic ({CSL}'08)},
  acronym =             {{CSL}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5213},
  pages =               {385-400},
  year =                {2008},
  month =               sep,
  doi =                 {10.1007/978-3-540-87531-4_28},
}
[CDH10] Krishnendu Chatterjee, Laurent Doyen, and Thomas A. Henzinger. Quantitative Languages. ACM Transactions on Computational Logic 11(4). ACM Press, July 2010. 
@article{tocl11(4)-CDH,
  author =              {Chatterjee, Krishnendu and Doyen, Laurent and
                         Henzinger, Thomas A.},
  title =               {Quantitative Languages},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Computational Logic},
  volume =              {11},
  number =              {4},
  year =                {2010},
  month =               jul,
  doi =                 {10.1145/1805950.1805953},
}
[CDH17] Krishnendu Chatterjee, Laurent Doyen, and Thomas A. Henzinger. The Cost of Exactness in Quantitative Reachability. In Models, Algorithms, Logics and Tools: Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday, Lecture Notes in Computer Science 10460, pages 367-381. Springer-Verlag, August 2017. 
@inproceedings{kimfest2017-CDH,
  author =              {Chatterjee, Krishnendu and Doyen, Laurent and
                         Henzinger, Thomas A.},
  title =               {The Cost of Exactness in Quantitative Reachability},
  editor =              {Aceto, Luca and Bacci, Giorgio and Bacci, Giovanni
                         and Ing{\'o}lfsd{\'o}ttir, Anna and Legay, Axel and
                         Mardare, Radu},
  booktitle =           {Models, Algorithms, Logics and Tools: Essays
                         Dedicated to Kim Guldstrand Larsen on the Occasion
                         of His 60th Birthday},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {10460},
  pages =               {367-381},
  year =                {2017},
  month =               aug,
  doi =                 {10.1007/978-3-319-63121-9_18},
}
[CDH+06] Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, and Jean-François Raskin. Algorithms for Omega-Regular Games with Imperfect Information. In CSL'06, Lecture Notes in Computer Science 4207, pages 287-302. Springer-Verlag, September 2006. 
@inproceedings{csl2006-CDHR,
  author =              {Chatterjee, Krishnendu and Doyen, Laurent and
                         Henzinger, Thomas A. and Raskin, Jean-Fran{\c c}ois},
  title =               {Algorithms for Omega-Regular Games with Imperfect
                         Information},
  editor =              {{\'E}sik, Zolt{\'a}n},
  booktitle =           {{P}roceedings of the 20th {I}nternational {W}orkshop
                         on {C}omputer {S}cience {L}ogic ({CSL}'06)},
  acronym =             {{CSL}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4207},
  pages =               {287-302},
  year =                {2006},
  month =               sep,
}
[CDH+10] Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, and Jean-François Raskin. Generalized Mean-payoff and Energy Games. In FSTTCS'10, Leibniz International Proceedings in Informatics 8, pages 505-516. Leibniz-Zentrum für Informatik, December 2010. 
@inproceedings{fsttcs2010-CDHR,
  author =              {Chatterjee, Krishnendu and Doyen, Laurent and
                         Henzinger, Thomas A. and Raskin, Jean-Fran{\c c}ois},
  title =               {Generalized Mean-payoff and Energy Games},
  editor =              {Lodaya, Kamal and Mahajan, Meena},
  booktitle =           {{P}roceedings of the 30th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'10)},
  acronym =             {{FSTTCS}'10},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {8},
  pages =               {505-516},
  year =                {2010},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2010.505},
}
[CDL+07] Franck Cassez, Alexandre David, Kim Guldstrand Larsen, Didier Lime, and Jean-François Raskin. Timed Control with Observation Based and Stuttering Invariant Strategies. In ATVA'07, Lecture Notes in Computer Science 4762, pages 192-206. Springer-Verlag, October 2007. 
@inproceedings{atva2007-CDLLR,
  author =              {Cassez, Franck and David, Alexandre and Larsen, Kim
                         Guldstrand and Lime, Didier and Raskin, Jean-Fran{\c
                         c}ois},
  title =               {Timed Control with Observation Based and Stuttering
                         Invariant Strategies},
  editor =              {Namjoshi, Kedar and Yoneda, Tomohiro and Higashino,
                         Teruo and Okamura, Yoshio},
  booktitle =           {{P}roceedings of the 5th {I}nternational {S}ymposium
                         on {A}utomated {T}echnology for {V}erification and
                         {A}nalysis ({ATVA}'07)},
  acronym =             {{ATVA}'07},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4762},
  pages =               {192-206},
  year =                {2007},
  month =               oct,
  doi =                 {10.1007/978-3-540-75596-8_15},
}
[CDM12] Franck Cassez, Jérémy Dubreil, and Hervé Marchand. Synthesis of opaque systems with static and dynamic masks. Formal Methods in System Design 40(1):88-115. Springer-Verlag, February 2012. 
@article{fmsd40(1)-CDM,
  author =              {Cassez, Franck and Dubreil, J{\'e}r{\'e}my and
                         Marchand, Herv{\'e}},
  title =               {Synthesis of opaque systems with static and dynamic
                         masks},
  publisher =           {Springer-Verlag},
  journal =             {Formal Methods in System Design},
  volume =              {40},
  number =              {1},
  pages =               {88-115},
  year =                {2012},
  month =               feb,
  doi =                 {10.1007/s10703-012-0141-9},
}
[CDR+13] Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, and Jean-François Raskin. Looking at Mean-Payoff and Total-Payoff through Windows. In ATVA'13, Lecture Notes in Computer Science 8172, pages 118-132. Springer-Verlag, October 2013. 
@inproceedings{atva2013-CDRR,
  author =              {Chatterjee, Krishnendu and Doyen, Laurent and
                         Randour, Mickael and Raskin, Jean-Fran{\c c}ois},
  title =               {Looking at Mean-Payoff and Total-Payoff through
                         Windows},
  editor =              {Hung, Dang Van and Ogawa, Mizuhito},
  booktitle =           {{P}roceedings of the 11th {I}nternational
                         {S}ymposium on {A}utomated {T}echnology for
                         {V}erification and {A}nalysis ({ATVA}'13)},
  acronym =             {{ATVA}'13},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8172},
  pages =               {118-132},
  year =                {2013},
  month =               oct,
}
[CDR+15] Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, and Jean-François Raskin. Looking at Mean-Payoff and Total-Payoff through Windows. Information and Computation 242:25-52. Elsevier, June 2015. 
@article{icomp242()-CDRR,
  author =              {Chatterjee, Krishnendu and Doyen, Laurent and
                         Randour, Mickael and Raskin, Jean-Fran{\c c}ois},
  title =               {Looking at Mean-Payoff and Total-Payoff through
                         Windows},
  publisher =           {Elsevier},
  journal =             {Information and Computation},
  volume =              {242},
  pages =               {25-52},
  year =                {2015},
  month =               jun,
  doi =                 {10.1016/j.ic.2015.03.010},
}
[CDS23] Roberto Cominetti, Valerio Dose, and Marco Scarsini. The price of anarchy in routing games as a function of the demand. Mathematical Programming. 2023. To appear. 
@article{mathprog-CDS,
  author =              {Cominetti, Roberto and Dose, Valerio and Scarsini,
                         Marco},
  title =               {The~price of anarchy in routing games as a function
                         of the demand},
  journal =             {Mathematical Programming},
  year =                {2023},
  doi =                 {10.1007/s10107-021-01701-7},
  note =                {To~appear},
}
[CDV02] Diego Calvanese, Giuseppe De Giacomo, and Moshe Y. Vardi. Reasoning about Actions and Planning in LTL Action Theories. In KR'02, pages 593-602. Morgan Kaufmann Publishers, April 2002. 
@inproceedings{kr2002-CDV,
  author =              {Calvanese, Diego and De{~}Giacomo, Giuseppe and
                         Vardi, Moshe Y.},
  title =               {Reasoning about Actions and Planning in {LTL} Action
                         Theories},
  editor =              {Giunchiglia, Fausto},
  booktitle =           {{P}roceedings of the 8th {I}nternational
                         {C}onference on {P}rinciples of {K}nowledge
                         {R}epresentation and {R}easoning ({KR}'02)},
  acronym =             {{KR}'02},
  publisher =           {Morgan Kaufmann Publishers},
  pages =               {593-602},
  year =                {2002},
  month =               apr,
}
[CE80] Edmund M. Clarke and E. Allen Emerson. Characterizing properties of parallel programs as fixpoints. In ICALP'80, Lecture Notes in Computer Science 85, pages 169-181. Springer-Verlag, July 1980. 
@inproceedings{icalp1980-CE,
  author =              {Clarke, Edmund M. and Emerson, E. Allen},
  title =               {Characterizing properties of parallel programs as
                         fixpoints},
  editor =              {de~Bakker, Jaco W. and van Leeuwen, Jan},
  booktitle =           {{P}roceedings of the 7th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'80)},
  acronym =             {{ICALP}'80},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {85},
  pages =               {169-181},
  year =                {1980},
  month =               jul,
}
[CE82] Edmund M. Clarke and E. Allen Emerson. Design and Synthesis of Synchronization Skeletons using Branching-Time Temporal Logic. In LOP'81, Lecture Notes in Computer Science 131, pages 52-71. Springer-Verlag, 1982. 
@inproceedings{lop1981-CE,
  author =              {Clarke, Edmund M. and Emerson, E. Allen},
  title =               {Design and Synthesis of Synchronization Skeletons
                         using Branching-Time Temporal Logic},
  editor =              {Kozen, Dexter C.},
  booktitle =           {{P}roceedings of the 3rd {W}orkshop on {L}ogics of
                         {P}rograms ({LOP}'81)},
  acronym =             {{LOP}'81},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {131},
  pages =               {52-71},
  year =                {1982},
  confyear =            {1981},
  confmonth =           {5},
  doi =                 {10.1007/BFb0025774},
}
[CE11] Bruno Courcelle and Joost Engelfriet. Graph Structure and Monadic Second-Order Logic, a Language Theoretic Approach. Cambridge University Press, 2011. 
@book{mso-CE11,
  author =              {Courcelle, Bruno and Engelfriet, Joost},
  title =               {Graph Structure and Monadic Second-Order Logic, a
                         Language Theoretic Approach},
  publisher =           {Cambridge University Press},
  year =                {2011},
}
[CEJ+98] Edmund M. Clarke, E. Allen Emerson, Somesh Jha, and A. Prasad Sistla. Symmetry Reductions in Model Checking. In CAV'98, Lecture Notes in Computer Science 1427, pages 147-158. Springer-Verlag, June 1998. 
@inproceedings{cav1998-CEJS,
  author =              {Clarke, Edmund M. and Emerson, E. Allen and Jha,
                         Somesh and Sistla, A. Prasad},
  title =               {Symmetry Reductions in Model Checking},
  editor =              {Hu, Alan J. and Vardi, Moshe Y.},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'98)},
  acronym =             {{CAV}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1427},
  pages =               {147-158},
  year =                {1998},
  month =               jun,
  doi =                 {10.1007/BFb0028741},
}
[Cer64] Ján Černý. Poznámka k homogénnym experimentom s konečnými automatmi. Matematicko-fyzikálny časopis 14(3):208-216. 1964. 
@article{mfc14(3)-Cer,
  author =              {{\v{C}}ern{\'y}, J{\'a}n},
  title =               {Pozn{\'a}mka k homog{\'e}nnym experimentom s
                         kone{\v{c}}n{\'y}mi automatmi},
  journal =             {Matematicko-fyzik{\'a}lny {\v{c}}asopis},
  volume =              {14},
  number =              {3},
  pages =               {208-216},
  year =                {1964},
}
[Cer93] Kārlis Čerāns. Decidability of Bisimulation Equivalences for Parallel Timer Processes. In CAV'92, Lecture Notes in Computer Science 663, pages 302-315. Springer-Verlag, 1993. 
@inproceedings{cav1992-Cer,
  author =              {{\v{C}}er{\={a}}ns, K{\={a}}rlis},
  title =               {Decidability of Bisimulation Equivalences for
                         Parallel Timer Processes},
  editor =              {von Bochmann, Gregor and Probst, David K.},
  booktitle =           {{P}roceedings of the 4th {I}nternational {W}orkshop
                         on {C}omputer {A}ided {V}erification ({CAV}'92)},
  acronym =             {{CAV}'92},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {663},
  pages =               {302-315},
  year =                {1993},
  confyear =            {1992},
  confmonth =           {6-7},
}
[CER93] Bruno Courcelle, Joost Engelfriet, and Grzegorz Rozenberg. Handle-rewriting hypergraph grammars. Journal of Computer and System Sciences 46(2). Academic Press, April 1993. 
@article{jcss46-CER93,
  author =              {Courcelle, Bruno and Engelfriet, Joost and
                         Rozenberg, Grzegorz},
  title =               {Handle-rewriting hypergraph grammars},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {46},
  number =              {2},
  year =                {1993},
  month =               apr,
  doi =                 {10.1016/0022-0000(93)90004-G},
}
[Cer14] Petr Čermák. A Model Checker for Strategy Logic. Master's thesis, Dept. of Computing, Imperial College London, UK, June 2014. 
@mastersthesis{master14-Cer,
  author =              {{\v{C}}erm{\'a}k, Petr},
  title =               {A~Model Checker for Strategy Logic},
  year =                {2014},
  month =               jun,
  school =              {Dept. of Computing, Imperial College London, UK},
}
[CES83] Edmund M. Clarke, E. Allen Emerson, and A. Prasad Sistla. Automatic Verification of Finite-State Concurrent Systems using Temporal Logic Specifications: A Practical Approach. In POPL'83, pages 117-126. ACM Press, January 1983. 
@inproceedings{popl1983-CES,
  author =              {Clarke, Edmund M. and Emerson, E. Allen and Sistla,
                         A. Prasad},
  title =               {Automatic Verification of Finite-State Concurrent
                         Systems using Temporal Logic Specifications: A
                         Practical Approach},
  booktitle =           {Conference Record of the 10th {ACM} {S}ymposium on
                         {P}rinciples of {P}rogramming {L}anguages
                         ({POPL}'83)},
  acronym =             {{POPL}'83},
  publisher =           {ACM Press},
  pages =               {117-126},
  year =                {1983},
  month =               jan,
}
[CES86] Edmund M. Clarke, E. Allen Emerson, and A. Prasad Sistla. Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications. ACM Transactions on Programming Languages and Systems 8(2):244-263. ACM Press, April 1986. 
@article{toplas8(2)-CES,
  author =              {Clarke, Edmund M. and Emerson, E. Allen and Sistla,
                         A. Prasad},
  title =               {Automatic Verification of Finite-State Concurrent
                         Systems Using Temporal Logic Specifications},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Programming Languages and
                         Systems},
  volume =              {8},
  number =              {2},
  pages =               {244-263},
  year =                {1986},
  month =               apr,
}
[CES09] Edmund M. Clarke, E. Allen Emerson, and Joseph Sifakis. Model checking: algorithmic verification and debugging. Communications of the ACM 52(11):74-84. ACM Press, November 2009. 
@article{cacm52(11)-CES,
  author =              {Clarke, Edmund M. and Emerson, E. Allen and Sifakis,
                         Joseph},
  title =               {Model checking: algorithmic verification and
                         debugging},
  publisher =           {ACM Press},
  journal =             {Communications of the ACM},
  volume =              {52},
  number =              {11},
  pages =               {74-84},
  year =                {2009},
  month =               nov,
  doi =                 {10.1145/1592761.1592781},
}
[CFG+16] Rodica Condurache, Emmanuel Filiot, Raffaella Gentilini, and Jean-François Raskin. The Complexity of Rational Synthesis. In ICALP'16, Leibniz International Proceedings in Informatics 55, pages 121:1-121:15. Leibniz-Zentrum für Informatik, July 2016. 
@inproceedings{icalp2016-CFGR,
  author =              {Condurache, Rodica and Filiot, Emmanuel and
                         Gentilini, Raffaella and Raskin, Jean-Fran{\c c}ois},
  title =               {The Complexity of Rational Synthesis},
  editor =              {Chatzigiannakis, Ioannis and Mitzenmacher, Michael
                         and Rabani, Yuval and Sangiorgi, Davide},
  booktitle =           {{P}roceedings of the 43rd {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'16)~-- Part~{II}},
  acronym =             {{ICALP}'16},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {55},
  pages =               {121:1-121:15},
  year =                {2016},
  month =               jul,
  doi =                 {10.4230/LIPIcs.ICALP.2016.121},
}
[CFH+03] Edmund M. Clarke, Ansgar Fehnker, Zhi Han, Bruce H. Krogh, Joël Ouaknine, Olaf Stursberg, and Michael Theobald. Abstraction and Countrexample-Guided Refinement in Model Checking of Hybrid Systems. International Journal of Foundations of Computer Science 14(4):583-604. August 2003. 
@article{ijfcs14(4)-CFHKOST,
  author =              {Clarke, Edmund M. and Fehnker, Ansgar and Han, Zhi
                         and Krogh, Bruce H. and Ouaknine, Jo{\"e}l and
                         Stursberg, Olaf and Theobald, Michael},
  title =               {Abstraction and Countrexample-Guided Refinement in
                         Model Checking of Hybrid Systems},
  journal =             {International Journal of Foundations of Computer
                         Science},
  volume =              {14},
  number =              {4},
  pages =               {583-604},
  year =                {2003},
  month =               aug,
  doi =                 {10.1142/S012905410300190X},
}
[CFK+12] Taolue Chen, Vojtěch Forejt, Marta Kwiatkowska, David Parker, and Aistis Simaitis. Automatic Verification of Competitive Stochastic Systems. In TACAS'12, Lecture Notes in Computer Science 7214, pages 315-330. Springer-Verlag, March 2012. 
@inproceedings{CFKPS-tacas2012,
  author =              {Chen, Taolue and Forejt, Vojt{\v{e}}ch and
                         Kwiatkowska, Marta and Parker, David and Simaitis,
                         Aistis},
  title =               {Automatic Verification of Competitive Stochastic
                         Systems},
  editor =              {Flanagan, Cormac and K{\"o}nig, Barbara},
  booktitle =           {{P}roceedings of the 18th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'12)},
  acronym =             {{TACAS}'12},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7214},
  pages =               {315-330},
  year =                {2012},
  month =               mar,
}
[CFK+12] Taolue Chen, Vojtěch Forejt, Marta Kwiatkowska, Aistis Simaitis, Ashutosh Trivedi, and Michael Ummels. Playing Stochastic Games Precisely. In CONCUR'12, Lecture Notes in Computer Science 7454, pages 348-363. Springer-Verlag, September 2012. 
@inproceedings{CFKSTU-concur2012,
  author =              {Chen, Taolue and Forejt, Vojt{\v{e}}ch and
                         Kwiatkowska, Marta and Simaitis, Aistis and Trivedi,
                         Ashutosh and Ummels, Michael},
  title =               {Playing Stochastic Games Precisely},
  editor =              {Koutny, Maciej and Ulidowski, Irek},
  booktitle =           {{P}roceedings of the 23rd {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'12)},
  acronym =             {{CONCUR}'12},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7454},
  pages =               {348-363},
  year =                {2012},
  month =               sep,
}
[CFP+96] Gérard Cécé, Alain Finkel, and S. Purushothaman Iyer. Unreliable Channels are Easier to Verify Than Perfect Channels. Information and Computation 124(1):20-31. Academic Press, January 1996. 
@article{icomp124(1)-CFP,
  author =              {C{\'e}c{\'e}, G{\'e}rard and Finkel, Alain and
                         Purushothaman Iyer, S.},
  title =               {Unreliable Channels are Easier to Verify Than
                         Perfect Channels},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {124},
  number =              {1},
  pages =               {20-31},
  year =                {1996},
  month =               jan,
}
[CG87] Edmund M. Clarke and Orna Grumberg. Research on Automatic Verification of Finite-State Concurrent Systems. Annual Review of Computer Science 2:269-290. Annual Reviews Inc., 1987. 
@article{arcs2()-CG,
  author =              {Clarke, Edmund M. and Grumberg, Orna},
  title =               {Research on Automatic Verification of Finite-State
                         Concurrent Systems},
  publisher =           {Annual Reviews Inc.},
  journal =             {Annual Review of Computer Science},
  volume =              {2},
  pages =               {269-290},
  year =                {1987},
}
[CG96] Boris V. Cherkassky and Andrew V. Goldberg. Negative-Cycle Detection Algorithm. In ESA'96, Lecture Notes in Computer Science 1136, pages 349-363. Springer-Verlag, September 1996. 
@inproceedings{esa1996-CG,
  author =              {Cherkassky, Boris V. and Goldberg, Andrew V.},
  title =               {Negative-Cycle Detection Algorithm},
  editor =              {D{\'\i}az, Josep and Serna, Maria J.},
  booktitle =           {{P}roceedings of the 4th {A}nnual {E}uropean
                         {S}ymposium on {A}lgorithms ({ESA}'96)},
  acronym =             {{ESA}'96},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1136},
  pages =               {349-363},
  year =                {1996},
  month =               sep,
}
[CG14] Namit Chaturvedi and Marcus Gelderie. Weak ω-Regular Trace Languages. Research Report 1402.3199, arXiv, February 2014. 
@techreport{arxiv1402.3199,
  author =              {Chaturvedi, Namit and Gelderie, Marcus},
  title =               {Weak {{\(\omega\)}}-Regular Trace Languages},
  number =              {1402.3199},
  year =                {2014},
  month =               feb,
  institution =         {arXiv},
  type =                {Research Report},
}
[CGH97] Edmund M. Clarke, Orna Grumberg, and Kiyoharu Hamaguchi. Another Look at LTL Model Checking. Formal Methods in System Design 10(1):47-71. Kluwer Academic, February 1997. 
@article{fmsd10(1)-CGH,
  author =              {Clarke, Edmund M. and Grumberg, Orna and Hamaguchi,
                         Kiyoharu},
  title =               {Another Look at {LTL} Model Checking},
  publisher =           {Kluwer Academic},
  journal =             {Formal Methods in System Design},
  volume =              {10},
  number =              {1},
  pages =               {47-71},
  year =                {1997},
  month =               feb,
}
[CGJ+00] Edmund M. Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, and Helmut Veith. Counterexample-Guided Abstraction Refinement. In CAV'00, Lecture Notes in Computer Science 1855, pages 154-169. Springer-Verlag, July 2000. 
@inproceedings{cav2000-CGJLV,
  author =              {Clarke, Edmund M. and Grumberg, Orna and Jha, Somesh
                         and Lu, Yuan and Veith, Helmut},
  title =               {Counterexample-Guided Abstraction Refinement},
  editor =              {Emerson, E. Allen and Sistla, A. Prasad},
  booktitle =           {{P}roceedings of the 12th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'00)},
  acronym =             {{CAV}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1855},
  pages =               {154-169},
  year =                {2000},
  month =               jul,
  doi =                 {10.1007/10722167_15},
}
[CGJ+01] Edmund M. Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, and Helmut Veith. Progress on the State Explosion Problem in Model Checking. In Reinhard Wilhelm (eds.), Informatics – 10 Years Back. 10 Years Ahead, Lecture Notes in Computer Science 2000, pages 176-194. Springer-Verlag, 2001. 
@incollection{lncs2000-CGJLV,
  author =              {Clarke, Edmund M. and Grumberg, Orna and Jha, Somesh
                         and Lu, Yuan and Veith, Helmut},
  title =               {Progress on the State Explosion Problem in Model
                         Checking},
  editor =              {Wilhelm, Reinhard},
  booktitle =           {Informatics~-- 10~Years Back. 10~Years Ahead},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2000},
  pages =               {176-194},
  year =                {2001},
}
[CGJ+03] Edmund M. Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, and Helmut Veith. Counterexample-Guided Abstraction Refinement for Symbolic Model Checking. Journal of the ACM 50(5):752-794. ACM Press, September 2003. 
@article{jacm50(5)-CGJLV,
  author =              {Clarke, Edmund M. and Grumberg, Orna and Jha, Somesh
                         and Lu, Yuan and Veith, Helmut},
  title =               {Counterexample-Guided Abstraction Refinement for
                         Symbolic Model Checking},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {50},
  number =              {5},
  pages =               {752-794},
  year =                {2003},
  month =               sep,
  doi =                 {10.1145/876638.876643},
}
[CGL93] Kārlis Čerāns, Jens Christian Godskesen, and Kim Guldstrand Larsen. Timed Modal Specification - Theory and Tools. In CAV'93, Lecture Notes in Computer Science 697, pages 253-267. Springer-Verlag, June 1993. 
@inproceedings{cav1993-CGL,
  author =              {{\v{C}}er{\={a}}ns, K{\={a}}rlis and Godskesen, Jens
                         Christian and Larsen, Kim Guldstrand},
  title =               {Timed Modal Specification - Theory and Tools},
  editor =              {Courcoubetis, Costas},
  booktitle =           {{P}roceedings of the 5th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'93)},
  acronym =             {{CAV}'93},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {697},
  pages =               {253-267},
  year =                {1993},
  month =               jun,
}
[CGL94] Edmund M. Clarke, Orna Grumberg, and David E. Long. Model Checking. ACM Transactions on Programming Languages and Systems 16(5):1-45. ACM Press, September 1994. 
@article{toplas16(5)-CGL,
  author =              {Clarke, Edmund M. and Grumberg, Orna and Long, David
                         E.},
  title =               {Model Checking},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Programming Languages and
                         Systems},
  volume =              {16},
  number =              {5},
  pages =               {1-45},
  year =                {1994},
  month =               sep,
}
[CGM+95] Edmund M. Clarke, Orna Grumberg, Kenneth L. McMillan, and Xudong Zhao. Efficient Generation of Counterexamples and Witnesses in Symbolic Model Checking. In DAC'95, pages 427-432. ACM Press, June 1995. 
@inproceedings{dac1995-CGMZ,
  author =              {Clarke, Edmund M. and Grumberg, Orna and McMillan,
                         Kenneth L. and Zhao, Xudong},
  title =               {Efficient Generation of Counterexamples and
                         Witnesses in Symbolic Model Checking},
  booktitle =           {{P}roceedings of the 32nd {D}esign {A}utomation
                         {C}onference ({DAC}'95)},
  acronym =             {{DAC}'95},
  publisher =           {ACM Press},
  pages =               {427-432},
  year =                {1995},
  month =               jun,
}
[CGP00] Edmund M. Clarke, Orna Grumberg, and Doron A. Peled. Model checking. MIT Press, 2000. 
@book{MC2000-CGP,
  author =              {Clarke, Edmund M. and Grumberg, Orna and Peled,
                         Doron A.},
  title =               {Model checking},
  publisher =           {MIT Press},
  year =                {2000},
}
[CGP+02] Alessandro Cimatti, Enrico Giunchiglia, Marco Pistore, Marco Roveri, Roberto Sebastiani, and Armando Tacchella. Integrating BDD-based and SAT-based Symbolic Model Checking. In FroCoS'02, Lecture Notes in Computer Science 2309, pages 49-56. Springer-Verlag, April 2002. 
@inproceedings{frocos2002-CGPRST,
  author =              {Cimatti, Alessandro and Giunchiglia, Enrico and
                         Pistore, Marco and Roveri, Marco and Sebastiani,
                         Roberto and Tacchella, Armando},
  title =               {Integrating {BDD}-based and {SAT}-based Symbolic
                         Model Checking},
  editor =              {Armando, Alessandro},
  booktitle =           {{P}roceedings of the 4th {I}nternational {W}orkshop
                         on {F}rontiers of {C}ombining {S}ystems
                         ({FroCoS}'02)},
  acronym =             {{FroCoS}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2309},
  pages =               {49-56},
  year =                {2002},
  month =               apr,
}
[CGS98] Marco Cadoli, Andrea Giovanardi, and Marco Schaerf. An Algorithm to Evaluate Quantified Boolean Formulae. In AAAI-IAAI'98, pages 262-267. MIT Press, July 1998. 
@inproceedings{aaai-iaai1998-CGS,
  author =              {Cadoli, Marco and Giovanardi, Andrea and Schaerf,
                         Marco},
  title =               {An Algorithm to Evaluate Quantified Boolean
                         Formulae},
  booktitle =           {{P}roceedings of the 15th {N}ational {C}onference on
                         {A}rtificial {I}ntelligence ({AAAI}'98) and 10th
                         {I}nnovative {A}pplications of {A}rtificial
                         {I}ntelligence {C}onference ({IAAI}'98)},
  acronym =             {{AAAI-IAAI}'98},
  publisher =           {MIT Press},
  pages =               {262-267},
  year =                {1998},
  month =               jul,
}
[CH14] Arnaud Carayol and Matthew Hague. Regular Strategies In Pushdown Reachability Games. In RP'14, Lecture Notes in Computer Science 8762, pages 58-71. Springer-Verlag, September 2014. 
@inproceedings{rp2014-CH,
  author =              {Carayol, Arnaud and Hague, Matthew},
  title =               {Regular Strategies In Pushdown Reachability Games},
  editor =              {Ouaknine, Jo{\"e}l and Potapov, Igor and Worrell,
                         James},
  booktitle =           {{P}roceedings of the 8th {W}orkshop on
                         {R}eachability {P}roblems in {C}omputational
                         {M}odels ({RP}'14)},
  acronym =             {{RP}'14},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8762},
  pages =               {58-71},
  year =                {2014},
  month =               sep,
  doi =                 {10.1007/978-3-319-11439-2_5},
}
[Cha00] William Chan. Temporal-Logic Queries. In CAV'00, Lecture Notes in Computer Science 1855, pages 450-463. Springer-Verlag, July 2000. 
@inproceedings{cav2000-Cha,
  author =              {Chan, William},
  title =               {Temporal-Logic Queries},
  editor =              {Emerson, E. Allen and Sistla, A. Prasad},
  booktitle =           {{P}roceedings of the 12th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'00)},
  acronym =             {{CAV}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1855},
  pages =               {450-463},
  year =                {2000},
  month =               jul,
}
[Cha07] Krishnendu Chatterjee. Stochastic ω-regular games. PhD thesis, University of Califormia at Berkeley, USA, 2007. 
@phdthesis{phd-chatterjee,
  author =              {Chatterjee, Krishnendu},
  title =               {Stochastic {\(\omega\)}-regular games},
  year =                {2007},
  school =              {University of Califormia at Berkeley, USA},
}
[Cha09] Patryk Chamuczyński. Algorithms and data structures for parametric analysis of real time systems. Thèse de doctorat, University of Göttingen, Germany, 2009. 
@phdthesis{phd-chamuczynski09,
  author =              {Patryk Chamuczy{\'n}ski},
  title =               {Algorithms and data structures for parametric
                         analysis of real time systems},
  year =                {2009},
  school =              {University of G{\"o}ttingen, Germany},
  type =                {Th\`ese de doctorat},
}
[Cha14] Namit Chaturvedi. Toward a structure theory of regular infinitary trace languages. In ICALP'14, Lecture Notes in Computer Science 8573, pages 134-145. Springer-Verlag, July 2014. 
@inproceedings{icalp2014-Cha,
  author =              {Chaturvedi, Namit},
  title =               {Toward a structure theory of regular infinitary
                         trace languages},
  editor =              {Esparza, Javier and Fraigniaud, Pierre and
                         Koutsoupias, Elias},
  booktitle =           {{P}roceedings of the 41st {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'14)~-- Part~{II}},
  acronym =             {{ICALP}'14},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8573},
  pages =               {134-145},
  year =                {2014},
  month =               jul,
  doi =                 {10.1007/978-3-662-43951-7_12},
}
[Cha14] Namit Chaturvedi. Languages of Infinite Traces and Deterministic Asynchronous Automata. Research Report AIB-2014-004, RWTH Aachen, Germany, February 2014. 
@techreport{AIB-2014-04,
  author =              {Chaturvedi, Namit},
  title =               {Languages of Infinite Traces and Deterministic
                         Asynchronous Automata},
  number =              {AIB-2014-004},
  year =                {2014},
  month =               feb,
  institution =         {RWTH Aachen, Germany},
  type =                {Research Report},
}
[CHJ04] Krishnendu Chatterjee, Thomas A. Henzinger, and Marcin Jurdziński. Games with Secure Equilibria. In LICS'04, pages 160-169. IEEE Comp. Soc. Press, July 2004. 
@inproceedings{lics2004-CHJ,
  author =              {Chatterjee, Krishnendu and Henzinger, Thomas A. and
                         Jurdzi{\'n}ski, Marcin},
  title =               {Games with Secure Equilibria},
  booktitle =           {{P}roceedings of the 19th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'04)},
  acronym =             {{LICS}'04},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {160-169},
  year =                {2004},
  month =               jul,
}
[CHJ05] Krishnendu Chatterjee, Thomas A. Henzinger, and Marcin Jurdziński. Mean-payoff Parity Games. In LICS'05, pages 178-187. IEEE Comp. Soc. Press, July 2005. 
@inproceedings{lics2005-CHJ,
  author =              {Chatterjee, Krishnendu and Henzinger, Thomas A. and
                         Jurdzi{\'n}ski, Marcin},
  title =               {Mean-payoff Parity Games},
  booktitle =           {{P}roceedings of the 20th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'05)},
  acronym =             {{LICS}'05},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {178-187},
  year =                {2005},
  month =               jul,
}
[CHJ06] Krishnendu Chatterjee, Thomas A. Henzinger, and Marcin Jurdziński. Games with Secure Equilibria. Theoretical Computer Science 365(1-2):67-82. Elsevier, November 2006. 
@article{tcs365(1-2)-CHJ,
  author =              {Chatterjee, Krishnendu and Henzinger, Thomas A. and
                         Jurdzi{\'n}ski, Marcin},
  title =               {Games with Secure Equilibria},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {365},
  number =              {1-2},
  pages =               {67-82},
  year =                {2006},
  month =               nov,
}
[Cho03] Hana Chockler. Coverage Metrics for Model Checking. PhD thesis, Hebrew University, Jerusalem, Israel, September 2003. 
@phdthesis{phd-chockler,
  author =              {Chockler, Hana},
  title =               {Coverage Metrics for Model Checking},
  year =                {2003},
  month =               sep,
  school =              {Hebrew University, Jerusalem, Israel},
}
[CHO+13] Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop, and Andreas Pavlogiannis. Distributed synthesis for LTL fragments. In FMCAD'13, pages 18-25. IEEE Comp. Soc. Press, October 2013. 
@inproceedings{fmcad2013-CHOP,
  author =              {Chatterjee, Krishnendu and Henzinger, Thomas A. and
                         Otop, Jan and Pavlogiannis, Andreas},
  title =               {Distributed synthesis for {LTL} fragments},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onference on {F}ormal {M}ethods in
                         {C}omputer-{A}ided {D}esign ({FMCAD}'13)},
  acronym =             {{FMCAD}'13},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {18-25},
  year =                {2013},
  month =               oct,
}
[CHP07] Krishnendu Chatterjee, Thomas A. Henzinger, and Nir Piterman. Generalized Parity Games. In FoSSaCS'07, Lecture Notes in Computer Science 4423, pages 153-167. Springer-Verlag, March 2007. 
@inproceedings{fossacs2007-CHP,
  author =              {Chatterjee, Krishnendu and Henzinger, Thomas A. and
                         Piterman, Nir},
  title =               {Generalized Parity Games},
  editor =              {Seidl, Helmut},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'07)},
  acronym =             {{FoSSaCS}'07},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4423},
  pages =               {153-167},
  year =                {2007},
  month =               mar,
}
[CHP07] Krishnendu Chatterjee, Thomas A. Henzinger, and Nir Piterman. Strategy Logic. In CONCUR'07, Lecture Notes in Computer Science 4703, pages 59-73. Springer-Verlag, September 2007. 
@inproceedings{concur2007-CHP,
  author =              {Chatterjee, Krishnendu and Henzinger, Thomas A. and
                         Piterman, Nir},
  title =               {Strategy Logic},
  editor =              {Caires, Lu{\'\i}s and Vasconcelos, Vasco T.},
  booktitle =           {{P}roceedings of the 18th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'07)},
  acronym =             {{CONCUR}'07},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4703},
  pages =               {59-73},
  year =                {2007},
  month =               sep,
  doi =                 {10.1007/978-3-540-74407-8_5},
}
[CHP08] Krishnendu Chatterjee, Thomas A. Henzinger, and Nir Piterman. Algorithms for Büchi games. Research Report 0805.2620, arXiv, May 2008. 
@techreport{corr0805.2620-CHP,
  author =              {Chatterjee, Krishnendu and Henzinger, Thomas A. and
                         Piterman, Nir},
  title =               {Algorithms for {B}{\"u}chi games},
  number =              {0805.2620},
  year =                {2008},
  month =               may,
  institution =         {arXiv},
  type =                {Research Report},
}
[CHP10] Krishnendu Chatterjee, Thomas A. Henzinger, and Nir Piterman. Strategy Logic. Information and Computation 208(6):677-693. Elsevier, June 2010. 
@article{icomp208(6)-CHP,
  author =              {Chatterjee, Krishnendu and Henzinger, Thomas A. and
                         Piterman, Nir},
  title =               {Strategy Logic},
  publisher =           {Elsevier},
  journal =             {Information and Computation},
  volume =              {208},
  number =              {6},
  pages =               {677-693},
  year =                {2010},
  month =               jun,
  doi =                 {10.1016/j.ic.2009.07.004},
}
[CHP11] Krishnendu Chatterjee, Thomas A. Henzinger, and Vinayak S. Prabhu. Timed Parity Games: Complexity and Robustness. Logical Methods in Computer Science 7(4). December 2011. 
@article{lmcs7(4)-CHP,
  author =              {Chatterjee, Krishnendu and Henzinger, Thomas A. and
                         Prabhu, Vinayak S.},
  title =               {Timed Parity Games: Complexity and Robustness},
  journal =             {Logical Methods in Computer Science},
  volume =              {7},
  number =              {4},
  year =                {2011},
  month =               dec,
  doi =                 {10.2168/LMCS-7(4:8)2011},
}
[CHR02] Franck Cassez, Thomas A. Henzinger, and Jean-François Raskin. A Comparison of Control Problems for Timed and Hybrid Systems. In HSCC'02, Lecture Notes in Computer Science 2289, pages 134-148. Springer-Verlag, March 2002. 
@inproceedings{hscc2002-CHR,
  author =              {Cassez, Franck and Henzinger, Thomas A. and Raskin,
                         Jean-Fran{\c c}ois},
  title =               {A Comparison of Control Problems for Timed and
                         Hybrid Systems},
  editor =              {Tomlin, Claire and Greenstreet, Mark R.},
  booktitle =           {{P}roceedings of the 5th {I}nternational {W}orkshop
                         on {H}ybrid {S}ystems: {C}omputation and {C}ontrol
                         ({HSCC}'02)},
  acronym =             {{HSCC}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2289},
  pages =               {134-148},
  year =                {2002},
  month =               mar,
}
[CHR12] Pavol Černý, Thomas A. Henzinger, and Arjun Radhakrishna. Simulation distances. Theoretical Computer Science 413(1):21-35. Elsevier, January 2012. 
@article{tcs413(1)-CHR,
  author =              {{\v{C}}ern{\'y}, Pavol and Henzinger, Thomas A. and
                         Radhakrishna, Arjun},
  title =               {Simulation distances},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {413},
  number =              {1},
  pages =               {21-35},
  year =                {2012},
  month =               jan,
  doi =                 {10.1016/j.tcs.2011.08.002},
}
[CHR13] Pavol Černý, Thomas A. Henzinger, and Arjun Radhakrishna. Quantitative abstraction refinement. In POPL'13, pages 115-128. ACM Press, January 2013. 
@inproceedings{popl2013-CHR,
  author =              {{\v{C}}ern{\'y}, Pavol and Henzinger, Thomas A. and
                         Radhakrishna, Arjun},
  title =               {Quantitative abstraction refinement},
  editor =              {Giacobazzi, Roberto and Cousot, Radhia},
  booktitle =           {Conference Record of the 40th {ACM}
                         {SIGPLAN}-{SIGACT} {S}ymposium on {P}rinciples of
                         {P}rogramming {L}anguages ({POPL}'13)},
  acronym =             {{POPL}'13},
  publisher =           {ACM Press},
  pages =               {115-128},
  year =                {2013},
  month =               jan,
  doi =                 {10.1145/2429069.2429085},
}
[CHS11] Arnaud Carayol, Axel Haddad, and Olivier Serre. Qualitative Tree Languages. In LICS'11, pages 13-22. IEEE Comp. Soc. Press, June 2011. 
@inproceedings{lics2011-CHS,
  author =              {Carayol, Arnaud and Haddad, Axel and Serre, Olivier},
  title =               {Qualitative Tree Languages},
  booktitle =           {{P}roceedings of the 26th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'11)},
  acronym =             {{LICS}'11},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {13-22},
  year =                {2011},
  month =               jun,
  doi =                 {10.1109/LICS.2011.28},
}
[Chu60] Alonzo Church. Applications of recursive arithmetic to the problem of circuit synthesis. In Summaries of the Summer Institute of Symbolic Logic – Volume 1, pages 3-50. Institute for Defense Analyses, 1960. 
@inproceedings{sisl1957-Chu,
  author =              {Church, Alonzo},
  title =               {Applications of recursive arithmetic to the problem
                         of circuit synthesis},
  booktitle =           {{S}ummaries of the {S}ummer {I}nstitute of
                         {S}ymbolic {L}ogic~-- Volume~1},
  publisher =           {Institute for Defense Analyses},
  pages =               {3-50},
  year =                {1960},
  confyear =            {1957},
}
[Chu63] Alonzo Church. Logic, arithmetic, and automata. In ICM'62, pages 23-35. 1963. 
@inproceedings{icm1962-Chu,
  author =              {Church, Alonzo},
  title =               {Logic, arithmetic, and automata},
  booktitle =           {{P}roceedings of the {I}nternational {C}ongress of
                         {M}athematicians ({ICM}'62)},
  acronym =             {{ICM}'62},
  pages =               {23-35},
  year =                {1963},
  confyear =            {1962},
  confmonth =           {8},
}
[CHV+18] Edmund M. Clarke, Thomas A. Henzinger, Helmut Veith, and Roderick Bloem. Handbook of Model Checking. Springer-Verlag, April 2018. 
@book{hbmc18-CHVB,
  author =              {Clarke, Edmund M. and Henzinger, Thomas A. and
                         Veith, Helmut and Bloem, Roderick},
  title =               {Handbook of Model Checking},
  publisher =           {Springer-Verlag},
  year =                {2018},
  month =               apr,
  doi =                 {10.1007/978-3-319-10575-8},
}
[CJ97] Hubert Comon and Florent Jacquemard. Ground Reducibility is EXPTIME-Complete. In LICS'97, pages 26-34. IEEE Comp. Soc. Press, June 1997. 
@inproceedings{lics1997-CJ,
  author =              {Comon, Hubert and Jacquemard, Florent},
  title =               {Ground Reducibility is {EXPTIME}-Complete},
  booktitle =           {{P}roceedings of the 12th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'97)},
  acronym =             {{LICS}'97},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {26-34},
  year =                {1997},
  month =               jun,
}
[CJ98] Hubert Comon and Yan Jurski. Multiple counters automata, safety analysis, and Presburger arithmetic. In CAV'98, Lecture Notes in Computer Science 1427, pages 268-279. Springer-Verlag, June 1998. 
@inproceedings{cav1998-CJ,
  author =              {Comon, Hubert and Jurski, Yan},
  title =               {Multiple counters automata, safety analysis, and
                         {P}resburger arithmetic},
  editor =              {Hu, Alan J. and Vardi, Moshe Y.},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'98)},
  acronym =             {{CAV}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1427},
  pages =               {268-279},
  year =                {1998},
  month =               jun,
  doi =                 {10.1007/BFb0028751},
}
[CJ99] Hubert Comon and Yan Jurski. Timed Automata and the Theory of Real Numbers. Research Report LSV-99-6, Lab. Spécification & Vérification, ENS Cachan, France, July 1999. 
@techreport{lsv-99-6,
  author =              {Comon, Hubert and Jurski, Yan},
  title =               {Timed Automata and the Theory of Real Numbers},
  number =              {LSV-99-6},
  year =                {1999},
  month =               jul,
  institution =         {Lab.~Sp\'ecification \& V\'erification, ENS Cachan,
                         France},
  type =                {Research Report},
}
[CJ99] Hubert Comon and Yan Jurski. Timed Automata and the Theory of Real Numbers. In CONCUR'99, Lecture Notes in Computer Science 1664, pages 242-257. Springer-Verlag, August 1999. 
@inproceedings{concur1999-CJ,
  author =              {Comon, Hubert and Jurski, Yan},
  title =               {Timed Automata and the Theory of Real Numbers},
  editor =              {Baeten, Jos C. M. and Mauw, Sjouke},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'99)},
  acronym =             {{CONCUR}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1664},
  pages =               {242-257},
  year =                {1999},
  month =               aug,
  doi =                 {10.1007/3-540-48320-9_18},
}
[CdJ+19] José R. Correa, Jasper de Jong, Bart de Keizer, and Marc Uetz. The inefficiency of Nash and subgame-perfect equilibria for network routing. Mathematics of Operations Research 44(4):1286-1303. Informs, November 2019. 
@article{moor44(4)-CJKU,
  author =              {Correa, Jos{\'e} R. and de~Jong, Jasper and
                         de~Keizer, Bart and Uetz, Marc},
  title =               {The inefficiency of {N}ash and subgame-perfect
                         equilibria for network routing},
  publisher =           {Informs},
  journal =             {Mathematics of Operations Research},
  volume =              {44},
  number =              {4},
  pages =               {1286-1303},
  year =                {2019},
  month =               nov,
  doi =                 {10.1287/moor.2018.0968},
}
[CJL+09] Franck Cassez, Jan J. Jensen, Kim Guldstrand Larsen, Jean-François Raskin, and Pierre-Alain Reynier. Automatic Synthesis of Robust and Optimal Controllers – An Industrial Case Study. In HSCC'09, Lecture Notes in Computer Science 5469, pages 90-104. Springer-Verlag, April 2009. 
@inproceedings{hscc2009-CJLRR,
  author =              {Cassez, Franck and Jensen, Jan J. and Larsen, Kim
                         Guldstrand and Raskin, Jean-Fran{\c c}ois and
                         Reynier, Pierre-Alain},
  title =               {Automatic Synthesis of Robust and Optimal
                         Controllers~-- An~Industrial Case Study},
  editor =              {Majumdar, Rupak and Tabuada, Paulo},
  booktitle =           {{P}roceedings of the 12th {I}nternational {W}orkshop
                         on {H}ybrid {S}ystems: {C}omputation and {C}ontrol
                         ({HSCC}'09)},
  acronym =             {{HSCC}'09},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5469},
  pages =               {90-104},
  year =                {2009},
  month =               apr,
  doi =                 {10.1007/978-3-642-00602-9_7},
}
[CJL+02] Edmund M. Clarke, Somesh Jha, Yuan Lu, and Helmut Veith. Tree-Like Counterexamples in Model Checking. In LICS'02, pages 19-29. IEEE Comp. Soc. Press, July 2002. 
@inproceedings{lics2002-CJLV,
  author =              {Clarke, Edmund M. and Jha, Somesh and Lu, Yuan and
                         Veith, Helmut},
  title =               {Tree-Like Counterexamples in Model Checking},
  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 =               {19-29},
  year =                {2002},
  month =               jul,
}
[CJM+20] Emily Clement, Thierry Jéron, Nicolas Markey, and David Mentré. Computing maximally-permissive strategies in acyclic timed automata. In FORMATS'20, Lecture Notes in Computer Science 12288, pages 111-126. Springer-Verlag, September 2020.
Abstract

Timed automata are a convenient mathematical model for modelling and reasoning about real-time systems. While they provide a powerful way of representing timing aspects of such systems, timed automata assume arbitrary precision and zero-delay actions; in particular, a state might be declared reachable in a timed automaton, but impossible to reach in the physical system it models.

In this paper, we consider permissive strategies as a way to overcome this problem: such strategies propose intervals of delays instead of single delays, and aim at reaching a target state whichever delay actually takes place. We develop an algorithm for computing the optimal permissiveness (and an associated maximally-permissive strategy) in acyclic timed automata and games.

@inproceedings{formats2020-CJMM,
  author =              {Clement, Emily and J{\'e}ron, Thierry and Markey,
                         Nicolas and Mentr{\'e}, David},
  title =               {Computing maximally-permissive strategies in acyclic
                         timed automata},
  editor =              {Bertrand, Nathalie and Jansen, Nils},
  booktitle =           {{P}roceedings of the 18th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'20)},
  acronym =             {{FORMATS}'20},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {12288},
  pages =               {111-126},
  year =                {2020},
  month =               sep,
  doi =                 {10.1007/978-3-030-57628-8_7},
  abstract =            {Timed automata are a convenient mathematical model
                         for modelling and reasoning about real-time systems.
                         While they provide a powerful way of representing
                         timing aspects of such systems, timed automata
                         assume arbitrary precision and zero-delay actions;
                         in~particular, a~state might be declared reachable
                         in a timed automaton, but impossible to reach in the
                         physical system it models. \par In this paper, we
                         consider permissive strategies as a way to overcome
                         this problem: such strategies propose intervals of
                         delays instead of single delays, and aim at reaching
                         a target state whichever delay actually takes place.
                         We develop an algorithm for computing the optimal
                         permissiveness (and~an associated
                         maximally-permissive strategy) in acyclic timed
                         automata and games.},
}
[CK05] George Christodoulou and Elias Koutsoupias. The price of anarchy of finite congestion games. In STOC'05, pages 67-73. ACM Press, May 2005. 
@inproceedings{stoc2005-CK,
  author =              {Christodoulou, George and Koutsoupias, Elias},
  title =               {The price of anarchy of finite congestion games},
  editor =              {Gabow, Harold N. and Fagin, Ronald},
  booktitle =           {{P}roceedings of the 37th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'05)},
  acronym =             {{STOC}'05},
  publisher =           {ACM Press},
  pages =               {67-73},
  year =                {2005},
  month =               may,
  doi =                 {10.1145/1060590.1060600},
}
[CKL98] Richard Castanet, Ousmane Koné, and Patrice Laurençot. On-the-fly Test Generation for Real Time Protocols. In ICCCN'98, pages 378-387. IEEE Comp. Soc. Press, October 1998. 
@inproceedings{CKL-icccn1998,
  author =              {Castanet, Richard and Kon{\'e}, Ousmane and
                         Lauren{\c{c}}ot, Patrice},
  title =               {On-the-fly Test Generation for Real Time Protocols},
  booktitle =           {{P}roceedings of the {I}nternational {C}onference On
                         {C}omputer {C}ommunications and {N}etworks
                         ({ICCCN}'98)},
  acronym =             {{ICCCN}'98},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {378-387},
  year =                {1998},
  month =               oct,
  doi =                 {10.1109/ICCCN.1998.998798},
}
[CKS81] Ashok K. Chandra, Dexter C. Kozen, and Larry J. Stockmeyer. Alternation. Journal of the ACM 28(1):114-133. ACM Press, January 1981. 
@article{jacm28(1)-CKS,
  author =              {Chandra, Ashok K. and Kozen, Dexter C. and
                         Stockmeyer, Larry J.},
  title =               {Alternation},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {28},
  number =              {1},
  pages =               {114-133},
  year =                {1981},
  month =               jan,
}
[CKV01] Hana Chockler, Orna Kupferman, and Moshe Y. Vardi. Coverage Metrics for Temporal Logic Model Checking. In TACAS'01, Lecture Notes in Computer Science 2031, pages 528-542. Springer-Verlag, April 2001. 
@inproceedings{tacas2001-CKV,
  author =              {Chockler, Hana and Kupferman, Orna and Vardi, Moshe
                         Y.},
  title =               {Coverage Metrics for Temporal Logic Model Checking},
  editor =              {Margaria, Tiziana and Yi, Wang},
  booktitle =           {{P}roceedings of the 7th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'01)},
  acronym =             {{TACAS}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2031},
  pages =               {528-542},
  year =                {2001},
  month =               apr,
}
[CL00] Franck Cassez and Kim Guldstrand Larsen. The Impressive Power of Stopwatches. In CONCUR'00, Lecture Notes in Computer Science 1877, pages 138-152. Springer-Verlag, August 2000. 
@inproceedings{concur2000-CL,
  author =              {Cassez, Franck and Larsen, Kim Guldstrand},
  title =               {The Impressive Power of Stopwatches},
  editor =              {Palamidessi, Catuscia},
  booktitle =           {{P}roceedings of the 11th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'00)},
  acronym =             {{CONCUR}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1877},
  pages =               {138-152},
  year =                {2000},
  month =               aug,
  doi =                 {10.1007/3-540-44618-4_12},
}
[CL02] Rance Cleaveland and Gerald Lüttgen. A Logical Process Calculi. In EXPRESS'02, Electronic Notes in Theoretical Computer Science 68(2), pages 33-50. Elsevier, August 2002. 
@inproceedings{express2002-CL,
  author =              {Cleaveland, Rance and L{\"u}ttgen, Gerald},
  title =               {A Logical Process Calculi},
  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 =               {33-50},
  year =                {2002},
  month =               aug,
}
[CL03] Thomas Colcombet and Christof Löding. On the Expressiveness of Deterministic transducers over Infinite Trees. In STACS'04, Lecture Notes in Computer Science 2996, pages 428-439. Springer-Verlag, March 2003. 
@inproceedings{stacs2004-CL,
  author =              {Colcombet, {\relax Th}omas and L{\"o}ding, Christof},
  title =               {On the Expressiveness of Deterministic transducers
                         over Infinite Trees},
  editor =              {Diekert, Volker and Habib, Michel},
  booktitle =           {{P}roceedings of the 21st {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'04)},
  acronym =             {{STACS}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2996},
  pages =               {428-439},
  year =                {2003},
  month =               mar,
}
[CL03] Maxime Crochemore and Thierry Lecrocq. Pattern Matching and Text Compression Algorithms. In Allen B. Tucker (eds.), Computer Science and Engineering Handbook. CRC Press, 2003. 
@incollection{CSEH2003-CL,
  author =              {Crochemore, Maxime and Lecrocq, {\relax Th}ierry},
  title =               {Pattern Matching and Text Compression Algorithms},
  editor =              {Tucker, Allen B.},
  booktitle =           {Computer Science and Engineering Handbook},
  publisher =           {CRC Press},
  pages =               {161-202},
  year =                {2003},
}
[CL07] Taolue Chen and Jian Lu. Probabilistic Alternating-time Temporal Logic and Model Checking Algorithm. In FSKD'07, pages 35-39. IEEE Comp. Soc. Press, August 2007. 
@inproceedings{fskd2007-CL,
  author =              {Chen, Taolue and Lu, Jian},
  title =               {Probabilistic Alternating-time Temporal Logic and
                         Model Checking Algorithm},
  editor =              {Lei, J.},
  booktitle =           {{P}roceedings of the 4th {I}nternational
                         {C}onference on {F}uzzy {S}ystems and {K}nowledge
                         {D}iscovery ({FSKD}'07)},
  acronym =             {{FSKD}'07},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {35-39},
  year =                {2007},
  month =               aug,
  doi =                 {10.1109/FSKD.2007.458},
}
[CLM15] Petr Čermák, Alessio Lomuscio, and Aniello Murano. Verifying and Synthesising Multi-Agent Systems against One-Goal Strategy Logic Specifications. In AAAI'15, pages 2038-2044. AAAI Press, January 2015. 
@inproceedings{aaai2015-CLM,
  author =              {{\v{C}}erm{\'a}k, Petr and Lomuscio, Alessio and
                         Murano, Aniello},
  title =               {Verifying and Synthesising Multi-Agent Systems
                         against One-Goal Strategy Logic Specifications},
  editor =              {Bonet, Blai and Koenig, Sven},
  booktitle =           {{P}roceedings of the 29th {AAAI} {C}onference on
                         {A}rtificial {I}ntelligence ({AAAI}'15)},
  acronym =             {{AAAI}'15},
  publisher =           {AAAI Press},
  pages =               {2038-2044},
  year =                {2015},
  month =               jan,
}
[CLM+14] Petr Čermák, Alessio Lomuscio, Fabio Mogavero, and Aniello Murano. MCMAS-SLK: A Model Checker for the Verification of Strategy Logic Specifications. In CAV'14, Lecture Notes in Computer Science 8559, pages 525-532. Springer-Verlag, July 2014. 
@inproceedings{cav2014-CLMM,
  author =              {{\v{C}}erm{\'a}k, Petr and Lomuscio, Alessio and
                         Mogavero, Fabio and Murano, Aniello},
  title =               {{MCMAS-SLK}: A~Model Checker for the Verification of
                         Strategy Logic Specifications},
  editor =              {Biere, Armin and Bloem, Roderick},
  booktitle =           {{P}roceedings of the 26th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'14)},
  acronym =             {{CAV}'14},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8559},
  pages =               {525-532},
  year =                {2014},
  month =               jul,
  doi =                 {10.1007/978-3-319-08867-9_34},
}
[CLM+15] Krishnendu Chatterjee, Stéphane Lafortune, Nicolas Markey, and Wolfgang Thomas (eds.) Non-Zero-Sum-Games and Control (Dagstuhl Seminar 15061). Dagstuhl Reports 5(2):1-25. Leibniz-Zentrum für Informatik, June 2015.
Abstract

In this report, the program, research issues, and results of Dagstuhl Seminar 15061 "Non-Zero-Sum-Games and Control" are described. The area of non-zero-sum games is addressed in a wide range of topics: multi-player games, partial-observation games, quantitative game models, and—as a special focus—connections with control engineering (supervisory control).

@proceedings{dagrep5(2)-CLMT,
  title =               {Non-Zero-Sum-Games and Control ({D}agstuhl
                         Seminar~15061)},
  editor =              {Chatterjee, Krishnendu and Lafortune, St{\'e}phane
                         and Markey, Nicolas and Thomas, Wolfgang},
  booktitle =           {Non-Zero-Sum-Games and Control ({D}agstuhl
                         Seminar~15061)},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  journal =             {Dagstuhl Reports},
  volume =              {5},
  number =              {2},
  pages =               {1-25},
  year =                {2015},
  month =               jun,
  doi =                 {10.4230/DagRep.5.2.1},
  url =                 {http://drops.dagstuhl.de/opus/volltexte/2015/5042},
  abstract =            {In this report, the program, research issues, and
                         results of Dagstuhl Seminar~15061
                         {"}Non-Zero-Sum-Games and Control{"} are described.
                         The area of non-zero-sum games is addressed in a
                         wide range of topics: multi-player games,
                         partial-observation games, quantitative game models,
                         and---as~a special focus---connections with control
                         engineering (supervisory control).},
}
[Clo94] Peter Clote. Computation Models and Function Algebras. In LCC'94, Lecture Notes in Computer Science 960, pages 98-130. Springer-Verlag, October 1994. 
@inproceedings{lcc1994-Clo,
  author =              {Clote, Peter},
  title =               {Computation Models and Function Algebras},
  editor =              {Leivant, Daniel},
  booktitle =           {{P}roceedings of the 1st {I}nternational {W}orkshop
                         on {L}ogic and {C}omputation {C}omplexity
                         ({LCC}'94)},
  acronym =             {{LCC}'94},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {960},
  pages =               {98-130},
  year =                {1994},
  month =               oct,
}
[CLP+11] Laura Carnevali, Giuseppe Lipari, Alessandro Pinzuti, and Enrico Vicario. A Formal Approach to Design and Verification of Two-Level Hierarchical Scheduling Systems. In ADA-EUROPE'11, Lecture Notes in Computer Science 6652, pages 118-131. Springer-Verlag, 2011. 
@inproceedings{adaeurope2011-CLPV,
  author =              {Carnevali, Laura and Lipari, Giuseppe and Pinzuti,
                         Alessandro and Vicario, Enrico},
  title =               {A Formal Approach to Design and Verification of
                         Two-Level Hierarchical Scheduling Systems},
  editor =              {Romanovsky, Alexander and Vardanega, Tullio},
  booktitle =           {Proceedings of the 16th {A}da-{E}urope
                         {I}nternational {C}onference on {R}eliable
                         {S}oftware {T}echnologies ({ADA-EUROPE}'11)},
  acronym =             {{ADA-EUROPE}'11},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6652},
  pages =               {118-131},
  year =                {2011},
  confyear =            {2011},
  confmonth =           {6},
}
[CLS01] Gianfranco Ciardo, Gerald Lüttgen, and Radu Siminiceanu. Saturation: An Efficient Iteration Strategy for Symbolic State-Space Generation. In TACAS'01, Lecture Notes in Computer Science 2031, pages 328-342. Springer-Verlag, April 2001. 
@inproceedings{tacas2001-CLS,
  author =              {Ciardo, Gianfranco and L{\"u}ttgen, Gerald and
                         Siminiceanu, Radu},
  title =               {Saturation: An Efficient Iteration Strategy for
                         Symbolic State-Space Generation},
  editor =              {Margaria, Tiziana and Yi, Wang},
  booktitle =           {{P}roceedings of the 7th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'01)},
  acronym =             {{TACAS}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2031},
  pages =               {328-342},
  year =                {2001},
  month =               apr,
}
[CM93] Bruno Courcelle and Mohamed Mosbah. Monadic second-order evaluations on tree-decomposable graphs. Theoretical Computer Science 109(1-2):49-82. Elsevier, 1993. 
@article{tcs109(1-2)-CM,
  author =              {Courcelle, Bruno and Mosbah, Mohamed},
  title =               {Monadic second-order evaluations on
                         tree-decomposable graphs},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {109},
  number =              {1-2},
  pages =               {49-82},
  year =                {1993},
  doi =                 {10.1016/0304-3975(93)90064-Z},
}
[CM97] Stephen A. Cook and David G. Mitchell. Finding Hard Instances of the Satisfiability Problem: A Survey. In Ding-zhu Du, Jun Gu, and Panos M. Pardalos (eds.), Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 35, pages 1-17. American Mathematical Society, October 1997. 
@incollection{dimacs35-CM,
  author =              {Cook, Stephen A. and Mitchell, David G.},
  title =               {Finding Hard Instances of the Satisfiability
                         Problem: A Survey},
  editor =              {Du, Ding-zhu and Gu, Jun and Pardalos, Panos M.},
  booktitle =           {Satisfiability Problem: Theory and Applications},
  publisher =           {American Mathematical Society},
  series =              {DIMACS Series in Discrete Mathematics and
                         Theoretical Computer Science},
  volume =              {35},
  pages =               {1-17},
  year =                {1997},
  month =               oct,
}
[CM02] Marco Carbone and Sergio Maffeis. On the Expressive Power of Polyadic Synchronisation in π-calculus. In EXPRESS'02, Electronic Notes in Theoretical Computer Science 68(2), pages 15-32. Elsevier, August 2002. 
@inproceedings{express2002-CM,
  author =              {Carbone, Marco and Maffeis, Sergio},
  title =               {On the Expressive Power of Polyadic Synchronisation
                         in {\(\pi\)}-calculus},
  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 =               {15-32},
  year =                {2002},
  month =               aug,
}
[CM03] Olivier Carton and Max Michel. Unambiguous Büchi Automata. Theoretical Computer Science 297(1-3):37-81. Elsevier, March 2003. 
@article{tcs297(1-3)-CM,
  author =              {Carton, Olivier and Michel, Max},
  title =               {Unambiguous B{\"u}chi Automata},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {297},
  number =              {1-3},
  pages =               {37-81},
  year =                {2003},
  month =               mar,
}
[CM06] Scott Cotton and Oded Maler. Fast and Flexible Difference Constraint Propagation for DPLL(T). In SAT'06, Lecture Notes in Computer Science 4121, pages 170-183. Springer-Verlag, August 2006. 
@inproceedings{sat2006-CM,
  author =              {Cotton, Scott and Maler, Oded},
  title =               {Fast and Flexible Difference Constraint Propagation
                         for {DPLL(T)}},
  editor =              {Biere, Armin and Gomes, Carla P.},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}onference on {T}heory and {A}pplications of
                         {S}atisfiability {T}esting ({SAT}'06)},
  acronym =             {{SAT}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4121},
  pages =               {170-183},
  year =                {2006},
  month =               aug,
}
[CM08] Franck Cassez and Nicolas Markey. Contrôle des systèmes temporisés. In Olivier H. Roux and Claude Jard (eds.), Approches formelles des systèmes embarqués communicants. Hermès, October 2008. 
@incollection{afsec2008-CM,
  author =              {Cassez, Franck and Markey, Nicolas},
  title =               {Contr{\^o}le des syst{\`e}mes temporis{\'e}s},
  editor =              {Roux, Olivier H. and Jard, Claude},
  booktitle =           {Approches formelles des syst{\`e}mes embarqu{\'e}s
                         communicants},
  publisher =           {Herm{\`e}s},
  pages =               {105-144},
  chapter =             {4},
  year =                {2008},
  month =               oct,
  url =                 {http://e.lavoisier.fr/produit/9782746243156},
}
[CM09] Franck Cassez and Nicolas Markey. Control of Timed Systems. In Claude Jard and Olivier H. Roux (eds.), Communicating Embedded Systems – Software and Design. Wiley-ISTE, October 2009. 
@incollection{ces2009-CM,
  author =              {Cassez, Franck and Markey, Nicolas},
  title =               {Control of Timed Systems},
  editor =              {Jard, Claude and Roux, Olivier H.},
  booktitle =           {Communicating Embedded Systems~-- Software and
                         Design},
  publisher =           {Wiley-ISTE},
  pages =               {83-120},
  chapter =             {3},
  year =                {2009},
  month =               oct,
  url =                 {http://www.iste.co.uk/index.php?f=x&ACTION=View&id=288},
}
[CMH08] Krishnendu Chatterjee, Rupak Majumdar, and Thomas A. Henzinger. Controller Synthesis with Budget Constraints. In HSCC'08, Lecture Notes in Computer Science 4981. Springer-Verlag, April 2008. 
@inproceedings{hscc2008-CMH,
  author =              {Chatterjee, Krishnendu and Majumdar, Rupak and
                         Henzinger, Thomas A.},
  title =               {Controller Synthesis with Budget Constraints},
  editor =              {Egerstedt, Magnus and Mishra, Bud},
  booktitle =           {{P}roceedings of the 11th {I}nternational {W}orkshop
                         on {H}ybrid {S}ystems: {C}omputation and {C}ontrol
                         ({HSCC}'08)},
  acronym =             {{HSCC}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4981},
  year =                {2008},
  month =               apr,
}
[CMJ04] Krishnendu Chatterjee, Rupak Majumdar, and Marcin Jurdziński. On Nash equilibria in stochastic games. In CSL'04, Lecture Notes in Computer Science 3210. Springer-Verlag, September 2004. 
@inproceedings{csl2004-CMJ,
  author =              {Chatterjee, Krishnendu and Majumdar, Rupak and
                         Jurdzi{\'n}ski, Marcin},
  title =               {On {N}ash equilibria in stochastic games},
  editor =              {Marcinkowski, Jerzy and Tarlecki, Andrzej},
  booktitle =           {{P}roceedings of the 18th {I}nternational {W}orkshop
                         on {C}omputer {S}cience {L}ogic ({CSL}'04)},
  acronym =             {{CSL}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3210},
  year =                {2004},
  month =               sep,
}
[CMP04] Ching-Tsun Chou, Phanindra K. Mannava, and Seungjoon Park. A Simple Method for Parameterized Verification of Cache Coherence Protocols. In FMCAD'04, Lecture Notes in Computer Science 3312, pages 382-398. Springer-Verlag, November 2004. 
@inproceedings{fmcad2004-CMP,
  author =              {Chou, Ching-Tsun and Mannava, Phanindra K. and Park,
                         Seungjoon},
  title =               {A Simple Method for Parameterized Verification of
                         Cache Coherence Protocols},
  editor =              {Hu, Alan J. and Martin, Andrew K.},
  booktitle =           {{P}roceedings of the 5th {I}nternational
                         {C}onference on {F}ormal {M}ethods in
                         {C}omputer-{A}ided {D}esign ({FMCAD}'04)},
  acronym =             {{FMCAD}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3312},
  pages =               {382-398},
  year =                {2004},
  month =               nov,
  doi =                 {10.1007/978-3-540-30494-4_27},
}
[CMR01] Paul Caspi, Christine Mazuet, and Natacha Reynaud-Paligot. About the design of distributed control systems: The quasi-synchronous approach. In SAFECOMP'01, Lecture Notes in Computer Science 2187, pages 215-226. Springer-Verlag, September 2001. 
@inproceedings{safecomp2001-CMR,
  author =              {Caspi, Paul and Mazuet, Christine and
                         Reynaud{-}Paligot, Natacha},
  title =               {About the design of distributed control systems:
                         The~quasi-synchronous approach},
  editor =              {Voges, Udo},
  booktitle =           {{P}roceedings of the 20th {I}nternational
                         {C}onference on {C}omputer {S}afety, {R}eliability
                         and {S}ecurity ({SAFECOMP}'01)},
  acronym =             {{SAFECOMP}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2187},
  pages =               {215-226},
  year =                {2001},
  month =               sep,
  doi =                 {10.1007/3-540-45416-0_21},
}
[CMR01] Bruno Courcelle, Johann A. Makowsky, and Udi Rotics. On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Applied Mathematics 108(1-2):23-52. Elsevier, February 2001. 
@article{dam108(1-2)-CMR,
  author =              {Courcelle, Bruno and Makowsky, Johann A. and Rotics,
                         Udi},
  title =               {On the fixed parameter complexity of graph
                         enumeration problems definable in monadic
                         second-order logic},
  publisher =           {Elsevier},
  journal =             {Discrete Applied Mathematics},
  volume =              {108},
  number =              {1-2},
  pages =               {23-52},
  year =                {2001},
  month =               feb,
}
[COG98] Rachel Cardell-Oliver and Tim Glover. A Practical and Complete Algorithm for Testing Real-Time Systems. In FTRTFT'98, Lecture Notes in Computer Science 1486, pages 251-261. Springer-Verlag, September 1998. 
@inproceedings{COG-ftrtft1998,
  author =              {Cardell-Oliver, Rachel and Glover, Tim},
  title =               {A~Practical and Complete Algorithm for Testing
                         Real-Time Systems},
  editor =              {Ravn, Anders P. and Rischel, Hans},
  booktitle =           {{P}roceedings of the 5th {F}ormal {T}echniques in
                         {R}eal-Time and {F}ault-Tolerant {S}ystems
                         ({FTRTFT}'98)},
  acronym =             {{FTRTFT}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1486},
  pages =               {251-261},
  year =                {1998},
  month =               sep,
  doi =                 {10.1007/BFb0055352},
}
[Col12] Thomas Colcombet. Forms of determinism for automata. In STACS'12, Leibniz International Proceedings in Informatics 14, pages 1-23. Leibniz-Zentrum für Informatik, February 2012. 
@inproceedings{stacs2012-Col,
  author =              {Colcombet, {\relax Th}omas},
  title =               {Forms of determinism for automata},
  editor =              {D{\"u}rr, Christoph and Wilke, Thomas},
  booktitle =           {{P}roceedings of the 29th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'12)},
  acronym =             {{STACS}'12},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {14},
  pages =               {1-23},
  year =                {2012},
  month =               feb,
  doi =                 {10.4230/LIPIcs.STACS.2012.1},
}
[Coo71] Stephen A. Cook. The complexity of Theorem Proving Procedures. In STOC'71, pages 151-158. ACM Press, 1971. 
@inproceedings{stoc1971-Coo,
  author =              {Cook, Stephen A.},
  title =               {The complexity of Theorem Proving Procedures},
  booktitle =           {{P}roceedings of the 3rd {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'71)},
  acronym =             {{STOC}'71},
  publisher =           {ACM Press},
  pages =               {151-158},
  year =                {1971},
}
[Coo85] Stephen A. Cook. A Taxonomy of Problems with Fast Parallel Algorithms. Information and Control 64(1-3):2-22. Academic Press, 1985. 
@article{icont64(1-3)-cook,
  author =              {Cook, Stephen A.},
  title =               {A Taxonomy of Problems with Fast Parallel
                         Algorithms},
  publisher =           {Academic Press},
  journal =             {Information and Control},
  volume =              {64},
  number =              {1-3},
  pages =               {2-22},
  year =                {1985},
}
[Coo04] Stephen A. Cook. Theories for Complexity Classes and their Propositional Translations. In Jan Krajíček (eds.), Complexity of computations and proofs, Quaderni di Matematica 13, pages 175-227. Dipartimento di Matematica, Seconda Universitá degli Studi di Napoli, Italy, 2004. 
@incollection{CCP2004-cook,
  author =              {Cook, Stephen A.},
  title =               {Theories for Complexity Classes and their
                         Propositional Translations},
  editor =              {Kraj{\'\i}{\v c}ek, Jan},
  booktitle =           {Complexity of computations and proofs},
  publisher =           {Dipartimento di Matematica, Seconda Universit{\'a}
                         degli Studi di Napoli, Italy},
  series =              {Quaderni di Matematica},
  volume =              {13},
  pages =               {175-227},
  year =                {2004},
}
[Cou90] Bruno Courcelle. The Monadic Second-Order Logic of Graphs. I: Recognizable Sets of Finite Graphs. Information and Computation 85(1):12-75. Academic Press, March 1990. 
@article{icomp85(1)-Cou,
  author =              {Courcelle, Bruno},
  title =               {The Monadic Second-Order Logic of Graphs.
                         {I}:~{R}ecognizable Sets of Finite Graphs},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {85},
  number =              {1},
  pages =               {12-75},
  year =                {1990},
  month =               mar,
}
[Cou97] Bruno Courcelle. The expression of graph properties and graph transformations in monadic second-order logic. In Grzegorz Rozenberg (eds.), Handbook of Graph Grammars. World Scientific, 1997. 
@incollection{handbookGG1997-Cou,
  author =              {Courcelle, Bruno},
  title =               {The expression of graph properties and graph
                         transformations in monadic second-order logic},
  editor =              {Rozenberg, Grzegorz},
  booktitle =           {Handbook of Graph Grammars},
  publisher =           {World Scientific},
  pages =               {313-400},
  year =                {1997},
}
[Cou04] Jean-Michel Couvreur. A BDD-like Implementation of an Automaton Package. In CIAA'04, Lecture Notes in Computer Science 3317, pages 310-311. Springer-Verlag, July 2004. 
@inproceedings{ciaa2004-Cou,
  author =              {Couvreur, Jean-Michel},
  title =               {A {BDD}-like Implementation of an Automaton Package},
  editor =              {Domaratzki, Michael and Okhatin, Alexander and
                         Salomaa, Arto and Yu, Sheng},
  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 =              {3317},
  pages =               {310-311},
  year =                {2004},
  month =               jul,
}
[Cou04] Jean-Michel Couvreur. Contribution à l'algorithmique de la vérification. Mémoire d'habilitation, Lab. Spécification & Vérification, ENS Cachan, France, July 2004. 
@phdthesis{hab-couvreur,
  author =              {Couvreur, Jean-Michel},
  title =               {Contribution {\`a} l'algorithmique de la
                         v{\'e}rification},
  year =                {2004},
  month =               jul,
  school =              {Lab.~Sp\'ecification \& V\'erification, ENS Cachan,
                         France},
  type =                {M\'emoire d'habilitation},
}
[Cov72] Thomas M. Cover. Broadcast Channels. IEEE Transactions on Information Theory 18(1):2-14. IEEE Inf. Theory Soc., January 1972. 
@article{tit18(1)-Cov,
  author =              {Cover, Thomas M.},
  title =               {Broadcast Channels},
  publisher =           {IEEE Inf. Theory Soc.},
  journal =             {IEEE Transactions on Information Theory},
  volume =              {18},
  number =              {1},
  pages =               {2-14},
  year =                {1972},
  month =               jan,
  doi =                 {10.1109/TIT.1972.1054727},
}
[Cov98] Thomas M. Cover. Comments on Broadcast Channels. IEEE Transactions on Information Theory 44(6):2524-2530. IEEE Inf. Theory Soc., October 1998. 
@article{tit44(6)-Cov,
  author =              {Cover, Thomas M.},
  title =               {Comments on Broadcast Channels},
  publisher =           {IEEE Inf. Theory Soc.},
  journal =             {IEEE Transactions on Information Theory},
  volume =              {44},
  number =              {6},
  pages =               {2524-2530},
  year =                {1998},
  month =               oct,
  doi =                 {10.1109/18.720547},
}
[CP97] Yi-Liang Chen and Gregory Provan. Modeling and Diagnosis of Timed Discrete Event Systems – A Factory Automation Example. In ACC'97, pages 31-36. IEEE Comp. Soc. Press, June 1997. 
@inproceedings{acc1997-CP,
  author =              {Chen, Yi-Liang and Provan, Gregory},
  title =               {Modeling and Diagnosis of Timed Discrete Event
                         Systems~-- A~Factory Automation Example},
  booktitle =           {Proceedings of the 1997 American Control Conference
                         ({ACC}'97)},
  acronym =             {{ACC}'97},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {31-36},
  year =                {1997},
  month =               jun,
  doi =                 {10.1109/ACC.1997.611749},
}
[CPJ08] Hubert Comon, Nicolas Perrin, and Florent Jacquemard. Visibly Tree Automata with Memory and Constraints. Logical Methods in Computer Science 4(2). May 2008. 
@article{lmcs4(2)-CPJ,
  author =              {Comon, Hubert and Perrin, Nicolas and Jacquemard,
                         Florent},
  title =               {Visibly Tree Automata with Memory and Constraints},
  journal =             {Logical Methods in Computer Science},
  volume =              {4},
  number =              {2},
  year =                {2008},
  month =               may,
  doi =                 {10.2168/LMCS-4(2:8)2008},
}
[CPP93] Joëlle Cohen, Dominique Perrin, and Jean-Éric Pin. On the Expressive Power of Temporal Logic. Journal of Computer and System Sciences 46(3):271-294. Academic Press, June 1993. 
@article{jcss46(3)-CPP,
  author =              {Cohen, Jo{\"e}lle and Perrin, Dominique and Pin,
                         Jean-{\'E}ric},
  title =               {On the Expressive Power of Temporal Logic},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {46},
  number =              {3},
  pages =               {271-294},
  year =                {1993},
  month =               jun,
}
[CPR+02] Alessandro Cimatti, Marco Pistore, Marco Roveri, and Roberto Sebastiani. Improving the Encoding of LTL Model Checking into SAT. In VMCAI'02, Lecture Notes in Computer Science 2294, pages 196-207. Springer-Verlag, January 2002. 
@inproceedings{vmcai2002-CPRS,
  author =              {Cimatti, Alessandro and Pistore, Marco and Roveri,
                         Marco and Sebastiani, Roberto},
  title =               {Improving the Encoding of {LTL} Model Checking into
                         {SAT}},
  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 =               {196-207},
  year =                {2002},
  month =               jan,
}
[CR07] Olivier Carton and Chloé Rispal. Complementation of rational sets on scattered linear orderings of finite rank. Theoretical Computer Science 382(2):109-119. Elsevier, August 2007. 
@article{tcs382(2)-CR,
  author =              {Carton, Olivier and Rispal, Chlo{\'e}},
  title =               {Complementation of rational sets on scattered linear
                         orderings of finite rank},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {382},
  number =              {2},
  pages =               {109-119},
  year =                {2007},
  month =               aug,
}
[Cro86] Maxime Crochemore. Transducers and Repetitions. Theoretical Computer Science 45(1):63-86. Elsevier, 1986. 
@article{tcs45(1)-Cro,
  author =              {Crochemore, Maxime},
  title =               {Transducers and Repetitions},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {45},
  number =              {1},
  pages =               {63-86},
  year =                {1986},
}
[CRR12] Krishnendu Chatterjee, Mickael Randour, and Jean-François Raskin. Strategy Synthesis for Multi-dimensional Quantitative Objectives. Research Report 1201.5073, arXiv, January 2012. 
@techreport{arxiv12-CRR,
  author =              {Chatterjee, Krishnendu and Randour, Mickael and
                         Raskin, Jean-Fran{\c c}ois},
  title =               {Strategy Synthesis for Multi-dimensional
                         Quantitative Objectives},
  number =              {1201.5073},
  year =                {2012},
  month =               jan,
  institution =         {arXiv},
  type =                {Research Report},
}
[CRR14] Krishnendu Chatterjee, Mickael Randour, and Jean-François Raskin. Strategy Synthesis for Multi-dimensional Quantitative Objectives. Acta Informatica 51(3-4):129-163. Springer-Verlag, June 2014. 
@article{acta51(3-4)-CRR,
  author =              {Chatterjee, Krishnendu and Randour, Mickael and
                         Raskin, Jean-Fran{\c c}ois},
  title =               {Strategy Synthesis for Multi-dimensional
                         Quantitative Objectives},
  publisher =           {Springer-Verlag},
  journal =             {Acta Informatica},
  volume =              {51},
  number =              {3-4},
  pages =               {129-163},
  year =                {2014},
  month =               jun,
  doi =                 {10.1007/s00236-013-0182-6},
}
[CRS01] Franck Cassez, Mark D. Ryan, and Pierre-Yves Schobbens. Proving Feature Non-Interaction with Alternating-Time Temporal Logic. In Proceedings of the FIREworks Workshop on Language Constructs for Describing Features, pages 85-104. Springer-Verlag, January 2001. 
@inproceedings{fireworks2000-CRS,
  author =              {Cassez, Franck and Ryan, Mark D. and Schobbens,
                         Pierre-Yves},
  title =               {Proving Feature Non-Interaction with
                         Alternating-Time Temporal Logic},
  editor =              {Gilmore, Stephen D. and Ryan, Mark D.},
  booktitle =           {{P}roceedings of the {FIRE}works {W}orkshop on
                         {L}anguage {C}onstructs for {D}escribing {F}eatures},
  publisher =           {Springer-Verlag},
  pages =               {85-104},
  year =                {2001},
  month =               jan,
  confyear =            {2000},
  confmonth =           {5},
}
[CRV+04] Shih-Fen Cheng, Daniel M. Reeves, Yevgeniy Vorobeychik, and Michael P. Wellman. Notes on Equilibria in Symmetric Games. In GTDT'04, pages 71-78. June 2004. 
@inproceedings{gtdt2004-CRVW,
  author =              {Cheng, Shih-Fen and Reeves, Daniel M. and
                         Vorobeychik, Yevgeniy and Wellman, Michael P.},
  title =               {Notes on Equilibria in Symmetric Games},
  editor =              {Parsons, Simon and Gmytrasiewicz, Piotr},
  booktitle =           {{P}roceedings of the 6th {I}nternational {W}orkshop
                         on Game Theoretic and Decision Theoretic Agents
                         ({GTDT}'04)},
  acronym =             {{GTDT}'04},
  pages =               {71-78},
  year =                {2004},
  month =               jun,
}
[CS92] Rance Cleaveland and Bernhard Steffen. A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus. Formal Methods in System Design 2(2):121-147. Kluwer Academic, 1992. 
@article{fmsd2(2)-CS,
  author =              {Cleaveland, Rance and Steffen, Bernhard},
  title =               {A Linear-Time Model-Checking Algorithm for the
                         Alternation-Free Modal Mu-Calculus},
  publisher =           {Kluwer Academic},
  journal =             {Formal Methods in System Design},
  volume =              {2},
  number =              {2},
  pages =               {121-147},
  year =                {1992},
  doi =                 {10.1007/BF01383878},
}
[CS01] Edmund M. Clarke and Bernd-Holger Schlingloff. Model Checking. In John Alan Robinson and Andrei Voronkov (eds.), Handbook of Automated Reasoning. Elsevier and MIT Press, 2001. 
@incollection{HARb-2001-24-CS,
  author =              {Clarke, Edmund M. and Schlingloff, Bernd-Holger},
  title =               {Model Checking},
  editor =              {Robinson, John Alan and Voronkov, Andrei},
  booktitle =           {Handbook of Automated Reasoning},
  publisher =           {Elsevier and MIT Press},
  volume =              {2},
  pages =               {1635-1790},
  year =                {2001},
}
[CS03] Maxime Crochemore and Valery T. Stefanov. Waiting time and complexity for matching patterns with automata. Information Processing Letters 87(3):119-125. Elsevier, August 2003. 
@article{ipl87(3)-CS,
  author =              {Crochemore, Maxime and Stefanov, Valery T.},
  title =               {Waiting time and complexity for matching patterns
                         with automata},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {87},
  number =              {3},
  pages =               {119-125},
  year =                {2003},
  month =               aug,
  doi =                 {10.1016/S0020-0190(03)00271-0},
}
[CT06] Thomas M. Cover and Joy A. Thomas. Elements of Information Theory. John Wiley & Sons, 2006. 
@book{EIT2006-CT,
  author =              {Cover, Thomas M. and Thomas, Joy A.},
  title =               {Elements of Information Theory},
  publisher =           {John Wiley \& Sons},
  edition =             {2},
  year =                {2006},
}
[CTL97] Christian Collberg, Clark Thomborson, and Douglas Low. A Taxonomy of Obfuscating Transformations. Technical Report 148, Department of Computer Science, University of Auckland, New Zealand, July 1997. 
@techreport{tr148-CTL,
  author =              {Collberg, Christian and Thomborson, Clark and Low,
                         Douglas},
  title =               {A Taxonomy of Obfuscating Transformations},
  number =              {148},
  year =                {1997},
  month =               jul,
  institution =         {Department of Computer Science, University of
                         Auckland, New Zealand},
  type =                {Technical Report},
}
[CTM+99] Sérgio Vale Aguiar Campos, Márcio Teixeira, Marius Minea, Andreas Kuehlmann, and Edmund M. Clarke. Model Checking Semi-Continuous Time Models Using BDDs. In SMC'99, Electronic Notes in Theoretical Computer Science 23(2). Elsevier, July 1999. 
@inproceedings{smc1999-CTMKC,
  author =              {Campos, S{\'e}rgio Vale Aguiar and Teixeira,
                         M{\'a}rcio and Minea, Marius and Kuehlmann, Andreas
                         and Clarke, Edmund M.},
  title =               {Model Checking Semi-Continuous Time Models Using
                         {BDD}s},
  editor =              {Cimatti, Alessandro and Grumberg, Orna},
  booktitle =           {{P}roceedings of the 1st {I}nternational {W}orkshop
                         on {S}ymbolic {M}odel {C}hecking ({SMC}'99)},
  acronym =             {{SMC}'99},
  publisher =           {Elsevier},
  series =              {Electronic Notes in Theoretical Computer Science},
  volume =              {23},
  number =              {2},
  year =                {1999},
  month =               jul,
}
[CTT+04] Edmund M. Clarke, Muralidhar Talupur, Tayssir Touili, and Helmut Veith. Verification by network decomposition. In CONCUR'04, Lecture Notes in Computer Science 3170, pages 276-291. Springer-Verlag, August 2004. 
@inproceedings{concur2004-CTTV,
  author =              {Clarke, Edmund M. and Talupur, Muralidhar and
                         Touili, Tayssir and Veith, Helmut},
  title =               {Verification by network decomposition},
  editor =              {Gardner, {\relax Ph}ilippa and Yoshida, Nobuko},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'04)},
  acronym =             {{CONCUR}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3170},
  pages =               {276-291},
  year =                {2004},
  month =               aug,
  doi =                 {10.1007/978-3-540-28644-8_18},
}
[CTV06] Edmund M. Clarke, Muralidhar Talupur, and Helmut Veith. Environment Abstraction for Parameterized Verification. In VMCAI'06, Lecture Notes in Computer Science 3855, pages 126-141. Springer-Verlag, January 2006. 
@inproceedings{vmcai2006-CTV,
  author =              {Clarke, Edmund M. and Talupur, Muralidhar and Veith,
                         Helmut},
  title =               {Environment Abstraction for Parameterized
                         Verification},
  editor =              {Emerson, E. Allen and Namjoshi, Kedar},
  booktitle =           {{P}roceedings of the 7th {I}nternational {W}orkshop
                         on {V}erification, {M}odel {C}hecking, and
                         {A}bstract {I}nterpretation ({VMCAI}'06)},
  acronym =             {{VMCAI}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3855},
  pages =               {126-141},
  year =                {2006},
  month =               jan,
  doi =                 {10.1007/11609773_9},
}
[CV12] Krishnendu Chatterjee and Yaron Velner. Mean-Payoff Pushdown Games. In LICS'12, pages 195-204. IEEE Comp. Soc. Press, June 2012. 
@inproceedings{lics2012-CV,
  author =              {Chatterjee, Krishnendu and Velner, Yaron},
  title =               {Mean-Payoff Pushdown Games},
  booktitle =           {{P}roceedings of the 27th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'12)},
  acronym =             {{LICS}'12},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {195-204},
  year =                {2012},
  month =               jun,
  doi =                 {10.1109/LICS.2012.30},
}
[CVW+91] Costas Courcoubetis, Moshe Y. Vardi, Pierre Wolper, and Mihalis Yannakakis. Memory-Efficient Algorithms for the Verification of Temporal Properties. In CAV'90, Lecture Notes in Computer Science 531, pages 233-242. Springer-Verlag, 1991. 
@inproceedings{cav1990-CVWY,
  author =              {Courcoubetis, Costas and Vardi, Moshe Y. and Wolper,
                         Pierre and Yannakakis, Mihalis},
  title =               {Memory-Efficient Algorithms for the Verification of
                         Temporal Properties},
  editor =              {Clarke, Edmund M. and Kurshan, Robert P.},
  booktitle =           {{P}roceedings of the 2nd {I}nternational {W}orkshop
                         on {C}omputer {A}ided {V}erification ({CAV}'90)},
  acronym =             {{CAV}'90},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {531},
  pages =               {233-242},
  year =                {1991},
  confyear =            {1990},
  confmonth =           {6},
}
[CY92] Costas Courcoubetis and Mihalis Yannakakis. Minimum and Maximum Delay Problems in Real-Time Systems. Formal Methods in System Design 1(4):385-415. Kluwer Academic, December 1992. 
@article{fmsd1(4)-CY,
  author =              {Courcoubetis, Costas and Yannakakis, Mihalis},
  title =               {Minimum and Maximum Delay Problems in Real-Time
                         Systems},
  publisher =           {Kluwer Academic},
  journal =             {Formal Methods in System Design},
  volume =              {1},
  number =              {4},
  pages =               {385-415},
  year =                {1992},
  month =               dec,
}
[CY95] Costas Courcoubetis and Mihalis Yannakakis. The Complexity of Probabilistic Verification. Journal of the ACM 42(4):857-907. ACM Press, July 1995. 
@article{jacm42(4)-CY,
  author =              {Courcoubetis, Costas and Yannakakis, Mihalis},
  title =               {The Complexity of Probabilistic Verification},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {42},
  number =              {4},
  pages =               {857-907},
  year =                {1995},
  month =               jul,
}
D
[vD03] Govert van Drimmelen. Satisfiability in Alternating-time Temporal Logic. In LICS'03, pages 208-217. IEEE Comp. Soc. Press, June 2003. 
@inproceedings{lics2003-vD,
  author =              {van Drimmelen, Govert},
  title =               {Satisfiability in Alternating-time Temporal Logic},
  booktitle =           {{P}roceedings of the 18th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'03)},
  acronym =             {{LICS}'03},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {208-217},
  year =                {2003},
  month =               jun,
}
[Da11] Arnaud Da Costa. Propriétés de jeux multi-agents. Thèse de doctorat, Lab. Spécification & Vérification, ENS Cachan, France, September 2011. 
@phdthesis{phd-dacosta,
  author =              {Da{~}Costa, Arnaud},
  title =               {Propri{\'e}t{\'e}s de jeux multi-agents},
  year =                {2011},
  month =               sep,
  school =              {Lab.~Sp\'ecification \& V\'erification, ENS Cachan,
                         France},
  type =                {Th\`ese de doctorat},
}
[Dam94] Mads Dam. Temporal Logic, Automata and Classical Theories. In ESSLLI'94. August 1994. 
@inproceedings{esslli1994-Dam,
  author =              {Dam, Mads},
  title =               {Temporal Logic, Automata and Classical Theories},
  booktitle =           {{P}roceedings of the 6th {E}uropean {S}ummer
                         {S}chool in {L}ogic, {L}anguage and {I}nformation
                         ({ESSLLI}'94)},
  acronym =             {{ESSLLI}'94},
  year =                {1994},
  month =               aug,
}
[Dam94] Dennis René Dams. CTL* and ECTL* as fragments of the modal μ-calculus. Theoretical Computer Science 126(1):77-96. Elsevier, April 1994. 
@article{tcs126(1)-Dam,
  author =              {Dams, Dennis Ren{\'e}},
  title =               {{CTL{\textsuperscript{*}}} and
                         {ECTL{\textsuperscript{*}}} as fragments of the
                         modal {{\(\mu\)}}-calculus},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {126},
  number =              {1},
  pages =               {77-96},
  year =                {1994},
  month =               apr,
}
[Dam99] Dennis René Dams. Flat Fragments of CTL and CTL*: Separating the Expressive and Distinguishing Powers. Logic Journal of the IGPL 7(1):55-78. Oxford University Press, January 1999. 
@article{jigpl7(1)-Dam,
  author =              {Dams, Dennis Ren{\'e}},
  title =               {Flat Fragments of {CTL} and {CTL}{\(^*\)}:
                         Separating the Expressive and Distinguishing Powers},
  publisher =           {Oxford University Press},
  journal =             {Logic Journal of the IGPL},
  volume =              {7},
  number =              {1},
  pages =               {55-78},
  year =                {1999},
  month =               jan,
}
[Dan03] Zhe Dang. Pushdown Timed Automata: A Binary Reachability Characterization and Safety Verification. Theoretical Computer Science 302(1-3):93-121. Elsevier, June 2003. 
@article{tcs302(1-3)-Dang,
  author =              {Dang, Zhe},
  title =               {Pushdown Timed Automata: A~Binary Reachability
                         Characterization and Safety Verification},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {302},
  number =              {1-3},
  pages =               {93-121},
  year =                {2003},
  month =               jun,
}
[DBM+10] Kun Deng, Prabir Barooah, Prashant G. Mehta, and Sean P. Meyn. Building thermal model reduction via aggregation of states. In ACC'10, pages 5118-5123. IEEE Comp. Soc. Press, June 2010. 
@inproceedings{acc2010-DBMM,
  author =              {Deng, Kun and Barooah, Prabir and Mehta, Prashant G.
                         and Meyn, Sean P.},
  title =               {Building thermal model reduction via aggregation of
                         states},
  booktitle =           {Proceedings of the 2010 American Control Conference
                         ({ACC}'10)},
  acronym =             {{ACC}'10},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {5118-5123},
  year =                {2010},
  month =               jun,
  doi =                 {10.1109/ACC.2010.5530470},
}
[DBR67] George B. Dantzig, W. O. Blattner, and M. R. Rao. Finding a Cycle in a Graph with Minimum Cost to Time Ratio with Application to a Ship Routing Problem. In Pierre Rosenstiehl (eds.), Theory of Graphs. Gordon and Breach Science Publishers, 1967. 
@incollection{thgraph-DBR67,
  author =              {Dantzig, George B. and Blattner, W. O. and Rao, M.
                         R.},
  title =               {Finding a Cycle in a Graph with Minimum Cost to Time
                         Ratio with Application to a Ship Routing Problem},
  editor =              {Rosenstiehl, Pierre},
  booktitle =           {Theory of Graphs},
  publisher =           {Gordon and Breach Science Publishers},
  pages =               {77-84},
  year =                {1967},
}
[DCM+04] Jennifer M. Davoren, Vaughan Coulthard, Nicolas Markey, and Thomas Moor. Non-deterministic Temporal Logics for General Flow Systems. In HSCC'04, Lecture Notes in Computer Science 2993, pages 280-295. Springer-Verlag, March 2004.
Abstract

In this paper, we use the constructs of branching temporal logic to formalize reasoning about a class of general flow systems, including discrete-time transition systems, continuous-time differential inclusions, and hybrid-time systems such as hybrid automata. We introduce Full General Flow Logic, GFL*, which has essentially the same syntax as the well-known Full Computation Tree Logic, CTL*, but generalizes the semantics to general flow systems over arbitrary time-lines. We propose an axiomatic proof system for GFL* and establish its soundness w.r.t. the general flow semantics.

@inproceedings{hscc2004-DCMM,
  author =              {Davoren, Jennifer M. and Coulthard, Vaughan and
                         Markey, Nicolas and Moor, Thomas},
  title =               {Non-deterministic Temporal Logics for General Flow
                         Systems},
  editor =              {Alur, Rajeev and Pappas, George J.},
  booktitle =           {{P}roceedings of the 7th {I}nternational {W}orkshop
                         on {H}ybrid {S}ystems: {C}omputation and {C}ontrol
                         ({HSCC}'04)},
  acronym =             {{HSCC}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2993},
  pages =               {280-295},
  year =                {2004},
  month =               mar,
  doi =                 {10.1007/978-3-540-24743-2_19},
  abstract =            {In this paper, we use the constructs of branching
                         temporal logic to formalize reasoning about a class
                         of general flow systems, including discrete-time
                         transition systems, continuous-time differential
                         inclusions, and hybrid-time systems such as hybrid
                         automata. We introduce Full General Flow Logic,
                         GFL\(^*\), which has essentially the same syntax as
                         the well-known Full Computation Tree Logic,
                         CTL\(^*\), but generalizes the semantics to general
                         flow systems over arbitrary time-lines. We propose
                         an axiomatic proof system for GFL\(^*\) and
                         establish its soundness w.r.t. the general flow
                         semantics.},
}
[DD03] Stéphane Demri and Deepak D'Souza. An Automata-Theoretic Approach to Constraint LTL. Research Report LSV-03-11, Lab. Spécification & Vérification, ENS Cachan, France, August 2003. 
@techreport{LSV-03-11-DD,
  author =              {Demri, St{\'e}phane and D'Souza, Deepak},
  title =               {An Automata-Theoretic Approach to Constraint {LTL}},
  number =              {LSV-03-11},
  year =                {2003},
  month =               aug,
  institution =         {Lab.~Sp\'ecification \& V\'erification, ENS Cachan,
                         France},
  type =                {Research Report},
}
[DDD+12] Werner Damm, Henning Dierks, Stefan Disch, Willem Hagemann, Florian Pigorsch, Christoph Scholl, Uwe Waldmann, and Boris Wirtz. Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces. Science of Computer Programming 77(10-11):1122-1150. Elsevier, September 2012. 
@article{scp77(10-11)-DDDHPSWW,
  author =              {Damm, Werner and Dierks, Henning and Disch, Stefan
                         and Hagemann, Willem and Pigorsch, Florian and
                         Scholl, Christoph and Waldmann, Uwe and Wirtz,
                         Boris},
  title =               {Exact and fully symbolic verification of linear
                         hybrid automata with large discrete state spaces},
  publisher =           {Elsevier},
  journal =             {Science of Computer Programming},
  volume =              {77},
  number =              {10-11},
  pages =               {1122-1150},
  year =                {2012},
  month =               sep,
  doi =                 {10.1016/j.scico.2011.07.006},
}
[DDG07] Stéphane Demri, Deepak D'Souza, and Régis Gascon. Decidable Temporal Logic with Repeating Values. In LFCS'07, Lecture Notes in Computer Science 4514, pages 180-194. Springer-Verlag, June 2007. 
@inproceedings{lfcs2007-DDG,
  author =              {Demri, St{\'e}phane and D'Souza, Deepak and Gascon,
                         R{\'e}gis},
  title =               {Decidable Temporal Logic with Repeating Values},
  editor =              {Artemov, Sergei N. and Nerode, Anil},
  booktitle =           {{P}roceedings of the {I}nternational {S}ymposium
                         {L}ogical {F}oundations of {C}omputer {S}cience
                         ({LFCS}'07)},
  acronym =             {{LFCS}'07},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4514},
  pages =               {180-194},
  year =                {2007},
  month =               jun,
}
[DDG+10] Aldric Degorre, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin, and Szymon Toruńczyk. Energy and Mean-Payoff Games with Imperfect Information. In CSL'10, Lecture Notes in Computer Science 6247, pages 260-274. Springer-Verlag, August 2010. 
@inproceedings{csl2010-DDGRT,
  author =              {Degorre, Aldric and Doyen, Laurent and Gentilini,
                         Raffaella and Raskin, Jean-Fran{\c c}ois and
                         Toru{\'n}czyk, Szymon},
  title =               {Energy and Mean-Payoff Games with Imperfect
                         Information},
  editor =              {Dawar, Anuj and Veith, Helmut},
  booktitle =           {{P}roceedings of the 24th {I}nternational {W}orkshop
                         on {C}omputer {S}cience {L}ogic ({CSL}'10)},
  acronym =             {{CSL}'10},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6247},
  pages =               {260-274},
  year =                {2010},
  month =               aug,
  doi =                 {10.1007/978-3-642-15205-4_22},
}
[DDL+13] Alexandre David, Dehui Du, Kim Guldstrand Larsen, Axel Legay, and Marius Mikučionis. Optimizing Control Strategy Using Statistical Model Checking. In NFM'13, Lecture Notes in Computer Science 7871, pages 352-367. Springer-Verlag, May 2013. 
@inproceedings{nasafm2013-DDLLM,
  author =              {David, Alexandre and Du, Dehui and Larsen, Kim
                         Guldstrand and Legay, Axel and Miku{\v{c}}ionis,
                         Marius},
  title =               {Optimizing Control Strategy Using Statistical Model
                         Checking},
  editor =              {Brat, Guillaume and Rungta, Neha and Venet, Arnaud},
  booktitle =           {{P}roceedings of the th {NASA} {F}ormal {M}ethods
                         {S}ymposium ({NFM}'13)},
  acronym =             {{NFM}'13},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7871},
  pages =               {352-367},
  year =                {2013},
  month =               may,
  doi =                 {10.1007/978-3-642-38088-4_24},
}
[DDM+04] Martin De Wulf, Laurent Doyen, Nicolas Markey, and Jean-François Raskin. Robustness and Implementability of Timed Automata. In FORMATS-FTRTFT'04, Lecture Notes in Computer Science 3253, pages 118-133. Springer-Verlag, September 2004.
Abstract

In a former paper, we defined a new semantics for timed automata, the Almost ASAP semantics, which is parameterized by Δ to cope with the reaction delay of the controller. We showed that this semantics is implementable provided there exists a strictly positive value for the parameter Δ for which the strategy is correct. In this paper, we define the implementability problem to be the question of existence of such a Δ. We show that this question is closely related to a notion of robustness for timed automata defined in (A. Puri: Dynamical Properties of Timed Automata. FTRTFT, 1998) and prove that the implementability problem is decidable.

@inproceedings{ftrtft2004-DDMR,
  author =              {De{~}Wulf, Martin and Doyen, Laurent and Markey,
                         Nicolas and Raskin, Jean-Fran{\c c}ois},
  title =               {Robustness and Implementability of Timed Automata},
  editor =              {Lakhnech, Yassine and Yovine, Sergio},
  booktitle =           {{P}roceedings of the {J}oint {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'04) and {F}ormal
                         {T}echniques in {R}eal-Time and {F}ault-Tolerant
                         {S}ystems ({FTRTFT}'04)},
  acronym =             {{FORMATS-FTRTFT}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3253},
  pages =               {118-133},
  year =                {2004},
  month =               sep,
  doi =                 {10.1007/978-3-540-30206-3_10},
  abstract =            {In a former paper, we defined a new semantics for
                         timed automata, the Almost ASAP semantics, which is
                         parameterized by \(\Delta\) to cope with the
                         reaction delay of the controller. We showed that
                         this semantics is implementable provided there
                         exists a strictly positive value for the parameter
                         \(\Delta\) for which the strategy is correct. In
                         this paper, we define the implementability problem
                         to be the question of existence of such a
                         \(\Delta\). We show that this question is closely
                         related to a notion of robustness for timed automata
                         defined in (A.~Puri: \textit{Dynamical Properties of
                         Timed Automata}. FTRTFT, 1998) and prove that the
                         implementability problem is decidable.},
}
[DDM+08] Martin De Wulf, Laurent Doyen, Nicolas Markey, and Jean-François Raskin. Robust Safety of Timed Automata. Formal Methods in System Design 33(1-3):45-84. Springer-Verlag, December 2008.
Abstract

Timed automata are governed by an idealized semantics that assumes a perfectly precise behavior of the clocks. The traditional semantics is not robust because the slightest perturbation in the timing of actions may lead to completely different behaviors of the automaton. Following several recent works, we consider a relaxation of this semantics, in which guards on transitions are widened by Δ>0 and clocks can drift by ε>0. The relaxed semantics encompasses the imprecisions that are inevitably present in an implementation of a timed automaton, due to the finite precision of digital clocks.

We solve the safety verification problem for this robust semantics: given a timed automaton and a set of bad states, our algorithm decides if there exist positive values for the parameters Δ and ε such that the timed automaton never enters the bad states under the relaxed semantics.

@article{fmsd33(1-3)-DDMR,
  author =              {De{~}Wulf, Martin and Doyen, Laurent and Markey,
                         Nicolas and Raskin, Jean-Fran{\c c}ois},
  title =               {Robust Safety of Timed Automata},
  publisher =           {Springer-Verlag},
  journal =             {Formal Methods in System Design},
  volume =              {33},
  number =              {1-3},
  pages =               {45-84},
  year =                {2008},
  month =               dec,
  doi =                 {10.1007/s10703-008-0056-7},
  abstract =            {Timed automata are governed by an idealized
                         semantics that assumes a perfectly precise behavior
                         of the clocks. The traditional semantics is not
                         robust because the slightest perturbation in the
                         timing of actions may lead to completely different
                         behaviors of the automaton. Following several recent
                         works, we consider a relaxation of this semantics,
                         in which guards on transitions are widened
                         by~\(\Delta>0\) and clocks can drift
                         by~\(\epsilon>0\). The relaxed semantics encompasses
                         the imprecisions that are inevitably present in an
                         implementation of a timed automaton, due to the
                         finite precision of digital clocks.\par We solve the
                         safety verification problem for this robust
                         semantics: given a timed automaton and a set of bad
                         states, our algorithm decides if there exist
                         positive values for the parameters~\(\Delta\)
                         and~\(\epsilon\) such that the timed automaton never
                         enters the bad states under the relaxed semantics.},
}
[DDR04] Martin De Wulf, Laurent Doyen, and Jean-François Raskin. Almost ASAP Semantics: From Timed Models to Timed Implementations. In HSCC'04, Lecture Notes in Computer Science 2993, pages 296-310. Springer-Verlag, March 2004. 
@inproceedings{hscc2004-DDR,
  author =              {De{~}Wulf, Martin and Doyen, Laurent and Raskin,
                         Jean-Fran{\c c}ois},
  title =               {Almost {ASAP} Semantics: From Timed Models to Timed
                         Implementations},
  editor =              {Alur, Rajeev and Pappas, George J.},
  booktitle =           {{P}roceedings of the 7th {I}nternational {W}orkshop
                         on {H}ybrid {S}ystems: {C}omputation and {C}ontrol
                         ({HSCC}'04)},
  acronym =             {{HSCC}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2993},
  pages =               {296-310},
  year =                {2004},
  month =               mar,
}
[DDR05] Martin De Wulf, Laurent Doyen, and Jean-François Raskin. Almost ASAP Semantics: From Timed Models to Timed Implementations. Formal Aspects of Computing 17(3):319-341. Springer-Verlag, 2005. 
@article{fac17(3)-DDR,
  author =              {De{~}Wulf, Martin and Doyen, Laurent and Raskin,
                         Jean-Fran{\c c}ois},
  title =               {Almost {ASAP} Semantics: From Timed Models to Timed
                         Implementations},
  publisher =           {Springer-Verlag},
  journal =             {Formal Aspects of Computing},
  volume =              {17},
  number =              {3},
  pages =               {319-341},
  year =                {2005},
}
[De94] Sergio De Agostino. P-complete problems in data compression. Theoretical Computer Science 127(1):181-186. Elsevier, May 1994. 
@article{tcs127(1)-Dea,
  author =              {De{~}Agostino, Sergio},
  title =               {{P}-complete problems in data compression},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {127},
  number =              {1},
  pages =               {181-186},
  year =                {1994},
  month =               may,
}
[De00] Sergio De Agostino. Erratum to "P-complete Problems in Data Compression". Theoretical Computer Science 234(1-2):325-326. Elsevier, March 2000. 
@article{tcs234(1-2)-Dea,
  author =              {De{~}Agostino, Sergio},
  title =               {Erratum to {"}{P}-complete Problems in Data
                         Compression{"}},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {234},
  number =              {1-2},
  pages =               {325-326},
  year =                {2000},
  month =               mar,
}
[De06] Martin De Wulf. From Timed Models to Timed Implementations. Thèse de doctorat, Département d'Informatique, Université Libre de Bruxelles, Belgium, December 2006. 
@phdthesis{phd-dewulf,
  author =              {De{~}Wulf, Martin},
  title =               {From Timed Models to Timed Implementations},
  year =                {2006},
  month =               dec,
  school =              {D{\'e}partement d'Informatique, Universit{\'e} Libre
                         de Bruxelles, Belgium},
  type =                {Th\`ese de doctorat},
}
[DEG+15] Antoine Durand-Gasselin, Javier Esparza, Pierre Ganty, and Rupak Majumdar. Model Checking Parameterized Asynchronous Shared-Memory Systems. In CAV'15, Lecture Notes in Computer Science 9206, pages 67-84. Springer-Verlag, July 2015. 
@inproceedings{cav2015-DEGM,
  author =              {Durand{-}Gasselin, Antoine and Esparza, Javier and
                         Ganty, Pierre and Majumdar, Rupak},
  title =               {Model Checking Parameterized Asynchronous
                         Shared-Memory Systems},
  editor =              {Kroening, Daniel and Pasareanu, Corina S.},
  booktitle =           {{P}roceedings of the 27th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'15)},
  acronym =             {{CAV}'15},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9206},
  pages =               {67-84},
  year =                {2015},
  month =               jul,
  doi =                 {10.1007/978-3-319-21690-4_5},
}
[DFF+04] Erik D. Demaine, Rudolf Fleischer, Aviezri S. Fraenkel, and Richard J. Nowakowski. Appendix B: Open Problems at the 2002 Dagstuhl Seminar on Algebraic Combinatorial Game Theory. Theoretical Computer Science 313(3):539-543. Elsevier, February 2004. 
@article{tcs313(3)-DFFN,
  author =              {Demaine, Erik D. and Fleischer, Rudolf and Fraenkel,
                         Aviezri S. and Nowakowski, Richard J.},
  title =               {Appendix~{B}: {O}pen Problems at the 2002 {D}agstuhl
                         Seminar on Algebraic Combinatorial Game Theory},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {313},
  number =              {3},
  pages =               {539-543},
  year =                {2004},
  month =               feb,
}
[DG00] Volker Diekert and Paul Gastin. LTL is Expressively Complete for Mazurkiewicz Traces. In ICALP'00, Lecture Notes in Computer Science 1853, pages 211-222. Springer-Verlag, July 2000. 
@inproceedings{icalp2000-DG,
  author =              {Diekert, Volker and Gastin, Paul},
  title =               {{LTL} is Expressively Complete for {M}azurkiewicz
                         Traces},
  editor =              {Montanari, Ugo and Rolim, Jos\'e D. P. and Welzl,
                         Emo},
  booktitle =           {{P}roceedings of the 27th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'00)},
  acronym =             {{ICALP}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1853},
  pages =               {211-222},
  year =                {2000},
  month =               jul,
}
[DG02] Jennifer M. Davoren and Rajeev Prabhakar Gore. Bimodal Logics for Reasoning about Continuous Dynamics. In AIML'00. World Scientific, 2002. 
@inproceedings{aiml2000-DG,
  author =              {Davoren, Jennifer M. and Gore, Rajeev Prabhakar},
  title =               {Bimodal Logics for Reasoning about Continuous
                         Dynamics},
  editor =              {de Rijke, Marteen and Wansing, Heinrich and Wolter,
                         Frank and Zakharyaschev, Michael},
  booktitle =           {{P}roceedings of the 3rd {W}orkshop on {A}dvances in
                         {M}odal {L}ogic ({AIML}'00)},
  acronym =             {{AIML}'00},
  publisher =           {World Scientific},
  year =                {2002},
  confyear =            {2000},
  confmonth =           {10},
}
[DG07] Manfred Droste and Paul Gastin. Weighted automata and weighted logics. Theoretical Computer Science 380(1-2):69-86. Elsevier, June 2007. 
@article{tcs380(1-2)-DG,
  author =              {Droste, Manfred and Gastin, Paul},
  title =               {Weighted automata and weighted logics},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {380},
  number =              {1-2},
  pages =               {69-86},
  year =                {2007},
  month =               jun,
}
[DG08] Anuj Dawar and Erich Grädel. The Descriptive Complexity of Parity Games. In CSL'08, Lecture Notes in Computer Science 5213, pages 354-368. Springer-Verlag, September 2008. 
@inproceedings{csl2008-DG,
  author =              {Dawar, Anuj and Gr{\"a}del, Erich},
  title =               {The Descriptive Complexity of Parity Games},
  editor =              {Kaminski, Michael and Martini, Simone},
  booktitle =           {{P}roceedings of the 22nd {I}nternational {W}orkshop
                         on {C}omputer {S}cience {L}ogic ({CSL}'08)},
  acronym =             {{CSL}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5213},
  pages =               {354-368},
  year =                {2008},
  month =               sep,
  doi =                 {10.1007/978-3-540-87531-4_26},
}
[DG08] Volker Diekert and Paul Gastin. First-order definable languages. In Jörg Flum, Erich Grädel, and Thomas Wilke (eds.), Logic and Automata: History and Perspectives, Texts in Logic and Games 2, pages 261-306. Amsterdam University Press, 2008. 
@incollection{lahp2008-DG,
  author =              {Diekert, Volker and Gastin, Paul},
  title =               {First-order definable languages},
  editor =              {Flum, J{\"o}rg and Gr{\"a}del, Erich and Wilke,
                         Thomas},
  booktitle =           {Logic and Automata: History and Perspectives},
  publisher =           {Amsterdam University Press},
  series =              {Texts in Logic and Games},
  volume =              {2},
  pages =               {261-306},
  year =                {2008},
}
[DG09] Stéphane Demri and Régis Gascon. The Effects of Bounding Syntactic Resources on Presburger LTL. Journal of Logic and Computation 19(6):1541-1575. Oxford University Press, December 2009. 
@article{jlc19(6)-DG,
  author =              {Demri, St{\'e}phane and Gascon, R{\'e}gis},
  title =               {The Effects of Bounding Syntactic Resources on
                         {P}resburger~{LTL}},
  publisher =           {Oxford University Press},
  journal =             {Journal of Logic and Computation},
  volume =              {19},
  number =              {6},
  pages =               {1541-1575},
  year =                {2009},
  month =               dec,
  doi =                 {10.1093/logcom/exp037},
}
[DGP09] Constantinos Daskalakis, Paul W. Goldberg, and Christos H. Papadimitriou. The complexity of computing a Nash equilibrium. SIAM Journal on Computing 39(1):195-259. Society for Industrial and Applied Math., 2009. 
@article{siamcomp39(1)-DGP,
  author =              {Daskalakis, Constantinos and Goldberg, Paul W. and
                         Papadimitriou, {\relax Ch}ristos H.},
  title =               {The complexity of computing a {N}ash equilibrium},
  publisher =           {Society for Industrial and Applied Math.},
  journal =             {SIAM Journal on Computing},
  volume =              {39},
  number =              {1},
  pages =               {195-259},
  year =                {2009},
}
[DGR09] Laurent Doyen, Raffaella Gentilini, and Jean-François Raskin. Faster Pseudo-Polynomial Algorithms for Mean-Payoff Games. Technical Report 2009-121, CFV, 2009. 
@techreport{CFV-2009-121-DGR,
  author =              {Doyen, Laurent and Gentilini, Raffaella and Raskin,
                         Jean-Fran{\c c}ois},
  title =               {Faster Pseudo-Polynomial Algorithms for Mean-Payoff
                         Games},
  number =              {2009-121},
  year =                {2009},
  institution =         {CFV},
  type =                {Technical Report},
}
[DGR+09] Laurent Doyen, Gilles Geeraerts, Jean-François Raskin, and Julien Reichert. Realizability of Real-Time Logics. In FORMATS'09, Lecture Notes in Computer Science 5813, pages 133-148. Springer-Verlag, September 2009. 
@inproceedings{formats2009-DGRR,
  author =              {Doyen, Laurent and Geeraerts, Gilles and Raskin,
                         Jean-Fran{\c c}ois and Reichert, Julien},
  title =               {Realizability of Real-Time Logics},
  editor =              {Ouaknine, Jo{\"e}l and Vaandrager, Frits},
  booktitle =           {{P}roceedings of the 7th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'09)},
  acronym =             {{FORMATS}'09},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5813},
  pages =               {133-148},
  year =                {2009},
  month =               sep,
}
[DGR+10] Barbara Di Giampaolo, Gilles Geeraerts, Jean-François Raskin, and Tali Sznajder. Safraless procedures for timed specifications. In FORMATS'10, Lecture Notes in Computer Science 6246, pages 2-22. Springer-Verlag, September 2010. 
@inproceedings{formats2010-DGRS,
  author =              {Di{~}Giampaolo, Barbara and Geeraerts, Gilles and
                         Raskin, Jean-Fran{\c c}ois and Sznajder, Tali},
  title =               {Safraless procedures for timed specifications},
  editor =              {Chatterjee, Krishnendu and Henzinger, Thomas A.},
  booktitle =           {{P}roceedings of the 8th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'10)},
  acronym =             {{FORMATS}'10},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6246},
  pages =               {2-22},
  year =                {2010},
  month =               sep,
}
[DGV99] Marco Daniele, Fausto Giunchiglia, and Moshe Y. Vardi. Improved Automata Generation for Linear Temporal Logic. In CAV'99, Lecture Notes in Computer Science 1633, pages 249-260. Springer-Verlag, July 1999. 
@inproceedings{cav1999-DGV,
  author =              {Daniele, Marco and Giunchiglia, Fausto and Vardi,
                         Moshe Y.},
  title =               {Improved Automata Generation for Linear Temporal
                         Logic},
  editor =              {Halbwachs, Nicolas and Peled, Doron A.},
  booktitle =           {{P}roceedings of the 11th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'99)},
  acronym =             {{CAV}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1633},
  pages =               {249-260},
  year =                {1999},
  month =               jul,
}
[DH00] Giovanna D'Agostino and Marco Hollenberg. Logical Questions Concerning the μ-Calculus: Interpolation, Lyndon and łoś-Tarski. Journal of Symbolic Logic 65(1):310-332. Association for Symbolic Logic, March 2000. 
@article{jsl65(1)-DH,
  author =              {D{'}Agostino, Giovanna and Hollenberg, Marco},
  title =               {Logical Questions Concerning the
                         {{\(\mu\)}}-Calculus: Interpolation, Lyndon and
                         {\L}o{\'s}-Tarski},
  publisher =           {Association for Symbolic Logic},
  journal =             {Journal of Symbolic Logic},
  volume =              {65},
  number =              {1},
  pages =               {310-332},
  year =                {2000},
  month =               mar,
  doi =                 {10.2307/2586539},
}
[DHL+06] Alexandre David, John Håkansson, Kim Guldstrand Larsen, and Paul Pettersson. Model Checking Timed Automata with Priorities Using DBM Subtraction. In FORMATS'06, Lecture Notes in Computer Science 4202, pages 128-142. Springer-Verlag, September 2006. 
@inproceedings{formats2006-DHLP,
  author =              {David, Alexandre and H{\aa}kansson, John and Larsen,
                         Kim Guldstrand and Pettersson, Paul},
  title =               {Model Checking Timed Automata with Priorities Using
                         {DBM} Subtraction},
  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 =               {128-142},
  year =                {2006},
  month =               sep,
  doi =                 {10.1007/11867340_10},
}
[Die01] Henning Dierks. PLC-automata: a new class of implementable real-time automata. Theoretical Computer Science 253(1):61-93. Elsevier, February 2001. 
@article{tcs253(1)-dierks,
  author =              {Dierks, Henning},
  title =               {{PLC}-automata: a new class of implementable
                         real-time automata},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {253},
  number =              {1},
  pages =               {61-93},
  year =                {2001},
  month =               feb,
}
[Die05] Henning Dierks. Finding Optimal Plans for Domains with Continuous Effects with UPPAAL Cora. In VV&PS'05. June 2005. 
@inproceedings{vvps2005-dierks,
  author =              {Dierks, Henning},
  title =               {Finding Optimal Plans for Domains with Continuous
                         Effects with {UPPAAL} {C}ora},
  booktitle =           {{P}roceedings of the {ICAPS}'05 {W}orkshop on
                         {V}erification and {V}alidation of {M}odel-Based
                         {P}lanning and {S}chedulin {S}ystems ({VV\&PS}'05)},
  acronym =             {{VV\&PS}'05},
  year =                {2005},
  month =               jun,
}
[Dij59] Edsger W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik 1:269-271. Springer-Verlag, 1959. 
@article{nm1()-Dij,
  author =              {Dijkstra, Edsger W.},
  title =               {A~note on two problems in connexion with graphs},
  publisher =           {Springer-Verlag},
  journal =             {Numerische Mathematik},
  volume =              {1},
  pages =               {269-271},
  year =                {1959},
  doi =                 {10.1007/BF01386390},
}
[Dil90] David L. Dill. Timing Assumptions and Verification of Finite-State Concurrent Systems. In AVMFSS'89, Lecture Notes in Computer Science 407, pages 197-212. Springer-Verlag, 1990. 
@inproceedings{avmfss1989-dill,
  author =              {Dill, David L.},
  title =               {Timing Assumptions and Verification of Finite-State
                         Concurrent Systems},
  editor =              {Sifakis, Joseph},
  booktitle =           {{P}roceedings of the {I}nternational {W}orkshop on
                         {A}utomatic {V}erification {M}ethods for {F}inite
                         {S}tate {S}ystems ({AVMFSS}'89)},
  acronym =             {{AVMFSS}'89},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {407},
  pages =               {197-212},
  year =                {1990},
  confyear =            {1989},
  confmonth =           {6},
  doi =                 {10.1007/3-540-52148-8_17},
}
[Dim00] Cătălin Dima. Real-Time Automata and the Kleene Algebra of Sets of Real Numbers. In STACS'00, Lecture Notes in Computer Science 1770, pages 279-289. Springer-Verlag, March 2000. 
@inproceedings{stacs2000-Dim,
  author =              {Dima, C{\u a}t{\u a}lin},
  title =               {Real-Time Automata and the {K}leene Algebra of Sets
                         of Real Numbers},
  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 =               {279-289},
  year =                {2000},
  month =               mar,
}
[Dim01] Cătălin Dima. Real-time automata. Journal of Automata, Languages and Combinatorics 6(1):3-23. 2001. 
@article{jalc6(1)-Dim,
  author =              {Dima, C{\u a}t{\u a}lin},
  title =               {Real-time automata},
  journal =             {Journal of Automata, Languages and Combinatorics},
  volume =              {6},
  number =              {1},
  pages =               {3-23},
  year =                {2001},
  doi =                 {10.25596/jalc-2001-003},
}
[Dim02] Cătălin Dima. Computing Reachability Relations in Timed Automata. In LICS'02, pages 177-186. IEEE Comp. Soc. Press, July 2002. 
@inproceedings{lics2002-Dim,
  author =              {Dima, C{\u a}t{\u a}lin},
  title =               {Computing Reachability Relations in Timed Automata},
  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 =               {177-186},
  year =                {2002},
  month =               jul,
}
[Dim07] Cătălin Dima. Dynamical Properties of Timed Automata Revisited. In FORMATS'07, Lecture Notes in Computer Science 4763, pages 130-146. Springer-Verlag, October 2007. 
@inproceedings{formats2007-Dim,
  author =              {Dima, C{\u a}t{\u a}lin},
  title =               {Dynamical Properties of Timed Automata Revisited},
  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 =               {130-146},
  year =                {2007},
  month =               oct,
}
[DJJ+03] Piotr Dembinski, Agata Janowska, Paweł Janowski, Wojciech Penczek, Agata Pólrola, Maciej Szreter, Bożna Woźna, and Andrzej Zbrzezny. Verics: A Tool for Verifying Timed Automata and Estelle Specifications. In TACAS'03, Lecture Notes in Computer Science 2619, pages 278-283. Springer-Verlag, April 2003. 
@inproceedings{tacas2003-DJJPPSWZ,
  author =              {Dembinski, Piotr and Janowska, Agata and Janowski,
                         Pawe{\l} and Penczek, Wojciech and P{\'o}lrola,
                         Agata and Szreter, Maciej and Wo{\'z}na, Bo{\.z}na
                         and Zbrzezny, Andrzej},
  title =               {Verics: A~Tool for Verifying Timed Automata and
                         Estelle Specifications},
  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 =               {278-283},
  year =                {2003},
  month =               apr,
}
[DJL+13] Stéphane Demri, Marcin Jurdziński, Oded Lachish, and Ranko Lazić. The covering and boundedness problems for branching vector addition systems. Journal of Computer and System Sciences 79(1):23-38. Elsevier, February 2013. 
@article{jcss79(1)-DJLL,
  author =              {Demri, St{\'e}phane and Jurdzi{\'n}ski, Marcin and
                         Lachish, Oded and Lazi{\'c}, Ranko},
  title =               {The covering and boundedness problems for branching
                         vector addition systems},
  publisher =           {Elsevier},
  journal =             {Journal of Computer and System Sciences},
  volume =              {79},
  number =              {1},
  pages =               {23-38},
  year =                {2013},
  month =               feb,
  doi =                 {10.1016/j.jcss.2012.04.002},
}
[DJL+14] Laurent Doyen, Line Juhl, Kim Guldstrand Larsen, Nicolas Markey, and Mahsa Shirmohammadi. Synchronizing words for weighted and timed automata. In FSTTCS'14, Leibniz International Proceedings in Informatics 29, pages 121-132. Leibniz-Zentrum für Informatik, December 2014.
Abstract

The problem of synchronizing automata is concerned with the existence of a word that sends all states ofM the automaton to one and the same state. This problem has classically been studied for complete deterministic finite automata, with the existence problem being NLOGSPACE-complete.

In this paper we consider synchronizing-word problems for weighted and timed automata. We consider the synchronization problem in several variants and combinations of these, including deterministic and non-deterministic timed and weighted automata, synchronization to unique location with possibly different clock valuations or accumulated weights, as well as synchronization with a safety condition forbidding the automaton to visit states outside a safety-set during synchronization (e.g. energy constraints). For deterministic weighted automata, the synchronization problem is proven PSPACE-complete under energy constraints, and in 3-EXPSPACE under general safety constraints. For timed automata the synchronization problems are shown to be PSPACE-complete in the deterministic case, and undecidable in the non-deterministic case.

@inproceedings{fsttcs2014-DJLMS,
  author =              {Doyen, Laurent and Juhl, Line and Larsen, Kim
                         Guldstrand and Markey, Nicolas and Shirmohammadi,
                         Mahsa},
  title =               {Synchronizing words for weighted and timed automata},
  editor =              {Raman, Venkatesh and Suresh, S. P.},
  booktitle =           {{P}roceedings of the 34th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'14)},
  acronym =             {{FSTTCS}'14},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {29},
  pages =               {121-132},
  year =                {2014},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2014.121},
  abstract =            {The problem of synchronizing automata is concerned
                         with the existence of a word that sends all states
                         ofM the automaton to one and the same state. This
                         problem has classically been studied for complete
                         deterministic finite automata, with the existence
                         problem being NLOGSPACE-complete.\par In this paper
                         we consider synchronizing-word problems for weighted
                         and timed automata. We consider the synchronization
                         problem in several variants and combinations of
                         these, including deterministic and non-deterministic
                         timed and weighted automata, synchronization to
                         unique location with possibly different clock
                         valuations or accumulated weights, as well as
                         synchronization with a safety condition forbidding
                         the automaton to visit states outside a safety-set
                         during synchronization (e.g. energy constraints).
                         For deterministic weighted automata, the
                         synchronization problem is proven PSPACE-complete
                         under energy constraints, and in 3-EXPSPACE under
                         general safety constraints. For timed automata the
                         synchronization problems are shown to be
                         PSPACE-complete in the deterministic case, and
                         undecidable in the non-deterministic case.},
}
[DJL+15] Alexandre David, Peter Gjøl Jensen, Kim Guldstrand Larsen, Marius Mikučionis, and Jakob Haar Taankvist. Uppaal Stratego. In TACAS'15, Lecture Notes in Computer Science 9035, pages 206-211. Springer-Verlag, April 2015. 
@inproceedings{tacas2015-DLLMW,
  author =              {David, Alexandre and Jensen, Peter Gj{\o}l and
                         Larsen, Kim Guldstrand and Miku{\v{c}}ionis, Marius
                         and Taankvist, Jakob Haar},
  title =               {Uppaal Stratego},
  editor =              {Baier, {\relax Ch}ristel and Tinelli, Cesare},
  booktitle =           {{P}roceedings of the 21st {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'15)},
  acronym =             {{TACAS}'15},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9035},
  pages =               {206-211},
  year =                {2015},
  month =               apr,
  doi =                 {10.1007/978-3-662-46681-0_16},
}
[DJW97] Stefan Dziembowski, Marcin Jurdziński, and Igor Walukiewicz. How Much Memory is Needed to Win Infinite Games. In LICS'97, pages 99-110. IEEE Comp. Soc. Press, June 1997. 
@inproceedings{lics1997-DJW,
  author =              {Dziembowski, Stefan and Jurdzi{\'n}ski, Marcin and
                         Walukiewicz, Igor},
  title =               {How Much Memory is Needed to Win Infinite Games},
  booktitle =           {{P}roceedings of the 12th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'97)},
  acronym =             {{LICS}'97},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {99-110},
  year =                {1997},
  month =               jun,
}
[DK06] Conrado Daws and Piotr Kordy. Symbolic robustness analysis of timed automata. In FORMATS'06, Lecture Notes in Computer Science 4202, pages 143-155. Springer-Verlag, September 2006. 
@inproceedings{formats06-DK,
  author =              {Daws, Conrado and Kordy, Piotr},
  title =               {Symbolic robustness analysis of 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 =               {143-155},
  year =                {2006},
  month =               sep,
}
[DKL07] Henning Dierks, Sebastian Kupferschmid, and Kim Guldstrand Larsen. Automatic abstraction refinement for timed automata. In FORMATS'07, Lecture Notes in Computer Science 4763, pages 114-129. Springer-Verlag, October 2007. 
@inproceedings{formats2007-DKL,
  author =              {Dierks, Henning and Kupferschmid, Sebastian and
                         Larsen, Kim Guldstrand},
  title =               {Automatic abstraction refinement for timed automata},
  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 =               {114-129},
  year =                {2007},
  month =               oct,
  doi =                 {10.1007/978-3-540-75454-1_10},
}
[DKL09] Christian Dax, Felix Klaedtke, and Martin Lange. On Regular Temporal Logics with Past. In ICALP'09, Lecture Notes in Computer Science 5556, pages 175-187. Springer-Verlag, July 2009. 
@inproceedings{icalp2009-DKL,
  author =              {Dax, Christian and Klaedtke, Felix and Lange,
                         Martin},
  title =               {On Regular Temporal Logics with Past},
  editor =              {Albers, Susanne and Marchetti{-}Spaccamela Alberto
                         and Matias, Yossi and Nikoletseas, Sotiris and
                         Thomas, Wolfgang},
  booktitle =           {{P}roceedings of the 36th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'09)~-- Part~{II}},
  acronym =             {{ICALP}'09},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5556},
  pages =               {175-187},
  year =                {2009},
  month =               jul,
  doi =                 {10.1007/978-3-642-02930-1_15},
}
[DKM+15] Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, and Thomas Zeume. Reachability is in DynFO. In ICALP'15, Lecture Notes in Computer Science 9135, pages 159-170. Springer-Verlag, July 2015. 
@inproceedings{icalp2015-DKMSZ,
  author =              {Datta, Samir and Kulkarni, Raghav and Mukherjee,
                         Anish and Schwentick, Thomas and Zeume, Thomas},
  title =               {Reachability is in {D}yn{F}O},
  editor =              {Halld{\'o}rsson, Magn{\'u}s M. and Iwana, Kazuo and
                         Kobayashi, Naoki and Speckmann, Bettina},
  booktitle =           {{P}roceedings of the 42nd {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'15)~-- Part~{II}},
  acronym =             {{ICALP}'15},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9135},
  pages =               {159-170},
  year =                {2015},
  month =               jul,
  doi =                 {10.1007/978-3-662-47666-6_13},
}
[DKP91] Nachum Dershowitz, Stéphane Kaplan, and David A. Plaisted. Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, .... Theoretical Computer Science 83(1):71-96. Elsevier, 1991. 
@article{tcs83(1)-DKP,
  author =              {Dershowitz, Nachum and Kaplan, St{\'e}phane and
                         Plaisted, David A.},
  title =               {Rewrite, Rewrite, Rewrite, Rewrite, Rewrite,~...},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {83},
  number =              {1},
  pages =               {71-96},
  year =                {1991},
}
[DKR08] Manfred Droste, Werner Kuich, and George Rahonis. Multi-Valued MSO Logics over Words and Trees. Fundamenta Informaticae 84(13-4):305-327. IOS Press, 2008. 
@article{fundi84(3-4)-DKR,
  author =              {Droste, Manfred and Kuich, Werner and Rahonis,
                         George},
  title =               {Multi-Valued {MSO} Logics over Words and Trees},
  publisher =           {IOS Press},
  journal =             {Fundamenta Informaticae},
  volume =              {84},
  number =              {13-4},
  pages =               {305-327},
  year =                {2008},
}
[DKR+17] Manfred Droste, Temur Kutsia, George Rahonis, and Wolfgang Schreiner. MK-fuzzy Automata and MSO Logics. In GandALF'17, Electronic Proceedings in Theoretical Computer Science 256, pages 106-120. September 2017. 
@inproceedings{gandalf2017-DKRS,
  author =              {Droste, Manfred and Kutsia, Temur and Rahonis,
                         George and Schreiner, Wolfgang},
  title =               {{MK}-fuzzy Automata and {MSO} Logics},
  editor =              {Bouyer, Patricia and Orlandini, Andrea and
                         San{~}Pietro, Pierluigi},
  booktitle =           {{P}roceedings of the 8th {I}nternational {S}ymposium
                         on {G}ames, {A}utomata, {L}ogics and {F}ormal
                         {V}erification ({GandALF}'17)},
  acronym =             {{GandALF}'17},
  series =              {Electronic Proceedings in Theoretical Computer
                         Science},
  volume =              {256},
  pages =               {106-120},
  year =                {2017},
  month =               sep,
  doi =                 {10.4204/EPTCS.256.8},
}
[DKV09] Manfred Droste, Werner Kuich, and Walter Vogler. Handbook of Weighted Automata. Springer-Verlag, 2009. 
@book{hwa-DKV,
  title =               {Handbook of Weighted Automata},
  editor =              {Droste, Manfred and Kuich, Werner and Vogler,
                         Walter},
  booktitle =           {Handbook of Weighted Automata},
  publisher =           {Springer-Verlag},
  year =                {2009},
}
[DL94] Giuseppe De Giacomo and Maurizio Lenzerini. Concept Language with Number Restrictions and Fixpoints, and its Relationship with Mu-Calculus. In ECAI'94, pages 411-415. John Wiley & Sons, August 1994. 
@inproceedings{ecai1994-DGL,
  author =              {De{~}Giacomo, Giuseppe and Lenzerini, Maurizio},
  title =               {Concept Language with Number Restrictions and
                         Fixpoints, and its Relationship with Mu-Calculus},
  editor =              {Cohn, Anthony G.},
  booktitle =           {{P}roceedings of the 11th {E}uropean {C}onference on
                         {A}rtificial {I}ntelligence ({ECAI}'94)},
  acronym =             {{ECAI}'94},
  publisher =           {John Wiley \& Sons},
  pages =               {411-415},
  year =                {1994},
  month =               aug,
}
[DLF+16] Alexandre Duret-Lutz, Alexandre Lewkowicz, Amaury Fauchille, Thibault Michaud, Étienne Renault, and Laurent Xu. Spot 2.0 – A Framework for LTL and ω-Automata Manipulation. In ATVA'16, Lecture Notes in Computer Science 9938, pages 122-129. Springer-Verlag, October 2016. 
@inproceedings{atva2016-DLFMRX,
  author =              {Duret{-}Lutz, Alexandre and Lewkowicz, Alexandre and
                         Fauchille, Amaury and Michaud, Thibault and Renault,
                         {\'E}tienne and Xu, Laurent},
  title =               {Spot~2.0~-- {A}~Framework for {LTL} and
                         {{\(\omega\)}}-Automata Manipulation},
  editor =              {Artho, Cyrille and Legay, Axel and Peled, Doron A.},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {S}ymposium on {A}utomated {T}echnology for
                         {V}erification and {A}nalysis ({ATVA}'16)},
  acronym =             {{ATVA}'16},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9938},
  pages =               {122-129},
  year =                {2016},
  month =               oct,
  doi =                 {10.1007/978-3-319-46520-3_8},
}
[DLL+12] Alexandre David, Kim Guldstrand Larsen, Axel Legay, and Marius Mikučionis. Schedulability of Herschel-Planck Revisited Using Statistical Model Checking. In ISoLA'12, Lecture Notes in Computer Science 7610, pages 293-307. Springer-Verlag, October 2012. 
@inproceedings{isola2012-DLLM,
  author =              {David, Alexandre and Larsen, Kim Guldstrand and
                         Legay, Axel and Miku{\v{c}}ionis, Marius},
  title =               {Schedulability of {H}erschel-{P}lanck Revisited
                         Using Statistical Model Checking},
  editor =              {Margaria, Tiziana and Steffen, Bernhard},
  booktitle =           {{P}roceedings of the 5th {I}nternational {S}ymposium
                         on {L}everaging {A}pplications of {F}ormal {M}ethods
                         ({IS}o{LA}'12)~-- {P}art~{II}: {A}pplications and
                         {C}ase {S}tudies},
  acronym =             {{IS}o{LA}'12},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7610},
  pages =               {293-307},
  year =                {2012},
  month =               oct,
  doi =                 {10.1007/978-3-642-34032-1},
}
[DLL+10] Alexandre David, Kim Guldstrand Larsen, Shuhao Li, Marius Mikučionis, and Brian Nielsen. Testing Real-Time Systems under Uncertainty. In FMCO'10, Lecture Notes in Computer Science 6957, pages 352-371. Springer-Verlag, December 2010. 
@inproceedings{fmco2010-DLLMN,
  author =              {David, Alexandre and Larsen, Kim Guldstrand and Li,
                         Shuhao and Miku{\v{c}}ionis, Marius and Nielsen,
                         Brian},
  title =               {Testing Real-Time Systems under Uncertainty},
  booktitle =           {{R}evised {P}apers of the 13th {I}nternational
                         {C}onference on {F}ormal {M}ethods for {C}omponents
                         and {O}bjects ({FMCO}'10)},
  acronym =             {{FMCO}'10},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6957},
  pages =               {352-371},
  year =                {2010},
  month =               dec,
  doi =                 {10.1007/978-3-642-25271-6_19},
}
[DLL+11] Alexandre David, Kim Guldstrand Larsen, Axel Legay, Marius Mikučionis, Danny Bøgsted Poulsen, Jonas van Vliet, and Zheng Wang. Statistical Model Checking for Networks of Priced Timed Automata. In FORMATS'11, Lecture Notes in Computer Science 6919, pages 80-96. Springer-Verlag, September 2011. 
@inproceedings{formats2011-DLLMPVW,
  author =              {David, Alexandre and Larsen, Kim Guldstrand and
                         Legay, Axel and Miku{\v{c}}ionis, Marius and
                         Poulsen, Danny B{\o}gsted and van Vliet, Jonas and
                         Wang, Zheng},
  title =               {Statistical Model Checking for Networks of Priced
                         Timed Automata},
  editor =              {Fahrenberg, Uli and Tripakis, Stavros},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'11)},
  acronym =             {{FORMATS}'11},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6919},
  pages =               {80-96},
  year =                {2011},
  month =               sep,
}
[DLL+11] Alexandre David, Kim Guldstrand Larsen, Axel Legay, Marius Mikučionis, and Zheng Wang. Time for Statistical Model Checking of Real-Time Systems. In CAV'11, Lecture Notes in Computer Science 6806, pages 349-355. Springer-Verlag, July 2011. 
@inproceedings{cav2011-DLLMW,
  author =              {David, Alexandre and Larsen, Kim Guldstrand and
                         Legay, Axel and Miku{\v{c}}ionis, Marius and Wang,
                         Zheng},
  title =               {Time for Statistical Model Checking of Real-Time
                         Systems},
  editor =              {Gopalakrishnan, Ganesh and Qadeer, Shaz},
  booktitle =           {{P}roceedings of the 23rd {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'11)},
  acronym =             {{CAV}'11},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6806},
  pages =               {349-355},
  year =                {2011},
  month =               jul,
  doi =                 {10.1007/978-3-642-22110-1_27},
}
[DLL+08] Alexandre David, Kim Guldstrand Larsen, Shuhao Li, and Brian Nielsen. A Game-Theoretic Approach to Real-Time System Testing. In DATE'08, pages 486-491. IEEE Comp. Soc. Press, March 2008. 
@inproceedings{date2008-DLLN,
  author =              {David, Alexandre and Larsen, Kim Guldstrand and Li,
                         Shuhao and Nielsen, Brian},
  title =               {A Game-Theoretic Approach to Real-Time System
                         Testing},
  booktitle =           {{P}roceedings of the 2008 {D}esign, {A}utomation and
                         {T}est in {E}urope ({DATE}'08)},
  acronym =             {{DATE}'08},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {486-491},
  year =                {2008},
  month =               mar,
}
[DLL+13] Alexandre David, Kim Guldstrand Larsen, Axel Legay, and Danny Bøgsted Poulsen. Statistical Model Checking of Dynamic Networks of Stochastic Hybrid Automata. In AVOCS'13, Electronic Communications of the EASST 10. European Association of Software Science and Technology, September 2013. 
@inproceedings{avocs2013-DLLP,
  author =              {David, Alexandre and Larsen, Kim Guldstrand and
                         Legay, Axel and Poulsen, Danny B{\o}gsted},
  title =               {Statistical Model Checking of Dynamic Networks of
                         Stochastic Hybrid Automata},
  editor =              {Schneider, Steve and Treharne, Helen},
  booktitle =           {{P}roceedings of the 13th {I}nternational {W}orkshop
                         on {A}utomated {V}erification of {C}ritical
                         {S}ystems ({AVOCS}'13)},
  acronym =             {{AVOCS}'13},
  publisher =           {European Association of Software Science and
                         Technology},
  series =              {Electronic Communications of the EASST},
  volume =              {10},
  year =                {2013},
  month =               sep,
}
[DLM10] Arnaud Da Costa, François Laroussinie, and Nicolas Markey. ATL with strategy contexts: Expressiveness and Model Checking. In FSTTCS'10, Leibniz International Proceedings in Informatics 8, pages 120-132. Leibniz-Zentrum für Informatik, December 2010.
Abstract

We study the alternating-time temporal logics ATL and ATL* extended with strategy contexts: these make agents commit to their strategies during the evaluation of formulas, contrary to plain ATL and ATL* where strategy quantifiers reset previously selected strategies.

We illustrate the important expressive power of strategy contexts by proving that they make the extended logics, namely ATLsc and ATLsc*, equally expressive: any formula in ATLsc* can be translated into an equivalent, linear-size ATLsc formula. Despite the high expressiveness of these logics, we prove that they remain decidable by designing a tree-automata-based algorithm for model-checking ATLsc on the full class of n-player concurrent game structures.

@inproceedings{fsttcs2010-DLM,
  author =              {Da{~}Costa, Arnaud and Laroussinie, Fran{\c c}ois
                         and Markey, Nicolas},
  title =               {{ATL} with strategy contexts: Expressiveness and
                         Model Checking},
  editor =              {Lodaya, Kamal and Mahajan, Meena},
  booktitle =           {{P}roceedings of the 30th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'10)},
  acronym =             {{FSTTCS}'10},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {8},
  pages =               {120-132},
  year =                {2010},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2010.120},
  abstract =            {We study the alternating-time temporal logics
                         \(\textsf{ATL}\) and~\(\textsf{ATL}^{*}\) extended
                         with strategy contexts: these make agents commit to
                         their strategies during the evaluation of formulas,
                         contrary to plain \(\textsf{ATL}\)
                         and~\(\textsf{ATL}^{*}\) where strategy quantifiers
                         reset previously selected strategies.\par We
                         illustrate the important expressive power of
                         strategy contexts by proving that they make the
                         extended logics, namely
                         \(\textsf{ATL}_{\textsf{sc}}\)
                         and~\(\textsf{ATL}_{\textsf{sc}}^{*}\), equally
                         expressive: any~formula
                         in~\(\textsf{ATL}_{\textsf{sc}}^{*}\) can be
                         translated into an equivalent, linear-size
                         \(\textsf{ATL}_{\textsf{sc}}\) formula. Despite the
                         high expressiveness of these logics, we prove that
                         they remain decidable by designing a
                         tree-automata-based algorithm for model-checking
                         \(\textsf{ATL}_{\textsf{sc}}\) on the full class of
                         \(n\)-player concurrent game structures.},
}
[DLM12] Arnaud Da Costa, François Laroussinie, and Nicolas Markey. Quantified CTL: Expressiveness and Model Checking. In CONCUR'12, Lecture Notes in Computer Science 7454, pages 177-192. Springer-Verlag, September 2012.
Abstract

While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke structure or to its unwinding tree), we study its expressiveness (showing in particular that QCTL coincides with Monadic Second-Order Logic for both semantics) and characterize the complexity of its model-checking problem, depending on the number of nested propositional quantifiers (showing that the structure semantics populates the polynomial hierarchy while the tree semantics populates the exponential hierarchy). We also show how these results apply to model checking ATL-like temporal logics for games.

@inproceedings{concur2012-DLM,
  author =              {Da{~}Costa, Arnaud and Laroussinie, Fran{\c c}ois
                         and Markey, Nicolas},
  title =               {Quantified~{CTL}: Expressiveness and Model Checking},
  editor =              {Koutny, Maciej and Ulidowski, Irek},
  booktitle =           {{P}roceedings of the 23rd {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'12)},
  acronym =             {{CONCUR}'12},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7454},
  pages =               {177-192},
  year =                {2012},
  month =               sep,
  doi =                 {10.1007/978-3-642-32940-1_14},
  abstract =            {While it was defined long ago, the extension of CTL
                         with quantification over atomic propositions has
                         never been studied extensively. Considering two
                         different semantics (depending whether propositional
                         quantification refers to the Kripke structure or to
                         its unwinding tree), we study its expressiveness
                         (showing in particular that QCTL coincides with
                         Monadic Second-Order Logic for both semantics) and
                         characterize the complexity of its model-checking
                         problem, depending on the number of nested
                         propositional quantifiers (showing that the
                         structure semantics populates the polynomial
                         hierarchy while the tree semantics populates the
                         exponential hierarchy). We also show how these
                         results apply to model checking ATL-like temporal
                         logics for games.},
}
[DLM16] Amélie David, François Laroussinie, and Nicolas Markey. On the expressiveness of QCTL. In CONCUR'16, Leibniz International Proceedings in Informatics 59, pages 28:1-28:15. Leibniz-Zentrum für Informatik, August 2016.
Abstract

QCTL extends the temporal logic CTL with quantification over atomic propositions. While the algorithmic questions for QCTL and its fragments with limited quantification depth are well-understood (e.g. satisfiability of QCTLk, with at most k nested blocks of quantifiers, is k+1-EXPTIME-complete), very few results are known about the expressiveness of this logic. We address such expressiveness questions in this paper. We first consider the distinguishing power of these logics (i.e., their ability to separate models), their relationship with behavioural equivalences, and their ability to capture the behaviours of finite Kripke structures with so-called characteristic formulas. We then consider their expressive power (i.e., their ability to express a property), showing that in terms of expressiveness the hierarchy QCTLk collapses at level 2 (in other terms, any QCTL formula can be expressed using at most two nested blocks of quantifiers).

@inproceedings{concur2016-DLM,
  author =              {David, Am{\'e}lie and Laroussinie, Fran{\c c}ois and
                         Markey, Nicolas},
  title =               {On~the expressiveness of~{QCTL}},
  editor =              {Desharnais, Jules and Jagadeesan, Radha},
  booktitle =           {{P}roceedings of the 27th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'16)},
  acronym =             {{CONCUR}'16},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {59},
  pages =               {28:1-28:15},
  year =                {2016},
  month =               aug,
  doi =                 {10.4230/LIPIcs.CONCUR.2016.28},
  abstract =            {QCTL extends the temporal logic CTL with
                         quantification over atomic propositions. While the
                         algorithmic questions for QCTL and its fragments
                         with limited quantification depth are
                         well-understood (e.g. satisfiability of
                         QCTL\textsuperscript{\(k\)}, with at most \(k\)
                         nested blocks of quantifiers, is
                         \(k+1\)-EXPTIME-complete), very few results are
                         known about the expressiveness of this logic.
                         We~address such expressiveness questions in this
                         paper. We first consider the \emph{distinguishing
                         power} of these logics (i.e.,~their ability to
                         separate models), their relationship with
                         behavioural equivalences, and their ability to
                         capture the behaviours of finite Kripke structures
                         with so-called characteristic formulas. We then
                         consider their \emph{expressive power} (i.e.,~their
                         ability to express a property), showing that in
                         terms of expressiveness the hierarchy
                         QCTL\textsuperscript{\(k\)} collapses at level~2
                         (in~other terms, any~QCTL formula can be expressed
                         using at most two nested blocks of quantifiers).},
}
[DLM+13] Peter H. Dalsgaard, Thibault Le Guilly, Daniel Middelhede, Petur Olsen, Thomas Pedersen, Anders P. Ravn, and Arne Skou. A Toolchain for Home Automation Controller Development. In SEAA'13, pages 122-129. September 2013. 
@inproceedings{HLMOPRS-seaa2013,
  author =              {Dalsgaard, Peter H. and Le{~}Guilly, Thibault and
                         Middelhede, Daniel and Olsen, Petur and Pedersen,
                         Thomas and Ravn, Anders P. and Skou, Arne},
  title =               {A Toolchain for Home Automation Controller
                         Development},
  editor =              {Demir{\"o}rs, Onur and T{\"u}retken, Oktay},
  booktitle =           {{P}roceedings of the 39th {E}uromicro {C}onference
                         on {S}oftware {E}ngineering and {A}dvanced
                         {A}pplications ({SEAA}'13)},
  acronym =             {{SEAA}'13},
  pages =               {122-129},
  year =                {2013},
  month =               sep,
}
[DLR+09] Alexandre David, Kim Guldstrand Larsen, Jacob Illum Rasmussen, and Arne Skou. Model-based framework for schedulability analysis using UPPAAL 4.1. In Gabriela Nicolescu and Pieter J. Mosterman (eds.), Model-Based Design for Embedded Systems, Computational Analysis, Synthesis, and Design of Dynamic Systems, pages 93-119. CRC Press, 2009. 
@incollection{mbdes2009-DLRS,
  author =              {David, Alexandre and Larsen, Kim Guldstrand and
                         Rasmussen, Jacob Illum and Skou, Arne},
  title =               {Model-based framework for schedulability analysis
                         using UPPAAL~4.1},
  editor =              {Nicolescu, Gabriela and Mosterman, Pieter J.},
  booktitle =           {Model-Based Design for Embedded Systems},
  publisher =           {CRC Press},
  series =              {Computational Analysis, Synthesis, and Design of
                         Dynamic Systems},
  pages =               {93-119},
  year =                {2009},
}
[DLS02] Stéphane Demri, François Laroussinie, and Philippe Schnoebelen. A Parametric Analysis of the State Explosion Problem in Model Checking (Extended Abstract). In STACS'02, Lecture Notes in Computer Science 2285, pages 620-631. Springer-Verlag, March 2002. 
@inproceedings{stacs2002-DLS,
  author =              {Demri, St{\'e}phane and Laroussinie, Fran{\c c}ois
                         and Schnoebelen, {\relax Ph}ilippe},
  title =               {A Parametric Analysis of the State Explosion Problem
                         in Model Checking (Extended Abstract)},
  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 =               {620-631},
  year =                {2002},
  month =               mar,
}
[DLS10] Stéphane Demri, Ranko Lazić, and Arnaud Sangnier. Model checking memoryful linear-time logics over one-counter automata. Theoretical Computer Science 411(22-24):2298-2316. Elsevier, May 2010. 
@article{tcs411(22-24)-DLS,
  author =              {Demri, St{\'e}phane and Lazi{\'c}, Ranko and
                         Sangnier, Arnaud},
  title =               {Model checking memoryful linear-time logics over
                         one-counter automata},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {411},
  number =              {22-24},
  pages =               {2298-2316},
  year =                {2010},
  month =               may,
  doi =                 {10.1016/j.tcs.2010.02.021},
}
[DM86] Partha Dasgupta and Eric Maskin. The Existence of Equilibrium in Discontinuous Economic Games, 1: Theory. The Review of Economic Studies 53(1):1-26. Oxford University Press, January 1986. 
@article{res53(1)-DM1,
  author =              {Dasgupta, Partha and Maskin, Eric},
  title =               {The Existence of Equilibrium in Discontinuous
                         Economic Games, 1:~{T}heory},
  publisher =           {Oxford University Press},
  journal =             {The Review of Economic Studies},
  volume =              {53},
  number =              {1},
  pages =               {1-26},
  year =                {1986},
  month =               jan,
}
[DM86] Partha Dasgupta and Eric Maskin. The Existence of Equilibrium in Discontinuous Economic Games, 2: Applications. The Review of Economic Studies 53(1):27-41. Oxford University Press, January 1986. 
@article{res53(1)-DM2,
  author =              {Dasgupta, Partha and Maskin, Eric},
  title =               {The Existence of Equilibrium in Discontinuous
                         Economic Games, 2:~{A}pplications},
  publisher =           {Oxford University Press},
  journal =             {The Review of Economic Studies},
  volume =              {53},
  number =              {1},
  pages =               {27-41},
  year =                {1986},
  month =               jan,
}
[DM02] Deepak D'Souza and Parthasarathy Madhusudan. Timed Control Synthesis for External Specifications. In STACS'02, Lecture Notes in Computer Science 2285, pages 571-582. Springer-Verlag, March 2002. 
@inproceedings{stacs2002-DM,
  author =              {D'Souza, Deepak and Madhusudan, Parthasarathy},
  title =               {Timed Control Synthesis for External Specifications},
  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 =               {571-582},
  year =                {2002},
  month =               mar,
}
[DM18] Dario Della Monica and Aniello Murano. Parity-energy ATL for Qualitative and Quantitative Reasoning in MAS. In AAMAS'18, pages 1441-1449. International Foundation for Autonomous Agents and Multiagent Systems, July 2018. 
@inproceedings{aamas2018-DM,
  author =              {Della{ }Monica, Dario and Murano, Aniello},
  title =               {Parity-energy {ATL} for Qualitative and Quantitative
                         Reasoning in~{MAS}},
  editor =              {Andr{\'e}, Elisabeth and Koenig, Sven and Dastani,
                         Mehdi and Sukthankar, Gita},
  booktitle =           {{P}roceedings of the 17th {I}nternational
                         {C}onference on {A}utonomous {A}gents and
                         {M}ultiagent {S}ystems ({AAMAS}'18)},
  acronym =             {{AAMAS}'18},
  publisher =           {International Foundation for Autonomous Agents and
                         Multiagent Systems},
  pages =               {1441-1449},
  year =                {2018},
  month =               jul,
}
[DMP18] Cătălin Dima, Bastien Maubert, and Sophie Pinchinat. Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus. ACM Transactions on Computational Logic 19(3):23:1-23:33. ACM Press, September 2018. 
@article{tocl19(3)-DMS,
  author =              {Dima, C{\u a}t{\u a}lin and Maubert, Bastien and
                         Pinchinat, Sophie},
  title =               {Relating Paths in Transition Systems: The~Fall of
                         the Modal Mu-Calculus},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Computational Logic},
  volume =              {19},
  number =              {3},
  pages =               {23:1-23:33},
  year =                {2018},
  month =               sep,
  doi =                 {10.1145/3231596},
}
[DMS11] Laurent Doyen, Thierry Massart, and Mahsa Shirmohammadi. Infinite Synchronizing Words for Probabilistic Automata. In MFCS'11, Lecture Notes in Computer Science 6907, pages 278-289. Springer-Verlag, August 2011. 
@inproceedings{mfcs2011-DMS,
  author =              {Doyen, Laurent and Massart, {\relax Th}ierry and
                         Shirmohammadi, Mahsa},
  title =               {Infinite Synchronizing Words for Probabilistic
                         Automata},
  editor =              {Murlak, Filip and Sankovski, Piotr},
  booktitle =           {{P}roceedings of the 36th {I}nternational
                         {S}ymposium on {M}athematical {F}oundations of
                         {C}omputer {S}cience ({MFCS}'13)},
  acronym =             {{MFCS}'11},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6907},
  pages =               {278-289},
  year =                {2011},
  month =               aug,
  doi =                 {10.1007/978-3-642-22993-0_27},
}
[DMS12] Laurent Doyen, Thierry Massart, and Mahsa Shirmohammadi. Infinite Synchronizing Words for Probabilistic Automata (erratum). Research Report 1206.0995, arXiv, June 2012. 
@techreport{mfcs2011-DMS-erratum,
  author =              {Doyen, Laurent and Massart, {\relax Th}ierry and
                         Shirmohammadi, Mahsa},
  title =               {Infinite Synchronizing Words for Probabilistic
                         Automata (erratum)},
  number =              {1206.0995},
  year =                {2012},
  month =               jun,
  institution =         {arXiv},
  type =                {Research Report},
}
[DMS14] Laurent Doyen, Thierry Massart, and Mahsa Shirmohammadi. Limit synchronization in Markov decision processes. In FoSSaCS'14, Lecture Notes in Computer Science 8412, pages 58-72. Springer-Verlag, April 2014. 
@inproceedings{fossacs2014-DMS,
  author =              {Doyen, Laurent and Massart, {\relax Th}ierry and
                         Shirmohammadi, Mahsa},
  title =               {Limit synchronization in {M}arkov decision
                         processes},
  editor =              {Muscholl, Anca},
  booktitle =           {{P}roceedings of the 17th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'14)},
  acronym =             {{FoSSaCS}'14},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8412},
  pages =               {58-72},
  year =                {2014},
  month =               apr,
  doi =                 {10.1007/978-3-642-54830-7_4},
}
[DMS19] Laurent Doyen, Thierry Massart, and Mahsa Shirmohammadi. The complexity of synchronizing Markov decision processes. Journal of Computer and System Sciences 100:96-129. Elsevier, March 2019. 
@article{jcss100()-DMS,
  author =              {Doyen, Laurent and Massart, {\relax Th}ierry and
                         Shirmohammadi, Mahsa},
  title =               {The complexity of synchronizing {M}arkov decision
                         processes},
  publisher =           {Elsevier},
  journal =             {Journal of Computer and System Sciences},
  volume =              {100},
  pages =               {96-129},
  year =                {2019},
  month =               mar,
  doi =                 {10.1016/j.jcss.2018.09.004},
}
[DN07] Stéphane Demri and David Nowak. Reasoning about Transfinite Sequences. International Journal of Foundations of Computer Science 18(1):87-112. February 2007. 
@article{ijfcs18(1)-DN,
  author =              {Demri, St{\'e}phane and Nowak, David},
  title =               {Reasoning about Transfinite Sequences},
  journal =             {International Journal of Foundations of Computer
                         Science},
  volume =              {18},
  number =              {1},
  pages =               {87-112},
  year =                {2007},
  month =               feb,
  doi =                 {10.1142/S0129054107004589},
}
[DOT+10] Andreas E. Dalsgaard, Mads Chr. Olesen, Martin Toft, René R. Hansen, and Kim Guldstrand Larsen. METAMOC: Modular Execution Time Analysis using Model Checking. In WCET'10, OpenAccess Series in Informatics 15, pages 113-123. Leibniz-Zentrum für Informatik, July 2010. 
@inproceedings{wcet2010-DOTHL,
  author =              {Dalsgaard, Andreas E. and Olesen, Mads Chr. and
                         Toft, Martin and Hansen, Ren{\'e} R. and Larsen, Kim
                         Guldstrand},
  title =               {METAMOC: Modular Execution Time Analysis using Model
                         Checking},
  editor =              {Lisper, Bj{\"o}rn},
  booktitle =           {{P}roceedings of the 10th {I}nternational {W}orkshop
                         on {W}orst-{C}ase {E}xecution {T}ime {A}nalysis
                         ({WCET}'10)},
  acronym =             {{WCET}'10},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {OpenAccess Series in Informatics},
  volume =              {15},
  pages =               {113-123},
  year =                {2010},
  month =               jul,
}
[DOT+96] Conrado Daws, Alfredo Olivero, Stavros Tripakis, and Sergio Yovine. The tool Kronos. In HSCC'95, Lecture Notes in Computer Science 1066, pages 208-219. Springer-Verlag, 1996. 
@inproceedings{hscc1995-DOTY,
  author =              {Daws, Conrado and Olivero, Alfredo and Tripakis,
                         Stavros and Yovine, Sergio},
  title =               {The tool {\scshape {K}ronos}},
  editor =              {Alur, Rajeev and Henzinger, Thomas A. and Sontag,
                         Eduardo D.},
  booktitle =           {{H}ybrid {S}ystems~{III}: {V}erification and
                         {C}ontrol ({HSCC}'95)},
  acronym =             {{HSCC}'95},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1066},
  pages =               {208-219},
  year =                {1996},
  confyear =            {1995},
  confmonth =           {10},
}
[Doy06] Laurent Doyen. Algorithmic Analysis of Complex Semantics for Timed and Hybrid Automata. Thèse de doctorat, Département d'Informatique, Université Libre de Bruxelles, Belgium, June 2006. 
@phdthesis{phd-doyen,
  author =              {Doyen, Laurent},
  title =               {Algorithmic Analysis of Complex Semantics for Timed
                         and Hybrid Automata},
  year =                {2006},
  month =               jun,
  school =              {D{\'e}partement d'Informatique, Universit{\'e} Libre
                         de Bruxelles, Belgium},
  type =                {Th\`ese de doctorat},
}
[Doy07] Laurent Doyen. Robust parametric reachability for timed automata. Information Processing Letters 102(5):208-213. Elsevier, May 2007. 
@article{ipl102(5)-Doy,
  author =              {Doyen, Laurent},
  title =               {Robust parametric reachability for timed automata},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {102},
  number =              {5},
  pages =               {208-213},
  year =                {2007},
  month =               may,
  doi =                 {10.1016/j.ipl.2006.11.018},
}
[Doy12] Laurent Doyen. Games and Automata: From Boolean to Quantitative Verification. Mémoire d'habilitation, École Normale Supérieure de Cachan, France, March 2012. 
@phdthesis{hdr-doyen,
  author =              {Doyen, Laurent},
  title =               {Games and Automata: From Boolean to Quantitative
                         Verification},
  year =                {2012},
  month =               mar,
  school =              {{\'E}cole Normale Sup{\'e}rieure de Cachan, France},
  type =                {M\'emoire d'habilitation},
}
[DP05] Deepak D'Souza and Pavithra Prabhakar. On the Expressiveness of MTL in the Pointwise and Continuous Semantics. Technical Report IISc-CSA-TR-2005-7, Indian Institute of Science, Bangalore, India, May 2005. 
@techreport{IISc-CSA-TR-2005-7-DP,
  author =              {D'Souza, Deepak and Prabhakar, Pavithra},
  title =               {On the Expressiveness of {MTL} in the Pointwise and
                         Continuous Semantics},
  number =              {IISc-CSA-TR-2005-7},
  year =                {2005},
  month =               may,
  institution =         {Indian Institute of Science, Bangalore, India},
  type =                {Technical Report},
}
[DP07] Deepak D'Souza and Pavithra Prabhakar. On the Expressiveness of MTL in the Pointwise and Continuous Semantics. International Journal on Software Tools for Technology Transfer 9(1):1-4. Springer-Verlag, February 2007. 
@article{sttt9(1)-DP,
  author =              {D'Souza, Deepak and Prabhakar, Pavithra},
  title =               {On the Expressiveness of {MTL} in the Pointwise and
                         Continuous Semantics},
  publisher =           {Springer-Verlag},
  journal =             {International Journal on Software Tools for
                         Technology Transfer},
  volume =              {9},
  number =              {1},
  pages =               {1-4},
  year =                {2007},
  month =               feb,
  doi =                 {10.1007/s10009-005-0214-9},
}
[DPP07] Andrea D'Ariano, Dario Pacciarelli, and Marco Pranzo. A branch-and-bound algorithm for scheduling trains in a railway network. European Journal of Operational Research 183(2):643-657. Elsevier, December 2007. 
@article{ejor183(2)-APP,
  author =              {D{'}Ariano, Andrea and Pacciarelli, Dario and
                         Pranzo, Marco},
  title =               {A~branch-and-bound algorithm for scheduling trains
                         in a railway network},
  publisher =           {Elsevier},
  journal =             {European Journal of Operational Research},
  volume =              {183},
  number =              {2},
  pages =               {643-657},
  year =                {2007},
  month =               dec,
  doi =                 {10.1016/j.ejor.2006.10.034},
}
[DPV06] Sanjoy Dasgupta, Christos H. Papadimitriou, and Vijay V. Vazirani. Algorithms. McGraw-Hill, 2006. 
@book{DPV06,
  author =              {Dasgupta, Sanjoy and Papadimitriou, {\relax
                         Ch}ristos H. and Vazirani, Vijay V.},
  title =               {Algorithms},
  publisher =           {McGraw-Hill},
  year =                {2006},
}
[DR95] Volker Diekert and Grzegorz Rozenberg. The Book of Traces. World Scientific, 1995. 
@book{BoT-DR,
  author =              {Diekert, Volker and Rozenberg, Grzegorz},
  title =               {The Book of Traces},
  publisher =           {World Scientific},
  year =                {1995},
}
[DR10] Laurent Doyen and Jean-François Raskin. Antichain Algorithms for Finite Automata. In TACAS'10, Lecture Notes in Computer Science 6015, pages 2-22. Springer-Verlag, March 2010. 
@inproceedings{tacas2010-DR,
  author =              {Doyen, Laurent and Raskin, Jean-Fran{\c c}ois},
  title =               {Antichain Algorithms for Finite Automata},
  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 =               {2-22},
  year =                {2010},
  month =               mar,
}
[DRV04] Giorgio Delzanno, Jean-François Raskin, and Laurent Van Begin. Covering sharing trees: a compact data structure for parameterized verification. International Journal on Software Tools for Technology Transfer 5(2-3):268-297. Springer-Verlag, 2004. 
@article{sttt5(2-3)-DRV,
  author =              {Delzanno, Giorgio and Raskin, Jean-Fran{\c c}ois and
                         Van{~}Begin, Laurent},
  title =               {Covering sharing trees: a compact data structure for
                         parameterized verification},
  publisher =           {Springer-Verlag},
  journal =             {International Journal on Software Tools for
                         Technology Transfer},
  volume =              {5},
  number =              {2-3},
  pages =               {268-297},
  year =                {2004},
}
[DS98] Stéphane Demri and Philippe Schnoebelen. The Complexity of Propositional Linear Temporal Logics in Simple Cases (extended abstract). In STACS'98, Lecture Notes in Computer Science 1373, pages 61-72. Springer-Verlag, February 1998. 
@inproceedings{stacs1998-DS,
  author =              {Demri, St{\'e}phane and Schnoebelen, {\relax
                         Ph}ilippe},
  title =               {The Complexity of Propositional Linear Temporal
                         Logics in Simple Cases (extended abstract)},
  editor =              {Morvan, Michel and Meinel, {\relax Ch}ristoph and
                         Krob, Daniel},
  booktitle =           {{P}roceedings of the 15th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'98)},
  acronym =             {{STACS}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1373},
  pages =               {61-72},
  year =                {1998},
  month =               feb,
}
[DS02] Stéphane Demri and Philippe Schnoebelen. The Complexity of Propositional Linear Temporal Logics in Simple Cases. Information and Computation 174(1):84-103. Academic Press, April 2002. 
@article{icomp174(1)-DS,
  author =              {Demri, St{\'e}phane and Schnoebelen, {\relax
                         Ph}ilippe},
  title =               {The Complexity of Propositional Linear Temporal
                         Logics in Simple Cases},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {174},
  number =              {1},
  pages =               {84-103},
  year =                {2002},
  month =               apr,
}
[DS02] Stéphane Demri and Ulrike Sattler. Automata-Theoretic Decision Procedures for Information Logics. Fundamenta Informaticae 53(1):1-22. IOS Press, 2002. 
@article{fundi53(1)-DS,
  author =              {Demri, St{\'e}phane and Sattler, Ulrike},
  title =               {Automata-Theoretic Decision Procedures for
                         Information Logics},
  publisher =           {IOS Press},
  journal =             {Fundamenta Informaticae},
  volume =              {53},
  number =              {1},
  pages =               {1-22},
  year =                {2002},
}
[DSK01] Zhe Dang, Pierluigi San Pietro, and Richard A. Kemmerer. On Presburger Liveness of Discrete Timed Automata. In STACS'01, Lecture Notes in Computer Science 2010, pages 132-143. Springer-Verlag, February 2001. 
@inproceedings{stacs01-DSPK,
  author =              {Dang, Zhe and San{~}Pietro, Pierluigi and Kemmerer,
                         Richard A.},
  title =               {On {P}resburger Liveness of Discrete Timed Automata},
  editor =              {Ferreira, Afonso and Reichel, Horst},
  booktitle =           {{P}roceedings of the 18th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'01)},
  acronym =             {{STACS}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2010},
  pages =               {132-143},
  year =                {2001},
  month =               feb,
}
[DSQ+15] Ankush Desai, Sanjit A. Seshia, Shaz Qadeer, David Broman, and John C. Eidson. Approximate synchrony: An abstraction for distributed almost-synchronous systems. In CAV'15, Lecture Notes in Computer Science 9206, pages 429-448. Springer-Verlag, July 2015. 
@inproceedings{cav2015-DSQBE,
  author =              {Desai, Ankush and Seshia,Sanjit A. and Qadeer, Shaz
                         and Broman, David and Eidson, John C.},
  title =               {Approximate synchrony: An abstraction for
                         distributed almost-synchronous systems},
  editor =              {Kroening, Daniel and Pasareanu, Corina S.},
  booktitle =           {{P}roceedings of the 27th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'15)},
  acronym =             {{CAV}'15},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9206},
  pages =               {429-448},
  year =                {2015},
  month =               jul,
  doi =                 {10.1007/978-3-319-21668-3_25},
}
[DST+12] Giorgio Delzanno, Arnaud Sangnier, Riccardo Traverso, and Gianluigi Zavattaro. On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks. In FSTTCS'12, Leibniz International Proceedings in Informatics 18, pages 289-300. Leibniz-Zentrum für Informatik, December 2012. 
@inproceedings{fsttcs12-DSTZ,
  author =              {Delzanno, Giorgio and Sangnier, Arnaud and Traverso,
                         Riccardo and Zavattaro, Gianluigi},
  title =               {On~the Complexity of Parameterized Reachability in
                         Reconfigurable Broadcast Networks},
  editor =              {D'Souza, Deepak and Kavitha, Telikepalli and
                         Radhakrishnan, Jaikumar},
  booktitle =           {{P}roceedings of the 32nd {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'12)},
  acronym =             {{FSTTCS}'12},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {18},
  pages =               {289-300},
  year =                {2012},
  month =               dec,
  doi =                 {LIPIcs.FSTTCS.2012.289},
}
[DSZ10] Giorgio Delzanno, Arnaud Sangnier, and Gianluigi Zavattaro. Parameterized Verification of Ad Hoc Networks. In CONCUR'10, Lecture Notes in Computer Science 6269, pages 313-327. Springer-Verlag, September 2010. 
@inproceedings{concur2010-DSZ,
  author =              {Delzanno, Giorgio and Sangnier, Arnaud and
                         Zavattaro, Gianluigi},
  title =               {Parameterized Verification of Ad~Hoc Networks},
  editor =              {Gastin, Paul and Laroussinie, Fran{\c c}ois},
  booktitle =           {{P}roceedings of the 21st {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'10)},
  acronym =             {{CONCUR}'10},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6269},
  pages =               {313-327},
  year =                {2010},
  month =               sep,
  doi =                 {10.1007/978-3-642-15375-4_22},
}
[DSZ12] Giorgio Delzanno, Arnaud Sangnier, and Gianluigi Zavattaro. Verification of Ad Hoc Networks with Node and Communication Failures. In FMOODS/FORTE'12, Lecture Notes in Computer Science 7273, pages 313-327. Springer-Verlag, June 2012. 
@inproceedings{forte2012-DSZ,
  author =              {Delzanno, Giorgio and Sangnier, Arnaud and
                         Zavattaro, Gianluigi},
  title =               {Verification of Ad~Hoc Networks with Node and
                         Communication Failures},
  editor =              {Giese, Holger and Ro{\c{s}}u, Grigore},
  booktitle =           {{P}roceedings of the {J}oint 14th {IFIP} {WG~6.1}
                         {I}nternational {C}onference on {F}ormal {M}ethods
                         for {O}pen {O}bject-{B}ased {D}istributed {S}ystems
                         ({FMOODS}'12) and 32nd {IFIP} {WG~6.1}
                         {I}nternational {C}onference on {F}ormal
                         {T}echniques for {N}etworked and {D}istributed
                         {S}ystems ({FORTE}'12)},
  acronym =             {{FMOODS/FORTE}'12},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7273},
  pages =               {313-327},
  year =                {2012},
  month =               jun,
  doi =                 {10.1007/978-3-642-15375-4_22},
}
[DT98] Conrado Daws and Stavros Tripakis. Model Checking of Real-Time Reachability Properties Using Abstractions. In TACAS'98, Lecture Notes in Computer Science 1384, pages 313-329. Springer-Verlag, March 1998. 
@inproceedings{tacas1998-DT,
  author =              {Daws, Conrado and Tripakis, Stavros},
  title =               {Model Checking of Real-Time Reachability Properties
                         Using Abstractions},
  editor =              {Steffen, Bernhard},
  booktitle =           {{P}roceedings of the 4th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'98)},
  acronym =             {{TACAS}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1384},
  pages =               {313-329},
  year =                {1998},
  month =               mar,
  doi =                 {10.1007/BFb0054180},
}
[DT04] Deepak D'Souza and Nicolas Tabareau. On Timed Automata with Input-Determined Guards. In FORMATS-FTRTFT'04, Lecture Notes in Computer Science 3253, pages 68-83. Springer-Verlag, September 2004. 
@inproceedings{formats2004-DT,
  author =              {D'Souza, Deepak and Tabareau, Nicolas},
  title =               {On~Timed Automata with Input-Determined Guards},
  editor =              {Lakhnech, Yassine and Yovine, Sergio},
  booktitle =           {{P}roceedings of the {J}oint {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'04) and {F}ormal
                         {T}echniques in {R}eal-Time and {F}ault-Tolerant
                         {S}ystems ({FTRTFT}'04)},
  acronym =             {{FORMATS-FTRTFT}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3253},
  pages =               {68-83},
  year =                {2004},
  month =               sep,
  doi =                 {10.1007/978-3-540-30206-3_7},
}
[DT11] Cătălin Dima and Ferucio Laurenţiu Ţiplea. Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable. Research Report 1102.4225, arXiv, February 2011. 
@techreport{arxiv11-DT,
  author =              {Dima, C{\u a}t{\u a}lin and {\c T}iplea, Ferucio
                         Lauren{\c t}iu},
  title =               {Model-checking {ATL} under Imperfect Information and
                         Perfect Recall Semantics is Undecidable},
  number =              {1102.4225},
  year =                {2011},
  month =               feb,
  institution =         {arXiv},
  type =                {Research Report},
}
[Duf03] Marie Duflot. Algorithmes distribués sur des anneaux paramétrés : preuves de convergence probabiliste et déterministe. Thèse de doctorat, Lab. Spécification & Vérification, ENS Cachan, France, September 2003. 
@phdthesis{phd-duflot,
  author =              {Duflot, Marie},
  title =               {Algorithmes distribu{\'e}s sur des anneaux
                         param{\'e}tr{\'e}s : preuves de convergence
                         probabiliste et d{\'e}terministe},
  year =                {2003},
  month =               sep,
  school =              {Lab.~Sp\'ecification \& V\'erification, ENS Cachan,
                         France},
  type =                {Th\`ese de doctorat},
}
[DV13] Giuseppe De Giacomo and Moshe Y. Vardi. Linear Temporal Logic and Linear Dynamic Logic on Finite Traces. In IJCAI'13, pages 854-860. IJCAI organization, August 2013. 
@inproceedings{ijcai2013-DGV,
  author =              {De{~}Giacomo, Giuseppe and Vardi, Moshe Y.},
  title =               {Linear Temporal Logic and Linear Dynamic Logic on
                         Finite Traces},
  editor =              {Rossi, Francesca},
  booktitle =           {{P}roceedings of the 23rd {I}nternational {J}oint
                         {C}onference on {A}rtificial {I}ntelligence
                         ({IJCAI}'13)},
  acronym =             {{IJCAI}'13},
  publisher =           {IJCAI organization},
  pages =               {854-860},
  year =                {2013},
  month =               aug,
}
[DW99] Martin Dickhöfer and Thomas Wilke. Timed Alternating Tree Automata: The Automata Theoretic Solution to the TCTL Model Checking Problem. In ICALP'99, Lecture Notes in Computer Science 1644, pages 281-290. Springer-Verlag, July 1999. 
@inproceedings{icalp1999-DW,
  author =              {Dickh{\"o}fer, Martin and Wilke, Thomas},
  title =               {Timed Alternating Tree Automata: The Automata
                         Theoretic Solution to the {TCTL} Model Checking
                         Problem},
  editor =              {Wiedermann, Jir{\'\i} and van Emde Boas, Peter and
                         Nielsen, Mogens},
  booktitle =           {{P}roceedings of the 26th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'99)},
  acronym =             {{ICALP}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1644},
  pages =               {281-290},
  year =                {1999},
  month =               jul,
}
[DY95] Conrado Daws and Sergio Yovine. Two examples of verification of multirate timed automata with Kronos. In RTSS'95, pages 66-75. IEEE Comp. Soc. Press, December 1995. 
@inproceedings{rtss1995-DY,
  author =              {Daws, Conrado and Yovine, Sergio},
  title =               {Two examples of verification of multirate timed
                         automata with {K}ronos},
  booktitle =           {{P}roceedings of the 16th {S}ymposium on {R}eal-Time
                         {S}ystems ({RTSS}'95)},
  acronym =             {{RTSS}'95},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {66-75},
  year =                {1995},
  month =               dec,
}
E
[vEB97] Peter van Emde Boas. The convenience of tiling. In Andrea Sorbi (eds.), Complexity, Logic and Recursion Theory, Lecture Notes in Pure and Applied Mathematics 187, pages 331-363. Marcel Dekker Inc., February 1997. 
@incollection{lnpam187-Emd,
  author =              {van Emde Boas, Peter},
  title =               {The convenience of tiling},
  editor =              {Sorbi, Andrea},
  booktitle =           {Complexity, Logic and Recursion Theory},
  publisher =           {Marcel Dekker Inc.},
  series =              {Lecture Notes in Pure and Applied Mathematics},
  volume =              {187},
  pages =               {331-363},
  year =                {1997},
  month =               feb,
}
[EC80] E. Allen Emerson and Edmund M. Clarke. Characterizing Correctness Properties of Parallel Programs Using Fixpoints. In ICALP'80, Lecture Notes in Computer Science 85, pages 169-181. Springer-Verlag, July 1980. 
@inproceedings{icalp1980-EC,
  author =              {Emerson, E. Allen and Clarke, Edmund M.},
  title =               {Characterizing Correctness Properties of Parallel
                         Programs Using Fixpoints},
  editor =              {de~Bakker, Jaco W. and van Leeuwen, Jan},
  booktitle =           {{P}roceedings of the 7th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'80)},
  acronym =             {{ICALP}'80},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {85},
  pages =               {169-181},
  year =                {1980},
  month =               jul,
}
[EC82] E. Allen Emerson and Edmund M. Clarke. Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons. Science of Computer Programming 2(3):241-266. North-Holland, December 1982. 
@article{scp2(3)-EC,
  author =              {Emerson, E. Allen and Clarke, Edmund M.},
  title =               {Using Branching Time Temporal Logic to Synthesize
                         Synchronization Skeletons},
  publisher =           {North-Holland},
  journal =             {Science of Computer Programming},
  volume =              {2},
  number =              {3},
  pages =               {241-266},
  year =                {1982},
  month =               dec,
}
[EF95] Heinz-Dieter Ebbinghaus and Jörg Flum. Finite Model Theory. Springer-Verlag, 1995. 
@book{fmt1999-EF,
  author =              {Ebbinghaus, Heinz-Dieter and Flum, J{\"o}rg},
  title =               {Finite Model Theory},
  publisher =           {Springer-Verlag},
  year =                {1995},
}
[EF13] Daniel Ejsing-Dunn and Lisa Fontani. Infinite Runs in Recharge Automata. Master's thesis, Computer Science Department, Aalborg University, Denmark, June 2013. 
@mastersthesis{master13-EF,
  author =              {Ejsing{-}Dunn, Daniel and Fontani, Lisa},
  title =               {Infinite Runs in Recharge Automata},
  year =                {2013},
  month =               jun,
  school =              {Computer Science Department, Aalborg University,
                         Denmark},
}
[EFG+10] Rüdiger Ehlers, Daniel Fass, Michael Gerke, and Hans-Jörg Peter. Fully Symbolic Timed Model Checking Using Constraint Matrix Diagrams. In RTSS'10, pages 360-371. IEEE Comp. Soc. Press, November 2010. 
@inproceedings{rtss2010-EFGP,
  author =              {Ehlers, R{\"u}diger and Fass, Daniel and Gerke,
                         Michael and Peter, Hans-J{\"o}rg},
  title =               {Fully Symbolic Timed Model Checking Using Constraint
                         Matrix Diagrams},
  booktitle =           {{P}roceedings of the 31st {IEEE} {S}ymposium on
                         {R}eal-Time {S}ystems ({RTSS}'10)},
  acronym =             {{RTSS}'10},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {360-371},
  year =                {2010},
  month =               nov,
  doi =                 {10.1109/RTSS.2010.36},
}
[EFM99] Javier Esparza, Alain Finkel, and Richard Mayr. On the verification of broadcast protocols. In LICS'99, pages 352-359. IEEE Comp. Soc. Press, July 1999. 
@inproceedings{lics1999-EFM,
  author =              {Esparza, Javier and Finkel, Alain and Mayr, Richard},
  title =               {On the verification of broadcast protocols},
  booktitle =           {{P}roceedings of the 14th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'99)},
  acronym =             {{LICS}'99},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {352-359},
  year =                {1999},
  month =               jul,
  doi =                 {10.1109/LICS.1999.782630},
}
[EGL+15] Javier Esparza, Pierre Ganty, Jérôme Leroux, and Rupak Majumdar. Verification of Population Protocols. In CONCUR'15, Leibniz International Proceedings in Informatics 42, pages 470-482. Leibniz-Zentrum für Informatik, September 2015. 
@inproceedings{concur2015-EGLM,
  author =              {Esparza, Javier and Ganty, Pierre and Leroux,
                         J{\'e}r{\^o}me and Majumdar, Rupak},
  title =               {Verification of Population Protocols},
  editor =              {Aceto, Luca and de Frutos{-}Escrig, David},
  booktitle =           {{P}roceedings of the 26th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'15)},
  acronym =             {{CONCUR}'15},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {42},
  pages =               {470-482},
  year =                {2015},
  month =               sep,
  doi =                 {10.4230/LIPIcs.CONCUR.2015.470},
}
[EGL+16] Javier Esparza, Pierre Ganty, Jérôme Leroux, and Rupak Majumdar. Model checking Population Protocols. In FSTTCS'16, Leibniz International Proceedings in Informatics, pages 27:1-27:14. Leibniz-Zentrum für Informatik, December 2016. 
@inproceedings{fsttcs2016-EGLM,
  author =              {Esparza, Javier and Ganty, Pierre and Leroux,
                         J{\'e}r{\^o}me and Majumdar, Rupak},
  title =               {Model checking Population Protocols},
  editor =              {Akshay, S. and Lal, Akash and Saurabh, Saket and
                         Sen, Sandeep},
  booktitle =           {{P}roceedings of the 36th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'16)},
  acronym =             {{FSTTCS}'16},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  pages =               {27:1-27:14},
  year =                {2016},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2016.27},
}
[EGL+17] Javier Esparza, Pierre Ganty, Jérôme Leroux, and Rupak Majumdar. Verification of Population Protocols. Acta Informatica 54(2):191-215. Springer-Verlag, March 2017. 
@article{atca54(2)-EGLM,
  author =              {Esparza, Javier and Ganty, Pierre and Leroux,
                         J{\'e}r{\^o}me and Majumdar, Rupak},
  title =               {Verification of Population Protocols},
  publisher =           {Springer-Verlag},
  journal =             {Acta Informatica},
  volume =              {54},
  number =              {2},
  pages =               {191-215},
  year =                {2017},
  month =               mar,
  doi =                 {10.1007/s00236-016-0272-3},
}
[EGM13] Javier Esparza, Pierre Ganty, and Rupak Majumdar. Parameterized verification of asynchronous shared-memory systems. In CAV'13, Lecture Notes in Computer Science 8044, pages 124-140. Springer-Verlag, July 2013. 
@inproceedings{cav2013-EGM,
  author =              {Esparza, Javier and Ganty, Pierre and Majumdar,
                         Rupak},
  title =               {Parameterized verification of asynchronous
                         shared-memory systems},
  editor =              {Sharygina, Natasha and Veith, Helmut},
  booktitle =           {{P}roceedings of the 25th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'13)},
  acronym =             {{CAV}'13},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8044},
  pages =               {124-140},
  year =                {2013},
  month =               jul,
  doi =                 {10.1007/978-3-642-39799-8_8},
}
[EH83] E. Allen Emerson and Joseph Y. Halpern. "Sometimes" and "Not Never" Revisited: On Branching versus Linear Time. In POPL'83, pages 127-140. ACM Press, January 1983. 
@inproceedings{popl1983-EH,
  author =              {Emerson, E. Allen and Halpern, Joseph Y.},
  title =               {{"}{S}ometimes{"} and {"}Not Never{"} Revisited:
                         On~Branching versus Linear Time},
  booktitle =           {Conference Record of the 10th {ACM} {S}ymposium on
                         {P}rinciples of {P}rogramming {L}anguages
                         ({POPL}'83)},
  acronym =             {{POPL}'83},
  publisher =           {ACM Press},
  pages =               {127-140},
  year =                {1983},
  month =               jan,
}
[EH85] E. Allen Emerson and Joseph Y. Halpern. Decision Procedures and Expressiveness in the Temporal Logic of Branching Time. Journal of Computer and System Sciences 30(1):1-24. Academic Press, February 1985. 
@article{jcss30(1)-EH,
  author =              {Emerson, E. Allen and Halpern, Joseph Y.},
  title =               {Decision Procedures and Expressiveness in the
                         Temporal Logic of Branching Time},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {30},
  number =              {1},
  pages =               {1-24},
  year =                {1985},
  month =               feb,
}
[EH86] E. Allen Emerson and Joseph Y. Halpern. "Sometimes" and "Not Never" Revisited: On Branching versus Linear Time Temporal Logic. Journal of the ACM 33(1):151-178. ACM Press, January 1986. 
@article{jacm33(1)-EH,
  author =              {Emerson, E. Allen and Halpern, Joseph Y.},
  title =               {{"}{S}ometimes{"} and {"}Not Never{"} Revisited:
                         On~Branching versus Linear Time Temporal Logic},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {33},
  number =              {1},
  pages =               {151-178},
  year =                {1986},
  month =               jan,
}
[Ehl13] Rüdiger Ehlers. Symmetric and Efficient Synthesis. PhD thesis, Saarland University, Germany, October 2013. 
@phdthesis{phd-ehlers,
  author =              {Ehlers, R{\"u}diger},
  title =               {Symmetric and Efficient Synthesis},
  year =                {2013},
  month =               oct,
  school =              {Saarland University, Germany},
}
[Ehr61] Andrzej Ehrenfeucht. An Application of Games to the Completeness Problem for Formalized Theories. Fundamenta Mathematicae 49:129-141. Institute of Mathematics, Polish Academy of Science, 1961. 
@article{fundm49-Ehr,
  author =              {Ehrenfeucht, Andrzej},
  title =               {An Application of Games to the Completeness Problem
                         for Formalized Theories},
  publisher =           {Institute of Mathematics, Polish Academy of Science},
  journal =             {Fundamenta Mathematicae},
  volume =              {49},
  pages =               {129-141},
  year =                {1961},
}
[EJ88] E. Allen Emerson and Charanjit S. Jutla. The Complexity of Tree Automata and Logics of Programs. In FOCS'88, pages 328-337. IEEE Comp. Soc. Press, October 1988. 
@inproceedings{focs1988-EJ,
  author =              {Emerson, E. Allen and Jutla, Charanjit S.},
  title =               {The Complexity of Tree Automata and Logics of
                         Programs},
  booktitle =           {{P}roceedings of the 29th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'88)},
  acronym =             {{FOCS}'88},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {328-337},
  year =                {1988},
  month =               oct,
}
[EJ91] E. Allen Emerson and Charanjit S. Jutla. Tree Automata, Mu-Calculus and Determinacy. In FOCS'91, pages 368-377. IEEE Comp. Soc. Press, October 1991. 
@inproceedings{focs1991-EJ,
  author =              {Emerson, E. Allen and Jutla, Charanjit S.},
  title =               {Tree Automata, Mu-Calculus and Determinacy},
  booktitle =           {{P}roceedings of the 32nd {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'91)},
  acronym =             {{FOCS}'91},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {368-377},
  year =                {1991},
  month =               oct,
  doi =                 {10.1109/SFCS.1991.185392},
}
[EJ99] E. Allen Emerson and Charanjit S. Jutla. The Complexity of Tree Automata and Logics of Programs. SIAM Journal on Computing 29(1):132-158. Society for Industrial and Applied Math., September 1999. 
@article{siamcomp29(1)-EJ,
  author =              {Emerson, E. Allen and Jutla, Charanjit S.},
  title =               {The Complexity of Tree Automata and Logics of
                         Programs},
  publisher =           {Society for Industrial and Applied Math.},
  journal =             {SIAM Journal on Computing},
  volume =              {29},
  number =              {1},
  pages =               {132-158},
  year =                {1999},
  month =               sep,
}
[EJS01] E. Allen Emerson, Charanjit S. Jutla, and A. Prasad Sistla. On model checking for the Mu-calculus and its fragments. Theoretical Computer Science 258(1-2):491-522. Elsevier, May 2001. 
@article{tcs258(1-2)-EJS,
  author =              {Emerson, E. Allen and Jutla, Charanjit S. and
                         Sistla, A. Prasad},
  title =               {On model checking for the Mu-calculus and its
                         fragments},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {258},
  number =              {1-2},
  pages =               {491-522},
  year =                {2001},
  month =               may,
}
[EJT10] Michael Elberfeld, Andreas Jakoby, and Till Tantau. Logspace Versions of the Theorems of Bodlaender and Courcelle. In FOCS'10, pages 143-152. IEEE Comp. Soc. Press, October 2010. 
@inproceedings{focs2010-EJT,
  author =              {Elberfeld, Michael and Jakoby, Andreas and Tantau,
                         Till},
  title =               {Logspace Versions of the Theorems of {B}odlaender
                         and {C}ourcelle},
  booktitle =           {{P}roceedings of the 51st {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'10)},
  acronym =             {{FOCS}'10},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {143-152},
  year =                {2010},
  month =               oct,
  doi =                 {10.1109/FOCS.2010.21},
}
[EK00] E. Allen Emerson and Vineet Kahlon. Reducing Model Checking of the Many to the Few. In CADE'00, Lecture Notes in Artificial Intelligence 1831, pages 236-254. Springer-Verlag, June 2000. 
@inproceedings{cade2000-EK,
  author =              {Emerson, E. Allen and Kahlon, Vineet},
  title =               {Reducing Model Checking of the Many to the~Few},
  editor =              {McAllester, David},
  booktitle =           {{P}roceedings of the 17th {I}nternational
                         {C}onference on {A}utomated {D}eduction ({CADE}'00)},
  acronym =             {{CADE}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Artificial Intelligence},
  volume =              {1831},
  pages =               {236-254},
  year =                {2000},
  month =               jun,
  doi =                 {10.1007/10721959_19},
}
[EL86] E. Allen Emerson and Chin-Laung Lei. Efficient Model Checking in Fragments of the Propositional Mu-Calculus. In LICS'86, pages 267-278. IEEE Comp. Soc. Press, June 1986. 
@inproceedings{lics1986-EL,
  author =              {Emerson, E. Allen and Lei, Chin-Laung},
  title =               {Efficient Model Checking in Fragments of the
                         Propositional Mu-Calculus},
  booktitle =           {{P}roceedings of the 1st {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'86)},
  acronym =             {{LICS}'86},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {267-278},
  year =                {1986},
  month =               jun,
}
[EL87] E. Allen Emerson and Chin-Laung Lei. Modalities for Model Checking: Branching Time Logic Strikes Back. Science of Computer Programming 8(3):275-306. Elsevier, June 1987. 
@article{scp8(3)-EL,
  author =              {Emerson, E. Allen and Lei, Chin-Laung},
  title =               {Modalities for Model Checking: Branching Time Logic
                         Strikes Back},
  publisher =           {Elsevier},
  journal =             {Science of Computer Programming},
  volume =              {8},
  number =              {3},
  pages =               {275-306},
  year =                {1987},
  month =               jun,
}
[EM79] Andrzej Ehrenfeucht and Jan Mycielski. Positional strategies for mean payoff games. International Journal of Game Theory 8(2):109-113. Springer-Verlag, June 1979. 
@article{ijgt49-EM,
  author =              {Ehrenfeucht, Andrzej and Mycielski, Jan},
  title =               {Positional strategies for mean payoff games},
  publisher =           {Springer-Verlag},
  journal =             {International Journal of Game Theory},
  volume =              {8},
  number =              {2},
  pages =               {109-113},
  year =                {1979},
  month =               jun,
  doi =                 {10.1007/BF01768705},
}
[Eme90] E. Allen Emerson. Temporal and Modal Logic. In Jan van Leeuwen (eds.), Handbook of Theoretical Computer Science. Elsevier, 1990. 
@incollection{HTCSb1990-Eme,
  author =              {Emerson, E. Allen},
  title =               {Temporal and Modal Logic},
  editor =              {van Leeuwen, Jan},
  booktitle =           {Handbook of Theoretical Computer Science},
  publisher =           {Elsevier},
  volume =              {B},
  pages =               {995-1072},
  chapter =             {16},
  year =                {1990},
}
[Eme96] E. Allen Emerson. Automated Temporal Reasoning about Reactive Systems. In Banff'94, Lecture Notes in Computer Science 1043, pages 41-101. Springer-Verlag, 1996. 
@inproceedings{banff1994-Eme,
  author =              {Emerson, E. Allen},
  title =               {Automated Temporal Reasoning about Reactive Systems},
  editor =              {Moller, Faron and Birtwistle, Graham M.},
  booktitle =           {{L}ogics for {C}oncurrency, {S}tructure versus
                         {A}utomata: {P}roceedings of the 8th {B}anff
                         {H}igher {O}rder {W}orkshop ({B}anff'94)},
  acronym =             {{B}anff'94},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1043},
  pages =               {41-101},
  year =                {1996},
  confyear =            {1994},
  confmonth =           {8-9},
}
[Eme96] E. Allen Emerson. Model Checking and the Mu-calculus. In Neil Immerman and Phokion G. Kolaitis (eds.), Descriptive Complexity and Finite Models, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 31, pages 185-214. American Mathematical Society, 1996. 
@incollection{dimacs31-Eme,
  author =              {Emerson, E. Allen},
  title =               {Model Checking and the Mu-calculus},
  editor =              {Immerman, Neil and Kolaitis, Phokion G.},
  booktitle =           {Descriptive Complexity and Finite Models},
  publisher =           {American Mathematical Society},
  series =              {DIMACS Series in Discrete Mathematics and
                         Theoretical Computer Science},
  volume =              {31},
  pages =               {185-214},
  year =                {1996},
}
[EMP10] Rüdiger Ehlers, Robert Mattmüller, and Hans-Jörg Peter. Combining Symbolic Representations for Solving Timed Games. In FORMATS'10, Lecture Notes in Computer Science 6246, pages 107-212. Springer-Verlag, September 2010. 
@inproceedings{formats2010-EMP,
  author =              {Ehlers, R{\"u}diger and Mattm{\"u}ller, Robert and
                         Peter, Hans-J{\"o}rg},
  title =               {Combining Symbolic Representations for Solving Timed
                         Games},
  editor =              {Chatterjee, Krishnendu and Henzinger, Thomas A.},
  booktitle =           {{P}roceedings of the 8th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'10)},
  acronym =             {{FORMATS}'10},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6246},
  pages =               {107-212},
  year =                {2010},
  month =               sep,
  doi =                 {10.1007/978-3-642-15297-9_10},
}
[EMS+92] E. Allen Emerson, Aloysius Ka-Lau Mok, A. Prasad Sistla, and Jayashankar Srinivasan. Quantitative Temporal Reasoning. Real-Time Systems 4:331-352. Kluwer Academic, 1992. 
@article{rts4()-EMSS,
  author =              {Emerson, E. Allen and Mok, Aloysius Ka-Lau and
                         Sistla, A. Prasad and Srinivasan, Jayashankar},
  title =               {Quantitative Temporal Reasoning},
  publisher =           {Kluwer Academic},
  journal =             {Real-Time Systems},
  volume =              {4},
  pages =               {331-352},
  year =                {1992},
}
[EN94] Javier Esparza and Mogens Nielsen. Decidability Issues for Petri Nets – A survey. EATCS Bulletin 52:244-262. EATCS, February 1994. 
@article{EN94,
  author =              {Esparza, Javier and Nielsen, Mogens},
  title =               {Decidability Issues for {P}etri Nets~-- A~survey},
  publisher =           {EATCS},
  journal =             {EATCS Bulletin},
  volume =              {52},
  pages =               {244-262},
  year =                {1994},
  month =               feb,
}
[EN03] E. Allen Emerson and Kedar Namjoshi. On Reasoning About Rings. International Journal of Foundations of Computer Science 14(4):527-550. August 2003. 
@article{ijfcs14(4)-EN,
  author =              {Emerson, E. Allen and Namjoshi, Kedar},
  title =               {On~Reasoning About Rings},
  journal =             {International Journal of Foundations of Computer
                         Science},
  volume =              {14},
  number =              {4},
  pages =               {527-550},
  year =                {2003},
  month =               aug,
  doi =                 {10.1142/S0129054103001881},
}
[END+02] Abdeslam En-Nouaary, Radhida Dssouli, and Ferhat Khendek. Timed Wp-Method: Testing Real-Time Systems. IEEE Transactions on Software Engineering 28(11):1023-1038. IEEE Comp. Soc. Press, November 2002. 
@article{tse28(11)-EDK,
  author =              {En-Nouaary, Abdeslam and Dssouli, Radhida and
                         Khendek, Ferhat},
  title =               {Timed Wp-Method: Testing Real-Time Systems},
  publisher =           {IEEE Comp. Soc. Press},
  journal =             {IEEE Transactions on Software Engineering},
  volume =              {28},
  number =              {11},
  pages =               {1023-1038},
  year =                {2002},
  month =               nov,
  doi =                 {10.1109/TSE.2002.1049402},
}
[ER09] Andrzej Ehrenfeucht and Grzegorz Rozenberg. Introducing Time in Reaction Systems. Theoretical Computer Science 410(4-5). Elsevier, February 2009. 
@article{tcs410(4-5)-ER,
  author =              {Ehrenfeucht, Andrzej and Rozenberg, Grzegorz},
  title =               {Introducing Time in Reaction Systems},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {410},
  number =              {4-5},
  year =                {2009},
  month =               feb,
  doi =                 {10.1016/j.tcs.2008.09.043},
}
[ES84] E. Allen Emerson and A. Prasad Sistla. Deciding Full Branching Time Logic. Information and Control 61(3):175-201. Academic Press, June 1984. 
@article{icont61(3)-ES,
  author =              {Emerson, E. Allen and Sistla, A. Prasad},
  title =               {Deciding Full Branching Time Logic},
  publisher =           {Academic Press},
  journal =             {Information and Control},
  volume =              {61},
  number =              {3},
  pages =               {175-201},
  year =                {1984},
  month =               jun,
}
[ES84] E. Allen Emerson and A. Prasad Sistla. Deciding Full Branching Time Logic: A Triple Exponential Decision Procedure for CTL*. In LOP'83, Lecture Notes in Computer Science 164, pages 176-192. Springer-Verlag, 1984. 
@inproceedings{lop1983-ES,
  author =              {Emerson, E. Allen and Sistla, A. Prasad},
  title =               {Deciding Full Branching Time Logic: A Triple
                         Exponential Decision Procedure for CTL{\(^*\)}},
  editor =              {Clarke, Edmund M. and Kozen, Dexter C.},
  booktitle =           {{P}roceedings of the 4th {W}orkshop on {L}ogics of
                         {P}rograms ({LOP}'83)},
  acronym =             {{LOP}'83},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {164},
  pages =               {176-192},
  year =                {1984},
  confyear =            {1983},
  confmonth =           {6},
}
[ES84] E. Allen Emerson and A. Prasad Sistla. Deciding Branching Time Logic. In STOC'84, pages 14-24. ACM Press, April 1984. 
@inproceedings{stoc1984-ES,
  author =              {Emerson, E. Allen and Sistla, A. Prasad},
  title =               {Deciding Branching Time Logic},
  booktitle =           {{P}roceedings of the 16th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'84)},
  acronym =             {{STOC}'84},
  publisher =           {ACM Press},
  pages =               {14-24},
  year =                {1984},
  month =               apr,
}
[ES88] E. Allen Emerson and Jayashankar Srinivasan. Branching Time Temporal Logic. In REX'88, Lecture Notes in Computer Science 354, pages 123-172. Springer-Verlag, May 1988. 
@inproceedings{rex1988-ES,
  author =              {Emerson, E. Allen and Srinivasan, Jayashankar},
  title =               {Branching Time Temporal Logic},
  editor =              {de~Bakker, Jaco W. and de Roever, Willem-Paul and
                         Rozenberg, Grzegorz},
  booktitle =           {{L}inear {T}ime, {B}ranching {T}ime and {P}artial
                         {O}rder in {L}ogics and {M}odels for
                         {C}oncurrency~--- {P}roceedings of {REX}
                         {S}chool{\slash}{W}orkshop~1988 ({REX}'88)},
  acronym =             {{REX}'88},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {354},
  pages =               {123-172},
  year =                {1988},
  month =               may,
}
[ES96] E. Allen Emerson and A. Prasad Sistla. Symmetry and model checking. Formal Methods in System Design 9(1-2):105-131. Kluwer Academic, August 1996. 
@article{fmsd9(1-2)-ES,
  author =              {Emerson, E. Allen and Sistla, A. Prasad},
  title =               {Symmetry and model checking},
  publisher =           {Kluwer Academic},
  journal =             {Formal Methods in System Design},
  volume =              {9},
  number =              {1-2},
  pages =               {105-131},
  year =                {1996},
  month =               aug,
  doi =                 {10.1007/BF00625970},
}
[Esp98] Javier Esparza. Decidability and Complexity of Petri Net Problems: An Introduction. In Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, Lecture Notes in Computer Science 1491, pages 374-428. Springer-Verlag, 1998. 
@inproceedings{acpn1-Esp,
  author =              {Esparza, Javier},
  title =               {Decidability and Complexity of {P}etri Net Problems:
                         An Introduction},
  editor =              {Reisig, Wolfgang and Rozenberg, Grzegorz},
  booktitle =           {Lectures on {P}etri Nets~{I}: Basic Models, Advances
                         in {P}etri Nets},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1491},
  pages =               {374-428},
  year =                {1998},
  confyear =            {1996},
  confmonth =           {9},
}
[Esp14] Javier Esparza. Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk). In STACS'14, Leibniz International Proceedings in Informatics 25, pages 1-10. Leibniz-Zentrum für Informatik, March 2014. 
@inproceedings{stacs2014-Esp,
  author =              {Esparza, Javier},
  title =               {Keeping a Crowd Safe: On the Complexity of
                         Parameterized Verification (Invited Talk)},
  editor =              {Mayr, Ernst W. and Portier, Natacha},
  booktitle =           {{P}roceedings of the 31st {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'14)},
  acronym =             {{STACS}'14},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {25},
  pages =               {1-10},
  year =                {2014},
  month =               mar,
  doi =                 {10.4230/LIPIcs.STACS.2014.1},
}
[ESY84] Shimon Even, Alan L. Selman, and Yacov Yacobi. The complexity of promise problems with applications to public-key cryptography. Information and Control 61(2):159-173. Academic Press, May 1984. 
@article{icont61(2)-ESY,
  author =              {Even, Shimon and Selman, Alan L. and Yacobi, Yacov},
  title =               {The complexity of promise problems with applications
                         to public-key cryptography},
  publisher =           {Academic Press},
  journal =             {Information and Control},
  volume =              {61},
  number =              {2},
  pages =               {159-173},
  year =                {1984},
  month =               may,
  doi =                 {10.1016/S0019-9958(84)80056-X},
}
[ET96] E. Allen Emerson and Richard J. Trefler. Generalized Quantitative Temporal Reasoning. Technical Report 96-20, Department of Computer Science, University of Texas at Austin, USA, 1996. 
@techreport{TR-96-20-ET,
  author =              {Emerson, E. Allen and Trefler, Richard J.},
  title =               {Generalized Quantitative Temporal Reasoning},
  number =              {96-20},
  year =                {1996},
  institution =         {Department of Computer Science, University of Texas
                         at Austin, USA},
  type =                {Technical Report},
}
[ET97] E. Allen Emerson and Richard J. Trefler. Generalized Quantitative Temporal Reasoning. In TAPSOFT'97, Lecture Notes in Computer Science 1214, pages 189-200. Springer-Verlag, April 1997. 
@inproceedings{tapsoft1997-ET,
  author =              {Emerson, E. Allen and Trefler, Richard J.},
  title =               {Generalized Quantitative Temporal Reasoning},
  editor =              {Bidoit, Michel and Dauchet, Max},
  booktitle =           {{P}roceedings of the 7th {I}nternational {J}oint
                         {C}onference {CAAP}{\slash}{FASE} on {T}heory and
                         {P}ractice of {S}oftware {D}evelopment
                         ({TAPSOFT}'97)},
  acronym =             {{TAPSOFT}'97},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1214},
  pages =               {189-200},
  year =                {1997},
  month =               apr,
}
[ET99] E. Allen Emerson and Richard J. Trefler. Parametric Quantitative Temporal Reasoning. In LICS'99, pages 336-343. IEEE Comp. Soc. Press, July 1999. 
@inproceedings{lics1999-ET,
  author =              {Emerson, E. Allen and Trefler, Richard J.},
  title =               {Parametric Quantitative Temporal Reasoning},
  booktitle =           {{P}roceedings of the 14th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'99)},
  acronym =             {{LICS}'99},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {336-343},
  year =                {1999},
  month =               jul,
}
[Ete99] Kousha Etessami. Stutter-Invariant Languages, ω-Automata, and Temporal Logic. In CAV'99, Lecture Notes in Computer Science 1633, pages 236-248. Springer-Verlag, July 1999. 
@inproceedings{cav1999-Ete,
  author =              {Etessami, Kousha},
  title =               {Stutter-Invariant Languages, {\(\omega\)}-Automata,
                         and Temporal Logic},
  editor =              {Halbwachs, Nicolas and Peled, Doron A.},
  booktitle =           {{P}roceedings of the 11th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'99)},
  acronym =             {{CAV}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1633},
  pages =               {236-248},
  year =                {1999},
  month =               jul,
}
[Ete00] Kousha Etessami. A Note on a Question of Peled and Wilke Regarding Stutter-Invariant LTL. Information Processing Letters 75(6):261-263. Elsevier, November 2000. 
@article{ipl75(6)-Ete,
  author =              {Etessami, Kousha},
  title =               {A Note on a Question of {P}eled and {W}ilke
                         Regarding Stutter-Invariant {LTL}},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {75},
  number =              {6},
  pages =               {261-263},
  year =                {2000},
  month =               nov,
}
[Ete02] Kousha Etessami. A Hierarchy of Polynomial-Time Computable Simulations for Automata. In CONCUR'02, Lecture Notes in Computer Science 2421, pages 131-144. Springer-Verlag, August 2002. 
@inproceedings{concur2002-Ete,
  author =              {Etessami, Kousha},
  title =               {A Hierarchy of Polynomial-Time Computable
                         Simulations for Automata},
  editor =              {Brim, Lubo{\v s} and Jan{\v c}ar, Petr and K{\v
                         r}et{\'\i}nsk{\'y}, Mojm{\'\i}r and Ku{\v c}era,
                         Anton{\'\i}n},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'02)},
  acronym =             {{CONCUR}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2421},
  pages =               {131-144},
  year =                {2002},
  month =               aug,
}
[EVW97] Kousha Etessami, Moshe Y. Vardi, and Thomas Wilke. First-Order Logic with Two Variables and Unary Temporal Logic. In LICS'97, pages 228-235. IEEE Comp. Soc. Press, June 1997. 
@inproceedings{lics1997-EVW,
  author =              {Etessami, Kousha and Vardi, Moshe Y. and Wilke,
                         Thomas},
  title =               {First-Order Logic with Two Variables and Unary
                         Temporal Logic},
  booktitle =           {{P}roceedings of the 12th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'97)},
  acronym =             {{LICS}'97},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {228-235},
  year =                {1997},
  month =               jun,
}
[EVW02] Kousha Etessami, Moshe Y. Vardi, and Thomas Wilke. First-Order Logic with Two Variables and Unary Temporal Logic. Information and Computation 179(2):279-295. Academic Press, December 2002. 
@article{icomp179(2)-EVW,
  author =              {Etessami, Kousha and Vardi, Moshe Y. and Wilke,
                         Thomas},
  title =               {First-Order Logic with Two Variables and Unary
                         Temporal Logic},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {179},
  number =              {2},
  pages =               {279-295},
  year =                {2002},
  month =               dec,
}
[EW96] Kousha Etessami and Thomas Wilke. An Until Hierarchy for Temporal Logic. In LICS'96, pages 108-117. IEEE Comp. Soc. Press, July 1996. 
@inproceedings{lics1996-EW,
  author =              {Etessami, Kousha and Wilke, Thomas},
  title =               {An Until Hierarchy for Temporal Logic},
  booktitle =           {{P}roceedings of the 11th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'96)},
  acronym =             {{LICS}'96},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {108-117},
  year =                {1996},
  month =               jul,
}
[EW00] Kousha Etessami and Thomas Wilke. An Until Hierarchy and Other Applications of an Ehrenfeucht-Fraïssé Game for Temporal Logic. Information and Computation 160(1-2):88-108. Academic Press, July 2000. 
@article{icomp160(1-2)-EW,
  author =              {Etessami, Kousha and Wilke, Thomas},
  title =               {An Until Hierarchy and Other Applications of an
                         Ehrenfeucht-Fra{\"i}ss{\'e} Game for Temporal Logic},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {160},
  number =              {1-2},
  pages =               {88-108},
  year =                {2000},
  month =               jul,
}
[EY05] Kousha Etessami and Mihalis Yannakakis. Recursive Markov Decision Processes and Recursive Stochastic Games. In ICALP'05, Lecture Notes in Computer Science 3580, pages 891-903. Springer-Verlag, July 2005. 
@inproceedings{icalp2005-EY,
  author =              {Etessami, Kousha and Yannakakis, Mihalis},
  title =               {Recursive {M}arkov Decision Processes and Recursive
                         Stochastic Games},
  editor =              {Caires, Lu{\'\i}s and Italiano, Giuseppe F. and
                         Monteiro, Lu{\'\i}s and Palamidessi, Catuscia and
                         Yung, Moti},
  booktitle =           {{P}roceedings of the 32nd {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'05)},
  acronym =             {{ICALP}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3580},
  pages =               {891-903},
  year =                {2005},
  month =               jul,
}
[EY07] Kousha Etessami and Mihalis Yannakakis. On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract). In FOCS'07, pages 113-123. IEEE Comp. Soc. Press, October 2007. 
@inproceedings{focs2007-EY,
  author =              {Etessami, Kousha and Yannakakis, Mihalis},
  title =               {On the Complexity of {N}ash Equilibria and Other
                         Fixed Points (Extended Abstract)},
  booktitle =           {{P}roceedings of the 48th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'07)},
  acronym =             {{FOCS}'07},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {113-123},
  year =                {2007},
  month =               oct,
}
F
[Far02] Berndt Farwer. ω-automata. In Erich Grädel, Wolfgang Thomas, and 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},
  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, and Mateusz Skomra. Games on graphs. Technical Report 2305.10546, arXiv, May 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,
  institution =         {arXiv},
}
[Feh99] Ansgar Fehnker. Scheduling a Steel Plant with Timed Automata. In RTCSA'99, pages 280-286. IEEE Comp. Soc. Press, December 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 and Martin Grohe. Describing Parameterized Complexity Classes. In STACS'02, Lecture Notes in Computer Science 2285, pages 359-371. Springer-Verlag, March 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 and Martin Grohe. The Complexity of First-Order and Monadic Second-Order Logic Revisited. In LICS'02, pages 215-224. IEEE Comp. Soc. Press, July 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, and 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, August 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, and Thomas Kropf. Symbolic Model Checking for Real-Time Circuits and Specifications. In TAU'95. ACM Press, November 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 and Steve Homer. A Short History of Computational Complexity. EATCS Bulletin 80:95-133. EATCS, June 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, and Levente Buttyán. Nash Equilibria of Packet Forwarding Strategies in Wireless Ad Hoc Networks. IEEE Transactions on Mobile Computing 5(5):463-476. IEEE, May 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, and Moshe Y. Vardi. Knowledge-Based Programs. In PODC'95, pages 153-163. ACM Press, August 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, and Moshe Y. Vardi. Common Knowledge Revisited. In TARK'96, pages 283-298. Morgan Kaufmann Publishers, March 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, and Jesper Nyholm Jensen. Modal Logic for Cryptographic Systems. In EXPRESS'02, Electronic Notes in Theoretical Computer Science 68(2), pages 127-144. Elsevier, August 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, October 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, December 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, September 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 and 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, July 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, and Jiří Srba. Energy Games in Multiweighted Automata. In ICTAC'11, Lecture Notes in Computer Science 6916, pages 95-115. Springer-Verlag, August 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, and Srinivas Pinisetty. Runtime enforcement of regular timed properties by suppressing and delaying events. Science of Computer Programming 123:2-41. Elsevier, July 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, and Jean-François Raskin. An Antichain Algorithm for LTL Realizability. In CAV'09, Lecture Notes in Computer Science 5643, pages 263-277. Springer-Verlag, June 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, and Joachim Gerlach. An Efficient Algorithm for Real-Time Symbolic Model Checking. In ED&TC'96, pages 15-20. IEEE Comp. Soc. Press, March 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, and Paul G. Spirakis. The structure and complexity of Nash equilibria for a selfish routing game. Theoretical Computer Science 410(36):3305-3326. Elsevier, August 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, and Yoad Lustig. Rational synthesis. In TACAS'10, Lecture Notes in Computer Science 6015, pages 190-204. Springer-Verlag, March 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, and 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, April 2016.
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.

@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, and Paul G. Spirakis. Selfish unsplittable flows. Theoretical Computer Science 348(2-3):226-239. Elsevier, December 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, and Moshe Y. Vardi. Büchi Complementation Made Tighter. International Journal of Foundations of Computer Science 17(4):851-868. August 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 and Richard E. Ladner. Propositional Dynamic Logic of Regular Programs. Journal of Computer and System Sciences 18(2):194-211. Academic Press, April 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 and Jérôme Leroux. How to Compose Presburger-Accelerations: Applications to Broadcast Protocols. Research Report, Lab. Spécification & Vérification, ENS Cachan, France, September 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 and Martin Lange. Solving Parity Games in Practice. In ATVA'09, Lecture Notes in Computer Science 5799, pages 182-196. Springer-Verlag, October 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 and 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, July 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, and Markus Latte. Satisfiability Games for Branching-Time Logics. Logical Methods in Computer Science 9(4). October 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, and Aniello Murano. Dense Real-Time Games. In LICS'02, pages 167-176. IEEE Comp. Soc. Press, July 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, and Aniello Murano. Automata-Theoretic Decision of Timed Games. In VMCAI'02, Lecture Notes in Computer Science 2294, pages 94-108. Springer-Verlag, January 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, and Jean-François Raskin. Iterated Regret Minimization in Game Graphs. In MFCS'10, Lecture Notes in Computer Science 6281, pages 342-354. Springer-Verlag, August 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, and Mariëlle Stoelinga. Model Checking Quantitative Linear Time Logic. In QAPL'08, Electronic Notes in Theoretical Computer Science 220(3), pages 61-77. Elsevier, March 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, and 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, September 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, and Claus Thrane. The Quantitative Linear-Time–Branching-Time Spectrum. In FSTTCS'11, Leibniz International Proceedings in Informatics 13. Leibniz-Zentrum für Informatik, December 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, and 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, September 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 and 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 and 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, August 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, and 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, September 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, and Wang Yi. Schedulability Analysis Using Two Clocks. In TACAS'03, Lecture Notes in Computer Science 2619, pages 224-239. Springer-Verlag, April 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, and Wang Yi. Schedulability analysis of fixed-priority systems using timed automata. Theoretical Computer Science 354(2):301-317. Elsevier, March 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, and Mark Reynolds. A Temporal Logic of Robustness. In FroCoS'07, Lecture Notes in Artificial Intelligence 4720, pages 193-205. Springer-Verlag, September 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, September 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, April 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, December 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, and Matteo Rossi. Dense-Time MTL Verification Through Sampling. Research Report 2007-37, Dipartimento di Elettronica ed Informazione, Politecnico di Milano, Italy, April 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, and 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, December 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, and Paola Spoletini. Fuzzy Time in Linear Temporal Logic. ACM Transactions on Computational Logic 15(4):30:1-30:22. ACM Press, August 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, and Kunal Talwar. The complexity of pure Nash equilibria. In STOC'04, pages 604-612. ACM Press, June 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, and Wang Yi. Timed Automata with Asynchronous Processes: Schedulability and Decidability. In TACAS'02, Lecture Notes in Computer Science 2280, pages 67-82. Springer-Verlag, April 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 and Michael O. Rabin. Super-Exponential Complexity of Presburger Arithmetic. TR TM-43, MIT Press, February 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 and 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 and 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, October 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, June 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, September 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, December 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, July 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, December 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, July 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, and Bernd-Holger Schlingloff. Hybrid Logics on Linear Structures: Expressivity and Complexity. In TIME-ICTL'03, pages 166-173. IEEE Comp. Soc. Press, July 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 and 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, March 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 and Henny Sipma. Checking Finite Traces using Alternating Automata. In RV'01, Electronic Notes in Theoretical Computer Science 55(2). Elsevier, July 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 and Philippe Schnoebelen. Well-Structured Transition Systems Everywhere!. Theoretical Computer Science 256(1-2):63-92. Elsevier, April 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 and Henny Sipma. Checking Finite Traces using Alternating Automata. Formal Methods in System Design 24(2):101-127. Kluwer Academic, March 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 and 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, July 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, and Henny Sipma. Collecting Statistics over Runtime Executions. In RV'02, Electronic Notes in Theoretical Computer Science 70(4). Elsevier, July 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 and Mikkel Thorup. String Matching in Lempel-Ziv Compressed Strings. In STOC'95, pages 703-712. ACM Press, May 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 and Ufuk Topcu. Computational methods for stochastic control with metric interval temporal logic specifications. Research Report 1503.07193, arXiv, March 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 and 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 and Thomas Wilke. Simulation Relations for Alternating Büchi Automata. Theoretical Computer Science 338(1-3):275-314. Elsevier, June 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 and Martin Zimmermann. Playing Pushdown Parity Games in a Hurry. In GandALF'12, Electronic Proceedings in Theoretical Computer Science 96, pages 183-196. September 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},
}
G
[vG90] Rob van Glabbeek. The linear-time–branching-time spectrum. In CONCUR'90, Lecture Notes in Computer Science 458, pages 278-297. Springer-Verlag, August 1990. 
@inproceedings{concur1990-vGl,
  author =              {van Glabbeek, Rob},
  title =               {The linear-time--branching-time spectrum},
  editor =              {Baeten, Jos C. M. and Klop, Jan Willem},
  booktitle =           {{P}roceedings of the 1st {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'90)},
  acronym =             {{CONCUR}'90},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {458},
  pages =               {278-297},
  year =                {1990},
  month =               aug,
}
[Gab81] Dov M. Gabbay. Expressive Functional Completeness in Tense Logic. In Aspects of Philosophical Logic, Synthese Library 147, pages 91-117. Springer-Verlag, December 1981. 
@inproceedings{apl1977-Gab,
  author =              {Gabbay, Dov M.},
  title =               {Expressive Functional Completeness in Tense Logic},
  editor =              {M{\"o}nnich, Uwe},
  booktitle =           {Aspects of Philosophical Logic},
  publisher =           {Springer-Verlag},
  series =              {Synthese Library},
  volume =              {147},
  pages =               {91-117},
  year =                {1981},
  month =               dec,
  confyear =            {1977},
}
[Gab89] Dov M. Gabbay. The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems. In TLS'87, Lecture Notes in Computer Science 398, pages 409-448. Springer-Verlag, 1989. 
@inproceedings{tls1987-Gab,
  author =              {Gabbay, Dov M.},
  title =               {The Declarative Past and Imperative Future:
                         Executable Temporal Logic for Interactive Systems},
  editor =              {Banieqbal, Behnam and Barringer, Howard and Pnueli,
                         Amir},
  booktitle =           {{P}roceedings of the 1st {C}onference on {T}emporal
                         {L}ogic in {S}pecification ({TLS}'87)},
  acronym =             {{TLS}'87},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {398},
  pages =               {409-448},
  year =                {1989},
  confyear =            {1987},
  confmonth =           {4},
}
[Gal76] Zvi Galil. Hierarchies of Complete Problems. Acta Informatica 6:77-88. Springer-Verlag, 1976. 
@article{acta6()-Gal,
  author =              {Galil, Zvi},
  title =               {Hierarchies of Complete Problems},
  publisher =           {Springer-Verlag},
  journal =             {Acta Informatica},
  volume =              {6},
  pages =               {77-88},
  year =                {1976},
}
[Gan15] Moses Ganardi. Parity Games of Bounded Tree- and Clique-Width. In FoSSaCS'15, Lecture Notes in Computer Science 9034, pages 390-404. Springer-Verlag, April 2015. 
@inproceedings{fossacs2015-Gan,
  author =              {Ganardi, Moses},
  title =               {Parity Games of Bounded Tree- and Clique-Width},
  editor =              {Pitts, Andrew},
  booktitle =           {{P}roceedings of the 18th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'15)},
  acronym =             {{FoSSaCS}'15},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9034},
  pages =               {390-404},
  year =                {2015},
  month =               apr,
  doi =                 {10.1007/978-3-662-46678-0_25},
}
[Gan23] Ritam Ganguly. Runtime verification of distributed systems. PhD thesis, Michigan State University, USA, 2023. 
@phdthesis{phd-ganguly,
  author =              {Ganguly, Ritam},
  title =               {Runtime verification of distributed systems},
  year =                {2023},
  school =              {Michigan State University, USA},
  type =                {{PhD} thesis},
}
[Gar17] Patrick Gardy. Semantics of Strategy Logic. PhD thesis, Lab. Spécification & Vérification, Univ. Paris-Saclay, France, June 2017. 
@phdthesis{phd-gardy,
  author =              {Gardy, Patrick},
  title =               {Semantics of Strategy Logic},
  year =                {2017},
  month =               jun,
  school =              {Lab.~Sp\'ecification \& V\'erification, Univ.
                         Paris-Saclay, France},
  type =                {{PhD} thesis},
}
[GBB+17] Mauricio González, Olivier Beaude, Patricia Bouyer, Samson Lasaulce, and Nicolas Markey. Stratégies d'ordonnancement de consommation d'énergie en présence d'information imparfaite de prévision. In GRETSI'17. September 2017.
Abstract

Energy consumption problems (e.g., electric vehicles charging) are very related to communication problems. The "water-filling" algorithm can be used, but it is not robust w.r.t. the noise of the "non-flexible", i.e. not-controllable, energy consumption forecasting. We propose a robust algorithm using the probabilistic model-checker PRISM, to exploit the idea of discretizing the consumption action (as for a modulation to small constellation) and the dynamic structure of the problem in a Markov-decision-process model.

@inproceedings{gretsi2017-GBBLM,
  author =              {Gonz{\'a}lez, Mauricio and Beaude, Olivier and
                         Bouyer, Patricia and Lasaulce, Samson and Markey,
                         Nicolas},
  title =               {Strat{\'e}gies d'ordonnancement de consommation
                         d'{\'e}nergie en pr{\'e}sence d'information
                         imparfaite de pr{\'e}vision},
  booktitle =           {{A}ctes du 26{\`e}me {C}olloque du {G}roupe
                         d'{\'E}tudes du {T}raitement du {S}ignal et des
                         {I}mages ({GRETSI}'17)},
  acronym =             {{GRETSI}'17},
  year =                {2017},
  month =               sep,
  abstract =            {Energy consumption problems (e.g., electric vehicles
                         charging) are very related to communication
                         problems. The "water-filling" algorithm can be used,
                         but it is not robust w.r.t. the noise of the
                         "non-flexible", i.e. not-controllable, energy
                         consumption forecasting. We~propose a robust
                         algorithm using the probabilistic model-checker
                         PRISM, to exploit the idea of discretizing the
                         consumption action (as~for a modulation to small
                         constellation) and the dynamic structure of the
                         problem in a Markov-decision-process model.},
}
[GBD02] Vijay Ganesh, Sergey Berezin, and David L. Dill. Deciding Presburger Arithmetic by Model Checking and Comparisons with Other Methods. In FMCAD'02, Lecture Notes in Computer Science 2517, pages 171-398. Springer-Verlag, November 2002. 
@inproceedings{fmcad2002-GBD,
  author =              {Ganesh, Vijay and Berezin, Sergey and Dill, David
                         L.},
  title =               {Deciding {P}resburger Arithmetic by Model Checking
                         and Comparisons with Other Methods},
  editor =              {Aagaard, Mark D. and O'Leary, John W.},
  booktitle =           {{P}roceedings of the 4th {I}nternational
                         {C}onference on {F}ormal {M}ethods in
                         {C}omputer-{A}ided {D}esign ({FMCAD}'02)},
  acronym =             {{FMCAD}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2517},
  pages =               {171-398},
  year =                {2002},
  month =               nov,
}
[GBL+19] Mauricio González, Patricia Bouyer, Samson Lasaulce, and Nicolas Markey. Optimisation en présence de contraintes en probabilités et processus markoviens contrôlés. In GRETSI'19. August 2019.
Abstract

This article focuses on the existence and synthesis of strategies in double-weighted Markov decision processes, which satisfy both a probability constraint over a weighted reachability condition, and a quantitative constraint on the expected value of a random variable defined using another reachability condition. This work generalizes a scheduling problem for energy consumption (typically the problem of charging electric vehicles). We study the set of values of a parameter (a threshold) for which the problem has a solution, and show how a partial characterization of this set can be obtained via two sequences of optimization problems. We also discuss the completeness and feasibility of the resulting approach.

@inproceedings{gretsi2019-GBLM,
  author =              {Gonz{\'a}lez, Mauricio and Bouyer, Patricia and
                         Lasaulce, Samson and Markey, Nicolas},
  title =               {Optimisation en pr\'esence de contraintes en
                         probabilit\'es et processus markoviens
                         contr\^ol\'es},
  booktitle =           {{A}ctes du 27{\`e}me {C}olloque du {G}roupe
                         d'{\'E}tudes du {T}raitement du {S}ignal et des
                         {I}mages ({GRETSI}'19)},
  acronym =             {{GRETSI}'19},
  year =                {2019},
  month =               aug,
  abstract =            {This article focuses on the existence and synthesis
                         of strategies in double-weighted Markov decision
                         processes, which satisfy both a probability
                         constraint over a weighted reachability condition,
                         and a quantitative constraint on the expected value
                         of a random variable defined using another
                         reachability condition. This work generalizes a
                         scheduling problem for energy consumption (typically
                         the problem of charging electric vehicles). We~study
                         the set of values of a parameter (a~threshold) for
                         which the problem has a solution, and show how a
                         partial characterization of this set can be obtained
                         via two sequences of optimization problems. We~also
                         discuss the completeness and feasibility of the
                         resulting approach.},
}
[GBM18] Patrick Gardy, Patricia Bouyer, and Nicolas Markey. Dependences in Strategy Logic. In STACS'18, Leibniz International Proceedings in Informatics 96, pages 34:1-34:14. Leibniz-Zentrum für Informatik, February 2018.
Abstract

Strategy Logic (SL) is a very expressive temporal logic for specifying and verifying properties of multi-agent systems: in SL, one can quantify over strategies, assign them to agents, and express LTL properties of the resulting plays. Such a powerful framework has two drawbacks: first, model checking SL has non-elementary complexity; second, the exact semantics of SL is rather intricate, and may not correspond to what is expected. In this paper, we focus on strategy dependences in SL, by tracking how existentially-quantified strategies in a formula may (or may not) depend on other strategies selected in the formula, revisiting the approach of [Mogavero et al., Reasoning about strategies: On the model-checking problem, 2014]. We explain why elementary dependences, as defined by Mogavero et al., do not exactly capture the intended concept of behavioral strategies. We address this discrepancy by introducing timeline dependences, and exhibit a large fragment of SL for which model checking can be performed in 2EXPTIME under this new semantics.

@inproceedings{stacs2018-GBM,
  author =              {Gardy, Patrick and Bouyer, Patricia and Markey,
                         Nicolas},
  title =               {Dependences in Strategy Logic},
  editor =              {Niedermeier, Rolf and Vall{\'e}e, Brigitte},
  booktitle =           {{P}roceedings of the 35th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'18)},
  acronym =             {{STACS}'18},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {96},
  pages =               {34:1-34:14},
  year =                {2018},
  month =               feb,
  doi =                 {10.4230/LIPIcs.STACS.2018.34},
  abstract =            {Strategy Logic~(\textsf{SL}) is a very expressive
                         temporal logic for specifying and verifying
                         properties of multi-agent systems: in~\textsf{SL},
                         one can quantify over strategies, assign them to
                         agents, and express \textsf{LTL} properties of the
                         resulting plays. Such a powerful framework has two
                         drawbacks: first, model checking \textsf{SL} has
                         non-elementary complexity; second, the exact
                         semantics of \textsf{SL} is rather intricate, and
                         may not correspond to what is expected. In~this
                         paper, we~focus on \emph{strategy dependences}
                         in~\textsf{SL}, by tracking how
                         existentially-quantified strategies in a formula may
                         (or~may~not) depend on other strategies selected in
                         the formula, revisiting the approach of~[Mogavero
                         \emph{et~al.}, Reasoning about strategies: On~the
                         model-checking problem,~2014]. We~explain why
                         \emph{elementary} dependences, as defined by
                         Mogavero~\emph{et~al.}, do not exactly capture the
                         intended concept of behavioral strategies.
                         We~address this discrepancy by introducing
                         \emph{timeline} dependences, and exhibit a large
                         fragment of \textsf{SL} for which model checking can
                         be performed in \textsf{2EXPTIME} under this new
                         semantics.},
}
[GBM20] Patrick Gardy, Patricia Bouyer, and Nicolas Markey. Dependences in Strategy Logic. Theory of Computing Systems 64(3):467-507. Springer-Verlag, April 2020.
Abstract

Strategy Logic (SL) is a very expressive temporal logic for specifying and verifying properties of multi-agent systems: in SL, one can quantify over strategies, assign them to agents, and express LTL properties of the resulting plays. Such a powerful framework has two drawbacks: first, model checking SL has non-elementary complexity; second, the exact semantics of SL is rather intricate, and may not correspond to what is expected. In this paper, we focus on strategy dependences in SL, by tracking how existentially-quantified strategies in a formula may (or may not) depend on other strategies selected in the formula, revisiting the approach of [Mogavero et al., Reasoning about strategies: On the model-checking problem, 2014]. We explain why elementary dependences, as defined by Mogavero et al., do not exactly capture the intended concept of behavioral strategies. We address this discrepancy by introducing timeline dependences, and exhibit a large fragment of SL for which model checking can be performed in 2EXPTIME under this new semantics.

@article{tocsys64(3)-GBM,
  author =              {Gardy, Patrick and Bouyer, Patricia and Markey,
                         Nicolas},
  title =               {Dependences in Strategy Logic},
  publisher =           {Springer-Verlag},
  journal =             {Theory of Computing Systems},
  volume =              {64},
  number =              {3},
  pages =               {467-507},
  year =                {2020},
  month =               apr,
  doi =                 {10.1007/s00224-019-09926-y},
  abstract =            {Strategy Logic~(\textsf{SL}) is a very expressive
                         temporal logic for specifying and verifying
                         properties of multi-agent systems: in~\textsf{SL},
                         one can quantify over strategies, assign them to
                         agents, and express \textsf{LTL} properties of the
                         resulting plays. Such a powerful framework has two
                         drawbacks: first, model checking \textsf{SL} has
                         non-elementary complexity; second, the exact
                         semantics of \textsf{SL} is rather intricate, and
                         may not correspond to what is expected. In~this
                         paper, we~focus on \emph{strategy dependences}
                         in~\textsf{SL}, by tracking how
                         existentially-quantified strategies in a formula may
                         (or~may~not) depend on other strategies selected in
                         the formula, revisiting the approach of~[Mogavero
                         \emph{et~al.}, Reasoning about strategies: On~the
                         model-checking problem,~2014]. We~explain why
                         \emph{elementary} dependences, as defined by
                         Mogavero~\emph{et~al.}, do not exactly capture the
                         intended concept of behavioral strategies.
                         We~address this discrepancy by introducing
                         \emph{timeline} dependences, and exhibit a large
                         fragment of \textsf{SL} for which model checking can
                         be performed in \textsf{2EXPTIME} under this new
                         semantics.},
}
[GC04] Arie Gurfinkel and Marsha Chechik. Extending extended vacuity. In FMCAD'04, Lecture Notes in Computer Science 3312, pages 306-321. Springer-Verlag, November 2004. 
@inproceedings{fmcad2004-GC,
  author =              {Gurfinkel, Arie and Chechik, Marsha},
  title =               {Extending extended vacuity},
  editor =              {Hu, Alan J. and Martin, Andrew K.},
  booktitle =           {{P}roceedings of the 5th {I}nternational
                         {C}onference on {F}ormal {M}ethods in
                         {C}omputer-{A}ided {D}esign ({FMCAD}'04)},
  acronym =             {{FMCAD}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3312},
  pages =               {306-321},
  year =                {2004},
  month =               nov,
  doi =                 {10.1007/978-3-540-30494-4_22},
}
[GC05] Arie Gurfinkel and Marsha Chechik. How Thorough Is Thorough Enough?. In CHARME'05, Lecture Notes in Computer Science 3725, pages 65-80. Springer-Verlag, October 2005. 
@inproceedings{charme2005-GC,
  author =              {Gurfinkel, Arie and Chechik, Marsha},
  title =               {How Thorough Is Thorough Enough?},
  editor =              {Borrine, Dominique and Paul, Wolfgang J.},
  booktitle =           {{P}roceedings of the 13th {C}orrect {H}ardware
                         {D}esign and {V}erification {M}ethods ({CHARME}'05)},
  acronym =             {{CHARME}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3725},
  pages =               {65-80},
  year =                {2005},
  month =               oct,
}
[GC10] Arie Gurfinkel and Marsha Chechik. Robust Vacuity for Branching Temporal Logic. Research Report cs.LO/1002.4616, arXiv, February 2010. 
@techreport{arxiv-cs.LO/1002.4616,
  author =              {Gurfinkel, Arie and Chechik, Marsha},
  title =               {Robust Vacuity for Branching Temporal Logic},
  number =              {cs.LO/1002.4616},
  year =                {2010},
  month =               feb,
  institution =         {arXiv},
  type =                {Research Report},
}
[GC12] Arie Gurfinkel and Marsha Chechik. Robust Vacuity for Branching Temporal Logic. ACM Transactions on Computational Logic 13(1). ACM Press, January 2012. 
@article{tocl13(1)-GC,
  author =              {Gurfinkel, Arie and Chechik, Marsha},
  title =               {Robust Vacuity for Branching Temporal Logic},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Computational Logic},
  volume =              {13},
  number =              {1},
  year =                {2012},
  month =               jan,
  doi =                 {10.1145/2071368.2071369},
}
[GCO01] Thorsten Gerdsmeier and Rachel Cardell-Oliver. Analysis of Scheduling Behaviour using Generic Timed Automata. In CATS'01, Electronic Notes in Theoretical Computer Science 42. Elsevier, January 2001. 
@inproceedings{cats2001-GC,
  author =              {Gerdsmeier, Thorsten and Cardell-Oliver, Rachel},
  title =               {Analysis of Scheduling Behaviour using Generic Timed
                         Automata},
  editor =              {Fidge, Colin},
  booktitle =           {Computing: The Australasian Theory Symposium
                         ({CATS}'01)},
  acronym =             {{CATS}'01},
  publisher =           {Elsevier},
  series =              {Electronic Notes in Theoretical Computer Science},
  volume =              {42},
  year =                {2001},
  month =               jan,
}
[GvD06] Valentin Goranko and Govert van Drimmelen. Complete Axiomatization and decidability of Alternating-time Temporal Logic. Theoretical Computer Science 353(1-3):93-117. Elsevier, March 2006. 
@article{tcs353(1-3)-GvD,
  author =              {Goranko, Valentin and van Drimmelen, Govert},
  title =               {Complete Axiomatization and decidability of
                         Alternating-time Temporal Logic},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {353},
  number =              {1-3},
  pages =               {93-117},
  year =                {2006},
  month =               mar,
}
[GD12] Dimitar P. Guelev and Cătălin Dima. Epistemic ATL with Perfect Recall, Past and Strategy Contexts. In CLIMA'12, Lecture Notes in Artificial Intelligence 7486, pages 77-93. Springer-Verlag, August 2012. 
@inproceedings{clima2012-GD,
  author =              {Guelev, Dimitar P. and Dima, C{\u a}t{\u a}lin},
  title =               {Epistemic {ATL} with Perfect Recall, Past and
                         Strategy Contexts},
  editor =              {Fisher, Michael and van der Torre, Leendert W. N.
                         and Dastani, Mehdi and Governatori, Guido},
  booktitle =           {{P}roceedings of the 13th {I}nternational {W}orkshop
                         on {C}omputational {L}ogic in {M}ulti-{A}gent
                         {S}ystems ({CLIMA}'12)},
  acronym =             {{CLIMA}'12},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Artificial Intelligence},
  volume =              {7486},
  pages =               {77-93},
  year =                {2012},
  month =               aug,
  doi =                 {10.1007/978-3-642-32897-8_7},
}
[Gei01] Marc C.W. Geilen. On the Construction of Monitors for Temporal Logic Properties. In RV'01, Electronic Notes in Theoretical Computer Science 55(2). Elsevier, July 2001. 
@inproceedings{rv2001-Gei,
  author =              {Geilen, Marc C.W.},
  title =               {On the Construction of Monitors for Temporal Logic
                         Properties},
  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,
}
[Gel13] Marcus Gelderie. Strategy Composition in Compositional Games. In ICALP'13, Lecture Notes in Computer Science 7966, pages 263-274. Springer-Verlag, July 2013. 
@inproceedings{icalp2013-Gel,
  author =              {Gelderie, Marcus},
  title =               {Strategy Composition in Compositional Games},
  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 =               {263-274},
  year =                {2013},
  month =               jul,
  doi =                 {10.1007/978-3-642-39212-2_25},
}
[Gel14] Marcus Gelderie. Strategy Machines – Representation and Complexity of Strategies in Infinite Games. PhD thesis, RWTH Aachen, Germany, February 2014. 
@phdthesis{phd-gelderie,
  author =              {Gelderie, Marcus},
  title =               {Strategy Machines~-- Representation and Complexity
                         of Strategies in Infinite Games},
  year =                {2014},
  month =               feb,
  school =              {RWTH Aachen, Germany},
  type =                {{PhD} thesis},
}
[GGR99] Leszek Gąsieniec, Alan Gibbons, and Wojciech Rytter. Efficiency of Fast Parallel Pattern-Searching in Highly Compressed Texts. In MFCS'99, Lecture Notes in Computer Science 1672, pages 48-58. Springer-Verlag, September 1999. 
@inproceedings{mfcs1999-GGR,
  author =              {G{\k a}sieniec, Leszek and Gibbons, Alan and Rytter,
                         Wojciech},
  title =               {Efficiency of Fast Parallel Pattern-Searching in
                         Highly Compressed Texts},
  editor =              {Kutylowski, Miroslaw and Pacholski, Leszek and
                         Wierzbicki, Tomasz},
  booktitle =           {{P}roceedings of the 24th {I}nternational
                         {S}ymposium on {M}athematical {F}oundations of
                         {C}omputer {S}cience ({MFCS}'99)},
  acronym =             {{MFCS}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1672},
  pages =               {48-58},
  year =                {1999},
  month =               sep,
}
[GGS03] Georg Gottlob, Gianluigi Greco, and Francesco Scarcello. Pure Nash Equilibria: Hard and Easy Games. In TARK'03, pages 215-230. ACM Press, June 2003. 
@inproceedings{tark2003-GGS,
  author =              {Gottlob, Georg and Greco, Gianluigi and Scarcello,
                         Francesco},
  title =               {Pure {N}ash Equilibria: Hard and Easy Games},
  editor =              {Halpern, Joseph Y. and Tennenholtz, Moshe},
  booktitle =           {{P}roceedings of the 9th {C}onference on
                         {T}heoretical {A}spects of {R}ationality and
                         {K}nowledge ({TARK}'03)},
  acronym =             {{TARK}'03},
  publisher =           {ACM Press},
  pages =               {215-230},
  year =                {2003},
  month =               jun,
}
[GH82] Yuri Gurevich and Leo Harrington. Trees, automata and games. In STOC'82, pages 60-65. ACM Press, May 1982. 
@inproceedings{stoc1982-GH,
  author =              {Gurevich, Yuri and Harrington, Leo},
  title =               {Trees, automata and games},
  booktitle =           {{P}roceedings of the 14th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'82)},
  acronym =             {{STOC}'82},
  publisher =           {ACM Press},
  pages =               {60-65},
  year =                {1982},
  month =               may,
}
[GH98] Raymond Greenlaw and H. James Hoover. Parallel Computation: Models and Complexity Issues. In Mikhail J. Atallah (eds.), Handbook of Algorithms and Theory of Computation. CRC Press, November 1998. 
@incollection{HATC1998-GH,
  author =              {Greenlaw, Raymond and Hoover, H. James},
  title =               {Parallel Computation: Models and Complexity Issues},
  editor =              {Atallah, Mikhail J.},
  booktitle =           {Handbook of Algorithms and Theory of Computation},
  publisher =           {CRC Press},
  chapter =             {48},
  year =                {1998},
  month =               nov,
}
[GH10] Hugo Gimbert and Florian Horn. Solving simple stochastic tail games. In SODA'10, pages 847-862. Society for Industrial and Applied Math., January 2010. 
@inproceedings{soda2010-GH,
  author =              {Gimbert, Hugo and Horn, Florian},
  title =               {Solving simple stochastic tail games},
  booktitle =           {{P}roceedings of the 21st {A}nnual {ACM}-{SIAM}
                         {S}ymposium on {D}iscrete {A}lgorithms ({SODA}'10)},
  acronym =             {{SODA}'10},
  publisher =           {Society for Industrial and Applied Math.},
  pages =               {847-862},
  year =                {2010},
  month =               jan,
  doi =                 {10.1137/1.9781611973075.69},
}
[GHJ97] Vineet Gupta, Thomas A. Henzinger, and Radha Jagadeesan. Robust Timed Automata. In HART'97, Lecture Notes in Computer Science 1201, pages 331-345. Springer-Verlag, March 1997. 
@inproceedings{hart1997-GHJ,
  author =              {Gupta, Vineet and Henzinger, Thomas A. and
                         Jagadeesan, Radha},
  title =               {Robust Timed Automata},
  editor =              {Maler, Oded},
  booktitle =           {{P}roceedings of the 1997 {I}nternational {W}orkshop
                         on {H}ybrid and {R}eal-Time {S}ystems ({HART}'97)},
  acronym =             {{HART}'97},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1201},
  pages =               {331-345},
  year =                {1997},
  month =               mar,
}
[GHK+08] Elisabeth Gassner, Johannes Hatzl, Sven O. Krumke, Heike Sperber, and Gerhard J. Woeginger. How hard is it to find extreme Nash equilibria in network congestion games?. In WINE'08, Lecture Notes in Computer Science 5385, pages 82-93. Springer-Verlag, December 2008. 
@inproceedings{wine2008-GHKSW,
  author =              {Gassner, Elisabeth and Hatzl, Johannes and Krumke,
                         Sven O. and Sperber, Heike and Woeginger, Gerhard
                         J.},
  title =               {How hard is it to find extreme {N}ash equilibria in
                         network congestion games?},
  editor =              {Papadimitriou, {\relax Ch}ristos H. and Zhang,
                         Shuzhong},
  booktitle =           {{P}roceedings of the 4th {I}nternational {W}orkshop
                         on {I}nternet and {N}etwork {E}conomics ({WINE}'08)},
  acronym =             {{WINE}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5385},
  pages =               {82-93},
  year =                {2008},
  month =               dec,
  doi =                 {10.1007/978-3-540-92185-1_17},
}
[GHO+10] Stefan Göller, Christoph Haase, Joël Ouaknine, and James Worrell. Model Checking Succinct and Parametric One-Counter Automata. In ICALP'10, Lecture Notes in Computer Science 6199, pages 575-586. Springer-Verlag, July 2010. 
@inproceedings{icalp2010-GHOW,
  author =              {G{\"o}ller, Stefan and Haase, Christoph and
                         Ouaknine, Jo{\"e}l and Worrell, James},
  title =               {Model Checking Succinct and Parametric One-Counter
                         Automata},
  editor =              {Abramsky, Samson and Gavoille, Cyril and Kirchner,
                         Claude and Meyer auf der Heide, Friedhelm and
                         Spirakis, Paul G.},
  booktitle =           {{P}roceedings of the 37th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'10)~-- Part~{II}},
  acronym =             {{ICALP}'10},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6199},
  pages =               {575-586},
  year =                {2010},
  month =               jul,
  doi =                 {10.1007/978-3-642-14162-1_48},
}
[GHP+17] Julian Gutierrez, Paul Harrenstein, Giuseppe Perelli, and Michael Wooldridge. Nash Equilibrium and Bisimulation Invariance. In CONCUR'17, Leibniz International Proceedings in Informatics 85, pages 17:1-17:16. Leibniz-Zentrum für Informatik, September 2017. 
@inproceedings{concur2017-GHPW,
  author =              {Gutierrez, Julian and Harrenstein, Paul and Perelli,
                         Giuseppe and Wooldridge, Michael},
  title =               {{N}ash Equilibrium and Bisimulation Invariance},
  editor =              {Meyer, Roland and Nestmann, Uwe},
  booktitle =           {{P}roceedings of the 28th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'17)},
  acronym =             {{CONCUR}'17},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {85},
  pages =               {17:1-17:16},
  year =                {2017},
  month =               sep,
  doi =                 {10.4230/LIPIcs.CONCUR.2017.17},
}
[GHR94] Raymond Greenlaw, H. James Hoover, and Walter L. Ruzzo. Combinatorial Optimization. . Oxford University Press, 1994. 
@incollection{GHR-appA4,
  author =              {Greenlaw, Raymond and Hoover, H. James and Ruzzo,
                         Walter L.},
  title =               {Combinatorial Optimization},
  publisher =           {Oxford University Press},
  chapter =             {A.4},
  year =                {1994},
}
[GHR95] Raymond Greenlaw, H. James Hoover, and Walter L. Ruzzo. Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, 1995. 
@book{GHR95,
  author =              {Greenlaw, Raymond and Hoover, H. James and Ruzzo,
                         Walter L.},
  title =               {Limits to Parallel Computation: {P}-Completeness
                         Theory},
  publisher =           {Oxford University Press},
  year =                {1995},
}
[Gim06] Hugo Gimbert. Jeux positionnels. Thèse de doctorat, Lab. Informatique Algorithmique: Fondements et Applications, Université Paris 7, France, December 2006. 
@phdthesis{phd-gimbert,
  author =              {Gimbert, Hugo},
  title =               {Jeux positionnels},
  year =                {2006},
  month =               dec,
  school =              {Lab.~Informatique Algorithmique: Fondements et
                         Applications, Universit{\'e} Paris~7, France},
  type =                {Th\`ese de doctorat},
}
[Gin58] Seymour Ginsburg. On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine. Journal of the ACM 5(3):266-280. ACM Press, July 1958. 
@article{jacm5(3)-Gin,
  author =              {Ginsburg, Seymour},
  title =               {On~the Length of the Smallest Uniform Experiment
                         which Distinguishes the Terminal States of a
                         Machine},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {5},
  number =              {3},
  pages =               {266-280},
  year =                {1958},
  month =               jul,
  doi =                 {10.1145/320932.320938},
}
[Gir12] Antoine Girard. Low-complexity switching controllers for safety using symbolic models. In ADHS'12. International Federation of Automatic Control, June 2012. 
@inproceedings{adhs2012-Gir,
  author =              {Girard, Antoine},
  title =               {Low-complexity switching controllers for safety
                         using symbolic models},
  editor =              {Giua, Alessandro and Silva, Manuel and Heemels,
                         Maurice and De{~}Schutter, Bart},
  booktitle =           {Proceedings of the 4th {IFAC} conference on
                         {A}nalysis and {D}esign of {H}ybrid {S}ystems
                         ({ADHS}'12)},
  acronym =             {{ADHS}'12},
  publisher =           {International Federation of Automatic Control},
  year =                {2012},
  month =               jun,
}
[GJ79] Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., 1979. 
@book{GJ79,
  author =              {Garey, Michael R. and Johnson, David S.},
  title =               {Computers and Intractability: A Guide to the Theory
                         of {NP}-Completeness},
  publisher =           {W.~H. Freeman~\&~Co.},
  year =                {1979},
}
[GJ04] Valentin Goranko and Wojciech Jamroga. Comparing Semantics of Logics for Multi-agent Systems. Synthese 139(2):241-280. Springer-Verlag, March 2004. 
@article{synthese139(2)-GJ,
  author =              {Goranko, Valentin and Jamroga, Wojciech},
  title =               {Comparing Semantics of Logics for Multi-agent
                         Systems},
  publisher =           {Springer-Verlag},
  journal =             {Synthese},
  volume =              {139},
  number =              {2},
  pages =               {241-280},
  year =                {2004},
  month =               mar,
}
[GK72] Yuri Gurevich and Igor O. Koryakov. Remarks on Berger's paper on the domino problem. Siberian Mathematical Journal 13(2):459-463. Springer-Verlag, March 1972. 
@article{smj13(2)-GK,
  author =              {Gurevich, Yuri and Koryakov, Igor O.},
  title =               {Remarks on {B}erger's paper on the domino problem},
  publisher =           {Springer-Verlag},
  journal =             {Siberian Mathematical Journal},
  volume =              {13},
  number =              {2},
  pages =               {459-463},
  year =                {1972},
  month =               mar,
}
[GK02] Georg Gottlob and Christoph Koch. Monadic Queries over Tree-Structured Data. In LICS'02, pages 189-202. IEEE Comp. Soc. Press, July 2002. 
@inproceedings{lics2002-GK,
  author =              {Gottlob, Georg and Koch, Christoph},
  title =               {Monadic Queries over Tree-Structured Data},
  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 =               {189-202},
  year =                {2002},
  month =               jul,
}
[GKP+96] Leszek Gąsieniec, Marek Karpinski, Wojciech Plandowski, and Wojciech Rytter. Efficient Algorithms for Lempel-Ziv Encoding (Extended Abstract). In SWAT'96, Lecture Notes in Computer Science 1097, pages 392-403. Springer-Verlag, July 1996. 
@inproceedings{swat1996-GKPR,
  author =              {G{\k a}sieniec, Leszek and Karpinski, Marek and
                         Plandowski, Wojciech and Rytter, Wojciech},
  title =               {Efficient Algorithms for {L}empel-{Z}iv Encoding
                         (Extended Abstract)},
  editor =              {Karlsson, Rolf G. and Lingas, Andrzej},
  booktitle =           {{P}roceedings of the 5th {S}candinavian {W}orkshop
                         on {A}lgorithm {T}heory ({SWAT}'96)},
  acronym =             {{SWAT}'96},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1097},
  pages =               {392-403},
  year =                {1996},
  month =               jul,
}
[GKS+03] Sankar Gurumurthy, Orna Kupferman, Fabio Somenzi, and Moshe Y. Vardi. On Complementing Nondeterministic Büchi Automata. In CHARME'03, Lecture Notes in Computer Science 2860. Springer-Verlag, October 2003. 
@inproceedings{charme2003-GKSV,
  author =              {Gurumurthy, Sankar and Kupferman, Orna and Somenzi,
                         Fabio and Vardi, Moshe Y.},
  title =               {On Complementing Nondeterministic B{\"u}chi
                         Automata},
  editor =              {Geist, Daniel and Tronci, Enrico},
  booktitle =           {{P}roceedings of the 12th {C}orrect {H}ardware
                         {D}esign and {V}erification {M}ethods ({CHARME}'03)},
  acronym =             {{CHARME}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2860},
  year =                {2003},
  month =               oct,
}
[GL02] Dimitra Giannakopoulou and Flavio Lerda. From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata. In FORTE'02, Lecture Notes in Computer Science 2529, pages 308-326. Springer-Verlag, November 2002. 
@inproceedings{forte2002-GL,
  author =              {Giannakopoulou, Dimitra and Lerda, Flavio},
  title =               {From States to Transitions: Improving Translation of
                         {LTL} Formulae to {B}{\"u}chi Automata},
  editor =              {Peled, Doron A. and Vardi, Moshe Y.},
  booktitle =           {{P}roceedings of the 22th {IFIP} {WG}6.1
                         {I}nternational {C}onference on {F}ormal
                         {T}echniques for {N}etworked and {D}istributed
                         {S}ystems ({FORTE}'02)},
  acronym =             {{FORTE}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2529},
  pages =               {308-326},
  year =                {2002},
  month =               nov,
}
[GL09] Sahika Genc and Stéphane Lafortune. Predictability of event occurrences in partially-observed discrete-event systems. Automatica 45(2):301-311. Elsevier, February 2009. 
@article{Automatica45(2)-GL,
  author =              {Genc, Sahika and Lafortune, St{\'e}phane},
  title =               {Predictability of event occurrences in
                         partially-observed discrete-event systems},
  publisher =           {Elsevier},
  journal =             {Automatica},
  volume =              {45},
  number =              {2},
  pages =               {301-311},
  year =                {2009},
  month =               feb,
  doi =                 {10.1016/j.automatica.2008.06.022},
}
[GL10] Stefan Göller and Markus Lohrey. Branching-time model checking of one-counter processes. In STACS'10, Leibniz International Proceedings in Informatics 20, pages 405-416. Leibniz-Zentrum für Informatik, February 2010. 
@inproceedings{stacs2010-GL,
  author =              {G{\"o}ller, Stefan and Lohrey, Markus},
  title =               {Branching-time model checking of one-counter
                         processes},
  editor =              {Marion, Jean-Yves and Schwentick, Thomas},
  booktitle =           {{P}roceedings of the 27th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'10)},
  acronym =             {{STACS}'10},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {20},
  pages =               {405-416},
  year =                {2010},
  month =               feb,
}
[GL13] Stefan Göller and Markus Lohrey. Branching-time model checking of one-counter processes and timed automata. SIAM Journal on Computing 42(3):884-923. Society for Industrial and Applied Math., 2013. 
@article{siamcomp42(3)-GL,
  author =              {G{\"o}ller, Stefan and Lohrey, Markus},
  title =               {Branching-time model checking of one-counter
                         processes and timed automata},
  publisher =           {Society for Industrial and Applied Math.},
  journal =             {SIAM Journal on Computing},
  volume =              {42},
  number =              {3},
  pages =               {884-923},
  year =                {2013},
  doi =                 {10.1137/120876435},
}
[GLM+05] Guillaume Gardey, Didier Lime, Morgan Magnin, and Olivier H. Roux. Romeo: A Tool for Analyzing Time Petri Nets. In CAV'05, Lecture Notes in Computer Science 3576, pages 418-423. Springer-Verlag, July 2005. 
@inproceedings{cav2005-GLMR,
  author =              {Gardey, Guillaume and Lime, Didier and Magnin,
                         Morgan and Roux, Olivier H.},
  title =               {Romeo: A~Tool for Analyzing Time {P}etri Nets},
  editor =              {Etessami, Kousha and Rajamani, Sriram},
  booktitle =           {{P}roceedings of the 17th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'05)},
  acronym =             {{CAV}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3576},
  pages =               {418-423},
  year =                {2005},
  month =               jul,
  doi =                 {10.1007/11513988_41},
}
[GLS95] Jens Christian Godskesen, Kim Guldstrand Larsen, and Arne Skou. Automatic verification of real-tim systems using epsilon. In PSTV'94, IFIP Conference Proceedings 1, pages 323-330. Chapman & Hall, 1995. 
@inproceedings{PSTV1994-GLS94,
  author =              {Godskesen, Jens Christian and Larsen, Kim Guldstrand
                         and Skou, Arne},
  title =               {Automatic verification of real-tim systems using
                         epsilon},
  editor =              {Vuong, Son T. and Chanson, Samuel T.},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {S}ymposium on {P}rotocol {S}pecification, {T}esting
                         and {V}erification ({PSTV}'94)},
  acronym =             {{PSTV}'94},
  publisher =           {Chapman \& Hall},
  series =              {IFIP Conference Proceedings},
  volume =              {1},
  pages =               {323-330},
  year =                {1995},
  confyear =            {1994},
}
[GM22] Thomas Guyet and Nicolas Markey. Logical forms of chronicles. In TIME'22, Leibniz International Proceedings in Informatics, pages 7:1-7:15. Leibniz-Zentrum für Informatik, November 2022.
Abstract

A chronicle is a temporal model introduced by Dousson et al. for situation recognition. In short, a chronicle consists of a set of events and a set of real-valued temporal constraints on the delays between pairs of events. This work investigates the relationship between chronicles and classical temporal model formalisms, namely TPTL and MTL. More specifically, we answer the following question: is it possible to find an equivalent formula in such formalisms for any chronicle? This question arises from the observation that a single chronicle captures complex temporal behaviours that do not order the events in time.

In this article, we introduce the subclass of linear chronicles, which defines a temporal order of occurrence of the event to be recognized in a temporal sequence. Our first result is that any chronicle can be expressed as a disjunction of linear chronicles. Our second result is that any linear chronicle has an equivalent TPTL formula. Using existing expressiveness results between TPTL and MTL, we show that some chronicles have no equivalent in MTL. This confirms that the model of chronicle has interesting properties for situation recognition.

@inproceedings{time2022-GM,
  author =              {Guyet, {\relax Th}omas and Markey, Nicolas},
  title =               {Logical forms of chronicles},
  editor =              {Artikis, Alexander and Posenato, Roberto and
                         Tonetta, Stefano},
  booktitle =           {{P}roceedings of the 29th {I}nternational
                         {S}ymposium on {T}emporal {R}epresentation and
                         {R}easoning ({TIME}'22)},
  acronym =             {{TIME}'22},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  pages =               {7:1-7:15},
  year =                {2022},
  month =               nov,
  doi =                 {10.4230/LIPIcs.TIME.2022.7},
  abstract =            {A~chronicle is a temporal model introduced by
                         Dousson~\textit{et~al.} for situation recognition.
                         In~short, a chronicle consists of a set of events
                         and a set of real-valued temporal constraints on the
                         delays between pairs of events. This~work
                         investigates the relationship between chronicles and
                         classical temporal model formalisms, namely
                         \textsf{TPTL} and~\textsf{MTL}. More~specifically,
                         we~answer the following question: is~it possible to
                         find an equivalent formula in such formalisms for
                         any chronicle? This~question arises from the
                         observation that a single chronicle captures complex
                         temporal behaviours that do not order the events in
                         time.\par In~this article, we~introduce the subclass
                         of linear chronicles, which defines a temporal order
                         of occurrence of the event to be recognized in a
                         temporal sequence. Our~first result is that any
                         chronicle can be expressed as a disjunction of
                         linear chronicles. Our~second result is that any
                         linear chronicle has an equivalent \textsf{TPTL}
                         formula. Using existing expressiveness results
                         between \textsf{TPTL} and~\textsf{MTL}, we~show that
                         some chronicles have no equivalent in~\textsf{MTL}.
                         This confirms that the model of chronicle has
                         interesting properties for situation recognition.},
}
[GMP03] Villiam Geffert, Carlo Mereghetti, and Giovanni Pighizzini. Converting Two-way Nondeterministic Unary Automata into Simpler Automata. Theoretical Computer Science 295(1-3):189-203. Elsevier, February 2003. 
@article{tcs295(1-3)-GMP,
  author =              {Geffert, Villiam and Mereghetti, Carlo and
                         Pighizzini, Giovanni},
  title =               {Converting Two-way Nondeterministic Unary Automata
                         into Simpler Automata},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {295},
  number =              {1-3},
  pages =               {189-203},
  year =                {2003},
  month =               feb,
}
[GMP07] Villiam Geffert, Carlo Mereghetti, and Giovanni Pighizzini. Complementing Two-way Finite Automata. Information and Computation 205(8):1173-1187. Elsevier, August 2007. 
@article{icomp205(8)-GMP,
  author =              {Geffert, Villiam and Mereghetti, Carlo and
                         Pighizzini, Giovanni},
  title =               {Complementing Two-way Finite Automata},
  publisher =           {Elsevier},
  journal =             {Information and Computation},
  volume =              {205},
  number =              {8},
  pages =               {1173-1187},
  year =                {2007},
  month =               aug,
}
[GMS22] Aline Goeminne, Nicolas Markey, and Ocan Sankur. Non-Blind Strategies in Timed Network Congestion Games. In FORMATS'22, Lecture Notes in Computer Science 13465, pages 183-199. Springer-Verlag, September 2022.
Abstract

Network congestion games are a convenient model for reasoning about routing problems in a network: agents have to move from a source to a target vertex while avoiding congestion, measured as a cost depending on the number of players using the same link. Network congestion games have been extensively studied over the last 40 years, while their extension with timing constraints were considered more recently.

Most of the results on network congestion games consider blind strategies: they are static, and do not adapt to the strategies selected by the other players. We extend the recent results of [Bertrand et al., Dynamic network congestion games. FSTTCS'20] to timed network congestion games, in which the availability of the edges depend on (discrete) time. We prove that computing Nash equilibria satisfying some constraint on the total cost (and in particular, computing the best and worst Nash equilibria), and computing the social optimum, can be achieved in exponential space. The social optimum can be computed in polynomial space if all players have the same source and target.

@inproceedings{formats2022-GMS,
  author =              {Goeminne, Aline and Markey, Nicolas and Sankur,
                         Ocan},
  title =               {Non-Blind Strategies in Timed Network Congestion
                         Games},
  editor =              {Bogomolov, Sergiy and Parker, David},
  booktitle =           {{P}roceedings of the 20th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'22)},
  acronym =             {{FORMATS}'22},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {13465},
  pages =               {183-199},
  year =                {2022},
  month =               sep,
  doi =                 {10.1007/978-3-031-15839-1_11},
  abstract =            {Network congestion games are a convenient model for
                         reasoning about routing problems in a network:
                         agents have to move from a source to a target vertex
                         while avoiding congestion, measured as a cost
                         depending on the number of players using the same
                         link. Network congestion games have been extensively
                         studied over the last 40 years, while their
                         extension with timing constraints were considered
                         more recently. \par Most of the results on network
                         congestion games consider blind strategies: they are
                         static, and do not adapt to the strategies selected
                         by the other players. We extend the recent results
                         of [Bertrand~\textit{et~al.}, Dynamic network
                         congestion games. FSTTCS'20] to timed network
                         congestion games, in which the availability of the
                         edges depend on (discrete) time. We prove that
                         computing Nash equilibria satisfying some constraint
                         on the total cost (and in particular, computing the
                         best and worst Nash equilibria), and computing the
                         social optimum, can be achieved in exponential
                         space. The social optimum can be computed in
                         polynomial space if all players have the same source
                         and target.},
}
[GO01] Paul Gastin and Denis Oddoux. Fast LTL to Büchi Automata Translation. In CAV'01, Lecture Notes in Computer Science 2102, pages 53-65. Springer-Verlag, July 2001. 
@inproceedings{cav2001-GO,
  author =              {Gastin, Paul and Oddoux, Denis},
  title =               {Fast {LTL} to {B}{\"u}chi Automata Translation},
  editor =              {Berry, G{\'e}rard and Comon, Hubert and Finkel,
                         Alain},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'01)},
  acronym =             {{CAV}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2102},
  pages =               {53-65},
  year =                {2001},
  month =               jul,
}
[GO03] Paul Gastin and Denis Oddoux. LTL with Past and Two-way Very-weak Alternating Automata. In MFCS'03, Lecture Notes in Computer Science 2747, pages 439-448. Springer-Verlag, August 2003. 
@inproceedings{mfcs2003-GO,
  author =              {Gastin, Paul and Oddoux, Denis},
  title =               {{LTL} with Past and Two-way Very-weak Alternating
                         Automata},
  editor =              {Rovan, Branislav and Vojt{\'a}s, Peter},
  booktitle =           {{P}roceedings of the 28th {I}nternational
                         {S}ymposium on {M}athematical {F}oundations of
                         {C}omputer {S}cience ({MFCS}'03)},
  acronym =             {{MFCS}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2747},
  pages =               {439-448},
  year =                {2003},
  month =               aug,
}
[Gol80] Leslie M. Goldschlager. A Space Efficient Algorithm for the Monotone Planar Circuit Value Problem. Information Processing Letters 10(1):25-27. Elsevier, February 1980. 
@article{ipl10(1)-Gol,
  author =              {Goldschlager, Leslie M.},
  title =               {A Space Efficient Algorithm for the Monotone Planar
                         Circuit Value Problem},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {10},
  number =              {1},
  pages =               {25-27},
  year =                {1980},
  month =               feb,
}
[Gol05] Oded Goldreich. On promise problems. Research Report 05-014, Electronic Colloquium on Computational Complexity, August 2005. 
@techreport{eccc2005-Gol,
  author =              {Goldreich, Oded},
  title =               {On promise problems},
  number =              {05-014},
  year =                {2005},
  month =               aug,
  institution =         {Electronic Colloquium on Computational Complexity},
  type =                {Research Report},
}
[Gor96] Valentin Goranko. Hierarchies of Modal and Temporal Logics with Reference Pointers. Journal of Logic, Language and Information 5(1):1-24. Kluwer Academic, April 1996. 
@article{jolli5(1)-Gor,
  author =              {Goranko, Valentin},
  title =               {Hierarchies of Modal and Temporal Logics with
                         Reference Pointers},
  publisher =           {Kluwer Academic},
  journal =             {Journal of Logic, Language and Information},
  volume =              {5},
  number =              {1},
  pages =               {1-24},
  year =                {1996},
  month =               apr,
}
[Gor00] Valentin Goranko. Temporal Logics of Computations. In ESSLLI'00. August 2000. 
@inproceedings{esslli2000-Gor,
  author =              {Goranko, Valentin},
  title =               {Temporal Logics of Computations},
  booktitle =           {{P}roceedings of the 12th {E}uropean {S}ummer
                         {S}chool in {L}ogic, {L}anguage and {I}nformation
                         ({ESSLLI}'00)},
  acronym =             {{ESSLLI}'00},
  year =                {2000},
  month =               aug,
}
[Gor01] Valentin Goranko. Coalition Games and Alternating Temporal Logics. In TARK'01, pages 259-272. Morgan Kaufmann Publishers, July 2001. 
@inproceedings{tark2001-Gor,
  author =              {Goranko, Valentin},
  title =               {Coalition Games and Alternating Temporal Logics},
  editor =              {van Benthem, Johan},
  booktitle =           {{P}roceedings of the 8th {C}onference on
                         {T}heoretical {A}spects of {R}ationality and
                         {K}nowledge ({TARK}'01)},
  acronym =             {{TARK}'01},
  publisher =           {Morgan Kaufmann Publishers},
  pages =               {259-272},
  year =                {2001},
  month =               jul,
}
[Got95] Georg Gottlob. NP Trees and Carnap's Modal Logic. Journal of the ACM 42(2):421-457. ACM Press, March 1995. 
@article{jacm42(2)-Got,
  author =              {Gottlob, Georg},
  title =               {{NP} Trees and {C}arnap's Modal Logic},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {42},
  number =              {2},
  pages =               {421-457},
  year =                {1995},
  month =               mar,
}
[GP01] Leszek Gąsieniec and Igor Potapov. Time/Space Efficient Compressed Pattern Matching. In FCT'01, Lecture Notes in Computer Science 2138, pages 138-149. Springer-Verlag, August 2001. 
@inproceedings{fct2001-GP,
  author =              {G{\k a}sieniec, Leszek and Potapov, Igor},
  title =               {Time{\slash}Space Efficient Compressed Pattern
                         Matching},
  editor =              {Freivalds, Rusins},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {S}ymposium on {F}undamentals of {C}omputation
                         {T}heory ({FCT}'01)},
  acronym =             {{FCT}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2138},
  pages =               {138-149},
  year =                {2001},
  month =               aug,
}
[GP02] Elsa Gunter and Doron A. Peled. Tracing the Executions of Concurrent Programs. In RV'02, Electronic Notes in Theoretical Computer Science 70(4). Elsevier, July 2002. 
@inproceedings{rv2002-GP,
  author =              {Gunter, Elsa and Peled, Doron A.},
  title =               {Tracing the Executions of Concurrent Programs},
  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,
}
[GP10] Alwyn Goodloe and Lee Pike. Monitoring distributed real-time systems: a survey and future directions. Technical Report NASA/CR-2010-216724, NASA, July 2010. 
@techreport{NASACR10-216724-GP,
  author =              {Goodloe, Alwyn and Pike, Lee},
  title =               {Monitoring distributed real-time systems: a~survey
                         and future directions},
  number =              {NASA/CR-2010-216724},
  year =                {2010},
  month =               jul,
  institution =         {NASA},
  type =                {Technical Report},
}
[GPS+80] Dov M. Gabbay, Amir Pnueli, Saharon Shelah, and Jonathan Stavi. On the Temporal Analysis of Fairness. In POPL'80, pages 163-173. ACM Press, January 1980. 
@inproceedings{popl1980-GPSS,
  author =              {Gabbay, Dov M. and Pnueli, Amir and Shelah, Saharon
                         and Stavi, Jonathan},
  title =               {On the Temporal Analysis of Fairness},
  booktitle =           {Conference Record of the 7th {ACM} {S}ymposium on
                         {P}rinciples of {P}rogramming {L}anguages
                         ({POPL}'80)},
  acronym =             {{POPL}'80},
  publisher =           {ACM Press},
  pages =               {163-173},
  year =                {1980},
  month =               jan,
}
[GPV+96] Rob Gerth, Doron A. Peled, Moshe Y. Vardi, and Pierre Wolper. Simple On-the-fly Automatic Verification of Linear Temporal Logic. In PSTV'95, IFIP Conference Proceedings 38, pages 3-18. Chapman & Hall, 1996. 
@inproceedings{pstv1995-GPVW,
  author =              {Gerth, Rob and Peled, Doron A. and Vardi, Moshe Y.
                         and Wolper, Pierre},
  title =               {Simple On-the-fly Automatic Verification of Linear
                         Temporal Logic},
  editor =              {Dembinski, Piotr and Sredniawa, Marek},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {S}ymposium on {P}rotocol {S}pecification, {T}esting
                         and {V}erification ({PSTV}'95)},
  acronym =             {{PSTV}'95},
  publisher =           {Chapman \& Hall},
  series =              {IFIP Conference Proceedings},
  volume =              {38},
  pages =               {3-18},
  year =                {1996},
  confyear =            {1995},
  confmonth =           {6},
}
[GR97] Dora Giammarresi and Antonio Restivo. Two-dimensional Languages. In Grzegorz Rozenberg and Arto Salomaa (eds.), Handbook of Formal Languages. Springer-Verlag, 1997. 
@incollection{HFL1997(3)-GR,
  author =              {Giammarresi, Dora and Restivo, Antonio},
  title =               {Two-dimensional Languages},
  editor =              {Rozenberg, Grzegorz and Salomaa, Arto},
  booktitle =           {Handbook of Formal Languages},
  publisher =           {Springer-Verlag},
  volume =              {3},
  pages =               {215-267},
  year =                {1997},
}
[GR99] Leszek Gąsieniec and Wojciech Rytter. Almost Optimal Fully LZW-Compressed Pattern Matching. In DCC'99, pages 316-325. IEEE Comp. Soc. Press, March 1999. 
@inproceedings{dcc1999-GR,
  author =              {G{\k a}sieniec, Leszek and Rytter, Wojciech},
  title =               {Almost Optimal Fully {LZW}-Compressed Pattern
                         Matching},
  booktitle =           {{P}roceedings of the 9th {D}ata {C}ompression
                         {C}onference ({DCC}'99)},
  acronym =             {{DCC}'99},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {316-325},
  year =                {1999},
  month =               mar,
}
[Gra83] Susanne Graf. On Lamport's Comparison between Linear and Branching Time Logic. Research Report 348, Lab. Informatique et Mathématiques Apppliquées de Grenoble, France, January 1983. 
@techreport{imag348-Gra,
  author =              {Graf, Susanne},
  title =               {On {L}amport's Comparison between Linear and
                         Branching Time Logic},
  number =              {348},
  year =                {1983},
  month =               jan,
  institution =         {Lab.~Informatique et Math{\'e}matiques Apppliqu\'ees
                         de Grenoble, France},
  type =                {Research Report},
}
[Gra84] Susanne Graf. On Lamport's Comparison between Linear and Branching Time Logic. RAIRO – Informatique Théorique et Applications 18(4):345-353. EDP Sciences, 1984. 
@article{rairo-ita18(4)-Gra,
  author =              {Graf, Susanne},
  title =               {On {L}amport's Comparison between Linear and
                         Branching Time Logic},
  publisher =           {EDP Sciences},
  journal =             {RAIRO~-- Informatique Th{\'e}orique et Applications},
  volume =              {18},
  number =              {4},
  pages =               {345-353},
  year =                {1984},
}
[Gri08] Olga Grinchtein. Learning of Timed Systems. PhD thesis, Deparment of Information Technology, Uppsala University, Sweden, 2008. 
@phdthesis{phd-grinchtein,
  author =              {Grinchtein, Olga},
  title =               {Learning of Timed Systems},
  year =                {2008},
  school =              {Deparment of Information Technology, Uppsala
                         University, Sweden},
}
[GRS00] Valérie Gouranton, Pierre Réty, and Helmut Seidl. Synchronized Tree Languages Revisited and New Applications. Research Report 2000-16, Lab. Informatique Fondamentale d'Orléans, France, 2000. 
@techreport{lifo-2000-16-GRS,
  author =              {Gouranton, Val{\'e}rie and R{\'e}ty, Pierre and
                         Seidl, Helmut},
  title =               {Synchronized Tree Languages Revisited and New
                         Applications},
  number =              {2000-16},
  year =                {2000},
  institution =         {Lab.~Informatique Fondamentale d'Orl{\'e}ans,
                         France},
  type =                {Research Report},
}
[GRS01] Valérie Gouranton, Pierre Réty, and Helmut Seidl. Synchronized Tree Languages Revisited and New Applications. In FoSSaCS'01, Lecture Notes in Computer Science 2030, pages 214-229. Springer-Verlag, April 2001. 
@inproceedings{fossacs2001-GRS,
  author =              {Gouranton, Val{\'e}rie and R{\'e}ty, Pierre and
                         Seidl, Helmut},
  title =               {Synchronized Tree Languages Revisited and New
                         Applications},
  editor =              {Honsell, Furio and Miculan, Marino},
  booktitle =           {{P}roceedings of the 4th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'01)},
  acronym =             {{FoSSaCS}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2030},
  pages =               {214-229},
  year =                {2001},
  month =               apr,
}
[GRS11] Gilles Geeraerts, Jean-François Raskin, and Tali Sznajder. Event-clock automata: form theory to practice. In FORMATS'11, Lecture Notes in Computer Science 6919, pages 209-224. Springer-Verlag, September 2011. 
@inproceedings{formats2011-GRS,
  author =              {Geeraerts, Gilles and Raskin, Jean-Fran{\c c}ois and
                         Sznajder, Tali},
  title =               {Event-clock automata: form theory to practice},
  editor =              {Fahrenberg, Uli and Tripakis, Stavros},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'11)},
  acronym =             {{FORMATS}'11},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6919},
  pages =               {209-224},
  year =                {2011},
  month =               sep,
  doi =                 {10.1007/978-3-642-24310-3_15},
}
[GRS+96] Dora Giammarresi, Antonio Restivo, Sebastian Seibert, and Wolfgang Thomas. Monadic Second-Order Logic over Rectangular Pictures and Recognizability by Tiling Systems. Information and Computation 125(1):32-45. Academic Press, February 1996. 
@article{icomp125(1)-GRST,
  author =              {Giammarresi, Dora and Restivo, Antonio and Seibert,
                         Sebastian and Thomas, Wolfgang},
  title =               {Monadic Second-Order Logic over Rectangular Pictures
                         and Recognizability by Tiling Systems},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {125},
  number =              {1},
  pages =               {32-45},
  year =                {1996},
  month =               feb,
  doi =                 {10.1006/inco.1996.0018},
}
[GRT10] James Gross, Frank G. Radmacher, and Wolfgang Thomas. A Game-Theoretic Approach to Routing under Adversarial Conditions. In IFIPTCS'10, IFIP Conference Proceedings 323, pages 355-370. Springer-Verlag, September 2010. 
@inproceedings{ifiptcs2010-GRT,
  author =              {Gross, James and Radmacher, Frank G. and Thomas,
                         Wolfgang},
  title =               {A~Game-Theoretic Approach to Routing under
                         Adversarial Conditions},
  editor =              {Calude, Cristian S. and Sassone, Vladimiro},
  booktitle =           {{P}roceedings of the 6th {IFIP} {I}nternational
                         {C}onference on {T}heoretical {C}omputer {S}cience
                         ({IFIPTCS}'10)},
  acronym =             {{IFIPTCS}'10},
  publisher =           {Springer-Verlag},
  series =              {IFIP Conference Proceedings},
  volume =              {323},
  pages =               {355-370},
  year =                {2010},
  month =               sep,
}
[GRT11] Sten Grüner, Frank G. Radmacher, and Wolfgang Thomas. Connectivity Games over Dynamic Networks. In GandALF'11, Electronic Proceedings in Theoretical Computer Science 54, pages 131-145. June 2011. 
@inproceedings{gandalf2011-GRT,
  author =              {Gr{\"u}ner, Sten and Radmacher, Frank G. and Thomas,
                         Wolfgang},
  title =               {Connectivity Games over Dynamic Networks},
  editor =              {D{'}Agostino, Giovanna and La{~}Torre, Salvatore},
  booktitle =           {{P}roceedings of the 2nd {I}nternational {S}ymposium
                         on {G}ames, {A}utomata, {L}ogics and {F}ormal
                         {V}erification ({GandALF}'11)},
  acronym =             {{GandALF}'11},
  series =              {Electronic Proceedings in Theoretical Computer
                         Science},
  volume =              {54},
  pages =               {131-145},
  year =                {2011},
  month =               jun,
}
[GRV05] Gilles Geeraerts, Jean-François Raskin, and Laurent Van Begin. Expand, Enlarge and Check... Made Efficient. In CAV'05, Lecture Notes in Computer Science 3576, pages 394-407. Springer-Verlag, July 2005. 
@inproceedings{cav2005-GRV,
  author =              {Geeraerts, Gilles and Raskin, Jean-Fran{\c c}ois and
                         Van{~}Begin, Laurent},
  title =               {Expand, Enlarge and Check... Made Efficient},
  editor =              {Etessami, Kousha and Rajamani, Sriram},
  booktitle =           {{P}roceedings of the 17th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'05)},
  acronym =             {{CAV}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3576},
  pages =               {394-407},
  year =                {2005},
  month =               jul,
}
[GRV06] Gilles Geeraerts, Jean-François Raskin, and Laurent Van Begin. Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS. Journal of Computer and System Sciences 72(1):180-203. Elsevier, February 2006. 
@article{jcss72(1)-GRV,
  author =              {Geeraerts, Gilles and Raskin, Jean-Fran{\c c}ois and
                         Van{~}Begin, Laurent},
  title =               {Expand, Enlarge and Check: New algorithms for the
                         coverability problem of~{WSTS}},
  publisher =           {Elsevier},
  journal =             {Journal of Computer and System Sciences},
  volume =              {72},
  number =              {1},
  pages =               {180-203},
  year =                {2006},
  month =               feb,
}
[GRV10] Gilles Geeraerts, Jean-François Raskin, and Laurent Van Begin. On the Efficient Computation of the Minimal Coverability Set of Petri Nets. International Journal of Foundations of Computer Science 21(2):135-165. April 2010. 
@article{ijfcs21(2)-GRV,
  author =              {Geeraerts, Gilles and Raskin, Jean-Fran{\c c}ois and
                         Van{~}Begin, Laurent},
  title =               {On the Efficient Computation of the Minimal
                         Coverability Set of {P}etri Nets},
  journal =             {International Journal of Foundations of Computer
                         Science},
  volume =              {21},
  number =              {2},
  pages =               {135-165},
  year =                {2010},
  month =               apr,
}
[GS66] Seymour Ginsburg and Edwin Spanier. Semigroups, Presburger formulas, and languages. Pacific Journal of Mathematics 16(2):285-296. December 1966. 
@article{pjm16(2)-GS,
  author =              {Ginsburg, Seymour and Spanier, Edwin},
  title =               {Semigroups, {P}resburger formulas, and languages},
  journal =             {Pacific Journal of Mathematics},
  volume =              {16},
  number =              {2},
  pages =               {285-296},
  year =                {1966},
  month =               dec,
}
[GS92] Steven M. German and A. Prasad Sistla. Reasoning about Systems with Many Processes. Journal of the ACM 39(3):675-735. ACM Press, July 1992. 
@article{jacm39(3)-GS,
  author =              {German, Steven M. and Sistla, A. Prasad},
  title =               {Reasoning about Systems with Many Processes},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {39},
  number =              {3},
  pages =               {675-735},
  year =                {1992},
  month =               jul,
  doi =                 {10.1145/146637.146681},
}
[GS94] Roberto Gorrieri and Glauco Siliprandi. Real-time System Verification using P/T Nets. In CAV'94, Lecture Notes in Computer Science 818, pages 14-26. Springer-Verlag, June 1994. 
@inproceedings{cav1994-GS,
  author =              {Gorrieri, Roberto and Siliprandi, Glauco},
  title =               {Real-time System Verification using {P/T} Nets},
  editor =              {Dill, David L.},
  booktitle =           {{P}roceedings of the 6th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'94)},
  acronym =             {{CAV}'94},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {818},
  pages =               {14-26},
  year =                {1994},
  month =               jun,
}
[GS06] Martin Grohe and Nicole Schweikardt. The Succinctness of First-Order Logic on Linear Orders. Logical Methods in Computer Science 1(1):1-25. June 2006. 
@article{lmcs1(1)-GS,
  author =              {Grohe, Martin and Schweikardt, Nicole},
  title =               {The Succinctness of First-Order Logic on Linear
                         Orders},
  journal =             {Logical Methods in Computer Science},
  volume =              {1},
  number =              {1},
  pages =               {1-25},
  year =                {2006},
  month =               jun,
}
[GS09] Thomas Gawlitza and Helmut Seidl. Games through Nested Fixpoints. In CAV'09, Lecture Notes in Computer Science 5643, pages 291-305. Springer-Verlag, June 2009. 
@inproceedings{cav2009-GS,
  author =              {Gawlitza, Thomas and Seidl, Helmut},
  title =               {Games through Nested Fixpoints},
  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 =               {291-305},
  year =                {2009},
  month =               jun,
  doi =                 {10.1007/978-3-642-02658-4_24},
}
[GSZ09] Paul Gastin, Tali Sznajder, and Marc Zeitoun. Distributed synthesis for well-connected architectures. Formal Methods in System Design 34(3):215-237. Springer-Verlag, June 2009. 
@article{fmsd34(3)-GSZ,
  author =              {Gastin, Paul and Sznajder, Tali and Zeitoun, Marc},
  title =               {Distributed synthesis for well-connected
                         architectures},
  publisher =           {Springer-Verlag},
  journal =             {Formal Methods in System Design},
  volume =              {34},
  number =              {3},
  pages =               {215-237},
  year =                {2009},
  month =               jun,
}
[GTK05] Shafi Goldwasser and Yael Tauman Kalai. On the Impossibility of Obfuscation with Auxiliary Input. In FOCS'05, pages 553-562. IEEE Comp. Soc. Press, October 2005. 
@inproceedings{focs2005-GT,
  author =              {Goldwasser, Shafi and Tauman Kalai, Yael},
  title =               {On the Impossibility of Obfuscation with Auxiliary
                         Input},
  booktitle =           {{P}roceedings of the 46th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'05)},
  acronym =             {{FOCS}'05},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {553-562},
  year =                {2005},
  month =               oct,
}
[GTW02] Erich Grädel, Wolfgang Thomas, and Thomas Wilke. Automata Logics, and Infinite Games – A Guide to Current Research. Lecture Notes in Computer Science 2500. Springer-Verlag, 2002. 
@book{GTW-lncs2500,
  title =               {Automata Logics, and Infinite Games~-- A~Guide to
                         Current Research},
  editor =              {Gr{\"a}del, Erich and Thomas, Wolfgang and Wilke,
                         Thomas},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2500},
  year =                {2002},
  doi =                 {10.1007/3-540-36387-4},
}
[GV05] Jaco Geldenhuys and Antti Valmari. More Efficient On-the-fly LTL Verification with Tarjan's Algorithm. Theoretical Computer Science 345(1):60-82. Elsevier, November 2005. 
@article{tcs345(1)-GV,
  author =              {Geldenhuys, Jaco and Valmari, Antti},
  title =               {More Efficient On-the-fly {LTL} Verification with
                         {T}arjan's Algorithm},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {345},
  number =              {1},
  pages =               {60-82},
  year =                {2005},
  month =               nov,
}
[GZ04] Hugo Gimbert and Wiesław Zielonka. When Can You Play Positionnaly?. In MFCS'04, Lecture Notes in Computer Science 3153, pages 686-697. Springer-Verlag, August 2004. 
@inproceedings{mfcs2004-GZ,
  author =              {Gimbert, Hugo and Zielonka, Wies{\l}aw},
  title =               {When Can You Play Positionnaly?},
  editor =              {Fiala, Ji{\v r}{\'\i} and Koubek, V{\'a}clav and
                         Kratoch{\'\i}l, Jan},
  booktitle =           {{P}roceedings of the 29th {I}nternational
                         {S}ymposium on {M}athematical {F}oundations of
                         {C}omputer {S}cience ({MFCS}'04)},
  acronym =             {{MFCS}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3153},
  pages =               {686-697},
  year =                {2004},
  month =               aug,
}
[GZ05] Hugo Gimbert and Wiesław Zielonka. Games Where You Can Play Optimally Without Any Memory. In CONCUR'05, Lecture Notes in Computer Science 3653, pages 428-442. Springer-Verlag, August 2005. 
@inproceedings{concur2005-GZ,
  author =              {Gimbert, Hugo and Zielonka, Wies{\l}aw},
  title =               {Games Where You Can Play Optimally Without Any
                         Memory},
  editor =              {Abadi, Mart{\'\i}n and de Alfaro, Luca},
  booktitle =           {{P}roceedings of the 16th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'05)},
  acronym =             {{CONCUR}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3653},
  pages =               {428-442},
  year =                {2005},
  month =               aug,
  doi =                 {10.1007/11539452_33},
}
H
[Haa12] Christoph Haase. On the Complexity of Model Checking Counter Automata. PhD thesis, University of Oxford, UK, January 2012. 
@phdthesis{phd-haase,
  author =              {Haase, Christoph},
  title =               {On the Complexity of Model Checking Counter
                         Automata},
  year =                {2012},
  month =               jan,
  school =              {University of Oxford, UK},
}
[HAB02] William Hesse, Eric Allender, and David A. Mix Barrington. Uniform constant-depth threshold circuits for division and iterated multiplication. Journal of Computer and System Sciences 65(4):695-716. Academic Press, December 2002. 
@article{jcss65(4)-HAB,
  author =              {Hesse, William and Allender, Eric and Barrington,
                         David A. Mix},
  title =               {Uniform constant-depth threshold circuits for
                         division and iterated multiplication},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {65},
  number =              {4},
  pages =               {695-716},
  year =                {2002},
  month =               dec,
}
[Had18] Serge Haddad. Memoryless determinacy of finite parity games: Another simple proof. Information Processing Letters 132:19-21. Elsevier, April 2018. 
@article{ipl132()-Had,
  author =              {Haddad, Serge},
  title =               {Memoryless determinacy of finite parity games:
                         Another simple proof},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {132},
  pages =               {19-21},
  year =                {2018},
  month =               apr,
  doi =                 {10.1016/j.ipl.2017.11.012},
}
[Had20] Christoforos N. Hadjicostis. Estimation and Inference in Discrete Event Systems – A model-based approach with finite automata. Communications and Control Engineering. Springer-Verlag, 2020. 
@book{Had20-IEDES,
  author =              {Hadjicostis, Christoforos N.},
  title =               {Estimation and Inference in Discrete Event
                         Systems~-- A~model-based approach with finite
                         automata},
  publisher =           {Springer-Verlag},
  series =              {Communications and Control Engineering},
  year =                {2020},
}
[Hag11] Matthew Hague. Parameterised Pushdown Systems with Non-Atomic Writes. In FSTTCS'11, Leibniz International Proceedings in Informatics 13, pages 457-468. Leibniz-Zentrum für Informatik, December 2011. 
@inproceedings{fsttcs11-Hag,
  author =              {Hague, Matthew},
  title =               {Parameterised Pushdown Systems with Non-Atomic
                         Writes},
  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},
  pages =               {457-468},
  year =                {2011},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2011.457},
}
[Hal03] Joseph Y. Halpern. A computer scientist looks at game theory. Games and Economic Behavior 45(1):114-131. October 2003. 
@article{geb45(1)-Hal,
  author =              {Halpern, Joseph Y.},
  title =               {A computer scientist looks at game theory},
  journal =             {Games and Economic Behavior},
  volume =              {45},
  number =              {1},
  pages =               {114-131},
  year =                {2003},
  month =               oct,
  doi =                 {10.1016/S0899-8256(02)00529-8},
}
[Hal05] Nicolas Halbwachs. A Synchronous Language at Work: the Story of Lustre. In MEMOCODE'05, pages 3-11. IEEE Comp. Soc. Press, July 2005. 
@inproceedings{memocode2005-Hal,
  author =              {Halbwachs, Nicolas},
  title =               {A Synchronous Language at Work: the Story of Lustre},
  booktitle =           {{P}roceedings of the {T}hird {ACM} and {IEEE}
                         {I}nternational {C}onference on {F}ormal {M}ethods
                         and {M}odels for {C}o-{D}esign ({MEMOCODE}'05)},
  acronym =             {{MEMOCODE}'05},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {3-11},
  year =                {2005},
  month =               jul,
  doi =                 {10.1109/MEMCOD.2005.1487884},
}
[Har67] John C. Harsanyi. Games with incomplete information played by "Bayesian" players – (I) The basic model. Management Science 14(3):159-182. November 1967. 
@article{ms14(3)-Har,
  author =              {Harsanyi, John C.},
  title =               {Games with incomplete information played by
                         {"}{B}ayesian{"} players~-- (I)~The~basic model},
  journal =             {Management Science},
  volume =              {14},
  number =              {3},
  pages =               {159-182},
  year =                {1967},
  month =               nov,
}
[Har85] David Harel. Recurring Dominoes: Making the Highly Undecidable Highly Understandable. Annals of Discrete Mathematics 24:51-72. North-Holland, 1985. 
@article{adm24()-Har,
  author =              {Harel, David},
  title =               {Recurring Dominoes: Making the Highly Undecidable
                         Highly Understandable},
  publisher =           {North-Holland},
  journal =             {Annals of Discrete Mathematics},
  volume =              {24},
  pages =               {51-72},
  year =                {1985},
}
[Har05] Aidan Harding. Symbolic Strategy Synthesis for Games with LTL Winning Conditions. PhD thesis, School of Computer Science, University of Birmingham, UK, March 2005. 
@phdthesis{phd-harding,
  author =              {Harding, Aidan},
  title =               {Symbolic Strategy Synthesis for Games with {LTL}
                         Winning Conditions},
  year =                {2005},
  month =               mar,
  school =              {School of Computer Science, University of
                         Birmingham, UK},
}
[HBL+03] Martijn Hendriks, Gerd Behrmann, Kim Guldstrand Larsen, Peter Niebert, and Frits Vaandrager. Adding Symmetry Reduction to Uppaal. In FORMATS'03, Lecture Notes in Computer Science 2791. Springer-Verlag, September 2003. 
@inproceedings{formats2003-HBLNV,
  author =              {Hendriks, Martijn and Behrmann, Gerd and Larsen, Kim
                         Guldstrand and Niebert, Peter and Vaandrager, Frits},
  title =               {Adding Symmetry Reduction to {U}ppaal},
  editor =              {Larsen, Kim Guldstrand and Niebert, Peter},
  booktitle =           {{R}evised {P}apers of the 1st {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'03)},
  acronym =             {{FORMATS}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2791},
  year =                {2003},
  month =               sep,
}
[HBM+10] Paul Hunter, Patricia Bouyer, Nicolas Markey, Joël Ouaknine, and James Worrell. Computing Rational Radical Sums in Uniform TC0. In FSTTCS'10, Leibniz International Proceedings in Informatics 8, pages 308-316. Leibniz-Zentrum für Informatik, December 2010.
Abstract

A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of deciding whether ∑i=1m Ci . AiXi is zero for given rational numbers Ai, Ci, Xi. It has been known for almost twenty years that this can be decided in polynomial time. In this paper we improve this result by showing membership in uniform TC0. This requires several significant departures from Blömer's polynomial-time algorithm as the latter crucially relies on primitives, such as gcd computation and binary search, that are not known to be in TC0.

@inproceedings{fsttcs2010-HBMOW,
  author =              {Hunter, Paul and Bouyer, Patricia and Markey,
                         Nicolas and Ouaknine, Jo{\"e}l and Worrell, James},
  title =               {Computing Rational Radical Sums in Uniform
                         {TC\textsuperscript{0}}},
  editor =              {Lodaya, Kamal and Mahajan, Meena},
  booktitle =           {{P}roceedings of the 30th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'10)},
  acronym =             {{FSTTCS}'10},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {8},
  pages =               {308-316},
  year =                {2010},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2010.308},
  abstract =            {A~fundamental problem in numerical computation and
                         computational geometry is to determine the sign of
                         arithmetic expressions in radicals. Here we consider
                         the simpler problem of deciding whether
                         \(\sum_{i=1}^m C_i \cdot A_i^{X_i}\) is zero for
                         given rational numbers~\(A_i\), \(C_i\),~\(X_i\).
                         It~has been known for almost twenty years that this
                         can be decided in polynomial time. In this paper we
                         improve this result by showing membership in uniform
                         \(\textsf{TC}^0\). This requires several significant
                         departures from Bl{\"o}mer's polynomial-time
                         algorithm as the latter crucially relies on
                         primitives, such as gcd computation and binary
                         search, that are not known to be
                         in~\(\textsf{TC}^0\).},
}
[HCC+00] Vicky Hartonas-Garmhausen, Sérgio Vale Aguiar Campos, Alessandro Cimatti, Edmund M. Clarke, and Fausto Giunchiglia. Verification of a Safety-Critical Railway Interlocking System with Real-Time Constraints. Science of Computer Programming 36(1):53-64. Elsevier, January 2000. 
@article{scp36(1)-HCCCG,
  author =              {Hartonas{-}Garmhausen, Vicky and Campos, S{\'e}rgio
                         Vale Aguiar and Cimatti, Alessandro and Clarke,
                         Edmund M. and Giunchiglia, Fausto},
  title =               {Verification of a Safety-Critical Railway
                         Interlocking System with Real-Time Constraints},
  publisher =           {Elsevier},
  journal =             {Science of Computer Programming},
  volume =              {36},
  number =              {1},
  pages =               {53-64},
  year =                {2000},
  month =               jan,
}
[HCK+93] Juris Hartmanis, Richard Chang, Jim Kadin, and Stephen G. Mitchell. Some Observation about Relativization of Space Bounded Computations. In Grzegorz Rozenberg and Arto Salomaa (eds.), Current Trends in Theoretical Computer Science, World Scientific Series in Computer Science 40, pages 423-433. World Scientific, 1993. 
@incollection{CTTCS-HCK,
  author =              {Hartmanis, Juris and Chang, Richard and Kadin, Jim
                         and Mitchell, Stephen G.},
  title =               {Some Observation about Relativization of Space
                         Bounded Computations},
  editor =              {Rozenberg, Grzegorz and Salomaa, Arto},
  booktitle =           {Current Trends in Theoretical Computer Science},
  publisher =           {World Scientific},
  series =              {World Scientific Series in Computer Science},
  volume =              {40},
  pages =               {423-433},
  year =                {1993},
}
[Hem98] Harald Hempel. Boolean Hierarchies – On Collapse Properties and Query Order. PhD thesis, Friedrich-Schiller Universität Jena, Germany, 1998. 
@phdthesis{phd-hempel,
  author =              {Hempel, Harald},
  title =               {Boolean Hierarchies~-- On~Collapse Properties and
                         Query Order},
  year =                {1998},
  school =              {Friedrich-Schiller Universit{\"a}t Jena, Germany},
}
[Hen61] Leon Henkin. Some Remarks on Infinitely Long Formulas. In Infinitistic Methods – Proceedings of the Symposium on Foundations of Mathematics, pages 167-183. Pergamon Press, 1961. 
@inproceedings{sofm1959-Hen,
  author =              {Henkin, Leon},
  title =               {Some Remarks on Infinitely Long Formulas},
  booktitle =           {{I}nfinitistic {M}ethods~-- {P}roceedings of the
                         {S}ymposium on {F}oundations of {M}athematics},
  publisher =           {Pergamon Press},
  pages =               {167-183},
  year =                {1961},
  confyear =            {1959},
  confmonth =           {9},
}
[Hen91] Thomas A. Henzinger. The Temporal Specification and Verification of Real-Time Systems. PhD thesis, Stanford University, 1991. 
@phdthesis{phd-henzinger,
  author =              {Henzinger, Thomas A.},
  title =               {The Temporal Specification and Verification of
                         Real-Time Systems},
  year =                {1991},
  school =              {Stanford University},
}
[Hen96] Thomas A. Henzinger. The Theory of Hybrid Automata. In LICS'96, pages 278-292. IEEE Comp. Soc. Press, July 1996. 
@inproceedings{lics1996-Hen,
  author =              {Henzinger, Thomas A.},
  title =               {The Theory of Hybrid Automata},
  booktitle =           {{P}roceedings of the 11th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'96)},
  acronym =             {{LICS}'96},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {278-292},
  year =                {1996},
  month =               jul,
}
[Hen98] Thomas A. Henzinger. It's About Time: Real-Time Logics Reviewed. In CONCUR'98, Lecture Notes in Computer Science 1466, pages 439-454. Springer-Verlag, September 1998. 
@inproceedings{concur1998-Hen,
  author =              {Henzinger, Thomas A.},
  title =               {It's About Time: Real-Time Logics Reviewed},
  editor =              {Sangiorgi, Davide and de Simone, Robert},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'98)},
  acronym =             {{CONCUR}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1466},
  pages =               {439-454},
  year =                {1998},
  month =               sep,
}
[Hen05] Thomas A. Henzinger. Games in system design and verification. In TARK'05, pages 1-4. June 2005. 
@inproceedings{tark2005-Hen,
  author =              {Henzinger, Thomas A.},
  title =               {Games in system design and verification},
  editor =              {van der Meyden, Ron},
  booktitle =           {{P}roceedings of the 10th {C}onference on
                         {T}heoretical {A}spects of {R}ationality and
                         {K}nowledge ({TARK}'05)},
  acronym =             {{TARK}'05},
  pages =               {1-4},
  year =                {2005},
  month =               jun,
}
[Hen12] Thomas A. Henzinger. Quantitative Reactive Models. In MODELS'12, Lecture Notes in Computer Science 7590, pages 1-2. Springer-Verlag, September 2012. 
@inproceedings{models2012-Hen,
  author =              {Henzinger, Thomas A.},
  title =               {Quantitative Reactive Models},
  editor =              {France, Robert B. and Kazmeier, J{\"u}rgen and Breu,
                         Ruth and Atkinson, Colin},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}onference on {M}odel {D}riven {E}ngineering
                         {L}anguages and {S}ystems ({MODELS}'12)},
  acronym =             {{MODELS}'12},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7590},
  pages =               {1-2},
  year =                {2012},
  month =               sep,
  doi =                 {10.1007/978-3-642-33666-9_1},
}
[Hen13] Thomas A. Henzinger. Quantitative reactive modeling and verification. Computer Science – Research and Development 28(4):331-344. November 2013. 
@article{csrd28(4)-Hen,
  author =              {Henzinger, Thomas A.},
  title =               {Quantitative reactive modeling and verification},
  journal =             {Computer Science~-- Research and Development},
  volume =              {28},
  number =              {4},
  pages =               {331-344},
  year =                {2013},
  month =               nov,
  doi =                 {10.1007/s00450-013-0251-7},
}
[Her98] Philippe Herrmann. Timed Automata and Recognizability. Information Processing Letters 65(6):313-318. Elsevier, March 1998. 
@article{ipl65(6)-Her,
  author =              {Herrmann, {\relax Ph}ilippe},
  title =               {Timed Automata and Recognizability},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {65},
  number =              {6},
  pages =               {313-318},
  year =                {1998},
  month =               mar,
}
[Hes03] William Hesse. Dynamic Computational Complexity. PhD thesis, Department of Computer Science, University of Massachusetts at Amherst, USA, September 2003. 
@phdthesis{phd-hesse,
  author =              {Hesse, William},
  title =               {Dynamic Computational Complexity},
  year =                {2003},
  month =               sep,
  school =              {Department of Computer Science, University of
                         Massachusetts at Amherst, USA},
}
[HHM99] Thomas A. Henzinger, Benjamin Horowitz, and Rupak Majumdar. Rectangular Hybrid Games. In CONCUR'99, Lecture Notes in Computer Science 1664, pages 320-335. Springer-Verlag, August 1999. 
@inproceedings{concur1999-HHM,
  author =              {Henzinger, Thomas A. and Horowitz, Benjamin and
                         Majumdar, Rupak},
  title =               {Rectangular Hybrid Games},
  editor =              {Baeten, Jos C. M. and Mauw, Sjouke},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'99)},
  acronym =             {{CONCUR}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1664},
  pages =               {320-335},
  year =                {1999},
  month =               aug,
}
[HvdH+03] Paul Harrenstein, Wiebe van der Hoek, John-Jules Meyer, and Cees Witteveen. A Modal Characterization of Nash Equilibrium. Fundamenta Informaticae 57(2-4):281-321. IOS Press, 2003. 
@article{fundi57(2-4)-HHMW,
  author =              {Harrenstein, Paul and van der Hoek, Wiebe and Meyer,
                         John-Jules and Witteveen, Cees},
  title =               {A Modal Characterization of {N}ash Equilibrium},
  publisher =           {IOS Press},
  journal =             {Fundamenta Informaticae},
  volume =              {57},
  number =              {2-4},
  pages =               {281-321},
  year =                {2003},
}
[HHW95] Thomas A. Henzinger, Pei-Hsin Ho, and Howard Wong-Toi. A User Guide to HyTech. In TACAS'95, Lecture Notes in Computer Science 1019, pages 41-71. Springer-Verlag, May 1995. 
@inproceedings{tacas1995-HHW,
  author =              {Henzinger, Thomas A. and Ho, Pei-Hsin and
                         Wong{-}Toi, Howard},
  title =               {A~User Guide to {H}y{T}ech},
  editor =              {Brinksma, Ed and Cleaveland, Rance and Larsen, Kim
                         Guldstrand and Margaria, Tiziana and Steffen,
                         Bernhard},
  booktitle =           {{P}roceedings of the 1st {I}nternational {W}orkshop
                         on {T}ools and {A}lgorithms for {C}onstruction and
                         {A}nalysis of {S}ystems ({TACAS}'95)},
  acronym =             {{TACAS}'95},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1019},
  pages =               {41-71},
  year =                {1995},
  month =               may,
  doi =                 {10.1007/3-540-60630-0_3},
}
[HHW97] Thomas A. Henzinger, Pei-Hsin Ho, and Howard Wong-Toi. HyTech: A Model-Checker for Hybrid Systems. International Journal on Software Tools for Technology Transfer 1(1-2):110-122. Springer-Verlag, October 1997. 
@article{sttt1(1-2)-HHW,
  author =              {Henzinger, Thomas A. and Ho, Pei-Hsin and
                         Wong{-}Toi, Howard},
  title =               {{H}y{T}ech: A~Model-Checker for Hybrid Systems},
  publisher =           {Springer-Verlag},
  journal =             {International Journal on Software Tools for
                         Technology Transfer},
  volume =              {1},
  number =              {1-2},
  pages =               {110-122},
  year =                {1997},
  month =               oct,
}
[HI02] William Hesse and Neil Immerman. Complete Problems for Dynamic Complexity Classes. In LICS'02, pages 313-322. IEEE Comp. Soc. Press, July 2002. 
@inproceedings{lics2002-HI,
  author =              {Hesse, William and Immerman, Neil},
  title =               {Complete Problems for Dynamic Complexity Classes},
  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 =               {313-322},
  year =                {2002},
  month =               jul,
}
[Hig52] Graham Higman. Ordering by Divisibility in Abstract Algebras. Proceedings of the London Mathematical Society s3-2(1):326-336. 1952. 
@article{plms-s3-2(1)-Hig,
  author =              {Higman, Graham},
  title =               {Ordering by Divisibility in Abstract Algebras},
  journal =             {Proceedings of the London Mathematical Society},
  volume =              {s3-2},
  number =              {1},
  pages =               {326-336},
  year =                {1952},
}
[HIM12] Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, and Peter Bro Miltersen. A Faster Algorithm for Solving One-Clock Priced Timed Games. Research Report 1201.3498, arXiv, January 2012. 
@techreport{arxiv12-HIM,
  author =              {Hansen, Thomas Dueholm and Ibsen{-}Jensen, Rasmus
                         and Miltersen, Peter Bro},
  title =               {A~Faster Algorithm for Solving One-Clock Priced
                         Timed Games},
  number =              {1201.3498},
  year =                {2012},
  month =               jan,
  institution =         {arXiv},
  type =                {Research Report},
}
[HIM13] Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, and Peter Bro Miltersen. A Faster Algorithm for Solving One-Clock Priced Timed Games. In CONCUR'13, Lecture Notes in Computer Science 8052, pages 531-545. Springer-Verlag, August 2013. 
@inproceedings{concur2013-HIM,
  author =              {Hansen, Thomas Dueholm and Ibsen{-}Jensen, Rasmus
                         and Miltersen, Peter Bro},
  title =               {A~Faster Algorithm for Solving One-Clock Priced
                         Timed Games},
  editor =              {D{'}Argenio, Pedro R. and Melgratt, Hern{\'a}n C.},
  booktitle =           {{P}roceedings of the 24th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'13)},
  acronym =             {{CONCUR}'13},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8052},
  pages =               {531-545},
  year =                {2013},
  month =               aug,
}
[HJ96] Dang Van Hung and Wang Ji. On the Design of Hybrid Control Systems Using Automata Models. In FSTTCS'96, Lecture Notes in Computer Science 1180, pages 156-176. Springer-Verlag, December 1996. 
@inproceedings{fsttcs1996-HJ,
  author =              {Hung, Dang Van and Ji, Wang},
  title =               {On the Design of Hybrid Control Systems Using
                         Automata Models},
  editor =              {Chandru, Vijay and Vinay, V.},
  booktitle =           {{P}roceedings of the 16th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'96)},
  acronym =             {{FSTTCS}'96},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1180},
  pages =               {156-176},
  year =                {1996},
  month =               dec,
}
[HJ04] Gerard J. Holzmann and Rajeev Joshi. Model-Driven Software Verification. In SPIN'04, Lecture Notes in Computer Science 2989, pages 76-91. Springer-Verlag, April 2004. 
@inproceedings{spin2004-HJ,
  author =              {Holzmann, Gerard J. and Joshi, Rajeev},
  title =               {Model-Driven Software Verification},
  editor =              {Graf, Susanne and Mounier, Laurent},
  booktitle =           {{P}roceedings of the 11th {I}nternational {SPIN}
                         {W}orkshop ({SPIN}'04)},
  acronym =             {{SPIN}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2989},
  pages =               {76-91},
  year =                {2004},
  month =               apr,
  doi =                 {10.1007/978-3-540-24732-6_6},
}
[HJM03] Thomas A. Henzinger, Ranjit Jhala, and Rupak Majumdar. Counterexample-Guided Control. In ICALP'03, Lecture Notes in Computer Science 2719, pages 886-902. Springer-Verlag, June 2003. 
@inproceedings{icalp2003-HJM,
  author =              {Henzinger, Thomas A. and Jhala, Ranjit and Majumdar,
                         Rupak},
  title =               {Counterexample-Guided Control},
  editor =              {Baeten, Jos C. M. and Lenstra, Jan Karel and Parrow,
                         Joachim and Woeginger, Gerhard J.},
  booktitle =           {{P}roceedings of the 30th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'03)},
  acronym =             {{ICALP}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2719},
  pages =               {886-902},
  year =                {2003},
  month =               jun,
}
[HJM18] Léo Henry, Thierry Jéron, and Nicolas Markey. Control strategies for off-line testing of timed systems. In SPIN'18, Lecture Notes in Computer Science 10869, pages 171-189. Springer-Verlag, June 2018.
Abstract

Partial observability and controllability are two well-known issues in test-case synthesis for interactive systems. We address the problem of partial control in the synthesis of test cases from timed-automata specifications. Building on the tioco timed testing framework, we extend a previous game interpretation of the test-synthesis problem from the untimed to the timed setting. This extension requires a deep reworking of the models, game interpretation and test-synthesis algorithms. We exhibit strategies of a game that tries to minimize both control losses and distance to the satisfaction of a test purpose, and prove they are winning under some fairness assumptions. This entails that when turning those strategies into test cases, we get properties such as soundness and exhaustiveness of the test synthesis method.

@inproceedings{spin2018-HJM,
  author =              {Henry, L{\'e}o and J{\'e}ron, Thierry and Markey,
                         Nicolas},
  title =               {Control strategies for off-line testing of timed
                         systems},
  editor =              {Gallardo, Mar{\'\i}a-del-Mar and Merino, Pedro},
  booktitle =           {{P}roceedings of the 25th {I}nternational
                         {S}ymposium on {M}odel-{C}herking {S}oftware
                         ({SPIN}'18)},
  acronym =             {{SPIN}'18},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {10869},
  pages =               {171-189},
  year =                {2018},
  month =               jun,
  doi =                 {10.1007/978-3-319-94111-0_10},
  abstract =            {Partial observability and controllability are two
                         well-known issues in test-case synthesis for
                         interactive systems. We~address the problem of
                         partial control in the synthesis of test cases from
                         timed-automata specifications. Building on the tioco
                         timed testing framework, we~extend a previous game
                         interpretation of the test-synthesis problem from
                         the untimed to the timed setting. This extension
                         requires a deep reworking of the models, game
                         interpretation and test-synthesis algorithms.
                         We~exhibit strategies of a game that tries to
                         minimize both control losses and distance to the
                         satisfaction of a test purpose, and prove they are
                         winning under some fairness assumptions. This
                         entails that when turning those strategies into test
                         cases, we get properties such as soundness and
                         exhaustiveness of the test synthesis method.},
}
[HJM20] Léo Henry, Thierry Jéron, and Nicolas Markey. Active learning of timed automata with unobservable resets. In FORMATS'20, Lecture Notes in Computer Science 12288, pages 144-160. Springer-Verlag, September 2020.
Abstract

Active learning of timed languages is concerned with the inference of timed automata by observing some of the timed words in their languages. The learner can query for the membership of words in the language, or propose a candidate model and ask if it is equivalent to the target. The major difficulty of this framework is the inference of clock resets, which are central to the dynamics of timed automata but not directly observable.

Interesting first steps have already been made by restricting to the subclass of event-recording automata, where clock resets are tied to observations. In order to advance towards learning of general timed automata, we generalize this method to a new class, called reset-free event-recording automata, where some transitions may reset no clocks.

Central to our contribution is the notion of invalidity, and the algorithm and data structures to deal with it, allowing on-the-fly detection and pruning of reset hypotheses that contradict observations. This notion is a key to any efficient active-learning procedure for generic timed automata.

@inproceedings{formats2020-HJM,
  author =              {Henry, L{\'e}o and J{\'e}ron, Thierry and Markey,
                         Nicolas},
  title =               {Active learning of timed automata with unobservable
                         resets},
  editor =              {Bertrand, Nathalie and Jansen, Nils},
  booktitle =           {{P}roceedings of the 18th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'20)},
  acronym =             {{FORMATS}'20},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {12288},
  pages =               {144-160},
  year =                {2020},
  month =               sep,
  doi =                 {10.1007/978-3-030-57628-8_9},
  abstract =            {Active learning of timed languages is concerned with
                         the inference of timed automata by observing some of
                         the timed words in their languages. The learner can
                         query for the membership of words in the language,
                         or propose a candidate model and ask if it is
                         equivalent to the target. The major difficulty of
                         this framework is the inference of clock resets,
                         which are central to the dynamics of timed automata
                         but not directly observable. \par Interesting first
                         steps have already been made by restricting to the
                         subclass of event-recording automata, where clock
                         resets are tied to observations. In order to advance
                         towards learning of general timed automata, we
                         generalize this method to a new class, called
                         reset-free event-recording automata, where some
                         transitions may reset no clocks. \par Central to our
                         contribution is the notion of invalidity, and the
                         algorithm and data structures to deal with it,
                         allowing on-the-fly detection and pruning of reset
                         hypotheses that contradict observations. This notion
                         is a key to any efficient active-learning procedure
                         for generic timed automata.},
}
[HJM22] Léo Henry, Thierry Jéron, and Nicolas Markey. Control strategies for off-line testing of timed systems. Formal Methods in System Design 60(2):147-194. Springer-Verlag, April 2022.
Abstract

Partial observability and controllability are two well-known issues in test-case synthesis for reactive systems. We address the problem of partial control in the synthesis of test cases from timed-automata specifications. We extend a previous approach to this problem from the untimed to the timed setting. This extension requires a deep reworking of the models, game interpretation and test-synthesis algorithms. We exhibit strategies of a game that try to minimize both cooperations of the system and distance to the satisfaction of a test purpose or to the next cooperation, and prove they are winning under some fairness assumptions. This entails that when turning those strategies into test cases, we get properties such as soundness and exhaustiveness of the test synthesis method. We finally propose a symbolic algorithm to compute those strategies.

@article{fmsd60(2)-HJM,
  author =              {Henry, L{\'e}o and J{\'e}ron, Thierry and Markey,
                         Nicolas},
  title =               {Control strategies for off-line testing of timed
                         systems},
  publisher =           {Springer-Verlag},
  journal =             {Formal Methods in System Design},
  volume =              {60},
  number =              {2},
  pages =               {147-194},
  year =                {2022},
  month =               apr,
  doi =                 {10.1007/s10703-022-00403-w},
  abstract =            {Partial observability and controllability are two
                         well-known issues in test-case synthesis for
                         reactive systems. We address the problem of partial
                         control in the synthesis of test cases from
                         timed-automata specifications. We extend a previous
                         approach to this problem from the untimed to the
                         timed setting. This extension requires a deep
                         reworking of the models, game interpretation and
                         test-synthesis algorithms. We exhibit strategies of
                         a game that try to minimize both cooperations of the
                         system and distance to the satisfaction of a test
                         purpose or to the next cooperation, and prove they
                         are winning under some fairness assumptions. This
                         entails that when turning those strategies into test
                         cases, we get properties such as soundness and
                         exhaustiveness of the test synthesis method. We
                         finally propose a symbolic algorithm to compute
                         those strategies.},
}
[HJM+04] Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, and Kenneth L. McMillan. Abstractions from Proofs. In POPL'04, pages 232-244. ACM Press, January 2004. 
@inproceedings{popl2004-HJMM,
  author =              {Henzinger, Thomas A. and Jhala, Ranjit and Majumdar,
                         Rupak and McMillan, Kenneth L.},
  title =               {Abstractions from Proofs},
  editor =              {Jones, Neil D. and Leroy, Xavier},
  booktitle =           {Conference Record of the 31st {ACM}
                         {SIGPLAN}-{SIGACT} {S}ymposium on {P}rinciples of
                         {P}rogramming {L}anguages ({POPL}'04)},
  acronym =             {{POPL}'04},
  publisher =           {ACM Press},
  pages =               {232-244},
  year =                {2004},
  month =               jan,
}
[HJM+02] Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, and Grégoire Sutre. Lazy abstraction. In POPL'02, ACM SIGPLAN Notices 37(1), pages 58-70. ACM Press, January 2002. 
@inproceedings{popl2002-HJMS,
  author =              {Henzinger, Thomas A. and Jhala, Ranjit and Majumdar,
                         Rupak and Sutre, Gr{\'e}goire},
  title =               {Lazy abstraction},
  booktitle =           {Conference Record of the 29th {ACM}
                         {SIGPLAN}-{SIGACT} {S}ymposium on {P}rinciples of
                         {P}rogramming {L}anguages ({POPL}'02)},
  acronym =             {{POPL}'02},
  publisher =           {ACM Press},
  series =              {ACM SIGPLAN Notices},
  volume =              {37},
  number =              {1},
  pages =               {58-70},
  year =                {2002},
  month =               jan,
}
[HJM+03] Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, and Grégoire Sutre. Software verification with BLAST. In SPIN'03, Lecture Notes in Computer Science 2648, pages 235-239. Springer-Verlag, April 2003. 
@inproceedings{spin2003-HJMS,
  author =              {Henzinger, Thomas A. and Jhala, Ranjit and Majumdar,
                         Rupak and Sutre, Gr{\'e}goire},
  title =               {Software verification with {BLAST}},
  editor =              {Ball, Thomas and Rajamani, Sriram},
  booktitle =           {{P}roceedings of the 10th {I}nternational {SPIN}
                         {W}orkshop ({SPIN}'03)},
  acronym =             {{SPIN}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2648},
  pages =               {235-239},
  year =                {2003},
  month =               apr,
}
[HJR02] Alan J. Hoffman, Kate Jenkins, and Tim Roughgarden. On a game in directed graphs. Information Processing Letters 83(1):13-16. Elsevier, July 2002. 
@article{ipl83(1)-HJR,
  author =              {Hoffman, Alan J. and Jenkins, Kate and Roughgarden,
                         Tim},
  title =               {On a game in directed graphs},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {83},
  number =              {1},
  pages =               {13-16},
  year =                {2002},
  month =               jul,
}
[vdH+05] Wiebe van der Hoek, Wojciech Jamroga, and Michael Wooldridge. A Logic for Strategic Reasoning. In AAMAS'05, pages 157-164. ACM Press, July 2005. 
@inproceedings{aamas2005-HJW,
  author =              {van der Hoek, Wiebe and Jamroga, Wojciech and
                         Wooldridge, Michael},
  title =               {A Logic for Strategic Reasoning},
  editor =              {Dignum, Franck and Dignum, Virginia and Koenig, Sven
                         and Kraus, Sarit and Singh, Munindar P. and
                         Wooldridge, Michael},
  booktitle =           {{P}roceedings of the 4th {I}nternational {J}oint
                         {C}onference on {A}utonomous {A}gents and
                         {M}ultiagent {S}ystems ({AAMAS}'05)},
  acronym =             {{AAMAS}'05},
  publisher =           {ACM Press},
  pages =               {157-164},
  year =                {2005},
  month =               jul,
}
[HK94] Joseph Y. Halpern and Bruce M. Kapron. Zero-one laws for modal logic. Annals of Pure and Applied Logic 69(2-3):157-193. Elsevier, October 1994. 
@article{apal69(2-3)-HK,
  author =              {Halpern, Joseph Y. and Kapron, Bruce M.},
  title =               {Zero-one laws for modal logic},
  publisher =           {Elsevier},
  journal =             {Annals of Pure and Applied Logic},
  volume =              {69},
  number =              {2-3},
  pages =               {157-193},
  year =                {1994},
  month =               oct,
}
[HK97] Thomas A. Henzinger and Orna Kupferman. From Quantity to Quality. In HART'97, Lecture Notes in Computer Science 1201, pages 48-62. Springer-Verlag, March 1997. 
@inproceedings{hart1997-HK,
  author =              {Henzinger, Thomas A. and Kupferman, Orna},
  title =               {From Quantity to Quality},
  editor =              {Maler, Oded},
  booktitle =           {{P}roceedings of the 1997 {I}nternational {W}orkshop
                         on {H}ybrid and {R}eal-Time {S}ystems ({HART}'97)},
  acronym =             {{HART}'97},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1201},
  pages =               {48-62},
  year =                {1997},
  month =               mar,
}
[HK99] Thomas A. Henzinger and Peter W. Kopke. Discrete-Time Control for Rectangular Hybrid Systems. Theoretical Computer Science 221(1-2):369-392. Elsevier, June 1999. 
@article{tcs221(1-2)-HK,
  author =              {Henzinger, Thomas A. and Kopke, Peter W.},
  title =               {Discrete-Time Control for Rectangular Hybrid
                         Systems},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {221},
  number =              {1-2},
  pages =               {369-392},
  year =                {1999},
  month =               jun,
}
[HK16] Loïc Hélouët and Karim Kecir. Realizability of Schedules by Stochastic Time Petri Nets with Blocking Semantics. In PETRI NETS'16, Lecture Notes in Computer Science 9698, pages 155-175. Springer-Verlag, June 2016. 
@inproceedings{pn2016-HK,
  author =              {H{\'e}lou{\"e}t, Lo{\"\i}c and Kecir, Karim},
  title =               {Realizability of Schedules by Stochastic Time
                         {P}etri Nets with Blocking Semantics},
  editor =              {Kordon, Fabrice and Moldt, Daniel},
  booktitle =           {{P}roceedings of the 37th {I}nternational
                         {C}onference on {A}pplications and {T}heory of
                         {P}etri Nets and {C}oncurrency ({PETRI NETS}'16)},
  acronym =             {{PETRI~NETS}'16},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9698},
  pages =               {155-175},
  year =                {2016},
  month =               jun,
  doi =                 {10.1007/978-3-319-39086-4_11},
}
[HK23] Émile Hazard and Denis Kuperberg. Explorable automata. In CSL'23, Leibniz International Proceedings in Informatics 252, pages 24:1-24:18. Leibniz-Zentrum für Informatik, February 2023. 
@inproceedings{csl2023-HK,
  author =              {Hazard, {\'E}mile and Kuperberg, Denis},
  title =               {Explorable automata},
  editor =              {Klin, Bartek and Pimentel, Elaine},
  booktitle =           {{P}roceedings of the 31st {EACSL} {A}nnual
                         {C}onference on {C}omputer {S}cience {L}ogic
                         ({CSL}'23)},
  acronym =             {{CSL}'23},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {252},
  pages =               {24:1-24:18},
  year =                {2023},
  month =               feb,
  doi =                 {10.4230/LIPIcs.CSL.2023.24},
}
[HKM03] Thomas A. Henzinger, Orna Kupferman, and Rupak Majumdar. On the Universal and Existential Fragments of the μ-Calculus. In TACAS'03, Lecture Notes in Computer Science 2619, pages 49-64. Springer-Verlag, April 2003. 
@inproceedings{tacas2003-HKM,
  author =              {Henzinger, Thomas A. and Kupferman, Orna and
                         Majumdar, Rupak},
  title =               {On the Universal and Existential Fragments of the
                         {\(\mu\)}-Calculus},
  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 =               {49-64},
  year =                {2003},
  month =               apr,
}
[HKN+06] Andrew Hinton, Marta Kwiatkowska, Gethin Norman, and David Parker. PRISM: A Tool for Automatic Verification of Probabilistic Systems. In TACAS'06, Lecture Notes in Computer Science 3920, pages 441-444. Springer-Verlag, March 2006. 
@inproceedings{tacas2006-HKNP,
  author =              {Hinton, Andrew and Kwiatkowska, Marta and Norman,
                         Gethin and Parker, David},
  title =               {{PRISM}: A~Tool for Automatic Verification of
                         Probabilistic Systems},
  editor =              {Hermanns, Holger and Palsberg, Jens},
  booktitle =           {{P}roceedings of the 12th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'06)},
  acronym =             {{TACAS}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3920},
  pages =               {441-444},
  year =                {2006},
  month =               mar,
}
[HKO+09] Christoph Haase, Stephan Kreutzer, Joël Ouaknine, and James Worrell. Reachability in Succinct and Parametric One-Counter Automata. In CONCUR'09, Lecture Notes in Computer Science 5710, pages 369-383. Springer-Verlag, September 2009. 
@inproceedings{concur2009-HKOW,
  author =              {Haase, Christoph and Kreutzer, Stephan and Ouaknine,
                         Jo{\"e}l and Worrell, James},
  title =               {Reachability in Succinct and Parametric One-Counter
                         Automata},
  editor =              {Bravetti, Mario and Zavattaro, Gianluigi},
  booktitle =           {{P}roceedings of the 20th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'09)},
  acronym =             {{CONCUR}'09},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5710},
  pages =               {369-383},
  year =                {2009},
  month =               sep,
  doi =                 {10.1007/978-3-642-04081-8_25},
}
[HKP82] David Harel, Dexter C. Kozen, and Rohit Parikh. Process Logic: Expressiveness, Decidability and Completeness. Journal of Computer and System Sciences 25(2):144-170. Academic Press, October 1982. 
@article{jcss25(2)-HKP,
  author =              {Harel, David and Kozen, Dexter C. and Parikh, Rohit},
  title =               {Process Logic: Expressiveness, Decidability and
                         Completeness},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {25},
  number =              {2},
  pages =               {144-170},
  year =                {1982},
  month =               oct,
}
[HKP+95] Thomas A. Henzinger, Peter W. Kopke, Anuj Puri, and Pravin Varaiya. What is decidable about Hybrid Automata?. In STOC'95, pages 373-382. ACM Press, May 1995. 
@inproceedings{stoc1995-HKPV,
  author =              {Henzinger, Thomas A. and Kopke, Peter W. and Puri,
                         Anuj and Varaiya, Pravin},
  title =               {What is decidable about Hybrid Automata?},
  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 =               {373-382},
  year =                {1995},
  month =               may,
}
[HKP+98] Thomas A. Henzinger, Peter W. Kopke, Anuj Puri, and Pravin Varaiya. What is decidable about Hybrid Automata?. Journal of Computer and System Sciences 57(1):94-124. Academic Press, August 1998. 
@article{jcss57(1)-HKPV,
  author =              {Henzinger, Thomas A. and Kopke, Peter W. and Puri,
                         Anuj and Varaiya, Pravin},
  title =               {What is decidable about Hybrid Automata?},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {57},
  number =              {1},
  pages =               {94-124},
  year =                {1998},
  month =               aug,
}
[HKS+11] Frédéric Herbreteau, Dileep Kini, B. Srivathsan, and Igor Walukiewicz. Using non-convex approximations for efficient analysis of timed automata. In FSTTCS'11, Leibniz International Proceedings in Informatics 13, pages 78-89. Leibniz-Zentrum für Informatik, December 2011. 
@inproceedings{fsttcs2011-HKSW,
  author =              {Herbreteau, Fr{\'e}d{\'e}ric and Kini, Dileep and
                         Srivathsan, B. and Walukiewicz, Igor},
  title =               {Using non-convex approximations for efficient
                         analysis of timed automata},
  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},
  pages =               {78-89},
  year =                {2011},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2011.78},
}
[HKT10] Michael Holtmann, łukasz Kaiser, and Wolfgang Thomas. Degrees of Lookahead in Regular Infinite Games. In FoSSaCS'10, Lecture Notes in Computer Science 6014, pages 252-266. Springer-Verlag, March 2010. 
@inproceedings{fossacs2010-HKT,
  author =              {Holtmann, Michael and Kaiser, {\L}ukasz and Thomas,
                         Wolfgang},
  title =               {Degrees of Lookahead in Regular Infinite Games},
  editor =              {Ong, Luke},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'10)},
  acronym =             {{FoSSaCS}'10},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6014},
  pages =               {252-266},
  year =                {2010},
  month =               mar,
}
[HKV96] Thomas A. Henzinger, Orna Kupferman, and Moshe Y. Vardi. A Space-Efficient On-the-fly Algorithm for Real-Time Model Checking. In CONCUR'96, Lecture Notes in Computer Science 1119, pages 514-529. Springer-Verlag, August 1996. 
@inproceedings{concur1996-HKV,
  author =              {Henzinger, Thomas A. and Kupferman, Orna and Vardi,
                         Moshe Y.},
  title =               {A Space-Efficient On-the-fly Algorithm for Real-Time
                         Model Checking},
  editor =              {Montanari, Ugo and Sassone, Vladimiro},
  booktitle =           {{P}roceedings of the 7th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'96)},
  acronym =             {{CONCUR}'96},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1119},
  pages =               {514-529},
  year =                {1996},
  month =               aug,
}
[HKW95] Thomas A. Henzinger, Peter W. Kopke, and Howard Wong-Toi. The expressive power of clocks. In ICALP'95, Lecture Notes in Computer Science 944, pages 417-428. Springer-Verlag, July 1995. 
@inproceedings{icalp1995-HKW,
  author =              {Henzinger, Thomas A. and Kopke, Peter W. and
                         Wong{-}Toi, Howard},
  title =               {The expressive power of clocks},
  editor =              {F{\"u}l{\"o}p, Zolt{\'a}n and Gecseg, Ferenc},
  booktitle =           {{P}roceedings of the 22nd {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'95)},
  acronym =             {{ICALP}'95},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {944},
  pages =               {417-428},
  year =                {1995},
  month =               jul,
}
[HL89] Hans Hüttel and Kim Guldstrand Larsen. The Use of Static Constructs in a Modal Process Logic. In Logic at Botik 89 – Proceedings of the Symposium on Logical Foundations of Computer Science, Lecture Notes in Computer Science 363, pages 163-180. Springer-Verlag, July 1989. 
@inproceedings{botik89-HL,
  author =              {H{\"u}ttel, Hans and Larsen, Kim Guldstrand},
  title =               {The Use of Static Constructs in a Modal Process
                         Logic},
  editor =              {Meyer, Albert R. and Taitslin, Michael A.},
  booktitle =           {{L}ogic at {B}otik~89 -- {P}roceedings of the
                         {S}ymposium on {L}ogical {F}oundations of {C}omputer
                         {S}cience},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {363},
  pages =               {163-180},
  year =                {1989},
  month =               jul,
}
[HL02] Martijn Hendriks and Kim Guldstrand Larsen. Exact Acceleration of real-Time Model Checking. In TPTS'02, Electronic Notes in Theoretical Computer Science 65(6). Elsevier, April 2002. 
@inproceedings{tpts2002-HL,
  author =              {Hendriks, Martijn and Larsen, Kim Guldstrand},
  title =               {Exact Acceleration of real-Time Model Checking},
  editor =              {Asarin, Eugene and Maler, Oded and Yovine, Sergio},
  booktitle =           {{P}roceedings of the 1st {W}orkshop on {T}heory and
                         {P}ractice of {T}imed {S}ystems ({TPTS}'02)},
  acronym =             {{TPTS}'02},
  publisher =           {Elsevier},
  series =              {Electronic Notes in Theoretical Computer Science},
  volume =              {65},
  number =              {6},
  year =                {2002},
  month =               apr,
}
[HLL+14] Henri Hansen, Shang-Wei Lin, Yang Liu, Truong Khanh Nguyen, and Jun Sun. Diamonds Are a Girl's Best Friend: Partial Order Reduction for Timed Automata with Abstractions. In CAV'14, Lecture Notes in Computer Science 8559, pages 391-406. Springer-Verlag, July 2014. 
@inproceedings{cav2014-HLLNS,
  author =              {Hansen, Henri and Lin, Shang{-}Wei and Liu, Yang and
                         Nguyen, Truong Khanh and Sun, Jun},
  title =               {Diamonds Are a Girl's Best Friend: Partial Order
                         Reduction for Timed Automata with Abstractions},
  editor =              {Biere, Armin and Bloem, Roderick},
  booktitle =           {{P}roceedings of the 26th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'14)},
  acronym =             {{CAV}'14},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8559},
  pages =               {391-406},
  year =                {2014},
  month =               jul,
  doi =                 {10.1007/978-3-319-08867-9_26},
}
[HLM+04] Thomas Hérault, Richard Lassaigne, Frédéric Magniette, and Sylvain Peyronnet. Approximate Probabilistic Model Checking. In VMCAI'04, Lecture Notes in Computer Science 2937, pages 73-84. Springer-Verlag, January 2004. 
@inproceedings{vmcai2004-HLMP,
  author =              {H{\'e}rault, {\relax Th}omas and Lassaigne, Richard
                         and Magniette, Fr{\'e}d{\'e}ric and Peyronnet,
                         Sylvain},
  title =               {Approximate Probabilistic Model Checking},
  editor =              {Steffen, Bernhard and Levi, Giorgio},
  booktitle =           {{P}roceedings of the 5th {I}nternational {W}orkshop
                         on {V}erification, {M}odel {C}hecking, and
                         {A}bstract {I}nterpretation ({VMCAI}'04)},
  acronym =             {{VMCAI}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2937},
  pages =               {73-84},
  year =                {2004},
  month =               jan,
}
[HLR+10] Holger Hermanns, Kim Guldstrand Larsen, Jean-François Raskin, and Jan Tretmans. Quantitative system validation in model driven design. In EMSOFT'10, pages 301-302. ACM Press, October 2010. 
@inproceedings{emsoft2010-HLRT,
  author =              {Hermanns, Holger and Larsen, Kim Guldstrand and
                         Raskin, Jean-Fran{\c c}ois and Tretmans, Jan},
  title =               {Quantitative system validation in model driven
                         design},
  editor =              {Carloni, Luca P. and Tripakis, Stavros},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {E}mbedded {S}oftware ({EMSOFT}'10)},
  acronym =             {{EMSOFT}'10},
  publisher =           {ACM Press},
  pages =               {301-302},
  year =                {2010},
  month =               oct,
}
[HLT22] Thomas A. Henzinger, Karoliina Lehtinen, and Patrick Totzke. History-deterministic timed automata. In CONCUR'22, Leibniz International Proceedings in Informatics 243, pages 14:1-14:21. Leibniz-Zentrum für Informatik, September 2022. 
@inproceedings{concur2022-HLT,
  author =              {Henzinger, Thomas A. and Lehtinen, Karoliina and
                         Totzke, Patrick},
  title =               {History-deterministic timed automata},
  editor =              {Klin, Bartek and Lasota, S{\l}awomir and Muscholl,
                         Anca},
  booktitle =           {{P}roceedings of the 33rd {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'22)},
  acronym =             {{CONCUR}'22},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {243},
  pages =               {14:1-14:21},
  year =                {2022},
  month =               sep,
  doi =                 {10.4230/LIPIcs.CONCUR.2022.14},
}
[vdH+06] Wiebe van der Hoek, Alessio Lomuscio, and Michael Wooldridge. On the Complexity of Practical ATL Model Checking. In AAMAS'06, pages 201-208. ACM Press, May 2006. 
@inproceedings{aamas2006-HLW,
  author =              {van der Hoek, Wiebe and Lomuscio, Alessio and
                         Wooldridge, Michael},
  title =               {On the Complexity of Practical {ATL} Model Checking},
  editor =              {Nakashima, Hideyuki and Wellman, Michael P. and
                         Weiss, Gerhard and Stone, Peter},
  booktitle =           {{P}roceedings of the 5th {I}nternational {J}oint
                         {C}onference on {A}utonomous {A}gents and
                         {M}ultiagent {S}ystems ({AAMAS}'06)},
  acronym =             {{AAMAS}'06},
  publisher =           {ACM Press},
  pages =               {201-208},
  year =                {2006},
  month =               may,
}
[HLW13] Andreas Herzig, Emiliano Lorini, and Dirk Walther. Reasoning about Actions Meets Strategic Logics. In LORI'13, Lecture Notes in Computer Science 8196, pages 162-175. Springer-Verlag, October 2013. 
@inproceedings{lori2013-HLW,
  author =              {Herzig, Andreas and Lorini, Emiliano and Walther,
                         Dirk},
  title =               {Reasoning about Actions Meets Strategic Logics},
  editor =              {Grossi, Davide and Roy, Olivier and Huang, Huaxin},
  booktitle =           {{P}roceedings of the 4th {W}orkshop on {L}ogic,
                         {R}ationality, and {I}nteraction ({LORI}'13)},
  acronym =             {{LORI}'13},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8196},
  pages =               {162-175},
  year =                {2013},
  month =               oct,
  doi =                 {10.1007/978-3-642-40948-6_13},
}
[HM85] Matthew C. B. Hennessy and Robin Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM 32(1). ACM Press, January 1985. 
@article{jacm32(1)-HM,
  author =              {Hennessy, Matthew C. B. and Milner, Robin},
  title =               {Algebraic laws for nondeterminism and concurrency},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {32},
  number =              {1},
  year =                {1985},
  month =               jan,
}
[HM03] Markus Holzer and Pierre McKenzie. Alternating and Empty Alternating Auxiliary Stack Automata. Theoretical Computer Science 299(1-3):307-326. Elsevier, April 2003. 
@article{tcs299(1-3)-HM,
  author =              {Holzer, Markus and McKenzie, Pierre},
  title =               {Alternating and Empty Alternating Auxiliary Stack
                         Automata},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {299},
  number =              {1-3},
  pages =               {307-326},
  year =                {2003},
  month =               apr,
}
[HvdM18] Xiaowei Huang and Ron van der Meyden. An Epistemic Strategy Logic. ACM Transactions on Computational Logic 19(4):26:1-26:45. ACM Press, December 2018. 
@article{tocl19(4)-HvdM,
  author =              {Huang, Xiaowei and van der Meyden, Ron},
  title =               {An Epistemic Strategy Logic},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Computational Logic},
  volume =              {19},
  number =              {4},
  pages =               {26:1-26:45},
  year =                {2018},
  month =               dec,
  doi =                 {10.1145/3233769},
}
[HM22] Bainian Hao and Carla Michini. Inefficiency of Pure Nash Equilibria in Series-Parallel Network Congestion Games. In WINE'22, Lecture Notes in Computer Science 13778, pages 3-20. Springer-Verlag, July 2022. 
@inproceedings{wine2022-HM,
  author =              {Hao, Bainian and Michini, Carla},
  title =               {Inefficiency of Pure Nash Equilibria in
                         Series-Parallel Network Congestion Games},
  editor =              {Hansen, Kristoffer Arnsfelt and Liu, Tracy Xiao and
                         Malekian, Azarakhsh},
  booktitle =           {{P}roceedings of the 18th {I}nternational
                         {C}onference on {W}eb and {I}nternet {E}conomics
                         ({WINE}'22)},
  acronym =             {{WINE}'22},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {13778},
  pages =               {3-20},
  year =                {2022},
  month =               jul,
  doi =                 {10.1007/978-3-031-22832-2_1},
}
[HMB07] Michael R. Hansen, Jan Madsen, and Aske Wiid Brekling. Semantics and Verification of a Language for Modelling Hardware Architectures. In Formal Methods and Hybrid Real-Time Systems, Essays in Honor of Dines Bjørner and Chaochen Zhou on the Occasion of Their 70th Birthdays, Lecture Notes in Computer Science 4700, pages 300-319. Springer-Verlag, September 2007. 
@inproceedings{BZbday07-HMB,
  author =              {Hansen, Michael R. and Madsen, Jan and Brekling,
                         Aske Wiid},
  title =               {Semantics and Verification of a Language for
                         Modelling Hardware Architectures},
  editor =              {Jones, Cliff B. and Liu, Zhiming and Woodcock, Jim},
  booktitle =           {Formal Methods and Hybrid Real-Time Systems, Essays
                         in Honor of Dines~Bj{\o}rner and Chaochen~Zhou on
                         the Occasion of Their 70th Birthdays},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4700},
  pages =               {300-319},
  year =                {2007},
  month =               sep,
  doi =                 {10.1007/978-3-540-75221-9_13},
}
[HMM18] Loïc Hélouët, Hervé Marchand, and John Mullins. Concurrent secrets with quantified suspicion. In ACSD'18, pages 75-84. IEEE Comp. Soc. Press, June 2018. 
@inproceedings{acsd2018-HMM,
  author =              {H{\'e}lou{\"e}t, Lo{\"\i}c and Marchand, Herv{\'e}
                         and Mullins, John},
  title =               {Concurrent secrets with quantified suspicion},
  editor =              {Chatain, {\relax Th}omas and Grosu, Radu and
                         Juh{\'a}s, Gabriel},
  booktitle =           {{P}roceedings of the 18th {I}nternational
                         {C}onference on {A}pplication of {C}oncurrency to
                         {S}ystem {D}esign ({ACSD}'18)},
  acronym =             {{ACSD}'18},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {75-84},
  year =                {2018},
  month =               jun,
  doi =                 {10.1109/ACSD.2018.00011},
}
[HMP92] Thomas A. Henzinger, Zohar Manna, and Amir Pnueli. What Good are Digital Clocks?. In ICALP'92, Lecture Notes in Computer Science 623, pages 545-558. Springer-Verlag, July 1992. 
@inproceedings{icalp1992-HMP,
  author =              {Henzinger, Thomas A. and Manna, Zohar and Pnueli,
                         Amir},
  title =               {What Good are Digital Clocks?},
  editor =              {Kuich, Werner},
  booktitle =           {{P}roceedings of the 19th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'92)},
  acronym =             {{ICALP}'92},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {623},
  pages =               {545-558},
  year =                {1992},
  month =               jul,
}
[HMP92] Thomas A. Henzinger, Zohar Manna, and Amir Pnueli. Timed Transition Systems. In REX'91, Lecture Notes in Computer Science 600, pages 226-251. Springer-Verlag, 1992. 
@inproceedings{rex1991-HMP,
  author =              {Henzinger, Thomas A. and Manna, Zohar and Pnueli,
                         Amir},
  title =               {Timed Transition Systems},
  editor =              {de~Bakker, Jaco W. and Huizing, Cornelis and de
                         Roever, Willem-Paul and Rozenberg, Grzegorz},
  booktitle =           {{R}eal-{T}ime: {T}heory in {P}ractice, {P}roceedings
                         of {REX} {W}orkshop~1991 ({REX}'91)},
  acronym =             {{REX}'91},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {600},
  pages =               {226-251},
  year =                {1992},
  confyear =            {1991},
  confmonth =           {6},
}
[HMP93] Thomas A. Henzinger, Zohar Manna, and Amir Pnueli. Towards Refining Temporal Specifications into Hybrid Systems. In HSCC'92, Lecture Notes in Computer Science 736, pages 60-76. Springer-Verlag, 1993. 
@inproceedings{hscc1992-HMP,
  author =              {Henzinger, Thomas A. and Manna, Zohar and Pnueli,
                         Amir},
  title =               {Towards Refining Temporal Specifications into Hybrid
                         Systems},
  editor =              {Grossman, Robert L. and Nerode, Anil and Ravn,
                         Anders P. and Rischel, Hans},
  booktitle =           {{H}ybrid {S}ystems ({HSCC}'92)},
  acronym =             {{HSCC}'92},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {736},
  pages =               {60-76},
  year =                {1993},
}
[HMP94] Thomas A. Henzinger, Zohar Manna, and Amir Pnueli. Temporal Proof Methodologies for Timed Transition Systems. Information and Computation 112(2):273-337. Academic Press, August 1994. 
@article{icomp112(2)-HMP,
  author =              {Henzinger, Thomas A. and Manna, Zohar and Pnueli,
                         Amir},
  title =               {Temporal Proof Methodologies for Timed Transition
                         Systems},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {112},
  number =              {2},
  pages =               {273-337},
  year =                {1994},
  month =               aug,
}
[HMP05] Thomas A. Henzinger, Rupak Majumdar, and Vinayak S. Prabhu. Quantifying Similarities Between Timed Systems. In FORMATS'05, Lecture Notes in Computer Science 3829, pages 226-241. Springer-Verlag, September 2005. 
@inproceedings{formats2005-HMP,
  author =              {Henzinger, Thomas A. and Majumdar, Rupak and Prabhu,
                         Vinayak S.},
  title =               {Quantifying Similarities Between Timed Systems},
  editor =              {Pettersson, Paul and Yi, Wang},
  booktitle =           {{P}roceedings of the 3rd {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'05)},
  acronym =             {{FORMATS}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3829},
  pages =               {226-241},
  year =                {2005},
  month =               sep,
}
[HMR19] Loïc Hélouët, Nicolas Markey, and Ritam Raha. Reachability games with relaxed energy constraints. In GandALF'19, Electronic Proceedings in Theoretical Computer Science 305, pages 17-33. September 2019.
Abstract

We study games with reachability objectives under energy constraints. We first prove that under strict energy constraints (either only lower-bound constraint or interval constraint), those games are LOGSPACE-equivalent to energy games with the same energy constraints but without reachability objective (i.e., for infinite runs). We then consider two kinds of relaxations of the upper-bound constraints (while keeping the lower-bound constraint strict): in the first one, called weak upper bound, the upper bound is absorbing, in the sense that it allows receiving more energy when the upper bound is already reached, but the extra energy will not be stored; in the second one, we allow for temporary violations of the upper bound, imposing limits on the number or on the amount of violations.

We prove that when considering weak upper bound, reachability objectives require memory, but can still be solved in polynomial-time for one-player arenas; we prove that they are in coNP in the two-player setting. Allowing for bounded violations makes the problem PSPACE-complete for one-player arenas and EXPTIME-complete for two players.

@inproceedings{gandalf2019-HMR,
  author =              {H{\'e}lou{\"e}t, Lo{\"\i}c and Markey, Nicolas and
                         Raha, Ritam},
  title =               {Reachability games with relaxed energy constraints},
  editor =              {Leroux, J{\'e}r{\^o}me and Raskin, Jean-Fran{\c
                         c}ois},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {S}ymposium on {G}ames, {A}utomata, {L}ogics and
                         {F}ormal {V}erification ({GandALF}'19)},
  acronym =             {{GandALF}'19},
  series =              {Electronic Proceedings in Theoretical Computer
                         Science},
  volume =              {305},
  pages =               {17-33},
  year =                {2019},
  month =               sep,
  doi =                 {10.4204/EPTCS.305.2},
  abstract =            {We study games with reachability objectives under
                         energy constraints. We first prove that under strict
                         energy constraints (either only lower-bound
                         constraint or interval constraint), those games are
                         \textsf{LOGSPACE}-equivalent to energy games with
                         the same energy constraints but without reachability
                         objective (i.e., for infinite runs). We then
                         consider two kinds of relaxations of the upper-bound
                         constraints (while keeping the lower-bound
                         constraint strict): in the first one, called
                         \emph{weak upper bound}, the upper bound is
                         \emph{absorbing}, in the sense that it allows
                         receiving more energy when the upper bound is
                         already reached, but the extra energy will not be
                         stored; in~the second~one, we~allow for
                         \emph{temporary violations} of the upper bound,
                         imposing limits on the number or on the amount of
                         violations.\par We prove that when considering weak
                         upper bound, reachability objectives require memory,
                         but can still be solved in polynomial-time for
                         one-player arenas; we prove that they are in
                         \textsf{coNP} in the two-player setting. Allowing
                         for bounded violations makes the problem
                         \textsf{PSPACE}-complete for one-player arenas and
                         \textsf{EXPTIME}-complete for two players.},
}
[HMR22] Loïc Hélouët, Nicolas Markey, and Ritam Raha. Reachability games with relaxed energy constraints. Information and Computation 285 (Part B). Elsevier, May 2022.
Abstract

We study games with reachability objectives under energy constraints. We first prove that under strict energy constraints (either only lower-bound constraint or interval constraint), those games are LOGSPACE-equivalent to energy games with the same energy constraints but without reachability objective (i.e., for infinite runs). We then consider two relaxations of the upper-bound constraints (while keeping the lower-bound constraint strict): in the first one, called weak upper bound, the upper bound is absorbing, i.e., when the upper bound is reached, the extra energy is not stored; in the second one, we allow for temporary violations of the upper bound, imposing limits on the number or on the amount of violations.

We prove that when considering weak upper bound, reachability objectives require memory, but can still be solved in polynomial-time for one-player arenas; we prove that they are in NP in the two-player setting. Allowing for bounded violations makes the problem PSPACE-complete for one-player arenas and EXPTIME-complete for two players. We then address the problem of existence of bounds for a given arena. We show that with reachability objectives, existence can be a simpler problem than the game itself, and conversely that with infinite games, existence can be harder.

@article{icomp2022-HMR,
  author =              {H{\'e}lou{\"e}t, Lo{\"\i}c and Markey, Nicolas and
                         Raha, Ritam},
  title =               {Reachability games with relaxed energy constraints},
  publisher =           {Elsevier},
  journal =             {Information and Computation},
  volume =              {285~(Part~B)},
  year =                {2022},
  month =               may,
  doi =                 {10.1016/j.ic.2021.104806},
  abstract =            {We study games with reachability objectives under
                         energy constraints. We first prove that under strict
                         energy constraints (either only lower-bound
                         constraint or interval constraint), those games are
                         LOGSPACE-equivalent to energy games with the same
                         energy constraints but without reachability
                         objective (i.e., for infinite runs). We then
                         consider two relaxations of the upper-bound
                         constraints (while keeping the lower-bound
                         constraint strict): in the first one, called weak
                         upper bound, the upper bound is absorbing, i.e.,
                         when the upper bound is reached, the extra energy is
                         not stored; in the second one, we allow for
                         temporary violations of the upper bound, imposing
                         limits on the number or on the amount of violations.
                         \par We prove that when considering weak upper
                         bound, reachability objectives require memory, but
                         can still be solved in polynomial-time for
                         one-player arenas; we prove that they are in NP in
                         the two-player setting. Allowing for bounded
                         violations makes the problem PSPACE-complete for
                         one-player arenas and EXPTIME-complete for two
                         players. We then address the problem of existence of
                         bounds for a given arena. We show that with
                         reachability objectives, existence can be a simpler
                         problem than the game itself, and conversely that
                         with infinite games, existence can be harder.},
}
[HMR+11] Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, and Shang-Hua Teng. Competitive routing over time. Theoretical Computer Science 412(39):5420-5432. Elsevier, September 2011. 
@article{tcs412(39)-HMRT,
  author =              {Hoefer, Martin and Mirrokni, Vahab S. and
                         R{\"{o}}glin, Heiko and Teng, Shang-Hua},
  title =               {Competitive routing over time},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {412},
  number =              {39},
  pages =               {5420-5432},
  year =                {2011},
  month =               sep,
  doi =                 {10.1016/j.tcs.2011.05.055},
}
[HMU01] John Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. Introduction to Automata Theory, Languages, and Computation. Pearson, 2001. 
@book{HMU01-IATLC,
  author =              {Hopcroft, John and Motwani, Rajeev and Ullman,
                         Jeffrey D.},
  title =               {Introduction to Automata Theory, Languages, and
                         Computation},
  publisher =           {Pearson},
  year =                {2001},
}
[HNR68] Peter E. Hart, Nils J. Nilsson, and Bertram Raphael. A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics 4(2):100-107. IEEE, July 1968. 
@article{tssc4(2)-HNR,
  author =              {Hart, Peter E. and Nilsson, Nils J. and Raphael,
                         Bertram},
  title =               {A~Formal Basis for the Heuristic Determination of
                         Minimum Cost Paths},
  publisher =           {IEEE},
  journal =             {IEEE Transactions on Systems Science and
                         Cybernetics},
  volume =              {4},
  number =              {2},
  pages =               {100-107},
  year =                {1968},
  month =               jul,
  doi =                 {10.1109/TSSC.1968.300136},
}
[HNR72] Peter E. Hart, Nils J. Nilsson, and Bertram Raphael. Correction to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths". SIGACT News 37:28-29. ACM Press, December 1972. 
@article{sigart-news37()-HNR,
  author =              {Hart, Peter E. and Nilsson, Nils J. and Raphael,
                         Bertram},
  title =               {Correction to {"}A~Formal Basis for the Heuristic
                         Determination of Minimum Cost Paths{"}},
  publisher =           {ACM Press},
  journal =             {SIGACT News},
  volume =              {37},
  pages =               {28-29},
  year =                {1972},
  month =               dec,
  doi =                 {10.1145/1056777.1056779},
}
[HNS+94] Thomas A. Henzinger, Xavier Nicollin, Joseph Sifakis, and Sergio Yovine. Symbolic Model Checking for Real Time Systems. Information and Computation 111(2):193-244. Academic Press, June 1994. 
@article{icomp111(2)-HNSY,
  author =              {Henzinger, Thomas A. and Nicollin, Xavier and
                         Sifakis, Joseph and Yovine, Sergio},
  title =               {Symbolic Model Checking for Real Time Systems},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {111},
  number =              {2},
  pages =               {193-244},
  year =                {1994},
  month =               jun,
}
[HvdN+06] Martijn Hendriks, Barend van den Nieuwelaar, and Frits Vaandrager. Model checker aided design of a controller for a wafer scanner. International Journal on Software Tools for Technology Transfer 8(6):633-647. Springer-Verlag, November 2006. 
@article{sttt8(6)-HVN,
  author =              {Hendriks, Martijn and van den Nieuwelaar, Barend and
                         Vaandrager, Frits},
  title =               {Model checker aided design of a controller for a
                         wafer scanner},
  publisher =           {Springer-Verlag},
  journal =             {International Journal on Software Tools for
                         Technology Transfer},
  volume =              {8},
  number =              {6},
  pages =               {633-647},
  year =                {2006},
  month =               nov,
}
[HO13] Thomas A. Henzinger and Jan Otop. From Model Checking to Model Measuring. In CONCUR'13, Lecture Notes in Computer Science 8052, pages 273-287. Springer-Verlag, August 2013. 
@inproceedings{concur2013-HO,
  author =              {Henzinger, Thomas A. and Otop, Jan},
  title =               {From Model Checking to Model Measuring},
  editor =              {D{'}Argenio, Pedro R. and Melgratt, Hern{\'a}n C.},
  booktitle =           {{P}roceedings of the 24th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'13)},
  acronym =             {{CONCUR}'13},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8052},
  pages =               {273-287},
  year =                {2013},
  month =               aug,
  doi =                 {10.1007/978-3-642-40184-8_20},
}
[Hoa69] Charles Antony Richard Hoare. An axiomatic basis for computer programming. Communications of the ACM 12(10):576-580. ACM Press, October 1969. 
@article{cacm12(10)-Hoa,
  author =              {Hoare, Charles Antony Richard},
  title =               {An axiomatic basis for computer programming},
  publisher =           {ACM Press},
  journal =             {Communications of the ACM},
  volume =              {12},
  number =              {10},
  pages =               {576-580},
  year =                {1969},
  month =               oct,
  doi =                 {10.1145/363235.363259},
}
[Hoa80] Charles Antony Richard Hoare. A Model for Communicating Sequential Processes. In R. M. McKeag and A. M. MacNaghten (eds.), On the Construction of Programs – An advanced course. Cambridge University Press, 1980. 
@incollection{CPAC-CSP-Hoare,
  author =              {Hoare, Charles Antony Richard},
  title =               {A Model for Communicating Sequential Processes},
  editor =              {McKeag, R. M. and MacNaghten, A. M.},
  booktitle =           {On the Construction of Programs~-- An advanced
                         course},
  publisher =           {Cambridge University Press},
  pages =               {229-254},
  year =                {1980},
}
[Hol97] Gerard J. Holzmann. The Model Checker SPIN. IEEE Transactions on Software Engineering 23(5):279-295. IEEE Comp. Soc. Press, May 1997. 
@article{tse23(5)-Hol,
  author =              {Holzmann, Gerard J.},
  title =               {The Model Checker {SPIN}},
  publisher =           {IEEE Comp. Soc. Press},
  journal =             {IEEE Transactions on Software Engineering},
  volume =              {23},
  number =              {5},
  pages =               {279-295},
  year =                {1997},
  month =               may,
}
[Hor45] Robert E. Horton. Erosional development of streams and their drainage basins; hydrophysical approach to quantitative morphology. Geological Society of America Bulletin 56(3):275-370. Geological Society of America, March 1945. 
@article{gsab56(3)-Hor,
  author =              {Horton, Robert E.},
  title =               {Erosional development of streams and their drainage
                         basins; hydrophysical approach to quantitative
                         morphology},
  publisher =           {Geological Society of America},
  journal =             {Geological Society of America Bulletin},
  volume =              {56},
  number =              {3},
  pages =               {275-370},
  year =                {1945},
  month =               mar,
  doi =                 {10.1130/0016-7606(1945)56[275:EDOSAT]2.0.CO;2},
}
[Hor05] Florian Horn. Streett Games on Finite Graphs. In GDV'05. July 2005. 
@inproceedings{gdv2005-Horn,
  author =              {Horn, Florian},
  title =               {{S}treett Games on Finite Graphs},
  editor =              {Jurdzi{\'n}ski, Marcin and Majumdar, Rupak},
  booktitle =           {{P}roceedings of the 2nd {W}orkshop on {G}ames in
                         {D}esign and {V}erification ({GDV}'05)},
  acronym =             {{GDV}'05},
  year =                {2005},
  month =               jul,
}
[HOW13] Paul Hunter, Joël Ouaknine, and James Worrell. Expressive Completeness for Metric Temporal Logic. In LICS'13, pages 349-357. IEEE Comp. Soc. Press, June 2013. 
@inproceedings{lics2013-HOW,
  author =              {Hunter, Paul and Ouaknine, Jo{\"e}l and Worrell,
                         James},
  title =               {Expressive Completeness for Metric Temporal Logic},
  booktitle =           {{P}roceedings of the 28th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'13)},
  acronym =             {{LICS}'13},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {349-357},
  year =                {2013},
  month =               jun,
  doi =                 {10.1109/LICS.2013.41},
}
[HP85] David Harel and David Peleg. Process Logic with Regular Formulas. Theoretical Computer Science 38:307-322. Elsevier, 1985. 
@article{tcs38()-HP,
  author =              {Harel, David and Peleg, David},
  title =               {Process Logic with Regular Formulas},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {38},
  pages =               {307-322},
  year =                {1985},
}
[HP06] Thomas A. Henzinger and Vinayak S. Prabhu. Timed Alternating-Time Temporal Logic. In FORMATS'06, Lecture Notes in Computer Science 4202, pages 1-17. Springer-Verlag, September 2006. 
@inproceedings{formats2006-HP,
  author =              {Henzinger, Thomas A. and Prabhu, Vinayak S.},
  title =               {Timed Alternating-Time Temporal Logic},
  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 =               {1-17},
  year =                {2006},
  month =               sep,
}
[HP06] Thomas A. Henzinger and Nir Piterman. Solving Games without Determinization. In CSL'06, Lecture Notes in Computer Science 4207, pages 395-410. Springer-Verlag, September 2006. 
@inproceedings{csl2006-HP,
  author =              {Henzinger, Thomas A. and Piterman, Nir},
  title =               {Solving Games without Determinization},
  editor =              {{\'E}sik, Zolt{\'a}n},
  booktitle =           {{P}roceedings of the 20th {I}nternational {W}orkshop
                         on {C}omputer {S}cience {L}ogic ({CSL}'06)},
  acronym =             {{CSL}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4207},
  pages =               {395-410},
  year =                {2006},
  month =               sep,
  doi =                 {10.1007/11874683_26},
}
[HPV99] Michel Habib, Christophe Paul, and Laurent Viennot. Partition Refinement Techniques: An Interesting Algorithmic Tool Kit. International Journal of Foundations of Computer Science 10(2):147,170. June 1999. 
@article{ijfcs10(2)-HPV,
  author =              {Habib, Michel and Paul, {\relax Ch}ristophe and
                         Viennot, Laurent},
  title =               {Partition Refinement Techniques: An Interesting
                         Algorithmic Tool Kit},
  journal =             {International Journal of Foundations of Computer
                         Science},
  volume =              {10},
  number =              {2},
  pages =               {147,170},
  year =                {1999},
  month =               jun,
}
[HQR98] Thomas A. Henzinger, Shaz Qadeer, and Sriram Rajamani. You Assume, We Guarantee: Methodology and Case Studies. In CAV'98, Lecture Notes in Computer Science 1427, pages 440-451. Springer-Verlag, June 1998. 
@inproceedings{cav1998-HQR,
  author =              {Henzinger, Thomas A. and Qadeer, Shaz and Rajamani,
                         Sriram},
  title =               {You Assume, We Guarantee: Methodology and Case
                         Studies},
  editor =              {Hu, Alan J. and Vardi, Moshe Y.},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'98)},
  acronym =             {{CAV}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1427},
  pages =               {440-451},
  year =                {1998},
  month =               jun,
}
[HR99] Yoram Hirshfeld and Alexander Rabinovich. Quantitative Temporal Logic. In CSL'99, Lecture Notes in Computer Science 1862, pages 172-187. Springer-Verlag, September 1999. 
@inproceedings{csl1999-HR,
  author =              {Hirshfeld, Yoram and Rabinovich, Alexander},
  title =               {Quantitative Temporal Logic},
  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 =               {172-187},
  year =                {1999},
  month =               sep,
}
[HR00] Thomas A. Henzinger and Jean-François Raskin. Robust Undecidability of Timed and Hybrid Systems. In HSCC'00, Lecture Notes in Computer Science 1790, pages 145-159. Springer-Verlag, March 2000. 
@inproceedings{hscc2000-HR,
  author =              {Henzinger, Thomas A. and Raskin, Jean-Fran{\c c}ois},
  title =               {Robust Undecidability of Timed and Hybrid Systems},
  editor =              {Lynch, Nancy and Krogh, Bruce H.},
  booktitle =           {{P}roceedings of the 3rd {I}nternational {W}orkshop
                         on {H}ybrid {S}ystems: {C}omputation and {C}ontrol
                         ({HSCC}'00)},
  acronym =             {{HSCC}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1790},
  pages =               {145-159},
  year =                {2000},
  month =               mar,
  doi =                 {10.1007/3-540-46430-1_15},
}
[HR02] Klaus Havelund and Grigore Roşu. Synthesizing monitors for safety properties. In TACAS'02, Lecture Notes in Computer Science 2280, pages 342-356. Springer-Verlag, April 2002. 
@inproceedings{tacas2002-HR,
  author =              {Havelund, Klaus and Ro{\c{s}}u, Grigore},
  title =               {Synthesizing monitors for safety properties},
  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 =               {342-356},
  year =                {2002},
  month =               apr,
}
[HR03] Yoram Hirshfeld and Alexander Rabinovich. Future Temporal Logic Needs Infinitely Many Modalities. Information and Computation 187(2):196-208. Academic Press, December 2003. 
@article{icomp187(2)-HR,
  author =              {Hirshfeld, Yoram and Rabinovich, Alexander},
  title =               {Future Temporal Logic Needs Infinitely Many
                         Modalities},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {187},
  number =              {2},
  pages =               {196-208},
  year =                {2003},
  month =               dec,
}
[HR04] Yoram Hirshfeld and Alexander Rabinovich. Logics for Real Time: Decidability and Complexity. Fundamenta Informaticae 62(1):1-28. IOS Press, 2004. 
@article{fi62(1)-HR,
  author =              {Hirshfeld, Yoram and Rabinovich, Alexander},
  title =               {Logics for Real Time: Decidability and Complexity},
  publisher =           {IOS Press},
  journal =             {Fundamenta Informaticae},
  volume =              {62},
  number =              {1},
  pages =               {1-28},
  year =                {2004},
}
[HR04] Michael Huth and Mark D. Ryan. Logic in Computer Science. Cambridge University Press, August 2004. 
@book{lics-HR,
  author =              {Huth, Michael and Ryan, Mark D.},
  title =               {Logic in Computer Science},
  publisher =           {Cambridge University Press},
  year =                {2004},
  month =               aug,
}
[HR05] Yoram Hirshfeld and Alexander Rabinovich. Timer Formulas and Decidable Metric Temporal Logic. Information and Computation 198(2):148-178. Academic Press, May 2005. 
@article{icomp198(2)-HR,
  author =              {Hirshfeld, Yoram and Rabinovich, Alexander},
  title =               {Timer Formulas and Decidable Metric Temporal Logic},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {198},
  number =              {2},
  pages =               {148-178},
  year =                {2005},
  month =               may,
  doi =                 {10.1016/j.ic.2004.12.002},
}
[HR05] Ian Hodkinson and Mark Reynolds. Separation – Past, Present, and Future. In Sergei N. Artemov, Howard Barringer, Artur S. d'Avila Garcez, Luís C. Lamb, and John Woods (eds.), We Will Show Them – Essays in Honour of Dov Gabbay. College Publications, 2005. 
@incollection{wwst2005b-HR,
  author =              {Hodkinson, Ian and Reynolds, Mark},
  title =               {Separation~-- Past, Present, and Future},
  editor =              {Artemov, Sergei N. and Barringer, Howard and d'Avila
                         Garcez, Artur S. and Lamb, Lu{\'\i}s C. and Woods,
                         John},
  booktitle =           {We Will Show Them~-- Essays in Honour of
                         {D}ov~{G}abbay},
  publisher =           {College Publications},
  volume =              {2},
  pages =               {117-142},
  year =                {2005},
}
[HR06] Yoram Hirshfeld and Alexander Rabinovich. An Expressive Temporal Logic for Real Time. In MFCS'06, Lecture Notes in Computer Science 4162, pages 492-504. Springer-Verlag, August 2006. 
@inproceedings{mfcs2006-HR,
  author =              {Hirshfeld, Yoram and Rabinovich, Alexander},
  title =               {An Expressive Temporal Logic for Real Time},
  editor =              {Kr{\'a}lovi{\v{c}}, Rastislav and Urzyczyn, Pawel},
  booktitle =           {{P}roceedings of the 31st {I}nternational
                         {S}ymposium on {M}athematical {F}oundations of
                         {C}omputer {S}cience ({MFCS}'06)},
  acronym =             {{MFCS}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4162},
  pages =               {492-504},
  year =                {2006},
  month =               aug,
}
[HR07] Yoram Hirshfeld and Alexander Rabinovich. Expressiveness of Metric modalities for continuous time. Logical Methods in Computer Science 3(1). March 2007. 
@article{lmcs3(1)-HR,
  author =              {Hirshfeld, Yoram and Rabinovich, Alexander},
  title =               {Expressiveness of Metric modalities for continuous
                         time},
  journal =             {Logical Methods in Computer Science},
  volume =              {3},
  number =              {1},
  year =                {2007},
  month =               mar,
  doi =                 {10.2168/LMCS-3(1:3)2007},
}
[HR08] Yoram Hirshfeld and Alexander Rabinovich. Decidable Metric Logics. Information and Computation 206(12):1425-1442. Elsevier, December 2008. 
@article{icomp206(12)-HR,
  author =              {Hirshfeld, Yoram and Rabinovich, Alexander},
  title =               {Decidable Metric Logics},
  publisher =           {Elsevier},
  journal =             {Information and Computation},
  volume =              {206},
  number =              {12},
  pages =               {1425-1442},
  year =                {2008},
  month =               dec,
  doi =                 {10.1016/j.ic.2008.08.004},
}
[HR14] Paul Hunter and Jean-François Raskin. Quantitative games with interval objectives. In FSTTCS'14, Leibniz International Proceedings in Informatics 29, pages 365-377. Leibniz-Zentrum für Informatik, December 2014. 
@inproceedings{fsttcs2014-HR,
  author =              {Hunter, Paul and Raskin, Jean-Fran{\c c}ois},
  title =               {Quantitative games with interval objectives},
  editor =              {Raman, Venkatesh and Suresh, S. P.},
  booktitle =           {{P}roceedings of the 34th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'14)},
  acronym =             {{FSTTCS}'14},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {29},
  pages =               {365-377},
  year =                {2014},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2014.365},
}
[HRS98] Thomas A. Henzinger, Jean-François Raskin, and Pierre-Yves Schobbens. The Regular Real-Time Languages. In ICALP'98, Lecture Notes in Computer Science 1443, pages 580-591. Springer-Verlag, July 1998. 
@inproceedings{icalp1998-HRS,
  author =              {Henzinger, Thomas A. and Raskin, Jean-Fran{\c c}ois
                         and Schobbens, Pierre-Yves},
  title =               {The Regular Real-Time Languages},
  editor =              {Larsen, Kim Guldstrand and Skyum, Sven and Winskel,
                         Glynn},
  booktitle =           {{P}roceedings of the 25th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'98)},
  acronym =             {{ICALP}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1443},
  pages =               {580-591},
  year =                {1998},
  month =               jul,
}
[HRS02] Aidan Harding, Mark D. Ryan, and Pierre-Yves Schobbens. Approximating ATL* in ATL (Extended Abstract). In VMCAI'02, Lecture Notes in Computer Science 2294, pages 289-301. Springer-Verlag, January 2002. 
@inproceedings{vmcai2002-HRS,
  author =              {Harding, Aidan and Ryan, Mark D. and Schobbens,
                         Pierre-Yves},
  title =               {Approximating {ATL}{\(^*\)} in~{ATL} (Extended
                         Abstract)},
  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 =               {289-301},
  year =                {2002},
  month =               jan,
}
[HRS03] Aidan Harding, Mark D. Ryan, and Pierre-Yves Schobbens. Towards Symbolic Strategy Synthesis for ⟨⟨A⟩⟩-LTL. In TIME-ICTL'03, pages 137-146. IEEE Comp. Soc. Press, July 2003. 
@inproceedings{time2003-HRS,
  author =              {Harding, Aidan and Ryan, Mark D. and Schobbens,
                         Pierre-Yves},
  title =               {Towards Symbolic Strategy Synthesis for
  {\(\langle\)\,\llap{\(\langle\)}A\(\rangle\)\,\llap{\(\rangle\)}}-{LTL}},
  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 =               {137-146},
  year =                {2003},
  month =               jul,
}
[HRS05] Aidan Harding, Mark D. Ryan, and Pierre-Yves Schobbens. A New Algorithm for Strategy Synthesis in LTL Games. In TACAS'05, Lecture Notes in Computer Science 3440, pages 477-492. Springer-Verlag, April 2005. 
@inproceedings{tacas2005-HRS,
  author =              {Harding, Aidan and Ryan, Mark D. and Schobbens,
                         Pierre-Yves},
  title =               {A New Algorithm for Strategy Synthesis in {LTL}
                         Games},
  editor =              {Halbwachs, Nicolas and Zuck, Lenore D.},
  booktitle =           {{P}roceedings of the 11th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'05)},
  acronym =             {{TACAS}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3440},
  pages =               {477-492},
  year =                {2005},
  month =               apr,
}
[HRS+02] Thomas Hune, Judi Romijn, Mariëlle Stoelinga, and Frits Vaandrager. Linear parametric model checking of timed automata. Journal of Logic and Algebraic Programming 52-53:183-220. Elsevier, June 2002. 
@article{jlap52-53-hrsv,
  author =              {Hune, Thomas and Romijn, Judi and Stoelinga,
                         Mari{\"e}lle and Vaandrager, Frits},
  title =               {Linear parametric model checking of timed automata},
  publisher =           {Elsevier},
  journal =             {Journal of Logic and Algebraic Programming},
  volume =              {52-53},
  pages =               {183-220},
  year =                {2002},
  month =               jun,
}
[HS89] Jaakko Hintikka and Gabriel Sandu. Informational Independence as a Semantical Phenomenon. In Proceedings of the 8th International Congress of Logic, Methodology and Philosophy of Science, Studies in Logic and the Foundations of Mathematics 70, pages 571-589. North-Holland, January 1989. 
@inproceedings{iclmps1989-HS,
  author =              {Hintikka, Jaakko and Sandu, Gabriel},
  title =               {Informational Independence as a Semantical
                         Phenomenon},
  editor =              {Fenstad, Jens Erik and Frolov, Ivan T. and
                         Hilppinen, Risto},
  booktitle =           {{P}roceedings of the 8th {I}nternational {C}ongress
                         of {L}ogic, {M}ethodology and {P}hilosophy of
                         {S}cience},
  publisher =           {North-Holland},
  series =              {Studies in Logic and the Foundations of Mathematics},
  volume =              {70},
  pages =               {571-589},
  year =                {1989},
  month =               jan,
  doi =                 {10.1016/S0049-237X(08)70066-1},
}
[HS91] Joseph Y. Halpern and Yoav Shoham. A Propositional Modal Logic of Time Intervals. Journal of the ACM 38(4):935-962. ACM Press, October 1991. 
@article{jacm38(4)-HS,
  author =              {Halpern, Joseph Y. and Shoham, Yoav},
  title =               {A Propositional Modal Logic of Time Intervals},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {38},
  number =              {4},
  pages =               {935-962},
  year =                {1991},
  month =               oct,
}
[HS96] Klaus Havelund and Natarajan Shankar. Experiments in Theorem Proving and Model Checking for Protocol Verification. In FME'96, Lecture Notes in Computer Science 1051, pages 662-681. Springer-Verlag, March 1996. 
@inproceedings{fme1996-HS,
  author =              {Havelund, Klaus and Shankar, Natarajan},
  title =               {Experiments in Theorem Proving and Model Checking
                         for Protocol Verification},
  editor =              {Gaudel, Marie-Claude and Woodcock, Jim},
  booktitle =           {Industrial Benefit and Advances in Formal
                         Methods~--- {P}roceedings of the 3rd {I}nternational
                         {S}ymposium of {F}ormal {M}ethods {E}urope
                         ({FME}'96)},
  acronym =             {{FME}'96},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1051},
  pages =               {662-681},
  year =                {1996},
  month =               mar,
}
[HS06] Thomas A. Henzinger and Joseph Sifakis. The Embedded Systems Design Challenge. In FM'06, Lecture Notes in Computer Science 4085, pages 1-15. Springer-Verlag, August 2006. 
@inproceedings{fm2006-HS,
  author =              {Henzinger, Thomas A. and Sifakis, Joseph},
  title =               {The Embedded Systems Design Challenge},
  editor =              {Misra, Jayadev and Nipkow, Tobias and Sekerinski,
                         Emil},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {S}ymposium on {F}ormal {M}ethods ({FM}'06)},
  acronym =             {{FM}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4085},
  pages =               {1-15},
  year =                {2006},
  month =               aug,
  doi =                 {10.1007/11813040_1},
}
[HSB03] John Hershberger, Subhash Suri, and Amir Bhosle. On the Difficulty of Some Shortest Path Problems. In STACS'03, Lecture Notes in Computer Science 2607, pages 343-354. Springer-Verlag, February 2003. 
@inproceedings{stacs2003-HSB,
  author =              {Hershberger, John and Suri, Subhash and Bhosle,
                         Amir},
  title =               {On the Difficulty of Some Shortest Path Problems},
  editor =              {Alt, Helmut and Habib, Michel},
  booktitle =           {{P}roceedings of the 20th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'03)},
  acronym =             {{STACS}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2607},
  pages =               {343-354},
  year =                {2003},
  month =               feb,
}
[HSL+97] Klaus Havelund, Arne Skou, Kim Guldstrand Larsen, and Kristian Lund. Formal Modelling and Analysis of an Audio/Video Protocol: An Industrial Case Study Using Uppaal. In RTSS'97, pages 2-13. IEEE Comp. Soc. Press, December 1997. 
@inproceedings{rts1997-HSLL,
  author =              {Havelund, Klaus and Skou, Arne and Larsen, Kim
                         Guldstrand and Lund, Kristian},
  title =               {Formal Modelling and Analysis of an
                         Audio{\slash}Video Protocol: An Industrial Case
                         Study Using {U}ppaal},
  booktitle =           {{P}roceedings of the 18th {S}ymposium on {R}eal-Time
                         {S}ystems ({RTSS}'97)},
  acronym =             {{RTSS}'97},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {2-13},
  year =                {1997},
  month =               dec,
}
[HST+16] Frédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, and Igor Walukiewicz. Why liveness for timed automata is hard, and what we can do about it. In FSTTCS'16, Leibniz International Proceedings in Informatics, pages 48:1-48:14. Leibniz-Zentrum für Informatik, December 2016. 
@inproceedings{fsttcs2016-HSTW,
  author =              {Herbreteau, Fr{\'e}d{\'e}ric and Srivathsan, B. and
                         Tran, Thanh-Tung and Walukiewicz, Igor},
  title =               {Why liveness for timed automata is hard, and what we
                         can do about~it},
  editor =              {Akshay, S. and Lal, Akash and Saurabh, Saket and
                         Sen, Sandeep},
  booktitle =           {{P}roceedings of the 36th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'16)},
  acronym =             {{FSTTCS}'16},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  pages =               {48:1-48:14},
  year =                {2016},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2016.48},
}
[HSW12] Frédéric Herbreteau, B. Srivathsan, and Igor Walukiewicz. Efficient emptiness check for timed Büchi automata. Formal Methods in System Design 40(2):122-146. Springer-Verlag, April 2012. 
@article{fmsd40(2)-HSW,
  author =              {Herbreteau, Fr{\'e}d{\'e}ric and Srivathsan, B. and
                         Walukiewicz, Igor},
  title =               {Efficient emptiness check for timed {B}{\"u}chi
                         automata},
  publisher =           {Springer-Verlag},
  journal =             {Formal Methods in System Design},
  volume =              {40},
  number =              {2},
  pages =               {122-146},
  year =                {2012},
  month =               apr,
  doi =                 {10.1007/s10703-011-0133-1},
}
[HSW12] Frédéric Herbreteau, B. Srivathsan, and Igor Walukiewicz. Better abstractions for timed automata. In LICS'12, pages 375-384. IEEE Comp. Soc. Press, June 2012. 
@inproceedings{lics2012-HSW,
  author =              {Herbreteau, Fr{\'e}d{\'e}ric and Srivathsan, B. and
                         Walukiewicz, Igor},
  title =               {Better abstractions for timed automata},
  booktitle =           {{P}roceedings of the 27th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'12)},
  acronym =             {{LICS}'12},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {375-384},
  year =                {2012},
  month =               jun,
  doi =                 {10.1109/LICS.2012.48},
}
[HSW13] Frédéric Herbreteau, B. Srivathsan, and Igor Walukiewicz. Lazy Abstractions for Timed Automata. In CAV'13, Lecture Notes in Computer Science 8044, pages 990-1005. Springer-Verlag, July 2013. 
@inproceedings{cav2013-HSW,
  author =              {Herbreteau, Fr{\'e}d{\'e}ric and Srivathsan, B. and
                         Walukiewicz, Igor},
  title =               {Lazy Abstractions for Timed Automata},
  editor =              {Sharygina, Natasha and Veith, Helmut},
  booktitle =           {{P}roceedings of the 25th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'13)},
  acronym =             {{CAV}'13},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8044},
  pages =               {990-1005},
  year =                {2013},
  month =               jul,
  doi =                 {10.1007/978-3-642-39799-8_71},
}
[HSW13] Chung-Hao Huang, Sven Schewe, and Farn Wang. Model Checking Iterated Games. In TACAS'13, Lecture Notes in Computer Science 7795, pages 154-168. Springer-Verlag, March 2013. 
@inproceedings{tacas2013-HSW,
  author =              {Huang, Chung-Hao and Schewe, Sven and Wang, Farn},
  title =               {Model Checking Iterated Games},
  editor =              {Piterman, Nir and Smolka, Scott A.},
  booktitle =           {{P}roceedings of the 19th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'13)},
  acronym =             {{TACAS}'13},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7795},
  pages =               {154-168},
  year =                {2013},
  month =               mar,
  doi =                 {10.1007/978-3-642-36742-7_11},
}
[HSW16] Frédéric Herbreteau, B. Srivathsan, and Igor Walukiewicz. Efficient emptiness check for timed Büchi automata. Information and Computation 251:67-90. Elsevier, December 2016. 
@article{icomp251()-HSW,
  author =              {Herbreteau, Fr{\'e}d{\'e}ric and Srivathsan, B. and
                         Walukiewicz, Igor},
  title =               {Efficient emptiness check for timed {B}{\"u}chi
                         automata},
  publisher =           {Elsevier},
  journal =             {Information and Computation},
  volume =              {251},
  pages =               {67-90},
  year =                {2016},
  month =               dec,
  doi =                 {10.1016/j.ic.2016.07.004},
}
[HT74] John Hopcroft and Robert Endre Tarjan. Efficient Planarity Testing. Journal of the ACM 21(4):549-568. ACM Press, October 1974. 
@article{jacm21(4)-HT,
  author =              {Hopcroft, John and Tarjan, Robert Endre},
  title =               {Efficient Planarity Testing},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {21},
  number =              {4},
  pages =               {549-568},
  year =                {1974},
  month =               oct,
}
[HT15] Frédéric Herbreteau and Thanh-Tung Tran. Improving Search Order for Reachability Testing in Timed Automata. In FORMATS'15, Lecture Notes in Computer Science 9268, pages 124-139. Springer-Verlag, September 2015. 
@inproceedings{formats2015-HT,
  author =              {Herbreteau, Fr{\'e}d{\'e}ric and Tran, Thanh-Tung},
  title =               {Improving Search Order for Reachability Testing in
                         Timed Automata},
  editor =              {Sankaranarayanan, Sriram and Vicario, Enrico},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'15)},
  acronym =             {{FORMATS}'15},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9268},
  pages =               {124-139},
  year =                {2015},
  month =               sep,
  doi =                 {10.1007/978-3-319-22975-1_9},
}
[HTS+00] Masahiro Hirao, Masayuki Takeda, Ayumi Shinohara, and Setsuo Arikawa. Faster Fully Compressed Pattern Matching Algorithm for a Subclass of Straight-Line Programs. Technical Report DOI-TR-169, Dept. of Informatics, Kyushu University, Fukuoka, Japan, January 2000. 
@techreport{DOI-TR-169-HTSA,
  author =              {Hirao, Masahiro and Takeda, Masayuki and Shinohara,
                         Ayumi and Arikawa, Setsuo},
  title =               {Faster Fully Compressed Pattern Matching Algorithm
                         for a Subclass of Straight-Line Programs},
  number =              {DOI-TR-169},
  year =                {2000},
  month =               jan,
  institution =         {Dept. of Informatics, Kyushu University, Fukuoka,
                         Japan},
  type =                {Technical Report},
}
[Hun01] Thomas Hune. Analyzing real-time systems: theory and tools. PhD thesis, University of Aarhus, Denmark, 2001. 
@phdthesis{phd-hune,
  author =              {Hune, Thomas},
  title =               {Analyzing real-time systems: theory and tools},
  year =                {2001},
  school =              {University of Aarhus, Denmark},
}
[Hun13] Paul Hunter. When is Metric Temporal Logic Expressively Complete?. In CSL'13, Leibniz International Proceedings in Informatics 23, pages 380-394. Leibniz-Zentrum für Informatik, September 2013. 
@inproceedings{csl2013-Hun,
  author =              {Hunter, Paul},
  title =               {When is Metric Temporal Logic Expressively
                         Complete?},
  editor =              {Ronchi{ }Della{~}Rocca, Simona},
  booktitle =           {{P}roceedings of the 27th {I}nternational {W}orkshop
                         on {C}omputer {S}cience {L}ogic ({CSL}'13)},
  acronym =             {{CSL}'13},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {23},
  pages =               {380-394},
  year =                {2013},
  month =               sep,
  doi =                 {10.4230/LIPIcs.CSL.2013.380},
}
[Hun15] Paul Hunter. Reachability in Succinct One-Counter Games. In RP'15, Lecture Notes in Computer Science 9328, pages 37-49. Springer-Verlag, September 2015. 
@inproceedings{rp2015-Hun,
  author =              {Hunter, Paul},
  title =               {Reachability in Succinct One-Counter Games},
  editor =              {Boja{\'n}czyk, Miko{\l}aj and Lasota, S{\l}awomir
                         and Potapov, Igor},
  booktitle =           {{P}roceedings of the 9th {W}orkshop on
                         {R}eachability {P}roblems in {C}omputational
                         {M}odels ({RP}'15)},
  acronym =             {{RP}'15},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9328},
  pages =               {37-49},
  year =                {2015},
  month =               sep,
  doi =                 {10.1007/978-3-319-24537-9_5},
}
[Huy82] Thiet-Dung Huynh. The Complexity of Semilinear Sets. Elektronische Informationsverarbeitung und Kybernetik 18(6):291-338. June 1982. 
@article{eik18(6)-Huy,
  author =              {Huynh, Thiet-Dung},
  title =               {The Complexity of Semilinear Sets},
  journal =             {Elektronische Informationsverarbeitung und
                         Kybernetik},
  volume =              {18},
  number =              {6},
  pages =               {291-338},
  year =                {1982},
  month =               jun,
}
[HVG04] Jinfeng Huang, Jeroen Voeten, and Marc C.W. Geilen. Real-Time Property Preservation in Concurrent Real-time Systems. In RTCSA'04. August 2004. 
@inproceedings{rtcsa2004-HVG,
  author =              {Huang, Jinfeng and Voeten, Jeroen and Geilen, Marc
                         C.W.},
  title =               {Real-Time Property Preservation in Concurrent
                         Real-time Systems},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {R}eal-{T}ime {C}omputing {S}ystems
                         and {A}pplications ({RTCSA}'04)},
  acronym =             {{RTCSA}'04},
  year =                {2004},
  month =               aug,
}
[HW97] Harald Hempel and Gerd Wechsung. The Operators min and max on the Polynomial Hierarchy. Technical Report TR97-025, Electronic Colloquium on Computational Complexity, May 1997. 
@techreport{ECCC-TR97-025-HW,
  author =              {Hempel, Harald and Wechsung, Gerd},
  title =               {The Operators min and max on the Polynomial
                         Hierarchy},
  number =              {TR97-025},
  year =                {1997},
  month =               may,
  institution =         {Electronic Colloquium on Computational Complexity},
  type =                {Technical Report},
}
[HWZ02] Ian Hodkinson, Frank Wolter, and Michael Zakharyaschev. Decidable and Undecidable Fragments of First-Order Branching Temporal Logics. In LICS'02, pages 393-402. IEEE Comp. Soc. Press, July 2002. 
@inproceedings{lics2002-HWZ,
  author =              {Hodkinson, Ian and Wolter, Frank and Zakharyaschev,
                         Michael},
  title =               {Decidable and Undecidable Fragments of First-Order
                         Branching Temporal Logics},
  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 =               {393-402},
  year =                {2002},
  month =               jul,
}
[HZH+10] Fei He, He Zhu, William N. N. Hung, Xiaoyu Song, and Ming Gu. Compositional Abstraction Refinement for Timed Systems. In TASE'10, pages 168-176. IEEE Comp. Soc. Press, August 2010. 
@inproceedings{tase2010-HZHSG,
  author =              {He, Fei and Zhu, He and Hung, William N. N. and
                         Song, Xiaoyu and Gu, Ming},
  title =               {Compositional Abstraction Refinement for Timed
                         Systems},
  editor =              {Liu, Jing and Peled, Doron A. and Wang, Bow-Yaw and
                         Wang, Farn},
  booktitle =           {{P}roceedings of the 4th {I}nternational {S}ymposium
                         on {T}heoretical {A}spects of {S}oftware
                         {E}ngineering ({TASE}'10)},
  acronym =             {{TASE}'10},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {168-176},
  year =                {2010},
  month =               aug,
  doi =                 {10.1109/TASE.2010.27},
}
I
[IK89] Neil Immerman and Dexter C. Kozen. Definability with Bounded Number of Bound Variables. Information and Computation 83(2):121-139. Academic Press, November 1989. 
@article{icomp83(2)-IK,
  author =              {Immerman, Neil and Kozen, Dexter C.},
  title =               {Definability with Bounded Number of Bound Variables},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {83},
  number =              {2},
  pages =               {121-139},
  year =                {1989},
  month =               nov,
}
[IKO+02] Satoshi Ikeda, Izumi Kubo, Norihiro Okumoto, and Masafumi Yamashita. Local Topological Information and Cover Time. IPSJ SIG Notes 88:27-34. Information Processing Society of Japan, September 2002. 
@article{ipsj88-IKOY,
  author =              {Ikeda, Satoshi and Kubo, Izumi and Okumoto, Norihiro
                         and Yamashita, Masafumi},
  title =               {Local Topological Information and Cover Time},
  publisher =           {Information Processing Society of Japan},
  journal =             {IPSJ SIG Notes},
  volume =              {88},
  pages =               {27-34},
  year =                {2002},
  month =               sep,
}
[IKY+08] Georgeta Igna, Vankatesh Kannan, Yang Yang, Twan Basten, Marc C.W. Geilen, Frits Vaandrager, Marc Voorhoeve, Sebastian de Smet, and Lou J. Somers. Formal Modeling and Scheduling of Datapaths of Digital Document Printers. In FORMATS'08, Lecture Notes in Computer Science 5215, pages 170-187. Springer-Verlag, September 2008. 
@inproceedings{formats2008-IKYBGVVSS,
  author =              {Igna, Georgeta and Kannan, Vankatesh and Yang, Yang
                         and Basten, Twan and Geilen, Marc C.W. and
                         Vaandrager, Frits and Voorhoeve, Marc and de Smet,
                         Sebastian and Somers, Lou J.},
  title =               {Formal Modeling and Scheduling of Datapaths of
                         Digital Document Printers},
  editor =              {Cassez, Franck and Jard, Claude},
  booktitle =           {{P}roceedings of the 6th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'08)},
  acronym =             {{FORMATS}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5215},
  pages =               {170-187},
  year =                {2008},
  month =               sep,
}
[Imm81] Neil Immerman. Number of quantifiers is better than number of tape cells. Journal of Computer and System Sciences 22(3):384-406. Academic Press, June 1981. 
@article{jcss22(3)-Imm,
  author =              {Immerman, Neil},
  title =               {Number of quantifiers is better than number of tape
                         cells},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {22},
  number =              {3},
  pages =               {384-406},
  year =                {1981},
  month =               jun,
  doi =                 {10.1016/0022-0000(81)90039-8},
}
[Imm87] Neil Immerman. Languages That Capture Complexity Classes. SIAM Journal on Computing 16(4):760-778. Society for Industrial and Applied Math., August 1987. 
@article{siamcomp16(4)-Imm,
  author =              {Immerman, Neil},
  title =               {Languages That Capture Complexity Classes},
  publisher =           {Society for Industrial and Applied Math.},
  journal =             {SIAM Journal on Computing},
  volume =              {16},
  number =              {4},
  pages =               {760-778},
  year =                {1987},
  month =               aug,
}
[Imm88] Neil Immerman. Nondeterministic Space is Closed Under Complementation. SIAM Journal on Computing 17(5):935-938. Society for Industrial and Applied Math., October 1988. 
@article{siamcomp17(5)-Imm,
  author =              {Immerman, Neil},
  title =               {Nondeterministic Space is Closed Under
                         Complementation},
  publisher =           {Society for Industrial and Applied Math.},
  journal =             {SIAM Journal on Computing},
  volume =              {17},
  number =              {5},
  pages =               {935-938},
  year =                {1988},
  month =               oct,
}
[Imm99] Neil Immerman. Descriptive complexity. Graduate texts in computer science. Springer-Verlag, 1999. 
@book{Imm-descrcompl,
  author =              {Immerman, Neil},
  title =               {Descriptive complexity},
  publisher =           {Springer-Verlag},
  series =              {Graduate texts in computer science},
  year =                {1999},
  doi =                 {10.1007/978-1-4612-0539-5},
}
[IS99] Balász Imreh and Magnus Steinby. Directable nondeterministic automata. Acta Cybernetica 14(1):105-115. Institute of Informatics, University of Szeged, 1999. 
@article{actacyb14(1)-IS,
  author =              {Imreh, Bal{\'a}sz and Steinby, Magnus},
  title =               {Directable nondeterministic automata},
  publisher =           {Institute of Informatics, University of Szeged},
  journal =             {Acta Cybernetica},
  volume =              {14},
  number =              {1},
  pages =               {105-115},
  year =                {1999},
}
[ISY03] Lucian Ilie, Baozhen Shan, and Sheng Yu. Expression Matching and Searching. In STACS'03, Lecture Notes in Computer Science 2607, pages 179-190. Springer-Verlag, February 2003. 
@inproceedings{stacs2003-ISY,
  author =              {Ilie, Lucian and Shan, Baozhen and Yu, Sheng},
  title =               {Expression Matching and Searching},
  editor =              {Alt, Helmut and Habib, Michel},
  booktitle =           {{P}roceedings of the 20th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'03)},
  acronym =             {{STACS}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2607},
  pages =               {179-190},
  year =                {2003},
  month =               feb,
}
[IT91] Katsushi Inoue and Itsuo Takanami. A survey of two-dimensional automata theory. Information Science 55(1-3):99-121. June 1991. 
@article{is55(1-3)-IT,
  author =              {Inoue, Katsushi and Takanami, Itsuo},
  title =               {A survey of two-dimensional automata theory},
  journal =             {Information Science},
  volume =              {55},
  number =              {1-3},
  pages =               {99-121},
  year =                {1991},
  month =               jun,
}
[ITN78] Katsushi Inoue, Itsuo Takanami, and Akira Nakamura. A note on Two-dimensional Finite Automata. Information Processing Letters 7(1):49-52. Elsevier, January 1978. 
@article{ipl7(1)-ITN,
  author =              {Inoue, Katsushi and Takanami, Itsuo and Nakamura,
                         Akira},
  title =               {A~note on Two-dimensional Finite Automata},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {7},
  number =              {1},
  pages =               {49-52},
  year =                {1978},
  month =               jan,
}
J
[Jaz19] Samy Jaziri. Automata on timed structures. PhD thesis, École Normale Supérieure de Cachan, France, September 2019. 
@phdthesis{phd-jaziri,
  author =              {Jaziri, Samy},
  title =               {Automata on timed structures},
  year =                {2019},
  month =               sep,
  school =              {{\'E}cole Normale Sup{\'e}rieure de Cachan, France},
}
[JBB+17] Swen Jacobs, Roderick Bloem, Romain Brenguier, Rüdiger Ehlers, Timotheus Hell, Robert Könighofer, Guillermo A. Pérez, Jean-François Raskin, Leonid Ryzhyk, Ocan Sankur, Martin Seidl, Leander Tentrup, and Adam Walker. The first reactive synthesis competition (SYNTCOMP 2014). International Journal on Software Tools for Technology Transfer 19(3):367-390. Springer-Verlag, June 2017. 
@article{sttt19(3)-JBBEHKPRRSSTW,
  author =              {Jacobs, Swen and Bloem, Roderick and Brenguier,
                         Romain and Ehlers, R{\"u}diger and Hell, Timotheus
                         and K{\"o}nighofer, Robert and P{\'e}rez, Guillermo
                         A. and Raskin, Jean-Fran{\c c}ois and Ryzhyk, Leonid
                         and Sankur, Ocan and Seidl, Martin and Tentrup,
                         Leander and Walker, Adam},
  title =               {The first reactive synthesis competition
                         ({SYNTCOMP}~2014)},
  publisher =           {Springer-Verlag},
  journal =             {International Journal on Software Tools for
                         Technology Transfer},
  volume =              {19},
  number =              {3},
  pages =               {367-390},
  year =                {2017},
  month =               jun,
  doi =                 {10.1007/s10009-016-0416-3},
}
[JdB+09] Mohammad Mahdi Jaghoori, Frank S. de Boer, Tom Chothia, and Marjan Sirjani. Schedulability of asynchronous real-time concurrent objects. Journal of Logic and Algebraic Programming 78(5):402-416. Elsevier, May 2009. 
@article{jlap78(5)-JBCS,
  author =              {Jaghoori, Mohammad Mahdi and de~Boer, Frank S. and
                         Chothia, Tom and Sirjani, Marjan},
  title =               {Schedulability of asynchronous real-time concurrent
                         objects},
  publisher =           {Elsevier},
  journal =             {Journal of Logic and Algebraic Programming},
  volume =              {78},
  number =              {5},
  pages =               {402-416},
  year =                {2009},
  month =               may,
}
[JD05] Wojciech Jamroga and Jürgen Dix. Do Agents Make Model Checking Explode (Computationally)?. In CEEMAS'05, Lecture Notes in Artificial Intelligence 23690, pages 398-407. Springer-Verlag, September 2005. 
@inproceedings{ceemas2005-JD,
  author =              {Jamroga, Wojciech and Dix, J{\"u}rgen},
  title =               {Do Agents Make Model Checking Explode
                         (Computationally)?},
  editor =              {P{\v e}chouc{\v e}k, Michal and Petta, Paolo and
                         Varga, L{\'a}szl{\'o} Zsolt},
  booktitle =           {{P}roceedings of the 4th {I}nternational {C}entral
                         and {E}astern {E}uropean {C}onference on
                         {M}ulti-{A}gent {S}ystems ({CEEMAS}'05)},
  acronym =             {{CEEMAS}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Artificial Intelligence},
  volume =              {23690},
  pages =               {398-407},
  year =                {2005},
  month =               sep,
}
[JD06] Wojciech Jamroga and Jürgen Dix. Model Checking Abilities of Agents: A Closer Look. Technical Report IfI-06-02, Institut fúr Informatik, Technische Universität Clausthal, Germany, 2006. 
@techreport{IfI-06-02-JD,
  author =              {Jamroga, Wojciech and Dix, J{\"u}rgen},
  title =               {Model Checking Abilities of Agents: A Closer Look},
  number =              {IfI-06-02},
  year =                {2006},
  institution =         {Institut f{\'u}r Informatik, Technische
                         Universit{\"a}t Clausthal, Germany},
  type =                {Technical Report},
}
[JD08] Wojciech Jamroga and Jürgen Dix. Model Checking Abilities of Agents: A Closer Look. Theory of Computing Systems 42(3):366-410. Springer-Verlag, April 2008. 
@article{tocsys42(3)-JD,
  author =              {Jamroga, Wojciech and Dix, J{\"u}rgen},
  title =               {Model Checking Abilities of Agents: A Closer Look},
  publisher =           {Springer-Verlag},
  journal =             {Theory of Computing Systems},
  volume =              {42},
  number =              {3},
  pages =               {366-410},
  year =                {2008},
  month =               apr,
  doi =                 {10.1007/s00224-007-9080-z},
}
[Jer03] Thierry Jéron. Project-Team VerTeCs. Annual Reviews Inc., IRISA, Rennes, France, 2003. 
@techreport{AR-VerTeCs-2003,
  author =              {J{\'e}ron, Thierry},
  title =               {Project-Team {VerTeCs}},
  year =                {2003},
  institution =         {IRISA, Rennes, France},
  type =                {Annual Reviews Inc.},
}
[Jer04] Thierry Jéron. Contribution à la génération automatique de tests pour les systèmes réactifs. Mémoire d'habilitation, Université Rennes 1, France, February 2004. 
@phdthesis{hab-jeron,
  author =              {J{\'e}ron, Thierry},
  title =               {Contribution {\`a} la g{\'e}n{\'e}ration automatique
                         de tests pour les syst{\`e}mes r{\'e}actifs},
  year =                {2004},
  month =               feb,
  school =              {Universit{\'e} Rennes~1, France},
  type =                {M\'emoire d'habilitation},
}
[JGB97] Predrag Janičić, Ian Green, and Alan Bundy. A Comparison of Decision Procedures in Presburger Arithmetic. In LIRA'97, pages 91-101. September 1997. 
@inproceedings{lira1997-JGB,
  author =              {Jani{\v c}i{\'c}, Predrag and Green, Ian and Bundy,
                         Alan},
  title =               {A Comparison of Decision Procedures in {P}resburger
                         Arithmetic},
  editor =              {To{\v s}i{\'c}, Ratko and Budimac, Zoran},
  booktitle =           {{P}roceedings of the 8th {I}nternational
                         {C}onference on {L}ogic and {C}omputer {S}cience
                         ({LIRA}'97)},
  acronym =             {{LIRA}'97},
  pages =               {91-101},
  year =                {1997},
  month =               sep,
}
[JvdH04] Wojciech Jamroga and Wiebe van der Hoek. Agents that Know How to Play. Fundamenta Informaticae 63(2-3):185-219. IOS Press, 2004. 
@article{fundi63(2-3)-JH,
  author =              {Jamroga, Wojciech and van der Hoek, Wiebe},
  title =               {Agents that Know How to Play},
  publisher =           {IOS Press},
  journal =             {Fundamenta Informaticae},
  volume =              {63},
  number =              {2-3},
  pages =               {185-219},
  year =                {2004},
}
[JvdH+05] Wojciech Jamroga, Wiebe van der Hoek, and Michael Wooldridge. Intentions and Strategies in Game-Like Scenarios. In EPIA'05, Lecture Notes in Artificial Intelligence 3808, pages 512-523. Springer-Verlag, December 2005. 
@inproceedings{epia2005-JHW,
  author =              {Jamroga, Wojciech and van der Hoek, Wiebe and
                         Wooldridge, Michael},
  title =               {Intentions and Strategies in Game-Like Scenarios},
  editor =              {Bento, Carlos and Cardoso, Am{\'\i}lcar and Dias,
                         Ga{\"e}l},
  booktitle =           {{P}roceedings of the 12th {P}ortuguese {C}onference
                         on {A}rtificial {I}ntelligence ({EPIA}'05)},
  acronym =             {{EPIA}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Artificial Intelligence},
  volume =              {3808},
  pages =               {512-523},
  year =                {2005},
  month =               dec,
}
[JKP16] Wojciech Jamroga, Beata Konikowska, and Wojciech Penczek. Multi-Valued Verification of Strategic Ability. In AAMAS'16, pages 1180-1189. International Foundation for Autonomous Agents and Multiagent Systems, May 2016. 
@inproceedings{aamas2016-JKP,
  author =              {Jamroga, Wojciech and Konikowska, Beata and Penczek,
                         Wojciech},
  title =               {Multi-Valued Verification of Strategic Ability},
  editor =              {Jonker, Catholijn M. and Marsella, Stacy and
                         Thangarajah, John and Tuyls, Karl},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}onference on {A}utonomous {A}gents and
                         {M}ultiagent {S}ystems ({AAMAS}'16)},
  acronym =             {{AAMAS}'16},
  publisher =           {International Foundation for Autonomous Agents and
                         Multiagent Systems},
  pages =               {1180-1189},
  year =                {2016},
  month =               may,
}
[JL03] Jan Johannsen and Martin Lange. CTL+ is Complete for Double Exponential Time. In ICALP'03, Lecture Notes in Computer Science 2719, pages 767-775. Springer-Verlag, June 2003. 
@inproceedings{icalp2003-JL,
  author =              {Johannsen, Jan and Lange, Martin},
  title =               {{CTL{\(^+\)}} is Complete for Double Exponential
                         Time},
  editor =              {Baeten, Jos C. M. and Lenstra, Jan Karel and Parrow,
                         Joachim and Woeginger, Gerhard J.},
  booktitle =           {{P}roceedings of the 30th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'03)},
  acronym =             {{ICALP}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2719},
  pages =               {767-775},
  year =                {2003},
  month =               jun,
}
[JL04] David Janin and Giacommo Lenzi. On the Relationship Between Monadic and Weak Monadic Second Order Logic on Arbitrary Trees. Fundamenta Informaticae 61(3-4):247-265. IOS Press, 2004. 
@article{fundi61(3-4)-JL,
  author =              {Janin, David and Lenzi, Giacommo},
  title =               {On the Relationship Between Monadic and Weak Monadic
                         Second Order Logic on Arbitrary Trees},
  publisher =           {IOS Press},
  journal =             {Fundamenta Informaticae},
  volume =              {61},
  number =              {3-4},
  pages =               {247-265},
  year =                {2004},
}
[JLM97] Birgit Jenner, Klaus-Jörn Lange, and Pierre McKenzie. Tree Isomorphism and Some Other Complete Problems for Deterministic Logspace. Technical Report 1059, DIRO, Université de Montréal, Canada, March 1997. 
@techreport{diro1-59-JLM,
  author =              {Jenner, Birgit and Lange, Klaus-J{\"o}rn and
                         McKenzie, Pierre},
  title =               {Tree Isomorphism and Some Other Complete Problems
                         for Deterministic Logspace},
  number =              {1059},
  year =                {1997},
  month =               mar,
  institution =         {DIRO, Universit{\'e} de Montr{\'e}al, Canada},
  type =                {Technical Report},
}
[JLR13] Line Juhl, Kim Guldstrand Larsen, and Jean-François Raskin. Optimal Bounds for Multiweighted and Parametrised Energy Games. In Theories of Programming and Formal Methods – Essays Dedicated to Jifeng He on the Occasion of His 70th Birthday, Lecture Notes in Computer Science 8051, pages 244-255. Springer-Verlag, 2013. 
@inproceedings{tpfm2013-JLR,
  author =              {Juhl, Line and Larsen, Kim Guldstrand and Raskin,
                         Jean-Fran{\c c}ois},
  title =               {Optimal Bounds for Multiweighted and Parametrised
                         Energy Games},
  editor =              {Liu, Zhiming and Woodcock, Jim and Zhu, Yunshan},
  booktitle =           {Theories of Programming and Formal Methods~-- Essays
                         Dedicated to Jifeng He on the Occasion of His 70th
                         Birthday},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8051},
  pages =               {244-255},
  year =                {2013},
  doi =                 {10.1007/978-3-642-39698-4_15},
}
[JLR15] Aleksandra Jovanović, Didier Lime, and Olivier H. Roux. Integer Parameter Synthesis for Timed Automata. IEEE Transactions on Software Engineering 41(5):445-461. IEEE Comp. Soc. Press, May 2015. 
@article{tse41(5)-JLR,
  author =              {Jovanovi{\'c}, Aleksandra and Lime, Didier and Roux,
                         Olivier H.},
  title =               {Integer Parameter Synthesis for Timed Automata},
  publisher =           {IEEE Comp. Soc. Press},
  journal =             {IEEE Transactions on Software Engineering},
  volume =              {41},
  number =              {5},
  pages =               {445-461},
  year =                {2015},
  month =               may,
  doi =                 {10.1109/TSE.2014.2357445},
}
[JLS07] Marcin Jurdziński, François Laroussinie, and Jeremy Sproston. Model Checking Probabilistic Timed Automata with One or Two Clocks. In TACAS'07, Lecture Notes in Computer Science 4424, pages 170-184. Springer-Verlag, March 2007. 
@inproceedings{tacas2007-JLS,
  author =              {Jurdzi{\'n}ski, Marcin and Laroussinie, Fran{\c
                         c}ois and Sproston, Jeremy},
  title =               {Model Checking Probabilistic Timed Automata with One
                         or Two Clocks},
  editor =              {Grumberg, Orna and Huth, Michael},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'07)},
  acronym =             {{TACAS}'07},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4424},
  pages =               {170-184},
  year =                {2007},
  month =               mar,
  doi =                 {10.1007/978-3-540-71209-1_15},
}
[JLS12] Kenneth Yrke Jørgensen, Kim Guldstrand Larsen, and Jiří Srba. Time-Darts: A Data Structure for Verification of Closed Timed Automata. In SSV'12, Electronic Proceedings in Theoretical Computer Science 102, pages 141-155. November 2012. 
@inproceedings{ssv2012-JLS,
  author =              {J{\o}rgensen, Kenneth Yrke and Larsen, Kim
                         Guldstrand and Srba, Ji{\v r}{\'\i}},
  title =               {Time-Darts: A~Data Structure for Verification of
                         Closed Timed Automata},
  booktitle =           {{P}roceedings of the 7th {C}onference on {S}ystems
                         {S}oftware {V}erification ({SSV}'12)},
  acronym =             {{SSV}'12},
  series =              {Electronic Proceedings in Theoretical Computer
                         Science},
  volume =              {102},
  pages =               {141-155},
  year =                {2012},
  month =               nov,
  doi =                 {10.4204/EPTCS.102.13},
}
[JLS15] Marcin Jurdziński, Ranko Lazić, and Sylvain Schmitz. Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time. In ICALP'15, Lecture Notes in Computer Science 9135, pages 260-272. Springer-Verlag, July 2015. 
@inproceedings{icalp2015-JLS,
  author =              {Jurdzi{\'n}ski, Marcin and Lazi{\'c}, Ranko and
                         Schmitz, Sylvain},
  title =               {Fixed-Dimensional Energy Games are in
                         Pseudo-Polynomial Time},
  editor =              {Halld{\'o}rsson, Magn{\'u}s M. and Iwana, Kazuo and
                         Kobayashi, Naoki and Speckmann, Bettina},
  booktitle =           {{P}roceedings of the 42nd {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'15)~-- Part~{II}},
  acronym =             {{ICALP}'15},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9135},
  pages =               {260-272},
  year =                {2015},
  month =               jul,
  doi =                 {10.1007/978-3-662-47666-6_21},
}
[JLS+13] Jonas Finnemann Jensen, Kim Guldstrand Larsen, Jiří Srba, and Lars Kærlund Østergaard. Local Model Checking of Weighted CTL with Upper-Bound Constraints. In SPIN'13, Lecture Notes in Computer Science 7976, pages 178-195. Springer-Verlag, July 2013. 
@inproceedings{spin2013-JLSO,
  author =              {Jensen, Jonas Finnemann and Larsen, Kim Guldstrand
                         and Srba, Ji{\v r}{\'\i} and {\O}stergaard, Lars
                         K{\ae}rlund},
  title =               {Local Model Checking of Weighted {CTL} with
                         Upper-Bound Constraints},
  editor =              {Bartocci, Ezio and Ramakrishnan, C. R.},
  booktitle =           {{P}roceedings of the 20th {I}nternational
                         {S}ymposium on {M}odel-{C}herking {S}oftware
                         ({SPIN}'13)},
  acronym =             {{SPIN}'13},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7976},
  pages =               {178-195},
  year =                {2013},
  month =               jul,
  doi =                 {10.1007/978-3-642-39176-7_12},
}
[JLS+14] Peter Gjøl Jensen, Kim Guldstrand Larsen, Jiří Srba, Mathias Grund Sørensen, and Jakob Haar Taankvist. Memory Efficient Data Structures for Explicit Verification of Timed Systems. In NFM'14, Lecture Notes in Computer Science 8430, pages 307-312. Springer-Verlag, April 2014. 
@inproceedings{nasaFM2014-JLSST,
  author =              {Jensen, Peter Gj{\o}l and Larsen, Kim Guldstrand and
                         Srba, Ji{\v r}{\'\i} and S{\o}rensen, Mathias Grund
                         and Taankvist, Jakob Haar},
  title =               {Memory Efficient Data Structures for Explicit
                         Verification of Timed Systems},
  editor =              {Badger, Julia M. and Rozier, Kristin Yvonne},
  booktitle =           {{P}roceedings of the 6th {NASA} {F}ormal {M}ethods
                         {S}ymposium ({NFM}'14)},
  acronym =             {{NFM}'14},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8430},
  pages =               {307-312},
  year =                {2014},
  month =               apr,
  doi =                 {10.1007/978-3-319-06200-6_26},
}
[JMM+20] Thierry Jéron, Nicolas Markey, David Mentré, Reiya Noguchi, and Ocan Sankur. Incremental methods for checking real-time consistency. In FORMATS'20, Lecture Notes in Computer Science 12288, pages 249-264. Springer-Verlag, September 2020.
Abstract

Requirements engineering is a key phase in the development process. Ensuring that requirements are consistent is essential so that they do not conflict and admit implementations. We consider the formal verification of rt-consistency, which imposes that the inevitability of definitive errors of a requirement should be anticipated, and that of partial consistency, which was recently introduced as a more effective check. We generalize and formalize both notions for discrete-time timed automata, develop three incremental algorithms, and present experimental results.

@inproceedings{formats2020-JMMNS,
  author =              {J{\'e}ron, Thierry and Markey, Nicolas and
                         Mentr{\'e}, David and Noguchi, Reiya and Sankur,
                         Ocan},
  title =               {Incremental methods for checking real-time
                         consistency},
  editor =              {Bertrand, Nathalie and Jansen, Nils},
  booktitle =           {{P}roceedings of the 18th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'20)},
  acronym =             {{FORMATS}'20},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {12288},
  pages =               {249-264},
  year =                {2020},
  month =               sep,
  doi =                 {10.1007/978-3-030-57628-8_15},
  abstract =            {Requirements engineering is a key phase in the
                         development process. Ensuring that requirements are
                         consistent is essential so that they do not conflict
                         and admit implementations. We~consider the formal
                         verification of rt-consistency, which imposes that
                         the inevitability of definitive errors of a
                         requirement should be anticipated, and that of
                         partial consistency, which was recently introduced
                         as a more effective check. We~generalize and
                         formalize both notions for discrete-time timed
                         automata, develop three incremental algorithms, and
                         present experimental results.},
}
[JMO07] Jacques Julliand, Hassan Mountassir, and Émilie Oudot. VeSTA: A Tool to Verify the Correct Integration of a Component in a Composite Timed System. In ICFEM'07, Lecture Notes in Computer Science 4789, pages 116-135. Springer-Verlag, November 2007. 
@inproceedings{icfem2007-JMO,
  author =              {Julliand, Jacques and Mountassir, Hassan and Oudot,
                         {\'E}milie},
  title =               {{V}e{STA}: A~Tool to Verify the Correct Integration
                         of a Component in a Composite Timed System},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference on {F}ormal {E}ngineering {M}ethods
                         ({ICFEM}'07)},
  acronym =             {{ICFEM}'07},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4789},
  pages =               {116-135},
  year =                {2007},
  month =               nov,
  doi =                 {10.1007/978-3-540-76650-6_8},
}
[JMR+03] Thierry Jéron, Hervé Marchand, Vlad Rusu, and Valéry Tschaen. Ensuring the Conformance of Reactive Discrete-Event Systems using Supervisory Control. In CDC'03, pages 2692- 2697. IEEE Comp. Soc. Press, December 2003. 
@inproceedings{cdc2003-JMRT,
  author =              {J{\'e}ron, Thierry and Marchand, Herv{\'e} and Rusu,
                         Vlad and Tschaen, Val{\'e}ry},
  title =               {Ensuring the Conformance of Reactive Discrete-Event
                         Systems using Supervisory Control},
  booktitle =           {{P}roceedings of the 42nd {IEEE} {C}onference on
                         {D}ecision and {C}ontrol ({CDC}'03)},
  acronym =             {{CDC}'03},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {2692- 2697},
  year =                {2003},
  month =               dec,
}
[Joh83] David S. Johnson. TheNP-Completeness Column: An Ongoing Guide. Journal of Algorithms 4(4):397-411. Elsevier, December 1983. 
@article{ja4(4)-joh,
  author =              {Johnson, David S.},
  title =               {The{NP}-Completeness Column: An Ongoing Guide},
  publisher =           {Elsevier},
  journal =             {Journal of Algorithms},
  volume =              {4},
  number =              {4},
  pages =               {397-411},
  year =                {1983},
  month =               dec,
}
[Joh90] David S. Johnson. A Catalog of Complexity Classes. In Jan van Leeuwen (eds.), Handbook of Theoretical Computer Science. Elsevier, 1990. 
@incollection{HTCSa1990-Joh,
  author =              {Johnson, David S.},
  title =               {A Catalog of Complexity Classes},
  editor =              {van Leeuwen, Jan},
  booktitle =           {Handbook of Theoretical Computer Science},
  publisher =           {Elsevier},
  volume =              {A},
  pages =               {67-161},
  chapter =             {2},
  year =                {1990},
}
[Joh03] Jan Johannsen. Satisfiability Problems Complete for Deterministic Logarithmic Space. In STACS'04, Lecture Notes in Computer Science 2996, pages 317-325. Springer-Verlag, March 2003. 
@inproceedings{stacs2004-Joh,
  author =              {Johannsen, Jan},
  title =               {Satisfiability Problems Complete for Deterministic
                         Logarithmic Space},
  editor =              {Diekert, Volker and Habib, Michel},
  booktitle =           {{P}roceedings of the 21st {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'04)},
  acronym =             {{STACS}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2996},
  pages =               {317-325},
  year =                {2003},
  month =               mar,
}
[JR11] Rémi Jaubert and Pierre-Alain Reynier. Quantitative Robustness Analysis of Flat Timed Automata. In FoSSaCS'11, Lecture Notes in Computer Science 6604, pages 229-244. Springer-Verlag, March 2011. 
@inproceedings{fossacs2011-JR,
  author =              {Jaubert, R{\'e}mi and Reynier, Pierre-Alain},
  title =               {Quantitative Robustness Analysis of Flat Timed
                         Automata},
  editor =              {Hofmann, Martin},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'11)},
  acronym =             {{FoSSaCS}'11},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6604},
  pages =               {229-244},
  year =                {2011},
  month =               mar,
}
[JRL+07] Jan J. Jensen, Jacob Illum Rasmussen, Kim Guldstrand Larsen, and Alexandre David. Guided Controller Synthesis for Climate Controller Using UPPAAL Tiga. In FORMATS'07, Lecture Notes in Computer Science 4763, pages 227-240. Springer-Verlag, October 2007. 
@inproceedings{formats2007-JRLD,
  author =              {Jensen, Jan J. and Rasmussen, Jacob Illum and
                         Larsen, Kim Guldstrand and David, Alexandre},
  title =               {Guided Controller Synthesis for Climate Controller
                         Using {UPPAAL} {T}iga},
  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 =               {227-240},
  year =                {2007},
  month =               oct,
}
[JS07] Petr Jančar and Zdeněk Sawa. A note on Emptiness for Alternating Finite Automata with a One-letter Alphabet. Information Processing Letters 104(5):164-167. Elsevier, November 2007. 
@article{ipl104(5)-JS,
  author =              {Jan{\v c}ar, Petr and Sawa, Zden{\v{e}}k},
  title =               {A note on Emptiness for Alternating Finite Automata
                         with a One-letter Alphabet},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {104},
  number =              {5},
  pages =               {164-167},
  year =                {2007},
  month =               nov,
}
[JT98] Birgit Jenner and Jacobo Torán. The Complexity of Obtaining Solutions for Problems in NP and NL. In Lane A. Hemaspaandra and Alan L. Selman (eds.), Complexity Theory Retrospective II. Springer-Verlag, 1998. 
@incollection{ctr2-JT,
  author =              {Jenner, Birgit and Tor{\'a}n, Jacobo},
  title =               {The Complexity of Obtaining Solutions for Problems
                         in {NP} and {NL}},
  editor =              {Hemaspaandra, Lane A. and Selman, Alan L.},
  booktitle =           {Complexity Theory Retrospective~II},
  publisher =           {Springer-Verlag},
  pages =               {155-178},
  year =                {1998},
}
[Jur98] Marcin Jurdziński. Deciding the Winner in Parity Games is in UP∩co-UP. Information Processing Letters 68(3):119-124. Elsevier, November 1998. 
@article{ipl68(3)-Jur,
  author =              {Jurdzi{\'n}ski, Marcin},
  title =               {Deciding the Winner in Parity Games is in
                         {UP}{\(\cap\)}co-{UP}},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {68},
  number =              {3},
  pages =               {119-124},
  year =                {1998},
  month =               nov,
}
[Jur00] Marcin Jurdziński. Small Progress Measures for Solving Parity Games. In STACS'00, Lecture Notes in Computer Science 1770, pages 290-301. Springer-Verlag, March 2000. 
@inproceedings{stacs2000-Jur,
  author =              {Jurdzi{\'n}ski, Marcin},
  title =               {Small Progress Measures for Solving Parity Games},
  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 =               {290-301},
  year =                {2000},
  month =               mar,
}
[JW95] David Janin and Igor Walukiewicz. Automata for the Modal μ-Calculus and Related Results. In MFCS'95, Lecture Notes in Computer Science 969, pages 552-562. Springer-Verlag, August 1995. 
@inproceedings{mfcs1995-JW,
  author =              {Janin, David and Walukiewicz, Igor},
  title =               {Automata for the Modal {\(\mu\)}-Calculus and
                         Related Results},
  editor =              {Wiedermann, Jir{\'\i} and H{\'a}jek, Petr},
  booktitle =           {{P}roceedings of the 20th {I}nternational
                         {S}ymposium on {M}athematical {F}oundations of
                         {C}omputer {S}cience ({MFCS}'95)},
  acronym =             {{MFCS}'95},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {969},
  pages =               {552-562},
  year =                {1995},
  month =               aug,
}
[JW96] David Janin and Igor Walukiewicz. On the Expressive Completeness of the Propositional Mu-Calculus With Respect to Monadic Second Order Logic. In CONCUR'96, Lecture Notes in Computer Science 1119, pages 263-277. Springer-Verlag, August 1996. 
@inproceedings{concur1996-JW,
  author =              {Janin, David and Walukiewicz, Igor},
  title =               {On the Expressive Completeness of the Propositional
                         Mu-Calculus With Respect to Monadic Second Order
                         Logic},
  editor =              {Montanari, Ugo and Sassone, Vladimiro},
  booktitle =           {{P}roceedings of the 7th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'96)},
  acronym =             {{CONCUR}'96},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1119},
  pages =               {263-277},
  year =                {1996},
  month =               aug,
}
[JW18] Paulin Jacquot and Cheng Wan. Routing game on parallel networks: the convergence of atomic to nonatomic. In CDC'18, pages 6951-6956. IEEE Comp. Soc. Press, December 2018. 
@inproceedings{cdc2018-JW,
  author =              {Jacquot, Paulin and Wan, Cheng},
  title =               {Routing game on parallel networks: the~convergence
                         of atomic to nonatomic},
  booktitle =           {{P}roceedings of the 57th {IEEE} {C}onference on
                         {D}ecision and {C}ontrol ({CDC}'18)},
  acronym =             {{CDC}'18},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {6951-6956},
  year =                {2018},
  month =               dec,
  doi =                 {10.1109/CDC.2018.8619369},
}
K
[Kai97] Roope Kaivola. Using Automata to Characterise Fixed Point Temporal Logics. PhD thesis, School of Informatics, University of Edinburgh, UK, July 1997. 
@phdthesis{phd-kaivola,
  author =              {Kaivola, Roope},
  title =               {Using Automata to Characterise Fixed Point Temporal
                         Logics},
  year =                {1997},
  month =               jul,
  school =              {School of Informatics, University of Edinburgh, UK},
  type =                {{PhD} thesis},
}
[Kam68] Johan Anthony Willem Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, Computer Science Department, University of California at Los Angeles, USA, 1968. 
@phdthesis{phd-kamp,
  author =              {Kamp, Johan Anthony Willem},
  title =               {Tense Logic and the Theory of Linear Order},
  year =                {1968},
  school =              {Computer Science Department, University of
                         California at Los~Angeles, USA},
  type =                {{PhD} thesis},
}
[Kam94] Michael Kaminski. A branching time logic with past operators. Journal of Computer and System Sciences 49(2):223-246. Academic Press, October 1994. 
@article{jcss49(2)-Kam,
  author =              {Kaminski, Michael},
  title =               {A branching time logic with past operators},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {49},
  number =              {2},
  pages =               {223-246},
  year =                {1994},
  month =               oct,
}
[Kar72] Richard M. Karp. Reducibility Among Combinatorial Problems. In CCC'72, IBM Research Symposia Series, pages 85-103. Plenum Press, March 1972. 
@inproceedings{ccc1972-Kar,
  author =              {Karp, Richard M.},
  title =               {Reducibility Among Combinatorial Problems},
  editor =              {Miller, Raymond E. and Thatcher, James W.},
  booktitle =           {{P}roceedings of a symposium on the Complexity of
                         Computer Computations ({CCC}'72)},
  acronym =             {{CCC}'72},
  publisher =           {Plenum Press},
  series =              {IBM Research Symposia Series},
  pages =               {85-103},
  year =                {1972},
  month =               mar,
}
[Kar78] Richard M. Karp. A characterization of the minimum cycle mean in a digraph. Discrete Mathematics 23(3):309-311. Elsevier, September 1978. 
@article{dm23(3)-Kar,
  author =              {Karp, Richard M.},
  title =               {A~characterization of the minimum cycle mean in a
                         digraph},
  publisher =           {Elsevier},
  journal =             {Discrete Mathematics},
  volume =              {23},
  number =              {3},
  pages =               {309-311},
  year =                {1978},
  month =               sep,
}
[Kar05] Jarkko Kari. Theory of Cellular Automata: A Survey. Theoretical Computer Science 334(1-3):3-33. Elsevier, April 2005. 
@article{tcs334(1-3)-Kar,
  author =              {Kari, Jarkko},
  title =               {Theory of Cellular Automata: A Survey},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {334},
  number =              {1-3},
  pages =               {3-33},
  year =                {2005},
  month =               apr,
}
[KBB+08] Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled Elbassioni, Vladimir Gurvich, Gabor Rudolf, and Jihui Zhao. On short paths interdiction problems: Total and node-wise limited interdiction. Theory of Computing Systems 43(2):204-233. Springer-Verlag, August 2008. 
@article{tcsyst43(2)-KBBEGRZ,
  author =              {Khachiyan, Leonid and Boros, Endre and Borys, Konrad
                         and Elbassioni, Khaled and Gurvich, Vladimir and
                         Rudolf, Gabor and Zhao, Jihui},
  title =               {On short paths interdiction problems: Total and
                         node-wise limited interdiction},
  publisher =           {Springer-Verlag},
  journal =             {Theory of Computing Systems},
  volume =              {43},
  number =              {2},
  pages =               {204-233},
  year =                {2008},
  month =               aug,
  doi =                 {10.1007/s00224-007-9025-6},
}
[KBM13] Jean-François Kempf, Marius Bozga, and Oded Maler. As soon as probable: Optimal scheduling under stochastic uncertainty. In TACAS'13, Lecture Notes in Computer Science 7795, pages 385-400. Springer-Verlag, March 2013. 
@inproceedings{tacas2013-KBM,
  author =              {Kempf, Jean-Fran{\c c}ois and Bozga, Marius and
                         Maler, Oded},
  title =               {As soon as probable: Optimal scheduling under
                         stochastic uncertainty},
  editor =              {Piterman, Nir and Smolka, Scott A.},
  booktitle =           {{P}roceedings of the 19th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'13)},
  acronym =             {{TACAS}'13},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7795},
  pages =               {385-400},
  year =                {2013},
  month =               mar,
}
[KDH+07] Sebastian Kupferschmid, Klaus Dräger, Jörg Hoffmann, Bernd Finkbeiner, Henning Dierks, Andreas Podelski, and Gerd Behrmann. Uppaal/DMC – Abstraction-Based Heuristics for Directed Model Checking. In TACAS'07, Lecture Notes in Computer Science 4424, pages 679-682. Springer-Verlag, March 2007. 
@inproceedings{tacas2007-KDHFDPB,
  author =              {Kupferschmid, Sebastian and Dr{\"a}ger, Klaus and
                         Hoffmann, J{\"o}rg and Finkbeiner, Bernd and Dierks,
                         Henning and Podelski, Andreas and Behrmann, Gerd},
  title =               {{U}ppaal{\slash}{DMC}~-- Abstraction-Based
                         Heuristics for Directed Model Checking},
  editor =              {Grumberg, Orna and Huth, Michael},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'07)},
  acronym =             {{TACAS}'07},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4424},
  pages =               {679-682},
  year =                {2007},
  month =               mar,
}
[KF09] Lars Kuhtz and Bernd Finkbeiner. LTL Path Checking is Efficiently Parallelizable. In ICALP'09, Lecture Notes in Computer Science 5556, pages 235-246. Springer-Verlag, July 2009. 
@inproceedings{icalp2009-KF,
  author =              {Kuhtz, Lars and Finkbeiner, Bernd},
  title =               {{LTL} Path Checking is Efficiently Parallelizable},
  editor =              {Albers, Susanne and Marchetti{-}Spaccamela Alberto
                         and Matias, Yossi and Nikoletseas, Sotiris and
                         Thomas, Wolfgang},
  booktitle =           {{P}roceedings of the 36th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'09)~-- Part~{II}},
  acronym =             {{ICALP}'09},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5556},
  pages =               {235-246},
  year =                {2009},
  month =               jul,
}
[KFS+09] Jeroen Kuipers, Janos Flesch, Gijs Schoenmakers, and Koos Vrieze. Pure subgame-perfect equilibria in free transition games. European Journal of Operational Research 199(2):442-447. Elsevier, December 2009. 
@article{ejor199(2)-KFS,
  author =              {Kuipers, Jeroen and Flesch, Janos and Schoenmakers,
                         Gijs and Vrieze, Koos},
  title =               {Pure subgame-perfect equilibria in free transition
                         games},
  publisher =           {Elsevier},
  journal =             {European Journal of Operational Research},
  volume =              {199},
  number =              {2},
  pages =               {442-447},
  year =                {2009},
  month =               dec,
}
[KG96] Orna Kupferman and Orna Grumberg. Buy One, Get One Free!!!. Journal of Logic and Computation 6(4):523-539. Oxford University Press, August 1996. 
@article{jlc6(4)-KG,
  author =              {Kupferman, Orna and Grumberg, Orna},
  title =               {Buy One, Get One Free!!!},
  publisher =           {Oxford University Press},
  journal =             {Journal of Logic and Computation},
  volume =              {6},
  number =              {4},
  pages =               {523-539},
  year =                {1996},
  month =               aug,
}
[KG96] Orna Kupferman and Orna Grumberg. Branching Time Temporal Logic and Tree Automata. Information and Computation 125(1):62-69. Academic Press, February 1996. 
@article{icomp125(1)-KG,
  author =              {Kupferman, Orna and Grumberg, Orna},
  title =               {Branching Time Temporal Logic and Tree Automata},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {125},
  number =              {1},
  pages =               {62-69},
  year =                {1996},
  month =               feb,
}
[Kha87] Oussama Khatib. A unified approach for motion and force control of robot manipulators: The operational space formulation. IEEE Journal of Robotics and Auomation 3(1):43-53. February 1987. 
@article{jra3(1)-Kha,
  author =              {Khatib, Oussama},
  title =               {A~unified approach for motion and force control of
                         robot manipulators: The operational space
                         formulation},
  journal =             {IEEE Journal of Robotics and Auomation},
  volume =              {3},
  number =              {1},
  pages =               {43-53},
  year =                {1987},
  month =               feb,
  doi =                 {10.1109/JRA.1987.1087068},
}
[KHL08] Sebastian Kupferschmid, Jörg Hoffmann, and Kim Guldstrand Larsen. Fast Directed Model Checking Via Russian Doll Abstraction. In TACAS'08, Lecture Notes in Computer Science 4963, pages 203-217. Springer-Verlag, March 2008. 
@inproceedings{tacas2008-KHL,
  author =              {Kupferschmid, Sebastian and Hoffmann, J{\"o}rg and
                         Larsen, Kim Guldstrand},
  title =               {Fast Directed Model Checking Via Russian Doll
                         Abstraction},
  editor =              {Ramakrishnan, C. R. and Rehof, Jakob},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'08)},
  acronym =             {{TACAS}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4963},
  pages =               {203-217},
  year =                {2008},
  month =               mar,
}
[KHM+94] Arjun Kapur, Thomas A. Henzinger, Zohar Manna, and Amir Pnueli. Proving Safety Properties of Hybrid Systems. In FTRTFT'94, Lecture Notes in Computer Science 863, pages 431-454. Springer-Verlag, September 1994. 
@inproceedings{ftrtft1994-KHMP,
  author =              {Kapur, Arjun and Henzinger, Thomas A. and Manna,
                         Zohar and Pnueli, Amir},
  title =               {Proving Safety Properties of Hybrid Systems},
  editor =              {Langmaack, Hans and de Roever, Willem-Paul and
                         Vytopil, Jan},
  booktitle =           {{P}roceedings of the 3rd {F}ormal {T}echniques in
                         {R}eal-Time and {F}ault-Tolerant {S}ystems
                         ({FTRTFT}'94)},
  acronym =             {{FTRTFT}'94},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {863},
  pages =               {431-454},
  year =                {1994},
  month =               sep,
}
[Kir02] Daniel Kirsten. Alternating tree automata and parity games. In Erich Grädel, Wolfgang Thomas, and Thomas Wilke (eds.), Automata, Logics, and Infinite Games, Lecture Notes in Computer Science 2500, pages 153-167. Springer-Verlag, 2002. 
@incollection{lncs2500-kirsten,
  author =              {Kirsten, Daniel},
  title =               {Alternating tree automata and parity games},
  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 =               {153-167},
  year =                {2002},
}
[KJJ02] Andrei A. Krokhin, Peter Jeavons, and Peter Jonsson. The Complexity of Constraints on Intervals and Lengths. In STACS'02, Lecture Notes in Computer Science 2285, pages 443-454. Springer-Verlag, March 2002. 
@inproceedings{stacs2002-KJJ,
  author =              {Krokhin, Andrei A. and Jeavons, Peter and Jonsson,
                         Peter},
  title =               {The Complexity of Constraints on Intervals and
                         Lengths},
  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 =               {443-454},
  year =                {2002},
  month =               mar,
}
[KLL+97] Kåre J. Kristoffersen, François Laroussinie, Kim Guldstrand Larsen, Paul Pettersson, and Wang Yi. A Compositional Proof of a Real-Time Mutual Exclusion Protocol. In TAPSOFT'97, Lecture Notes in Computer Science 1214, pages 565-579. Springer-Verlag, April 1997. 
@inproceedings{tapsoft1997-KLLPY,
  author =              {Kristoffersen, K{\aa}re J. and Laroussinie, Fran{\c
                         c}ois and Larsen, Kim Guldstrand and Pettersson,
                         Paul and Yi, Wang},
  title =               {A Compositional Proof of a Real-Time Mutual
                         Exclusion Protocol},
  editor =              {Bidoit, Michel and Dauchet, Max},
  booktitle =           {{P}roceedings of the 7th {I}nternational {J}oint
                         {C}onference {CAAP}{\slash}{FASE} on {T}heory and
                         {P}ractice of {S}oftware {D}evelopment
                         ({TAPSOFT}'97)},
  acronym =             {{TAPSOFT}'97},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1214},
  pages =               {565-579},
  year =                {1997},
  month =               apr,
}
[Klo94] Ton Kloks. Treewidth, Computations and Approximations. Lecture Notes in Computer Science 842. Springer-Verlag, 1994. 
@book{twca1994-Klo,
  author =              {Kloks, Ton},
  title =               {Treewidth, Computations and Approximations},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {842},
  year =                {1994},
  doi =                 {10.1007/BFb0045375},
}
[KLS+12] Miroslav Klimoš, Kim Guldstrand Larsen, Filip Štefaňák, and Jeppe Thaarup. Nash Equilibria in Concurrent Priced Games. In LATA'12, Lecture Notes in Computer Science 7183, pages 363-376. Springer-Verlag, May 2012. 
@inproceedings{lata2012-KLST,
  author =              {Klimo{\v{s}}, Miroslav and Larsen, Kim Guldstrand
                         and {\v{S}}tefa{\v{n}}{\'a}k, Filip and Thaarup,
                         Jeppe},
  title =               {{N}ash Equilibria in Concurrent Priced Games},
  editor =              {Dediu, Adrian Horia and Mart{\'\i}n-Vide, Carlos},
  booktitle =           {{P}roceedings of the 6th {I}nternational
                         {C}onference on {L}anguage and {A}utomata {T}heory
                         and {A}pplications ({LATA}'12)},
  acronym =             {{LATA}'12},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7183},
  pages =               {363-376},
  year =                {2012},
  month =               may,
}
[KLV03] George Karakostas, Richard J. Lipton, and Anastasios Viglas. On the Complexity of Intersecting Finite State Automata and NL versus NP. Theoretical Computer Science 302(1-3):257-274. Elsevier, June 2003. 
@article{tcs302(1-3)-KLV,
  author =              {Karakostas, George and Lipton, Richard J. and
                         Viglas, Anastasios},
  title =               {On the Complexity of Intersecting Finite State
                         Automata and {NL} versus~{NP}},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {302},
  number =              {1-3},
  pages =               {257-274},
  year =                {2003},
  month =               jun,
}
[KM01] Jarkko Kari and Cristopher Moore. Rectangles and Squares Recognized by Two-dimensional Automata. In STACS'01, Lecture Notes in Computer Science 2010, pages 396-406. Springer-Verlag, February 2001. 
@inproceedings{stacs2001-KM,
  author =              {Kari, Jarkko and Moore, Cristopher},
  title =               {Rectangles and Squares Recognized by Two-dimensional
                         Automata},
  editor =              {Ferreira, Afonso and Reichel, Horst},
  booktitle =           {{P}roceedings of the 18th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'01)},
  acronym =             {{STACS}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2010},
  pages =               {396-406},
  year =                {2001},
  month =               feb,
}
[KM02] Antonín Kučera and Richard Mayr. Why is Simulation Harder than Bisimulation?. In CONCUR'02, Lecture Notes in Computer Science 2421, pages 594-609. Springer-Verlag, August 2002. 
@inproceedings{concur2002-KM,
  author =              {Ku{\v c}era, Anton{\'\i}n and Mayr, Richard},
  title =               {Why is Simulation Harder than Bisimulation?},
  editor =              {Brim, Lubo{\v s} and Jan{\v c}ar, Petr and K{\v
                         r}et{\'\i}nsk{\'y}, Mojm{\'\i}r and Ku{\v c}era,
                         Anton{\'\i}n},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'02)},
  acronym =             {{CONCUR}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2421},
  pages =               {594-609},
  year =                {2002},
  month =               aug,
}
[KMM+93] Yonit Kesten, Zohar Manna, Hugh McGuire, and Amir Pnueli. A Decision Algorithm for Full Propositional Temporal Logic. In CAV'93, Lecture Notes in Computer Science 697, pages 97-109. Springer-Verlag, June 1993. 
@inproceedings{cav1993-KMMP,
  author =              {Kesten, Yonit and Manna, Zohar and McGuire, Hugh and
                         Pnueli, Amir},
  title =               {A Decision Algorithm for Full Propositional Temporal
                         Logic},
  editor =              {Courcoubetis, Costas},
  booktitle =           {{P}roceedings of the 5th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'93)},
  acronym =             {{CAV}'93},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {697},
  pages =               {97-109},
  year =                {1993},
  month =               jun,
}
[KMP00] Yonit Kesten, Zohar Manna, and Amir Pnueli. Verifying Clocked Transition Systems. Acta Informatica 36(11):837-912. Springer-Verlag, 2000. 
@article{acta36(11)-KMP,
  author =              {Kesten, Yonit and Manna, Zohar and Pnueli, Amir},
  title =               {Verifying Clocked Transition Systems},
  publisher =           {Springer-Verlag},
  journal =             {Acta Informatica},
  volume =              {36},
  number =              {11},
  pages =               {837-912},
  year =                {2000},
}
[KMP16] Shankara Narayanan Krishna, Khushraj Madnani, and Paritosh K. Pandya. Metric Temporal Logic with Counting. In FoSSaCS'16, Lecture Notes in Computer Science 9634, pages 335-352. Springer-Verlag, April 2016. 
@inproceedings{fossacs2016-KMP,
  author =              {Krishna, Shankara Narayanan and Madnani, Khushraj
                         and Pandya, Paritosh K.},
  title =               {Metric Temporal Logic with Counting},
  editor =              {Jacobs, Bart and L{\"o}ding, Christof},
  booktitle =           {{P}roceedings of the 19th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'16)},
  acronym =             {{FoSSaCS}'16},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9634},
  pages =               {335-352},
  year =                {2016},
  month =               apr,
  doi =                 {10.1007/978-3-662-49630-5_20},
}
[KMS19] Sophia Knight, Bastien Maubert, and François Schwarzentruber. Reasoning about knowledge and messages in asynchronous multi-agent systems. Mathematical Structures in Computer Science 29(1):127-168. January 2019. 
@article{mscs29(1)-KMS,
  author =              {Knight, Sophia and Maubert, Bastien and
                         Schwarzentruber, Fran{\c c}ois},
  title =               {Reasoning about knowledge and messages in
                         asynchronous multi-agent systems},
  journal =             {Mathematical Structures in Computer Science},
  volume =              {29},
  number =              {1},
  pages =               {127-168},
  year =                {2019},
  month =               jan,
  doi =                 {10.1017/S0960129517000214},
}
[KMS+04] Daniel Král, Vladan Majerech, Jiří Sgall, Tomáš Tichý, and Gerhard J. Woeginger. It is Tough to be a Plumber. Theoretical Computer Science 313(3):473-484. Elsevier, February 2004. 
@article{tcs313(3)-KMSTW,
  author =              {Kr{\'a}l, Daniel and Majerech, Vladan and Sgall,
                         Ji{\v r}{\'\i} and Tich{\'y}, Tom{\'a}{\v s} and
                         Woeginger, Gerhard J.},
  title =               {It is Tough to be a Plumber},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {313},
  number =              {3},
  pages =               {473-484},
  year =                {2004},
  month =               feb,
}
[KMT+00] Orna Kupferman, Parthasarathy Madhusudan, P. S. Thiagarajan, and Moshe Y. Vardi. Open Systems in Reactive Environments: Control and Synthesis. In CONCUR'00, Lecture Notes in Computer Science 1877, pages 92-107. Springer-Verlag, August 2000. 
@inproceedings{concur2000-KMTV,
  author =              {Kupferman, Orna and Madhusudan, Parthasarathy and
                         Thiagarajan, P. S. and Vardi, Moshe Y.},
  title =               {Open Systems in Reactive Environments: Control and
                         Synthesis},
  editor =              {Palamidessi, Catuscia},
  booktitle =           {{P}roceedings of the 11th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'00)},
  acronym =             {{CONCUR}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1877},
  pages =               {92-107},
  year =                {2000},
  month =               aug,
}
[KMT+04] Pavel Krčál, Leonid Mokrushin, P. S. Thiagarajan, and Wang Yi. Timed vs. Timed-Triggered Automata. In CONCUR'04, Lecture Notes in Computer Science 3170, pages 340-354. Springer-Verlag, August 2004. 
@inproceedings{concur2004-KMTY,
  author =              {Kr{\v{c}}{\'a}l, Pavel and Mokrushin, Leonid and
                         Thiagarajan, P. S. and Yi, Wang},
  title =               {Timed vs.{} Timed-Triggered Automata},
  editor =              {Gardner, {\relax Ph}ilippa and Yoshida, Nobuko},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'04)},
  acronym =             {{CONCUR}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3170},
  pages =               {340-354},
  year =                {2004},
  month =               aug,
}
[Kna28] Bronisław Knaster. Un théorème sur les fonctions d'ensembles. Annales de la Société Polonaise de Mathématiques 6:133-134. Polish Mathematical Society, 1928. 
@article{aspm6()-Kna,
  author =              {Knaster, Bronis{\l}aw},
  title =               {Un th{\'e}or{\`e}me sur les fonctions d'ensembles},
  publisher =           {Polish Mathematical Society},
  journal =             {Annales de la Soci\'et\'e Polonaise de
                         Math\'ematiques},
  volume =              {6},
  pages =               {133-134},
  year =                {1928},
}
[KNP06] Marta Kwiatkowska, Gethin Norman, and David Parker. Symmetry Reduction for Probabilistic Model Checking. In CAV'06, Lecture Notes in Computer Science 4144, pages 234-248. Springer-Verlag, July 2006. 
@inproceedings{cav2006-KNP,
  author =              {Kwiatkowska, Marta and Norman, Gethin and Parker,
                         David},
  title =               {Symmetry Reduction for Probabilistic Model Checking},
  editor =              {Ball, Thomas and Jones, Robert},
  booktitle =           {{P}roceedings of the 18th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'06)},
  acronym =             {{CAV}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4144},
  pages =               {234-248},
  year =                {2006},
  month =               jul,
  doi =                 {10.1007/11817963_23},
}
[KNS+02] Marta Kwiatkowska, Gethin Norman, Roberto Segala, and Jeremy Sproston. Automatic verification of real-time systems with discrete probability distributions. Theoretical Computer Science 282(1):101-150. Elsevier, June 2002. 
@article{tcs282(1)-KNSS,
  author =              {Kwiatkowska, Marta and Norman, Gethin and Segala,
                         Roberto and Sproston, Jeremy},
  title =               {Automatic verification of real-time systems with
                         discrete probability distributions},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {282},
  number =              {1},
  pages =               {101-150},
  year =                {2002},
  month =               jun,
  doi =                 {10.1016/S0304-3975(01)00046-9},
}
[KO05] Ahmed Khoumsi and Lucien Ouedraogo. A New Method for Transforming Timed Automata. In SBMF'04, Electronic Notes in Theoretical Computer Science 130. Elsevier, 2005. 
@inproceedings{sbmf2004-KO,
  author =              {Khoumsi, Ahmed and Ouedraogo, Lucien},
  title =               {A New Method for Transforming Timed Automata},
  editor =              {Mota, Alexandre and Moura, Arnaldo V.},
  booktitle =           {{P}roceedings of the 7th {B}razilian {S}ymposium on
                         {F}ormal {M}ethods ({SBMF}'04)},
  acronym =             {{SBMF}'04},
  publisher =           {Elsevier},
  series =              {Electronic Notes in Theoretical Computer Science},
  volume =              {130},
  year =                {2005},
  confyear =            {2004},
  confmonth =           {11},
}
[Kon27] Dénes Kőnig. Über eine Schlussweise aus dem Endlichen ins Unendliche. Acta litt. sci. Reg. Univ. Hung. Francisco-Josephinae, Sect. sci. math. 3(2-3):121-130. János Bolyai Mathematical Institute, University of Szeged, June 1927. 
@article{actaszeged3(2-3)-Kon,
  author =              {K{\H o}nig, D{\'e}nes},
  title =               {{\"U}ber eine Schlussweise aus dem Endlichen ins
                         Unendliche},
  publisher =           {J{\'a}nos Bolyai Mathematical Institute, University
                         of Szeged},
  journal =             {Acta litt. sci. Reg. Univ. Hung.
                         Francisco-Josephinae, Sect. sci. math.},
  volume =              {3},
  number =              {2-3},
  pages =               {121-130},
  year =                {1927},
  month =               jun,
}
[Kop06] Eryk Kopczynski. Half-Positional Determinacy of Infinite Games. In ICALP'06, Lecture Notes in Computer Science 4052, pages 336-347. Springer-Verlag, July 2006. 
@inproceedings{icalp2006-Kop,
  author =              {Kopczynski, Eryk},
  title =               {Half-Positional Determinacy of Infinite Games},
  editor =              {Bugliesi, Michele and Preneel, Bart and Sassone,
                         Vladimiro and Wegener, Ingo},
  booktitle =           {{P}roceedings of the 33rd {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'06))~-- Part~{II}},
  acronym =             {{ICALP}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4052},
  pages =               {336-347},
  year =                {2006},
  month =               jul,
  doi =                 {10.1007/11787006_29},
}
[Koy87] Ron Koymans. Specifying Message Passing and Real-Time Systems with Real-Time Temporal Logic. In ESPRIT'87. Elsevier, September 1987. 
@inproceedings{esprit1987-Koy,
  author =              {Koymans, Ron},
  title =               {Specifying Message Passing and Real-Time Systems
                         with Real-Time Temporal Logic},
  booktitle =           {{P}roceedings of the 4th {A}nnual {ESPRIT}
                         {C}onference ({ESPRIT}'87)},
  acronym =             {{ESPRIT}'87},
  publisher =           {Elsevier},
  year =                {1987},
  month =               sep,
}
[Koy90] Ron Koymans. Specifying Real-Time Properties with Metric Temporal Logic. Real-Time Systems 2(4):255-299. Kluwer Academic, 1990. 
@article{rts2(4)-Koy,
  author =              {Koymans, Ron},
  title =               {Specifying Real-Time Properties with Metric Temporal
                         Logic},
  publisher =           {Kluwer Academic},
  journal =             {Real-Time Systems},
  volume =              {2},
  number =              {4},
  pages =               {255-299},
  year =                {1990},
}
[Koz83] Dexter C. Kozen. Results on the Propositional μ-calculus. Theoretical Computer Science 27:333-354. Elsevier, 1983. 
@article{tcs27()-Koz,
  author =              {Kozen, Dexter C.},
  title =               {Results on the Propositional {\(\mu\)}-calculus},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {27},
  pages =               {333-354},
  year =                {1983},
}
[Koz92] Dexter C. Kozen. The design and analysis of algorithms. Springer-Verlag, 1992. 
@book{Koz92-daa,
  author =              {Kozen, Dexter C.},
  title =               {The design and analysis of algorithms},
  publisher =           {Springer-Verlag},
  year =                {1992},
  doi =                 {10.1007/978-1-4612-4400-4},
}
[Koz06] Dexter C. Kozen. Coinductive Proof Principles for Stochastic Processes. In LICS'06, pages 359-366. IEEE Comp. Soc. Press, July 2006. 
@inproceedings{lics2006-koz,
  author =              {Kozen, Dexter C.},
  title =               {Coinductive Proof Principles for Stochastic
                         Processes},
  booktitle =           {{P}roceedings of the 21st {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'06)},
  acronym =             {{LICS}'06},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {359-366},
  year =                {2006},
  month =               jul,
}
[KP95] Yonit Kesten and Amir Pnueli. A Complete Proof Systems for QPTL. In LICS'95, pages 2-12. IEEE Comp. Soc. Press, June 1995. 
@inproceedings{lics1995-KeP,
  author =              {Kesten, Yonit and Pnueli, Amir},
  title =               {A Complete Proof Systems for {QPTL}},
  booktitle =           {{P}roceedings of the 10th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'95)},
  acronym =             {{LICS}'95},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {2-12},
  year =                {1995},
  month =               jun,
}
[KP95] Orna Kupferman and Amir Pnueli. Once and For All. In LICS'95, pages 25-35. IEEE Comp. Soc. Press, June 1995. 
@inproceedings{lics1995-KuP,
  author =              {Kupferman, Orna and Pnueli, Amir},
  title =               {{\emph{Once}} and {\emph{For All}}},
  booktitle =           {{P}roceedings of the 10th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'95)},
  acronym =             {{LICS}'95},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {25-35},
  year =                {1995},
  month =               jun,
}
[KP99] Elias Koutsoupias and Christos H. Papadimitriou. Worst-case equilibria. In STACS'99, Lecture Notes in Computer Science 1563, pages 404-413. Springer-Verlag, March 1999. 
@inproceedings{stacs1999-KP,
  author =              {Koutsoupias, Elias and Papadimitriou, {\relax
                         Ch}ristos H.},
  title =               {Worst-case equilibria},
  editor =              {Meinel, {\relax Ch}ristoph and Tison, Sophie},
  booktitle =           {{P}roceedings of the 16th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'99)},
  acronym =             {{STACS}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1563},
  pages =               {404-413},
  year =                {1999},
  month =               mar,
  doi =                 {10.1007/3-540-49116-3_38},
}
[KP02] Yonit Kesten and Amir Pnueli. Complete Proof System for QPTL. Journal of Logic and Computation 12(5):701-745. Oxford University Press, October 2002. 
@article{jlc12(5)-KP,
  author =              {Kesten, Yonit and Pnueli, Amir},
  title =               {Complete Proof System for~{QPTL}},
  publisher =           {Oxford University Press},
  journal =             {Journal of Logic and Computation},
  volume =              {12},
  number =              {5},
  pages =               {701-745},
  year =                {2002},
  month =               oct,
  doi =                 {10.1093/logcom/12.5.701},
}
[KP02] Beata Konikowska and Wojciech Penczek. Reducing Model Checking from Multi-Valued CTL* to CTL*. In CONCUR'02, Lecture Notes in Computer Science 2421, pages 226-239. Springer-Verlag, August 2002. 
@inproceedings{concur2002-KP,
  author =              {Konikowska, Beata and Penczek, Wojciech},
  title =               {Reducing Model Checking from Multi-Valued
                         {CTL}{\(^*\)} to {CTL}{\(^*\)}},
  editor =              {Brim, Lubo{\v s} and Jan{\v c}ar, Petr and K{\v
                         r}et{\'\i}nsk{\'y}, Mojm{\'\i}r and Ku{\v c}era,
                         Anton{\'\i}n},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'02)},
  acronym =             {{CONCUR}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2421},
  pages =               {226-239},
  year =                {2002},
  month =               aug,
}
[KP04] Magdalena Kacprzak and Wojciech Penczek. Unbounded Model Checking for Alternating-Time Temporal Logic. In AAMAS'04, pages 646-653. IEEE Comp. Soc. Press, August 2004. 
@inproceedings{aamas2004-KP,
  author =              {Kacprzak, Magdalena and Penczek, Wojciech},
  title =               {Unbounded Model Checking for Alternating-Time
                         Temporal Logic},
  booktitle =           {{P}roceedings of the 3rd {I}nternational {J}oint
                         {C}onference on {A}utonomous {A}gents and
                         {M}ultiagent {S}ystems ({AAMAS}'04)},
  acronym =             {{AAMAS}'04},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {646-653},
  year =                {2004},
  month =               aug,
}
[KP05] Yonit Kesten and Amir Pnueli. A Compositional Approach to CTL* Verification. Theoretical Computer Science 331(2-3):397-428. Elsevier, February 2005. 
@article{tcs331(2-3)-KP,
  author =              {Kesten, Yonit and Pnueli, Amir},
  title =               {A Compositional Approach to {CTL}{\(^*\)}
                         Verification},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {331},
  number =              {2-3},
  pages =               {397-428},
  year =                {2005},
  month =               feb,
}
[KP05] Pavel Krčál and Radek Pelánek. On Sampled Semantics of Timed Systems. In FSTTCS'05, Lecture Notes in Computer Science 3821, pages 310-321. Springer-Verlag, December 2005. 
@inproceedings{fsttcs2005-KP,
  author =              {Kr{\v{c}}{\'{a}}l, Pavel and Pel{\'{a}}nek, Radek},
  title =               {On Sampled Semantics of Timed Systems},
  editor =              {Ramanujam, R. and Sen, Sandeep},
  booktitle =           {{P}roceedings of the 25th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'05)},
  acronym =             {{FSTTCS}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3821},
  pages =               {310-321},
  year =                {2005},
  month =               dec,
}
[KP09] Elias Koutsoupias and Christos H. Papadimitriou. Worst-case equilibria. Computer Science Review 3(2):65-69. May 2009. 
@article{KP-csr09,
  author =              {Koutsoupias, Elias and Papadimitriou, {\relax
                         Ch}ristos H.},
  title =               {Worst-case equilibria},
  journal =             {Computer Science Review},
  volume =              {3},
  number =              {2},
  pages =               {65-69},
  year =                {2009},
  month =               may,
  doi =                 {10.1016/j.cosrev.2009.04.003},
}
[KP12] Elias Koutsoupias and Katia Papakonstantinopoulou. Contention Issues in Congestion Games. In ICALP'12, Lecture Notes in Computer Science 7392, pages 623-635. Springer-Verlag, July 2012. 
@inproceedings{icalp2012-KP,
  author =              {Koutsoupias, Elias and Papakonstantinopoulou, Katia},
  title =               {Contention Issues in Congestion Games},
  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 =               {623-635},
  year =                {2012},
  month =               jul,
  doi =                 {10.1007/978-3-642-31585-5_55},
}
[KPA03] Kåre J. Kristoffersen, Christian Pedersen, and Henrik Reif Andersen. Runtime Verification of Timed LTL Using Disjunctive Normalized Equation Systems. In RV'03, Electronic Notes in Theoretical Computer Science 89(2). Elsevier, 2003. 
@inproceedings{rv2003-KPA,
  author =              {Kristoffersen, K{\aa}re J. and Pedersen, Christian
                         and Andersen, Henrik Reif},
  title =               {Runtime Verification of Timed {LTL} Using
                         Disjunctive Normalized Equation Systems},
  editor =              {Cook, Byron and Stoller, Scott and Viser, Willem},
  booktitle =           {{P}roceedings of the 3rd {I}nternational {W}orkshop
                         on {R}untime {V}erification ({RV}'03)},
  acronym =             {{RV}'03},
  publisher =           {Elsevier},
  series =              {Electronic Notes in Theoretical Computer Science},
  volume =              {89},
  number =              {2},
  year =                {2003},
  confyear =            {2003},
  confmonth =           {7},
}
[KPR98] Yonit Kesten, Amir Pnueli, and Li-on Raviv. Algorithmic Verification of Linear Temporal Logic Specifications. In ICALP'98, Lecture Notes in Computer Science 1443, pages 1-16. Springer-Verlag, July 1998. 
@inproceedings{icalp1998-KPR,
  author =              {Kesten, Yonit and Pnueli, Amir and Raviv, Li-on},
  title =               {Algorithmic Verification of Linear Temporal Logic
                         Specifications},
  editor =              {Larsen, Kim Guldstrand and Skyum, Sven and Winskel,
                         Glynn},
  booktitle =           {{P}roceedings of the 25th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'98)},
  acronym =             {{ICALP}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1443},
  pages =               {1-16},
  year =                {1998},
  month =               jul,
}
[KPS+99] Yonit Kesten, Amir Pnueli, Joseph Sifakis, and Sergio Yovine. Decidable Integration Graphs. Information and Computation 150(2):209-243. Academic Press, May 1999. 
@article{icomp150(2)-KPSY,
  author =              {Kesten, Yonit and Pnueli, Amir and Sifakis, Joseph
                         and Yovine, Sergio},
  title =               {Decidable Integration Graphs},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {150},
  number =              {2},
  pages =               {209-243},
  year =                {1999},
  month =               may,
  doi =                 {10.1006/inco.1998.2774},
}
[KPS+02] Yonit Kesten, Amir Pnueli, Elad Shahar, and Lenore D. Zuck. Network Invariants in Action. In CONCUR'02, Lecture Notes in Computer Science 2421, pages 101-115. Springer-Verlag, August 2002. 
@inproceedings{concur2002-KPSZ,
  author =              {Kesten, Yonit and Pnueli, Amir and Shahar, Elad and
                         Zuck, Lenore D.},
  title =               {Network Invariants in Action},
  editor =              {Brim, Lubo{\v s} and Jan{\v c}ar, Petr and K{\v
                         r}et{\'\i}nsk{\'y}, Mojm{\'\i}r and Ku{\v c}era,
                         Anton{\'\i}n},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'02)},
  acronym =             {{CONCUR}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2421},
  pages =               {101-115},
  year =                {2002},
  month =               aug,
}
[KPV01] Orna Kupferman, Nir Piterman, and Moshe Y. Vardi. Extended Temporal Logic Revisited. In CONCUR'01, Lecture Notes in Computer Science 2154, pages 519-535. Springer-Verlag, August 2001. 
@inproceedings{concur2001-KPV,
  author =              {Kupferman, Orna and Piterman, Nir and Vardi, Moshe
                         Y.},
  title =               {Extended Temporal Logic Revisited},
  editor =              {Larsen, Kim Guldstrand and Nielsen, Mogens},
  booktitle =           {{P}roceedings of the 12th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'01)},
  acronym =             {{CONCUR}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2154},
  pages =               {519-535},
  year =                {2001},
  month =               aug,
}
[KPV12] Orna Kupferman, Amir Pnueli, and Moshe Y. Vardi. Once and For All. Journal of Computer and System Sciences 78(3):981-996. Elsevier, May 2012. 
@article{jcss78(3)-KPV,
  author =              {Kupferman, Orna and Pnueli, Amir and Vardi, Moshe
                         Y.},
  title =               {{\emph{Once}} and {\emph{For All}}},
  publisher =           {Elsevier},
  journal =             {Journal of Computer and System Sciences},
  volume =              {78},
  number =              {3},
  pages =               {981-996},
  year =                {2012},
  month =               may,
  doi =                 {10.1016/j.jcss.2011.08.006},
}
[KPV16] Orna Kupferman, Giuseppe Perelli, and Moshe Y. Vardi. Synthesis with rational environments. Annals of Mathematics and Artificial Intelligence 78(1):3-20. Kluwer Academic, September 2016. 
@article{amai78(1)-KPV,
  author =              {Kupferman, Orna and Perelli, Giuseppe and Vardi,
                         Moshe Y.},
  title =               {Synthesis with rational environments},
  publisher =           {Kluwer Academic},
  journal =             {Annals of Mathematics and Artificial Intelligence},
  volume =              {78},
  number =              {1},
  pages =               {3-20},
  year =                {2016},
  month =               sep,
  doi =                 {10.1007/s10472-016-9508-8},
}
[KR13] Jim Kurose and Keith Ross. Computer Networks – A top-down approach. Pearson, 2013. 
@book{KR13-CN,
  author =              {Kurose, Jim and Ross, Keith},
  title =               {Computer Networks~-- A~top-down approach},
  publisher =           {Pearson},
  year =                {2013},
}
[Kre87] Mark W. Krentel. The Complexity of Optimization Problems. PhD thesis, Department of Computer Science, Cornell University, Ithaca, New York, USA, 1987. 
@phdthesis{phd-krentel,
  author =              {Krentel, Mark W.},
  title =               {The Complexity of Optimization Problems},
  year =                {1987},
  school =              {Department of Computer Science, Cornell University,
                         Ithaca, New York, USA},
  type =                {{PhD} thesis},
}
[Kre88] Mark W. Krentel. The Complexity of Optimization Problems. Journal of Computer and System Sciences 36(3):490-509. Academic Press, June 1988. 
@article{jcss36(3)-Kre,
  author =              {Krentel, Mark W.},
  title =               {The Complexity of Optimization Problems},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {36},
  number =              {3},
  pages =               {490-509},
  year =                {1988},
  month =               jun,
}
[Kri59] Saul A. Kripke. A Completeness Theorem in Modal Logic. Journal of Symbolic Logic 24(1):1-14. Association for Symbolic Logic, March 1959. 
@article{jsl24(1)-Kri,
  author =              {Kripke, Saul A.},
  title =               {A Completeness Theorem in Modal Logic},
  publisher =           {Association for Symbolic Logic},
  journal =             {Journal of Symbolic Logic},
  volume =              {24},
  number =              {1},
  pages =               {1-14},
  year =                {1959},
  month =               mar,
}
[Kri63] Saul A. Kripke. Semantical Considerations on Modal Logic. Acta Philosophica Fennica 16:83-94. Philosophical Society of Finland, 1963. 
@article{apf16()-Kri,
  author =              {Kripke, Saul A.},
  title =               {Semantical Considerations on Modal Logic},
  publisher =           {Philosophical Society of Finland},
  journal =             {Acta Philosophica Fennica},
  volume =              {16},
  pages =               {83-94},
  year =                {1963},
}
[Kri63] Saul A. Kripke. Semantical Analysis of Modal Logic I: Normal Modal Propositional Calculi. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 9(5-6):67-96. Deutscher Verlag der Wissenschaften, 1963. 
@article{zml9(5-6)-Kri,
  author =              {Kripke, Saul A.},
  title =               {Semantical Analysis of Modal Logic~{I}: Normal Modal
                         Propositional Calculi},
  publisher =           {Deutscher Verlag der Wissenschaften},
  journal =             {Zeitschrift fur mathematische Logik und Grundlagen
                         der Mathematik},
  volume =              {9},
  number =              {5-6},
  pages =               {67-96},
  year =                {1963},
}
[KRS97] Marek Karpinski, Wojciech Rytter, and Ayumi Shinohara. An Efficient Pattern-Matching Algorithm for Strings with Short Description. Nordic Journal of Computing 4(2):172-186. Publishing Association Nordic Journal of Computing, 1997. 
@article{njc4(2)-KRS,
  author =              {Karpinski, Marek and Rytter, Wojciech and Shinohara,
                         Ayumi},
  title =               {An Efficient Pattern-Matching Algorithm for Strings
                         with Short Description},
  publisher =           {Publishing Association Nordic Journal of Computing},
  journal =             {Nordic Journal of Computing},
  volume =              {4},
  number =              {2},
  pages =               {172-186},
  year =                {1997},
}
[KRT09] Dominik Klein, Frank G. Radmacher, and Wolfgang Thomas. The Complexity of Reachability in Randomized Sabotage Games. In FSEN'09, Lecture Notes in Computer Science 5961, pages 162-177. Springer-Verlag, April 2009. 
@inproceedings{fsen2009-KRT,
  author =              {Klein, Dominik and Radmacher, Frank G. and Thomas,
                         Wolfgang},
  title =               {The Complexity of Reachability in Randomized
                         Sabotage Games},
  editor =              {Arbab, Farhad and Sirjani, Marjan},
  booktitle =           {{R}evised {S}elected {P}apers of the 3rd
                         {I}nternational {C}onference on {F}undamentals of
                         {S}oftware {E}ngineering ({FSEN}'09)},
  acronym =             {{FSEN}'09},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5961},
  pages =               {162-177},
  year =                {2009},
  month =               apr,
}
[KS83] Paris C. Kanellakis and Scott A. Smolka. CCS expressions finite state processes, and three problems of equivalence. In PODC'83, pages 228-240. ACM Press, August 1983. 
@inproceedings{podc1983-KS,
  author =              {Kanellakis, Paris C. and Smolka, Scott A.},
  title =               {{CCS} expressions finite state processes, and three
                         problems of equivalence},
  booktitle =           {{P}roceedings of the 2nd {ACM} {S}ymposium on
                         {P}rinciples of {D}istributed {C}omputing
                         ({PODC}'83)},
  acronym =             {{PODC}'83},
  publisher =           {ACM Press},
  pages =               {228-240},
  year =                {1983},
  month =               aug,
}
[KS88] S. Rao Kosaraju and Gregory F. Sullivan. Detecting cycles in dynamic graphs in polynomial time. In STOC'88, pages 398-406. ACM Press, May 1988. 
@inproceedings{stoc1988-KS,
  author =              {Kosaraju, S. Rao and Sullivan, Gregory F.},
  title =               {Detecting cycles in dynamic graphs in polynomial
                         time},
  booktitle =           {{P}roceedings of the 20th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'88)},
  acronym =             {{STOC}'88},
  publisher =           {ACM Press},
  pages =               {398-406},
  year =                {1988},
  month =               may,
  doi =                 {10.1145/62212.62251},
}
[KS90] Paris C. Kanellakis and Scott A. Smolka. CCS expressions finite state processes, and three problems of equivalence. Information and Computation 86(1):43-68. Academic Press, May 1990. 
@article{icomp86(1)-KS,
  author =              {Kanellakis, Paris C. and Smolka, Scott A.},
  title =               {{CCS} expressions finite state processes, and three
                         problems of equivalence},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {86},
  number =              {1},
  pages =               {43-68},
  year =                {1990},
  month =               may,
}
[KS02] Antonín Kučera and Jan Strejček. The Stuterring Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL. Technical Report FIMU-RS-2002-03, Faculty of Informatics, Masaryk University, Brno, Czech Republic, July 2002. 
@techreport{fimu-rs-2002-03-KS,
  author =              {Ku{\v c}era, Anton{\'\i}n and Strej{\v c}ek, Jan},
  title =               {The Stuterring Principle Revisited: On the
                         Expressiveness of Nested~{X} and~{U} Operators in
                         the Logic {LTL}},
  number =              {FIMU-RS-2002-03},
  year =                {2002},
  month =               jul,
  institution =         {Faculty of Informatics, Masaryk University, Brno,
                         Czech Republic},
  type =                {Technical Report},
}
[KS03] Dimitris J. Kavvadias and Elias C. Stavropoulos. Monotone Boolean Dualization is in co-NP[log2(n)]. Information Processing Letters 85(1):1-8. Elsevier, January 2003. 
@article{ipl85(1)-KS,
  author =              {Kavvadias, Dimitris J. and Stavropoulos, Elias C.},
  title =               {Monotone Boolean Dualization is in
                         co-{NP}{\([\log^2(n)]\)}},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {85},
  number =              {1},
  pages =               {1-8},
  year =                {2003},
  month =               jan,
}
[KS05] Spyros Kontogiannis and Paul G. Spirakis. Atomic selfish routing in networks: a survey. In WINE'05, Lecture Notes in Computer Science 3828, pages 989-1002. Springer-Verlag, December 2005. 
@inproceedings{wine2005-KS,
  author =              {Kontogiannis, Spyros and Spirakis, Paul G.},
  title =               {Atomic selfish routing in networks: a~survey},
  editor =              {Deng, Xiaotie and Ye, Yinyu},
  booktitle =           {{P}roceedings of the 1st {I}nternational {W}orkshop
                         on {I}nternet and {N}etwork {E}conomics ({WINE}'05)},
  acronym =             {{WINE}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3828},
  pages =               {989-1002},
  year =                {2005},
  month =               dec,
  doi =                 {10.1007/11600930_100},
}
[KS05] Antonín Kučera and Jan Strejček. The Stuttering Principle Revisited. Acta Informatica 41(7-8):415-434. Springer-Verlag, June 2005. 
@article{acta41(7-8)-KS,
  author =              {Ku{\v c}era, Anton{\'\i}n and Strej{\v c}ek, Jan},
  title =               {The Stuttering Principle Revisited},
  publisher =           {Springer-Verlag},
  journal =             {Acta Informatica},
  volume =              {41},
  number =              {7-8},
  pages =               {415-434},
  year =                {2005},
  month =               jun,
  doi =                 {10.1007/s00236-005-0164-4},
}
[KS05] Antonín Kučera and Jan Strejček. Characteristic Patterns for LTL. In SOFSEM'05, Lecture Notes in Computer Science 3381, pages 239-249. Springer-Verlag, January 2005. 
@inproceedings{sofsem2005-KS,
  author =              {Ku{\v c}era, Anton{\'\i}n and Strej{\v c}ek, Jan},
  title =               {Characteristic Patterns for {LTL}},
  editor =              {Vojt{\'a}s, Peter and Bielikov{\'a}, M{\'a}ria and
                         Charron-Bost, Bernadette and S{\'y}kora, Ondrej},
  booktitle =           {{P}roceedings of the 31st {C}onference on {C}urrent
                         {T}rends in {T}heory and {P}ractice of {I}nformatics
                         ({SOFSEM}'05)},
  acronym =             {{SOFSEM}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3381},
  pages =               {239-249},
  year =                {2005},
  month =               jan,
}
[KS11] Ronald Koch and Martin Skutella. Nash equilibria and the price of anarchy for flows over time. Theory of Computing Systems 49(1):71-97. Springer-Verlag, July 2011. 
@article{tocsys49(1)-ks,
  author =              {Koch, Ronald and Skutella, Martin},
  title =               {{N}ash equilibria and the price of anarchy for flows
                         over time},
  publisher =           {Springer-Verlag},
  journal =             {Theory of Computing Systems},
  volume =              {49},
  number =              {1},
  pages =               {71-97},
  year =                {2011},
  month =               jul,
  doi =                 {10.1007/s00224-010-9299-y},
}
[KS15] Denis Kuperberg and Michal Skrzypczak. On determinisation of good-for-games automata. In ICALP'15, Lecture Notes in Computer Science 9135, pages 299-310. Springer-Verlag, July 2015. 
@inproceedings{icalp2015-KS,
  author =              {Kuperberg, Denis and Skrzypczak, Michal},
  title =               {On determinisation of good-for-games automata},
  editor =              {Halld{\'o}rsson, Magn{\'u}s M. and Iwana, Kazuo and
                         Kobayashi, Naoki and Speckmann, Bettina},
  booktitle =           {{P}roceedings of the 42nd {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'15)~-- Part~{II}},
  acronym =             {{ICALP}'15},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9135},
  pages =               {299-310},
  year =                {2015},
  month =               jul,
  doi =                 {10.1007/978-3-662-47666-6_24},
}
[KSC08] Egor V. Kuzmin, Valery A. Sokolov, and Dmitry Y. Chaly. Boundedness Problems for Minsky Counter Machines. Doklady Mathematics 78(1):604-606. Pleiades Publishing, 2008. 
@article{doklady78(1)-KSC,
  author =              {Kuzmin, Egor V. and Sokolov, Valery A. and Chaly,
                         Dmitry Y.},
  title =               {Boundedness Problems for {M}insky Counter Machines},
  publisher =           {Pleiades Publishing},
  journal =             {Doklady Mathematics},
  volume =              {78},
  number =              {1},
  pages =               {604-606},
  year =                {2008},
}
[KST+99] Takuya Kida, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, and Setsuo Arikawa. A Unifying Framework for Compressed Pattern Matching. In SPIRE/CRIWG'99, pages 89-96. IEEE Comp. Soc. Press, September 1999. 
@inproceedings{spire1999-KSTSA,
  author =              {Kida, Takuya and Shibata, Yusuke and Takeda,
                         Masayuki and Shinohara, Ayumi and Arikawa, Setsuo},
  title =               {A Unifying Framework for Compressed Pattern
                         Matching},
  booktitle =           {{P}roceedings of the 6th {S}tring {P}rocessing and
                         {I}nformation {R}etrieval {S}ymposium \&
                         {I}nternational {W}orkshop on {G}roupware
                         ({SPIRE/CRIWG}'99)},
  acronym =             {{SPIRE/CRIWG}'99},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {89-96},
  year =                {1999},
  month =               sep,
}
[KSV96] Orna Kupferman, Shmuel Safra, and Moshe Y. Vardi. Relating Word and Tree Automata. In LICS'96, pages 322-332. IEEE Comp. Soc. Press, July 1996. 
@inproceedings{lics1996-KSV,
  author =              {Kupferman, Orna and Safra, Shmuel and Vardi, Moshe
                         Y.},
  title =               {Relating Word and Tree Automata},
  booktitle =           {{P}roceedings of the 11th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'96)},
  acronym =             {{LICS}'96},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {322-332},
  year =                {1996},
  month =               jul,
  doi =                 {10.1109/LICS.1996.561360},
}
[KSV06] Orna Kupferman, Shmuel Safra, and Moshe Y. Vardi. Relating Word and Tree Automata. Annals of Pure and Applied Logic 138(1-3):126-146. Elsevier, March 2006. 
@article{apal138(1-3)-KSV,
  author =              {Kupferman, Orna and Safra, Shmuel and Vardi, Moshe
                         Y.},
  title =               {Relating Word and Tree Automata},
  publisher =           {Elsevier},
  journal =             {Annals of Pure and Applied Logic},
  volume =              {138},
  number =              {1-3},
  pages =               {126-146},
  year =                {2006},
  month =               mar,
}
[KSW87] Johannes Köbler, Uwe Schöning, and Klaus W. Wagner. The difference and truth-table hierarchies for NP. RAIRO – Informatique Théorique et Applications 21(4):419-435. EDP Sciences, 1987. 
@article{rairo-ita21(4)-KSW,
  author =              {K{\"o}bler, Johannes and Sch{\"o}ning, Uwe and
                         Wagner, Klaus W.},
  title =               {The difference and truth-table hierarchies for~{NP}},
  publisher =           {EDP Sciences},
  journal =             {RAIRO~-- Informatique Th{\'e}orique et Applications},
  volume =              {21},
  number =              {4},
  pages =               {419-435},
  year =                {1987},
}
[KT09] Moez Krichen and Stavros Tripakis. Conformance testing for real-time systems. Formal Methods in System Design 34(3):238-304. Springer-Verlag, June 2009. 
@article{fmsd34(3)-KT,
  author =              {Krichen, Moez and Tripakis, Stavros},
  title =               {Conformance testing for real-time systems},
  publisher =           {Springer-Verlag},
  journal =             {Formal Methods in System Design},
  volume =              {34},
  number =              {3},
  pages =               {238-304},
  year =                {2009},
  month =               jun,
  doi =                 {10.1007/s10703-009-0065-1},
}
[Kuc12] Antonín Kučera. Playing Games with Counter Automata. In RP'12, Lecture Notes in Computer Science 7550, pages 29-41. Springer-Verlag, September 2012. 
@inproceedings{rp2012-Kuc,
  author =              {Ku{\v c}era, Anton{\'\i}n},
  title =               {Playing Games with Counter Automata},
  editor =              {Finkel, Alain and Leroux, J{\'e}r{\^o}me and
                         Potapov, Igor},
  booktitle =           {{P}roceedings of the 6th {W}orkshop on
                         {R}eachability {P}roblems in {C}omputational
                         {M}odels ({RP}'12)},
  acronym =             {{RP}'12},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7550},
  pages =               {29-41},
  year =                {2012},
  month =               sep,
  doi =                 {10.1007/978-3-642-33512-9_4},
}
[Kun80] Kenneth Kunen. Set Theory. Elsevier, 1980. 
@book{SetT-Kunen,
  author =              {Kunen, Kenneth},
  title =               {Set Theory},
  publisher =           {Elsevier},
  year =                {1980},
}
[Kup95] Orna Kupferman. Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions. In CAV'95, Lecture Notes in Computer Science 939, pages 325-338. Springer-Verlag, July 1995. 
@inproceedings{cav1995-Kup,
  author =              {Kupferman, Orna},
  title =               {Augmenting Branching Temporal Logics with
                         Existential Quantification over Atomic Propositions},
  editor =              {Wolper, Pierre},
  booktitle =           {{P}roceedings of the 7th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'95)},
  acronym =             {{CAV}'95},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {939},
  pages =               {325-338},
  year =                {1995},
  month =               jul,
  doi =                 {10.1007/3-540-60045-0_60},
}
[Kup95] Orna Kupferman. Model Checking for Branching-Time Temporal Logics. PhD thesis, Israel Institute of Technology, Haifa, Israel, 1995. 
@phdthesis{phd-kupferman,
  author =              {Kupferman, Orna},
  title =               {Model Checking for Branching-Time Temporal Logics},
  year =                {1995},
  school =              {Israel Institute of Technology, Haifa, Israel},
  type =                {{PhD} thesis},
}
[Kup99] Orna Kupferman. Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions. Journal of Logic and Computation 9(2):135-147. Oxford University Press, April 1999. 
@article{jlc9(2)-Kup,
  author =              {Kupferman, Orna},
  title =               {Augmenting Branching Temporal Logics with
                         Existential Quantification over Atomic Propositions},
  publisher =           {Oxford University Press},
  journal =             {Journal of Logic and Computation},
  volume =              {9},
  number =              {2},
  pages =               {135-147},
  year =                {1999},
  month =               apr,
}
[Kur02] Agi Kurucz. S5 × S5 × S5 lacks the finite model property. In AIML'00, pages 321-327. World Scientific, 2002. 
@inproceedings{aiml2000-Kur,
  author =              {Kurucz, Agi},
  title =               {{{\(S5\times S5\times S5\)}} lacks the finite model
                         property},
  editor =              {de Rijke, Marteen and Wansing, Heinrich and Wolter,
                         Frank and Zakharyaschev, Michael},
  booktitle =           {{P}roceedings of the 3rd {W}orkshop on {A}dvances in
                         {M}odal {L}ogic ({AIML}'00)},
  acronym =             {{AIML}'00},
  publisher =           {World Scientific},
  pages =               {321-327},
  year =                {2002},
  confyear =            {2000},
  confmonth =           {10},
}
[KV97] Orna Kupferman and Moshe Y. Vardi. Weak Alternating Automata Are Not That Weak. In ISTCS'97, pages 147-158. IEEE Comp. Soc. Press, June 1997. 
@inproceedings{istcs1997-KV,
  author =              {Kupferman, Orna and Vardi, Moshe Y.},
  title =               {Weak Alternating Automata Are Not That Weak},
  booktitle =           {{P}roceedings of the 5th {I}srael {S}ymposium on
                         {T}heory of {C}omputing {S}ystems ({ISTCS}'97)},
  acronym =             {{ISTCS}'97},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {147-158},
  year =                {1997},
  month =               jun,
}
[KV97] Orna Kupferman and Moshe Y. Vardi. Module Checking Revisited. In CAV'97, Lecture Notes in Computer Science 1254, pages 36-47. Springer-Verlag, June 1997. 
@inproceedings{cav1997-KV,
  author =              {Kupferman, Orna and Vardi, Moshe Y.},
  title =               {Module Checking Revisited},
  editor =              {Grumberg, Orna},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'97)},
  acronym =             {{CAV}'97},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1254},
  pages =               {36-47},
  year =                {1997},
  month =               jun,
}
[KV98] Orna Kupferman and Moshe Y. Vardi. Freedom, Weakness, and Determinism: From Linear-Time to Branching-Time. In LICS'98, pages 81-92. IEEE Comp. Soc. Press, June 1998. 
@inproceedings{lics1998-KV,
  author =              {Kupferman, Orna and Vardi, Moshe Y.},
  title =               {Freedom, Weakness, and Determinism: From Linear-Time
                         to Branching-Time},
  booktitle =           {{P}roceedings of the 13th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'98)},
  acronym =             {{LICS}'98},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {81-92},
  year =                {1998},
  month =               jun,
}
[KV98] Orna Kupferman and Moshe Y. Vardi. Weak Alternating Automata and Tree Automata Emptiness. In STOC'98, pages 224-233. ACM Press, May 1998. 
@inproceedings{stoc1998-KV,
  author =              {Kupferman, Orna and Vardi, Moshe Y.},
  title =               {Weak Alternating Automata and Tree Automata
                         Emptiness},
  booktitle =           {{P}roceedings of the 30th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'98)},
  acronym =             {{STOC}'98},
  publisher =           {ACM Press},
  pages =               {224-233},
  year =                {1998},
  month =               may,
}
[KV99] Orna Kupferman and Moshe Y. Vardi. Model Checking of Safety Properties. In CAV'99, Lecture Notes in Computer Science 1633, pages 172-183. Springer-Verlag, July 1999. 
@inproceedings{cav1999-KV,
  author =              {Kupferman, Orna and Vardi, Moshe Y.},
  title =               {Model Checking of Safety Properties},
  editor =              {Halbwachs, Nicolas and Peled, Doron A.},
  booktitle =           {{P}roceedings of the 11th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'99)},
  acronym =             {{CAV}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1633},
  pages =               {172-183},
  year =                {1999},
  month =               jul,
}
[KV99] Orna Kupferman and Moshe Y. Vardi. Robust Satisfaction. In CONCUR'99, Lecture Notes in Computer Science 1664, pages 383-398. Springer-Verlag, August 1999. 
@inproceedings{concur1999-KV,
  author =              {Kupferman, Orna and Vardi, Moshe Y.},
  title =               {Robust Satisfaction},
  editor =              {Baeten, Jos C. M. and Mauw, Sjouke},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'99)},
  acronym =             {{CONCUR}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1664},
  pages =               {383-398},
  year =                {1999},
  month =               aug,
}
[KV00] Orna Kupferman and Moshe Y. Vardi. An Automata-Theoretic Approach to Reasoning about Infinite-State Systems. In CAV'00, Lecture Notes in Computer Science 1855, pages 36-52. Springer-Verlag, July 2000. 
@inproceedings{cav2000-KV,
  author =              {Kupferman, Orna and Vardi, Moshe Y.},
  title =               {An Automata-Theoretic Approach to Reasoning about
                         Infinite-State Systems},
  editor =              {Emerson, E. Allen and Sistla, A. Prasad},
  booktitle =           {{P}roceedings of the 12th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'00)},
  acronym =             {{CAV}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1855},
  pages =               {36-52},
  year =                {2000},
  month =               jul,
}
[KV01] Orna Kupferman and Moshe Y. Vardi. Model Checking of Safety Properties. Formal Methods in System Design 19(3):291-314. Kluwer Academic, November 2001. 
@article{fmsd19(3)-KV,
  author =              {Kupferman, Orna and Vardi, Moshe Y.},
  title =               {Model Checking of Safety Properties},
  publisher =           {Kluwer Academic},
  journal =             {Formal Methods in System Design},
  volume =              {19},
  number =              {3},
  pages =               {291-314},
  year =                {2001},
  month =               nov,
}
[KV01] Orna Kupferman and Moshe Y. Vardi. Synthesizing Distributed Systems. In LICS'01, pages 389-398. IEEE Comp. Soc. Press, June 2001. 
@inproceedings{lics2001-KV,
  author =              {Kupferman, Orna and Vardi, Moshe Y.},
  title =               {Synthesizing Distributed Systems},
  booktitle =           {{P}roceedings of the 16th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'01)},
  acronym =             {{LICS}'01},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {389-398},
  year =                {2001},
  month =               jun,
  doi =                 {10.1109/LICS.2001.932514},
}
[KV03] Orna Kupferman and Moshe Y. Vardi. Safraless Decision Procedures. In FOCS'03. IEEE Comp. Soc. Press, October 2003. 
@inproceedings{focs2003-KV,
  author =              {Kupferman, Orna and Vardi, Moshe Y.},
  title =               {Safraless Decision Procedures},
  booktitle =           {{P}roceedings of the 44th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'03)},
  acronym =             {{FOCS}'03},
  publisher =           {IEEE Comp. Soc. Press},
  year =                {2003},
  month =               oct,
}
[KV03] Orna Kupferman and Moshe Y. Vardi. Π2∩Σ2≡ AFMC. In ICALP'03, Lecture Notes in Computer Science 2719, pages 697-713. Springer-Verlag, June 2003. 
@inproceedings{icalp2003-KV,
  author =              {Kupferman, Orna and Vardi, Moshe Y.},
  title =               {{{\(\Pi_2\cap\Sigma_2\equiv \textup{AFMC}\)}}},
  editor =              {Baeten, Jos C. M. and Lenstra, Jan Karel and Parrow,
                         Joachim and Woeginger, Gerhard J.},
  booktitle =           {{P}roceedings of the 30th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'03)},
  acronym =             {{ICALP}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2719},
  pages =               {697-713},
  year =                {2003},
  month =               jun,
}
[KV06] Orna Kupferman and Moshe Y. Vardi. Memoryful Branching-Time Logic. In LICS'06, pages 265-274. IEEE Comp. Soc. Press, July 2006. 
@inproceedings{lics2006-KV,
  author =              {Kupferman, Orna and Vardi, Moshe Y.},
  title =               {Memoryful Branching-Time Logic},
  booktitle =           {{P}roceedings of the 21st {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'06)},
  acronym =             {{LICS}'06},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {265-274},
  year =                {2006},
  month =               jul,
}
[KVW00] Orna Kupferman, Moshe Y. Vardi, and Pierre Wolper. An Automata-Theoretic Approach to Branching-Time Model-Checking. Journal of the ACM 47(2):312-360. ACM Press, March 2000. 
@article{jacm47(2)-KVW,
  author =              {Kupferman, Orna and Vardi, Moshe Y. and Wolper,
                         Pierre},
  title =               {An Automata-Theoretic Approach to Branching-Time
                         Model-Checking},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {47},
  number =              {2},
  pages =               {312-360},
  year =                {2000},
  month =               mar,
}
[KVW01] Orna Kupferman, Moshe Y. Vardi, and Pierre Wolper. Module Checking. Information and Computation 164(2):322-344. Academic Press, January 2001. 
@article{icomp164(2)-KVW,
  author =              {Kupferman, Orna and Vardi, Moshe Y. and Wolper,
                         Pierre},
  title =               {Module Checking},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {164},
  number =              {2},
  pages =               {322-344},
  year =                {2001},
  month =               jan,
}
[KVW15] Igor V. Konnov, Helmut Veith, and Josef Widder. SMT and POR bea Counter Abstraction: Parameterized Model Checking of Threshold-Based Distributed Algorithms. In CAV'15, Lecture Notes in Computer Science 9206, pages 85-102. Springer-Verlag, July 2015. 
@inproceedings{cav2015-KVW,
  author =              {Konnov, Igor V. and Veith, Helmut and Widder, Josef},
  title =               {{SMT} and {POR} bea Counter Abstraction:
                         Parameterized Model Checking of Threshold-Based
                         Distributed Algorithms},
  editor =              {Kroening, Daniel and Pasareanu, Corina S.},
  booktitle =           {{P}roceedings of the 27th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'15)},
  acronym =             {{CAV}'15},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9206},
  pages =               {85-102},
  year =                {2015},
  month =               jul,
  doi =                 {10.1007/978-3-319-21690-4_6},
}
[KW03] Detlef Kähler and Thomas Wilke. Program complexity of dynamic LTL model checking. In CSL'03, Lecture Notes in Computer Science 2803, pages 271-284. Springer-Verlag, August 2003. 
@inproceedings{csl2003-KW,
  author =              {K{\"a}hler, Detlef and Wilke, Thomas},
  title =               {Program complexity of dynamic {LTL} model checking},
  editor =              {Baaz, Matthias and Makowsky, Johann A.},
  booktitle =           {{P}roceedings of the 17th {I}nternational {W}orkshop
                         on {C}omputer {S}cience {L}ogic ({CSL}'03)},
  acronym =             {{CSL}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2803},
  pages =               {271-284},
  year =                {2003},
  month =               aug,
  doi =                 {10.1007/978-3-540-45220-1_23},
}
[KW05] Shmuel Tomi Klein and Yair Wiseman. Parallel Lempel-Ziv Coding. Discrete Applied Mathematics 146(2):180-191. Elsevier, March 2005. 
@article{dam146(2)-KW,
  author =              {Klein, Shmuel Tomi and Wiseman, Yair},
  title =               {Parallel {L}empel-{Z}iv Coding},
  publisher =           {Elsevier},
  journal =             {Discrete Applied Mathematics},
  volume =              {146},
  number =              {2},
  pages =               {180-191},
  year =                {2005},
  month =               mar,
}
[KWN+08] Sebastian Kupferschmid, Martin Wehrle, Bernhard Nebel, and Andreas Podelski. Faster Than Uppaal?. In CAV'08, Lecture Notes in Computer Science 5123, pages 552-555. Springer-Verlag, July 2008. 
@inproceedings{cav2008KWNP,
  author =              {Kupferschmid, Sebastian and Wehrle, Martin and
                         Nebel, Bernhard and Podelski, Andreas},
  title =               {Faster Than {U}ppaal?},
  editor =              {Gupta, Aarti and Malik, Sharad},
  booktitle =           {{P}roceedings of the 20th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'08)},
  acronym =             {{CAV}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5123},
  pages =               {552-555},
  year =                {2008},
  month =               jul,
}
[KWZ+03] Agi Kurucz, Frank Wolter, Michael Zakharyaschev, and Dov M. Gabbay. Many-Dimensional Modal Logics: Theory and Applications. Elsevier, 2003. 
@book{mdml2003-KWZG,
  author =              {Kurucz, Agi and Wolter, Frank and Zakharyaschev,
                         Michael and Gabbay, Dov M.},
  title =               {Many-Dimensional Modal Logics: Theory and
                         Applications},
  publisher =           {Elsevier},
  year =                {2003},
}
L
[La01] Salvatore La Torre. Verification of Reactive Systems and Decision Problems in Temporal Logics. PhD thesis, University of Pennsylvania, 2001. 
@phdthesis{phd-latorre,
  author =              {La{~}Torre, Salvatore},
  title =               {Verification of Reactive Systems and Decision
                         Problems in Temporal Logics},
  year =                {2001},
  school =              {University of Pennsylvania},
}
[Lam80] Leslie Lamport. ``Sometimes'' is sometimes ``Not Never''. In POPL'80, pages 174-185. ACM Press, January 1980. 
@inproceedings{popl1980-Lam,
  author =              {Lamport, Leslie},
  title =               {``{S}ometimes'' is sometimes ``{N}ot {N}ever''},
  booktitle =           {Conference Record of the 7th {ACM} {S}ymposium on
                         {P}rinciples of {P}rogramming {L}anguages
                         ({POPL}'80)},
  acronym =             {{POPL}'80},
  publisher =           {ACM Press},
  pages =               {174-185},
  year =                {1980},
  month =               jan,
}
[Lam83] Leslie Lamport. What good is Temporal Logic?. In WCC'83, pages 657-668. North-Holland/IFIP, September 1983. 
@inproceedings{ifipwcc1983-Lam,
  author =              {Lamport, Leslie},
  title =               {What good is Temporal Logic?},
  editor =              {Mason, R. E. A.},
  booktitle =           {{I}nformation {P}rocessing~83~-- {P}roceedings of
                         the 9th {IFIP} {W}orld {C}omputer {C}ongress
                         ({WCC}'83)},
  acronym =             {{WCC}'83},
  publisher =           {North-Holland/IFIP},
  pages =               {657-668},
  year =                {1983},
  month =               sep,
}
[Lam87] Leslie Lamport. A Fast Mutual Exclusion Algorithm. ACM Transactions on Computer Systems 5(1):1-11. ACM Press, February 1987. 
@article{tocs5(1)-Lam,
  author =              {Lamport, Leslie},
  title =               {A~Fast Mutual Exclusion Algorithm},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Computer Systems},
  volume =              {5},
  number =              {1},
  pages =               {1-11},
  year =                {1987},
  month =               feb,
}
[Lan02] Martin Lange. Local Model Checking Games for Fixed Point Logic with Chop. In CONCUR'02, Lecture Notes in Computer Science 2421, pages 240-254. Springer-Verlag, August 2002. 
@inproceedings{concur2002-Lan,
  author =              {Lange, Martin},
  title =               {Local Model Checking Games for Fixed Point Logic
                         with Chop},
  editor =              {Brim, Lubo{\v s} and Jan{\v c}ar, Petr and K{\v
                         r}et{\'\i}nsk{\'y}, Mojm{\'\i}r and Ku{\v c}era,
                         Anton{\'\i}n},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'02)},
  acronym =             {{CONCUR}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2421},
  pages =               {240-254},
  year =                {2002},
  month =               aug,
}
[Lan02] Martin Lange. Alternating Context-Free Languages and Linear Time μ-calculus with Sequential Composition. In EXPRESS'02, Electronic Notes in Theoretical Computer Science 68(2), pages 71-87. Elsevier, August 2002. 
@inproceedings{express2002-Lan,
  author =              {Lange, Martin},
  title =               {Alternating Context-Free Languages and Linear Time
                         {\(\mu\)}-calculus with Sequential Composition},
  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 =               {71-87},
  year =                {2002},
  month =               aug,
}
[Lan05] Martin Lange. Weak Automata for the Linear Time μ-Calculus. In VMCAI'05, Lecture Notes in Computer Science 3385, pages 267-281. Springer-Verlag, January 2005. 
@inproceedings{vmcai2005-Lan,
  author =              {Lange, Martin},
  title =               {Weak Automata for the Linear Time
                         {\(\mu\)}-Calculus},
  editor =              {Cousot, Radhia},
  booktitle =           {{P}roceedings of the 6th {I}nternational {W}orkshop
                         on {V}erification, {M}odel {C}hecking, and
                         {A}bstract {I}nterpretation ({VMCAI}'05)},
  acronym =             {{VMCAI}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3385},
  pages =               {267-281},
  year =                {2005},
  month =               jan,
}
[Lan07] Martin Lange. Linear-Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness. In CONCUR'07, Lecture Notes in Computer Science 4703, pages 90-104. Springer-Verlag, September 2007. 
@inproceedings{concur2007-Lan,
  author =              {Lange, Martin},
  title =               {Linear-Time Logics Around~{PSL}: Complexity,
                         Expressiveness, and a Little Bit of Succinctness},
  editor =              {Caires, Lu{\'\i}s and Vasconcelos, Vasco T.},
  booktitle =           {{P}roceedings of the 18th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'07)},
  acronym =             {{CONCUR}'07},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4703},
  pages =               {90-104},
  year =                {2007},
  month =               sep,
}
[Lan08] Martin Lange. A purely model-theoretic proof of the exponential succinctness gap between CTL+ and CTL. Information Processing Letters 108(5):308-312. Elsevier, November 2008. 
@article{ipl108(5)-Lan,
  author =              {Lange, Martin},
  title =               {A purely model-theoretic proof of the exponential
                         succinctness gap between {CTL\(^{+}\)} and {CTL}},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {108},
  number =              {5},
  pages =               {308-312},
  year =                {2008},
  month =               nov,
}
[Lar86] Kim Guldstrand Larsen. Context-dependent bisimulation between processes. PhD thesis, School of Informatics, University of Edinburgh, UK, 1986. 
@phdthesis{phd-larsen,
  author =              {Larsen, Kim Guldstrand},
  title =               {Context-dependent bisimulation between processes},
  year =                {1986},
  school =              {School of Informatics, University of Edinburgh, UK},
}
[Lar90] Kim Guldstrand Larsen. Modal Specifications. In AVMFSS'89, Lecture Notes in Computer Science 407, pages 232-246. Springer-Verlag, 1990. 
@inproceedings{avmfss1989-Lar,
  author =              {Larsen, Kim Guldstrand},
  title =               {Modal Specifications},
  editor =              {Sifakis, Joseph},
  booktitle =           {{P}roceedings of the {I}nternational {W}orkshop on
                         {A}utomatic {V}erification {M}ethods for {F}inite
                         {S}tate {S}ystems ({AVMFSS}'89)},
  acronym =             {{AVMFSS}'89},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {407},
  pages =               {232-246},
  year =                {1990},
  confyear =            {1989},
  confmonth =           {6},
}
[Lar92] Kim Skak Larsen. Length of Maximal Common Subsequences. Technical Report PB-426, DAIMI, Faculty of Science, University of Aarhus, Denmark, October 1992. 
@techreport{daimi-PB426,
  author =              {Larsen, Kim Skak},
  title =               {Length of Maximal Common Subsequences},
  number =              {PB-426},
  year =                {1992},
  month =               oct,
  institution =         {DAIMI, Faculty of Science, University of Aarhus,
                         Denmark},
  type =                {Technical Report},
}
[Lar94] François Laroussinie. Logiques temporelles avec passé pour la spécification et la vérification des systèmes réactifs. Thèse de doctorat, INPG, 1994. 
@phdthesis{phd-laroussinie,
  author =              {Laroussinie, Fran{\c c}ois},
  title =               {Logiques temporelles avec pass{\'e} pour la
                         sp{\'e}cification et la v{\'e}rification des
                         syst{\`e}mes r{\'e}actifs},
  year =                {1994},
  school =              {INPG},
  type =                {Th\`ese de doctorat},
}
[Lar95] François Laroussinie. About the Expressive Power of CTL Combinators. Information Processing Letters 54(6):343-345. Elsevier, June 1995. 
@article{ipl54(6)-Lar,
  author =              {Laroussinie, Fran{\c c}ois},
  title =               {About the Expressive Power of {CTL} Combinators},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {54},
  number =              {6},
  pages =               {343-345},
  year =                {1995},
  month =               jun,
}
[Las02] Sławomir Lasota. Decidability of Strong Bisimilarity for Timed BPP. In CONCUR'02, Lecture Notes in Computer Science 2421, pages 562-579. Springer-Verlag, August 2002. 
@inproceedings{concur2002-Las,
  author =              {Lasota, S{\l}awomir},
  title =               {Decidability of Strong Bisimilarity for Timed {BPP}},
  editor =              {Brim, Lubo{\v s} and Jan{\v c}ar, Petr and K{\v
                         r}et{\'\i}nsk{\'y}, Mojm{\'\i}r and Ku{\v c}era,
                         Anton{\'\i}n},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'02)},
  acronym =             {{CONCUR}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2421},
  pages =               {562-579},
  year =                {2002},
  month =               aug,
}
[LBB+01] Kim Guldstrand Larsen, Gerd Behrmann, Ed Brinksma, Ansgar Fehnker, Thomas Hune, Paul Pettersson, and Judi Romijn. As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata. In CAV'01, Lecture Notes in Computer Science 2102, pages 493-505. Springer-Verlag, July 2001. 
@inproceedings{cav2001-LBBFHPR,
  author =              {Larsen, Kim Guldstrand and Behrmann, Gerd and
                         Brinksma, Ed and Fehnker, Ansgar and Hune, Thomas
                         and Pettersson, Paul and Romijn, Judi},
  title =               {As~Cheap as Possible: Efficient Cost-Optimal
                         Reachability for Priced Timed Automata},
  editor =              {Berry, G{\'e}rard and Comon, Hubert and Finkel,
                         Alain},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'01)},
  acronym =             {{CAV}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2102},
  pages =               {493-505},
  year =                {2001},
  month =               jul,
  doi =                 {10.1007/3-540-44585-4_47},
}
[LD03] Cullen Linn and Saumya Debray. Obfuscation of Executable Code to Improve Resistance to Static Disassembly. In CCS'03, pages 290-299. ACM Press, October 2003. 
@inproceedings{ccs2003-LD,
  author =              {Linn, Cullen and Debray, Saumya},
  title =               {Obfuscation of Executable Code to Improve Resistance
                         to Static Disassembly},
  editor =              {Jajodia, Sushil and Atluri, Vijayalakshmi and
                         Jaeger, Trent},
  booktitle =           {{P}roceedings of the 10th {C}onference on {C}omputer
                         and {C}ommunications {S}ecurity ({CCS}'03)},
  acronym =             {{CCS}'03},
  publisher =           {ACM Press},
  pages =               {290-299},
  year =                {2003},
  month =               oct,
}
[LDW+19] Vincent Langenfeld, Daniel Dietsch, Bernd Westphal, Jochen Hoenicke, and Amalinda Post. Scalable Analysis of Real-Time Requirements. In RE'19, pages 234-244. IEEE Comp. Soc. Press, September 2019. 
@inproceedings{re2019-LDWHP,
  author =              {Langenfeld, Vincent and Dietsch, Daniel and
                         Westphal, Bernd and Hoenicke, Jochen and Post,
                         Amalinda},
  title =               {Scalable Analysis of Real-Time Requirements},
  editor =              {Damian, Daniela E. and Perini, Anna and Lee,
                         Seok-Won},
  booktitle =           {{P}roceedings of the 27th {I}nternaitonal
                         {R}equirements Engineering {C}onference ({RE}'19)},
  acronym =             {{RE}'19},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {234-244},
  year =                {2019},
  month =               sep,
  doi =                 {10.1109/RE.2019.00033},
}
[Lei81] Ernst Leiss. Succinct representation of regular languages by boolean automata. Theoretical Computer Science 13(3):323-330. Elsevier, 1981. 
@article{tcs13(3)-Lei,
  author =              {Leiss, Ernst},
  title =               {Succinct representation of regular languages by
                         boolean automata},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {13},
  number =              {3},
  pages =               {323-330},
  year =                {1981},
}
[Ler03] Jérôme Leroux. Algorithmique de la vérification des systèmes à compteurs. Approximation et accélération. Implémentation de l'outil FAST. Thèse de doctorat, Lab. Spécification & Vérification, ENS Cachan, France, December 2003. 
@phdthesis{phd-leroux,
  author =              {Leroux, J{\'e}r{\^o}me},
  title =               {Algorithmique de la v{\'e}rification des
                         syst{\`e}mes {\`a} compteurs. Approximation et
                         acc{\'e}l{\'e}ration. Impl{\'e}mentation de l'outil
                         {FAST}},
  year =                {2003},
  month =               dec,
  school =              {Lab.~Sp\'ecification \& V\'erification, ENS Cachan,
                         France},
  type =                {Th\`ese de doctorat},
}
[LFM+16] Adrien Le Coënt, Laurent Fribourg, Nicolas Markey, Florian De Vuyst, and Ludovic Chamoin. Distributed Synthesis of State-Dependent Switching Control. In RP'16, Lecture Notes in Computer Science 9899, pages 119-133. Springer-Verlag, September 2016.
Abstract

We present a correct-by-design method of state-dependent control synthesis for linear discrete-time switching systems. Given an objective region R of the state space, the method builds a capture set S and a control which steers any element of S into R. The method works by iterated backward reachability from R. More precisely, S is given as a parametric extension of R, and the maximum value of the parameter is solved by linear programming. The method can also be used to synthesize a stability control which maintains indefinitely within R all the states starting at R. We explain how the synthesis method can be performed in a distributed manner. The method has been implemented and successfully applied to the synthesis of a distributed control of a concrete floor heating system with 11 rooms and 211 = 2048 switching modes.

@inproceedings{rp2016-LFMDC,
  author =              {Le{~}Co{\"e}nt, Adrien and Fribourg, Laurent and
                         Markey, Nicolas and De{~}Vuyst, Florian and Chamoin,
                         Ludovic},
  title =               {Distributed Synthesis of State-Dependent Switching
                         Control},
  editor =              {Larsen, Kim Guldstrand and Srba, Ji{\v r}{\'\i}},
  booktitle =           {{P}roceedings of the 10th {W}orkshop on
                         {R}eachability {P}roblems in {C}omputational
                         {M}odels ({RP}'16)},
  acronym =             {{RP}'16},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9899},
  pages =               {119-133},
  year =                {2016},
  month =               sep,
  doi =                 {10.1007/978-3-319-45994-3_9},
  abstract =            {We present a correct-by-design method of
                         state-dependent control synthesis for linear
                         discrete-time switching systems. Given an objective
                         region~\(R\) of the state space, the method builds a
                         capture set~\(S\) and a control which steers any
                         element of~\(S\) into~\(R\). The method works by
                         iterated backward reachability from~\(R\). More
                         precisely, \(S\)~is given as a parametric extension
                         of~\(R\), and the maximum value of the parameter is
                         solved by linear programming. The method can also be
                         used to synthesize a stability control which
                         maintains indefinitely within~\(R\) all the states
                         starting at~\(R\). We~explain how the synthesis
                         method can be performed in a distributed manner. The
                         method has been implemented and successfully applied
                         to the synthesis of a distributed control of a
                         concrete floor heating system with 11 rooms and
                         \(2^{11} = 2048\) switching modes.},
}
[LFM+18] Adrien Le Coënt, Laurent Fribourg, Nicolas Markey, Florian De Vuyst, and Ludovic Chamoin. Distributed Synthesis of State-Dependent Switching Control. Theoretical Computer Science 750:53-68. Elsevier, November 2018.
Abstract

We present a correct-by-design method of state-dependent control synthesis for sampled switching systems. Given a target region R of the state space, our method builds a capture set S and a control that steers any element of S into R. The method works by iterated backward reachability from R. It is also used to synthesize a recurrence control that makes any state of R return to R infinitely often. We explain how the synthesis method can be performed in a compositional manner, and apply it to the synthesis of a compositional control for a concrete floor-heating system with 11 rooms and up to 211=2048 switching modes.

@article{tcs750()-LFMDC,
  author =              {Le{~}Co{\"e}nt, Adrien and Fribourg, Laurent and
                         Markey, Nicolas and De{~}Vuyst, Florian and Chamoin,
                         Ludovic},
  title =               {Distributed Synthesis of State-Dependent Switching
                         Control},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {750},
  pages =               {53-68},
  year =                {2018},
  month =               nov,
  doi =                 {10.1016/j.tcs.2018.01.021},
  abstract =            {We present a correct-by-design method of
                         state-dependent control synthesis for sampled
                         switching systems. Given a target region~\(R\) of
                         the state space, our~method builds a capture
                         set~\(S\) and a~control that steers any element
                         of~\(S\) into~\(R\). The~method works by iterated
                         backward reachability from~\(R\). It~is also used to
                         synthesize a recurrence control that makes any state
                         of~\(R\) return to~\(R\) infinitely often.
                         We~explain how the synthesis method can be performed
                         in a compositional manner, and apply it to the
                         synthesis of a compositional control for a concrete
                         floor-heating system with 11~rooms and up to
                         \(2^{11}=2048\) switching modes.},
}
[Lim05] Nutan Limaye. Parallel Complexity Classes Centered around LOGCFL. Master's thesis, Anna University, Chennai, India, April 2005. 
@mastersthesis{master05-limaye,
  author =              {Limaye, Nutan},
  title =               {Parallel Complexity Classes Centered around
                         {LOGCFL}},
  year =                {2005},
  month =               apr,
  school =              {Anna University, Chennai, India},
}
[LL98] François Laroussinie and Kim Guldstrand Larsen. CMC: A Tool for Compositional Model-Checking of Real-Time Systems. In FORTE/PSTV'98, IFIP Conference Proceedings 135, pages 439-456. Kluwer Academic, October 1998. 
@inproceedings{forte1998-LL,
  author =              {Laroussinie, Fran{\c c}ois and Larsen, Kim
                         Guldstrand},
  title =               {{CMC}: A~Tool for Compositional Model-Checking of
                         Real-Time Systems},
  editor =              {Budkowski, Stanislaw and Cavalli, Anna R. and Najm,
                         Elie},
  booktitle =           {{P}roceedings of the {IFIP} {TC6} {WG}6.1 {J}oint
                         {I}nternational {C}onference on {F}ormal
                         {D}escription {T}echniques for {D}istributed
                         {S}ystems and {C}ommunication {P}rotocols
                         ({FORTE}'98) and {P}rotocol {S}pecification,
                         {T}esting and {V}erification ({PSTV}'98)},
  acronym =             {{FORTE/PSTV}'98},
  publisher =           {Kluwer Academic},
  series =              {IFIP Conference Proceedings},
  volume =              {135},
  pages =               {439-456},
  year =                {1998},
  month =               oct,
}
[LLH18] Stéphane Lafortune, Feng Lin, and Christoforos N. Hadjicostis. On the history of diagnosability and opacity in discrete event systems. Annual Reviews in Control 45:257-266. Elsevier, 2018. 
@article{aric45()-LLH,
  author =              {Lafortune, St{\'e}phane and Lin, Feng and
                         Hadjicostis, Christoforos N.},
  title =               {On~the history of diagnosability and opacity in
                         discrete event systems},
  publisher =           {Elsevier},
  journal =             {Annual Reviews in Control},
  volume =              {45},
  pages =               {257-266},
  year =                {2018},
  doi =                 {10.1016/j.arcontrol.2018.04.002},
}
[LLP+97] Kim Guldstrand Larsen, Fredrik Larsson, Paul Pettersson, and Wang Yi. Efficient verification of real-time systems: compact data structure and state-space reduction. In RTSS'97, pages 14-24. IEEE Comp. Soc. Press, December 1997. 
@inproceedings{rtss1997-LLPY,
  author =              {Larsen, Kim Guldstrand and Larsson, Fredrik and
                         Pettersson, Paul and Yi, Wang},
  title =               {Efficient verification of real-time systems: compact
                         data structure and state-space reduction},
  booktitle =           {{P}roceedings of the 18th {S}ymposium on {R}eal-Time
                         {S}ystems ({RTSS}'97)},
  acronym =             {{RTSS}'97},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {14-24},
  year =                {1997},
  month =               dec,
}
[LLT+14] Kim Guldstrand Larsen, Axel Legay, Louis-Marie Traonouez, and Andrzej Wąsowski. Robust synthesis for real-time systems. Theoretical Computer Science 515:96-122. Elsevier, January 2014. 
@article{tcs515-LLTW,
  author =              {Larsen, Kim Guldstrand and Legay, Axel and
                         Traonouez, Louis-Marie and W{\k a}sowski, Andrzej},
  title =               {Robust synthesis for real-time systems},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {515},
  pages =               {96-122},
  year =                {2014},
  month =               jan,
}
[LLW95] François Laroussinie, Kim Guldstrand Larsen, and Carsten Weise. From Timed Automata to Logic – and Back. In MFCS'95, Lecture Notes in Computer Science 969, pages 529-539. Springer-Verlag, August 1995. 
@inproceedings{mfcs1995-LLW,
  author =              {Laroussinie, Fran{\c c}ois and Larsen, Kim
                         Guldstrand and Weise, Carsten},
  title =               {From Timed Automata to Logic~-- and Back},
  editor =              {Wiedermann, Jir{\'\i} and H{\'a}jek, Petr},
  booktitle =           {{P}roceedings of the 20th {I}nternational
                         {S}ymposium on {M}athematical {F}oundations of
                         {C}omputer {S}cience ({MFCS}'95)},
  acronym =             {{MFCS}'95},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {969},
  pages =               {529-539},
  year =                {1995},
  month =               aug,
  doi =                 {10.1007/3-540-60246-1_158},
}
[LLZ15] Kim Guldstrand Larsen, Simon Laursen, and Martin Zimmermann. Limit Your Consumption! Finding Bounds in Average-energy Games. Research Report 1510.05774, arXiv, October 2015. 
@techreport{arxiv-1510.05774,
  author =              {Larsen, Kim Guldstrand and Laursen, Simon and
                         Zimmermann, Martin},
  title =               {Limit Your Consumption! Finding Bounds in
                         Average-energy Games},
  number =              {1510.05774},
  year =                {2015},
  month =               oct,
  institution =         {arXiv},
  type =                {Research Report},
}
[LM02] Christopher Lynch and Barbara Morawska. Automatic Decidability. In LICS'02, pages 9-16. IEEE Comp. Soc. Press, July 2002. 
@inproceedings{lics2002-LM,
  author =              {Lynch, Christopher and Morawska, Barbara},
  title =               {Automatic Decidability},
  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 =               {9-16},
  year =                {2002},
  month =               jul,
}
[LM13] François Laroussinie and Nicolas Markey. Satisfiability of ATL with strategy contexts. In GandALF'13, Electronic Proceedings in Theoretical Computer Science 119, pages 208-223. August 2013.
Abstract

Various extensions of the temporal logic ATL have recently been introduced to express rich properties of multi-agent systems. Among these, ATLsc extends ATL with strategy contexts, while Strategy Logic has first-order quantification over strategies. There is a price to pay for the rich expressiveness of these logics: model-checking is non-elementary, and satisfiability is undecidable.

We prove in this paper that satisfiability is decidable in several special cases. The most important one is when restricting to turn-based games. We prove that decidability also holds for concurrent games if the number of moves available to the agents is bounded. Finally, we prove that restricting strategy quantification to memoryless strategies brings back undecidability.

@inproceedings{gandalf2013-LM,
  author =              {Laroussinie, Fran{\c c}ois and Markey, Nicolas},
  title =               {Satisfiability of {ATL} with strategy contexts},
  editor =              {Puppis, Gabriele and Villa, Tiziano},
  booktitle =           {{P}roceedings of the 4th {I}nternational {S}ymposium
                         on {G}ames, {A}utomata, {L}ogics and {F}ormal
                         {V}erification ({GandALF}'13)},
  acronym =             {{GandALF}'13},
  series =              {Electronic Proceedings in Theoretical Computer
                         Science},
  volume =              {119},
  pages =               {208-223},
  year =                {2013},
  month =               aug,
  doi =                 {10.4204/EPTCS.119.18},
  abstract =            {Various extensions of the temporal logic ATL have
                         recently been introduced to express rich properties
                         of multi-agent systems. Among these, ATLsc extends
                         ATL with \emph{strategy contexts}, while Strategy
                         Logic has \emph{first-order quantification} over
                         strategies. There is a price to pay for the rich
                         expressiveness of these logics: model-checking is
                         non-elementary, and satisfiability is
                         undecidable.\par We prove in this paper that
                         satisfiability is decidable in several special
                         cases. The most important one is when restricting to
                         \emph{turn-based} games. We~prove that decidability
                         also holds for concurrent games if the number of
                         moves available to the agents is bounded. Finally,
                         we~prove that restricting strategy quantification to
                         memoryless strategies brings back undecidability.},
}
[LM14] François Laroussinie and Nicolas Markey. Quantified CTL: expressiveness and complexity. Logical Methods in Computer Science 10(4). December 2014.
Abstract

While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke structure or to its unwinding tree), we study its expressiveness (showing in particular that QCTL coincides with Monadic Second-Order Logic for both semantics) and characterise the complexity of its model-checking and satisfiability problems, depending on the number of nested propositional quantifiers (showing that the structure semantics populates the polynomial hierarchy while the tree semantics populates the exponential hierarchy).

@article{lmcs10(4)-LM,
  author =              {Laroussinie, Fran{\c c}ois and Markey, Nicolas},
  title =               {Quantified~{CTL}: expressiveness and complexity},
  journal =             {Logical Methods in Computer Science},
  volume =              {10},
  number =              {4},
  year =                {2014},
  month =               dec,
  doi =                 {10.2168/LMCS-10(4:17)2014},
  abstract =            {While it was defined long ago, the extension of CTL
                         with quantification over atomic propositions has
                         never been studied extensively. Considering two
                         different semantics (depending whether propositional
                         quantification refers to the Kripke structure or to
                         its unwinding tree), we~study its expressiveness
                         (showing in particular that QCTL coincides with
                         Monadic Second-Order Logic for both semantics) and
                         characterise the complexity of its model-checking
                         and satisfiability problems, depending on the number
                         of nested propositional quantifiers (showing that
                         the structure semantics populates the polynomial
                         hierarchy while the tree semantics populates the
                         exponential hierarchy).},
}
[LM15] François Laroussinie and Nicolas Markey. Augmenting ATL with strategy contexts. Information and Computation 245:98-123. Elsevier, December 2015.
Abstract

We study the extension of the alternating-time temporal logic (ATL) with strategy contexts: contrary to the original semantics, in this semantics the strategy quantifiers do not reset the previously selected strategies.

We show that our extension ATLsc is very expressive, but that its decision problems are quite hard: model checking is k-EXPTIME-complete when the formula has k nested strategy quantifiers; satisfiability is undecidable, but we prove that it is decidable when restricting to turn-based games. Our algorithms are obtained through a very convenient translation to QCTL (the computation-tree logic CTL extended with atomic quantification), which we show also applies to Strategy Logic, as well as when strategy quantification ranges over memoryless strategies.

@article{icomp245()-LM,
  author =              {Laroussinie, Fran{\c c}ois and Markey, Nicolas},
  title =               {Augmenting {ATL} with strategy contexts},
  publisher =           {Elsevier},
  journal =             {Information and Computation},
  volume =              {245},
  pages =               {98-123},
  year =                {2015},
  month =               dec,
  doi =                 {10.1016/j.ic.2014.12.020},
  abstract =            {We study the extension of the alternating-time
                         temporal logic (ATL) with strategy contexts:
                         contrary to the original semantics, in this
                         semantics the strategy quantifiers do not reset the
                         previously selected strategies.\par We show that our
                         extension ATLsc is very expressive, but that its
                         decision problems are quite hard: model checking is
                         \(k\)-EXPTIME-complete when the formula has \(k\)
                         nested strategy quantifiers; satisfiability is
                         undecidable, but we prove that it is decidable when
                         restricting to turn-based games. Our algorithms are
                         obtained through a very convenient translation to
                         QCTL (the~computation-tree logic CTL extended with
                         atomic quantification), which we show also applies
                         to Strategy Logic, as well as when strategy
                         quantification ranges over memoryless strategies.},
}
[LMG04] Thomas Lévy, Olivier Marcé, and Damien Galand. Embedded BGP Routing Monitoring. In HSNMC'04, Lecture Notes in Computer Science 3079, pages 348-359. Springer-Verlag, June 2004. 
@inproceedings{hsnmc2004-LMG,
  author =              {L{\'e}vy, {\relax Th}omas and Marc{\'e}, Olivier and
                         Galand, Damien},
  title =               {Embedded {BGP} Routing Monitoring},
  editor =              {Mammeri, Zoubir and Lorenz, Pascal},
  booktitle =           {{P}roceedings of the 7th {IEEE} {I}nternational
                         {C}onference on {H}igh {S}peed {N}etworks and
                         {M}ultimedia {C}ommunications ({HSNMC}'04)},
  acronym =             {{HSNMC}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3079},
  pages =               {348-359},
  year =                {2004},
  month =               jun,
}
[LMN04] Kim Guldstrand Larsen, Marius Mikučionis, and Brian Nielsen. Online Testing of Real-time Systems Using Uppaal. In FATES'04, Lecture Notes in Computer Science 3395, pages 79-94. Springer-Verlag, September 2004. 
@inproceedings{LMN-fates2004,
  author =              {Larsen, Kim Guldstrand and Miku{\v{c}}ionis, Marius
                         and Nielsen, Brian},
  title =               {Online Testing of Real-time Systems Using {U}ppaal},
  editor =              {Grabowski, Jens and Nielsen, Brian},
  booktitle =           {{P}roceedings of the 4th {I}nternational {W}orkshop
                         on {F}ormal {A}pproaches to {S}oftware {T}esting
                         ({FATES}'04)},
  acronym =             {{FATES}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3395},
  pages =               {79-94},
  year =                {2004},
  month =               sep,
  doi =                 {10.1007/978-3-540-31848-4_6},
}
[LMO06] François Laroussinie, Nicolas Markey, and Ghassan Oreiby. Model-Checking Timed ATL for Durational Concurrent Game Structures. In FORMATS'06, Lecture Notes in Computer Science 4202, pages 245-259. Springer-Verlag, September 2006.
Abstract

We extend the framework of ATL model-checking to "simply timed" concurrent game structures, i.e., multi-agent structures where each transition carry an integral duration (or interval thereof). While the case of single durations is easily handled from the semantics point of view, intervals of durations raise several interesting questions. Moreover subtle algorithmic problems have to be handled when dealing with model checking. We propose a semantics for which we develop efficient (PTIME) algorithms for timed ATL without equality constraints, while the general case is shown to be EXPTIME-complete.

@inproceedings{formats2006-LMO,
  author =              {Laroussinie, Fran{\c c}ois and Markey, Nicolas and
                         Oreiby, Ghassan},
  title =               {Model-Checking Timed~{ATL} for Durational Concurrent
                         Game Structures},
  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 =               {245-259},
  year =                {2006},
  month =               sep,
  doi =                 {10.1007/11867340_18},
  abstract =            {We extend the framework of ATL model-checking to
                         {"}simply timed{"} concurrent game structures, i.e.,
                         multi-agent structures where each transition carry
                         an integral duration (or interval thereof). While
                         the case of single durations is easily handled from
                         the semantics point of view, intervals of durations
                         raise several interesting questions. Moreover subtle
                         algorithmic problems have to be handled when dealing
                         with model checking. We propose a semantics for
                         which we develop efficient (PTIME) algorithms for
                         timed ATL without equality constraints, while the
                         general case is shown to be EXPTIME-complete.},
}
[LMO07] François Laroussinie, Nicolas Markey, and Ghassan Oreiby. On the Expressiveness and Complexity of ATL. In FoSSaCS'07, Lecture Notes in Computer Science 4423, pages 243-257. Springer-Verlag, March 2007.
Abstract

ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions of agents in order to enforce a given property. We prove that the standard definition of ATL (built on modalities "Next", "Always" and "Until") has to be completed in order to express the duals of its modalities: it is necessary to add the modality "Release". We then precisely characterize the complexity of ATL model-checking when the number of agents is not fixed. We prove that it is Δ2P and Δ3P-complete, depending on the underlying multi-agent model (ATS and CGS, resp.). We also prove that ATL+ model-checking is Δ3P-complete over both models, even with a fixed number of agents.

@inproceedings{fossacs2007-LMO,
  author =              {Laroussinie, Fran{\c c}ois and Markey, Nicolas and
                         Oreiby, Ghassan},
  title =               {On the Expressiveness and Complexity of~{ATL}},
  editor =              {Seidl, Helmut},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'07)},
  acronym =             {{FoSSaCS}'07},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4423},
  pages =               {243-257},
  year =                {2007},
  month =               mar,
  doi =                 {10.1007/978-3-540-71389-0_18},
  abstract =            {ATL is a temporal logic geared towards the
                         specification and verification of properties in
                         multi-agents systems. It allows to reason on the
                         existence of strategies for coalitions of agents in
                         order to enforce a given property. We prove that the
                         standard definition of~ATL (built on modalities
                         {"}Next{"}, {"}Always{"} and~{"}Until{"}) has to be
                         completed in order to express the duals of its
                         modalities: it~is necessary to add the modality
                         {"}Release{"}. We~then precisely characterize the
                         complexity of ATL model-checking when the number of
                         agents is not fixed. We prove that it is
                         \(\Delta_{2}^{P}\) and \(\Delta_{3}^{P}\)-complete,
                         depending on the underlying multi-agent model (ATS
                         and CGS,~resp.). We also prove that~ATL\({}^{+}\)
                         model-checking is \(\Delta_{3}^{P}\)-complete over
                         both models, even with a fixed number of agents.},
}
[LMO08] François Laroussinie, Nicolas Markey, and Ghassan Oreiby. On the Expressiveness and Complexity of ATL. Logical Methods in Computer Science 4(2). May 2008.
Abstract

ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions of agents in order to enforce a given property. We prove that the standard definition of ATL (built on modalities "Next", "Always" and "Until") has to be completed in order to express the duals of its modalities: it is necessary to add the modality "Release". We then precisely characterize the complexity of ATL model-checking when the number of agents is not fixed. We prove that it is Δ2P and Δ3P-complete, depending on the underlying multi-agent model (ATS and CGS, resp.). We also prove that ATL+ model-checking is Δ3P-complete over both models, even with a fixed number of agents.

@article{lmcs4(2)-LMO,
  author =              {Laroussinie, Fran{\c c}ois and Markey, Nicolas and
                         Oreiby, Ghassan},
  title =               {On the Expressiveness and Complexity of~{ATL}},
  journal =             {Logical Methods in Computer Science},
  volume =              {4},
  number =              {2},
  year =                {2008},
  month =               may,
  doi =                 {10.2168/LMCS-4(2:7)2008},
  abstract =            {ATL is a temporal logic geared towards the
                         specification and verification of properties in
                         multi-agents systems. It allows to reason on the
                         existence of strategies for coalitions of agents in
                         order to enforce a given property. We prove that the
                         standard definition of~ATL (built on modalities
                         {"}Next{"}, {"}Always{"} and~{"}Until{"}) has to be
                         completed in order to express the duals of its
                         modalities: it~is necessary to add the modality
                         {"}Release{"}. We~then precisely characterize the
                         complexity of ATL model-checking when the number of
                         agents is not fixed. We prove that it is
                         \(\Delta_{2}^{P}\) and \(\Delta_{3}^{P}\)-complete,
                         depending on the underlying multi-agent model (ATS
                         and CGS,~resp.). We also prove that~ATL\({}^{+}\)
                         model-checking is \(\Delta_{3}^{P}\)-complete over
                         both models, even with a fixed number of agents.},
}
[LMS01] François Laroussinie, Nicolas Markey, and Philippe Schnoebelen. Model Checking CTL+ and FCTL is hard. In FoSSaCS'01, Lecture Notes in Computer Science 2030, pages 318-331. Springer-Verlag, April 2001.
Abstract

Among the branching-time temporal logics used for the specification and verification of systems, CTL+, FCTL and ECTL+ are the most notable logics for which the precise computational complexity of model checking is not known. We answer this longstanding open problem and show that model checking these (and some related) logics is Δ2p-complete.

@inproceedings{fossacs2001-LMS,
  author =              {Laroussinie, Fran{\c c}ois and Markey, Nicolas and
                         Schnoebelen, {\relax Ph}ilippe},
  title =               {Model Checking {CTL}{\(^+\)} and {FCTL} is hard},
  editor =              {Honsell, Furio and Miculan, Marino},
  booktitle =           {{P}roceedings of the 4th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'01)},
  acronym =             {{FoSSaCS}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2030},
  pages =               {318-331},
  year =                {2001},
  month =               apr,
  doi =                 {10.1007/3-540-45315-6_21},
  abstract =            {Among the branching-time temporal logics used for
                         the specification and verification of systems,
                         CTL\(^+\), FCTL and ECTL\(^+\) are the most notable
                         logics for which the precise computational
                         complexity of model checking is not known. We answer
                         this longstanding open problem and show that model
                         checking these (and some related) logics is
                         \(\Delta_2^p\)-complete.},
}
[LMS02] François Laroussinie, Nicolas Markey, and Philippe Schnoebelen. On Model Checking Durational Kripke Structures (Extended Abstract). In FoSSaCS'02, Lecture Notes in Computer Science 2303, pages 264-279. Springer-Verlag, April 2002.
Abstract

We consider quantitative model checking in durational Kripke structures (Kripke structures where transitions have integer durations) with timed temporal logics where subscripts put quantitative constraints on the time it takes before a property is satisfied. We investigate the conditions that allow polynomial-time model checking algorithms for timed versions of CTL and exhibit an important gap between logics where subscripts of the form "= c" (exact duration) are allowed, and simpler logics that only allow subscripts of the form "≤ c" or "≥ c" (bounded duration).

A surprising outcome of this study is that it provides the second example of a Δ2P-complete model checking problem.

@inproceedings{fossacs2002-LMS,
  author =              {Laroussinie, Fran{\c c}ois and Markey, Nicolas and
                         Schnoebelen, {\relax Ph}ilippe},
  title =               {On Model Checking Durational {K}ripke Structures
                         (Extended Abstract)},
  editor =              {Nielsen, Mogens and Engberg, Uffe},
  booktitle =           {{P}roceedings of the 5th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'02)},
  acronym =             {{FoSSaCS}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2303},
  pages =               {264-279},
  year =                {2002},
  month =               apr,
  doi =                 {10.1007/3-540-45931-6_19},
  abstract =            {We consider quantitative model checking in
                         \emph{durational Kripke structures} (Kripke
                         structures where transitions have integer durations)
                         with timed temporal logics where subscripts put
                         quantitative constraints on the time it takes before
                         a property is satisfied. We investigate the
                         conditions that allow polynomial-time model checking
                         algorithms for timed versions of CTL and exhibit an
                         important gap between logics where subscripts of the
                         form {"}\(= c\){"} (exact duration) are allowed, and
                         simpler logics that only allow subscripts of the
                         form {"}\(\leq c\){"} or {"}\(\geq c\){"} (bounded
                         duration).\par A surprising outcome of this study is
                         that it provides the second example of a
                         \(\Delta_2^P\)-complete model checking problem.},
}
[LMS02] François Laroussinie, Nicolas Markey, and Philippe Schnoebelen. Temporal Logic with Forgettable Past. In LICS'02, pages 383-392. IEEE Comp. Soc. Press, July 2002.
Abstract

We investigate NLTL, a linear-time temporal logic with forgettable past. NLTL can be exponentially more succinct than LTL + Past (which in turn can be more succinct than LTL). We study satisfiability and model checking for NLTL and provide optimal automata-theoretic algorithms for these EXPSPACE-complete problems.

@inproceedings{lics2002-LMS,
  author =              {Laroussinie, Fran{\c c}ois and Markey, Nicolas and
                         Schnoebelen, {\relax Ph}ilippe},
  title =               {Temporal Logic with Forgettable Past},
  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 =               {383-392},
  year =                {2002},
  month =               jul,
  doi =                 {10.1109/LICS.2002.1029846},
  abstract =            {We investigate NLTL, a linear-time temporal logic
                         with forgettable past. NLTL can be exponentially
                         more succinct than LTL + Past (which in turn can be
                         more succinct than LTL). We study satisfiability and
                         model checking for NLTL and provide optimal
                         automata-theoretic algorithms for these
                         EXPSPACE-complete problems.},
}
[LMS04] François Laroussinie, Nicolas Markey, and Philippe Schnoebelen. Model Checking Timed Automata with One or Two Clocks. In CONCUR'04, Lecture Notes in Computer Science 3170, pages 387-401. Springer-Verlag, August 2004.
Abstract

In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model checking TCTL and TCTL, over TAs with one clock or two clocks.

First we show that the reachability problem is NLOGSPACE-complete for one clock TAs (i.e. as complex as reachability in classical graphs) and we give a polynomial time algorithm for model checking TCTL, over this class of TAs. Secondly we show that model checking becomes PSPACE-complete for full TCTL over one clock TAs. We also show that model checking CTL (without any timing constraint) over two clock TAs is PSPACE-complete and that reachability is NP-hard.

@inproceedings{concur2004-LMS,
  author =              {Laroussinie, Fran{\c c}ois and Markey, Nicolas and
                         Schnoebelen, {\relax Ph}ilippe},
  title =               {Model Checking Timed Automata with One or Two
                         Clocks},
  editor =              {Gardner, {\relax Ph}ilippa and Yoshida, Nobuko},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'04)},
  acronym =             {{CONCUR}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3170},
  pages =               {387-401},
  year =                {2004},
  month =               aug,
  doi =                 {10.1007/978-3-540-28644-8_25},
  abstract =            {In this paper, we study model checking of timed
                         automata (TAs), and more precisely we aim at finding
                         efficient model checking for subclasses of TAs. For
                         this, we consider model checking TCTL and TCTL, over
                         TAs with one clock or two clocks.\par First we show
                         that the reachability problem is NLOGSPACE-complete
                         for one clock TAs (i.e. as complex as reachability
                         in classical graphs) and we give a polynomial time
                         algorithm for model checking TCTL, over this class
                         of TAs. Secondly we show that model checking becomes
                         PSPACE-complete for full TCTL over one clock TAs. We
                         also show that model checking CTL (without any
                         timing constraint) over two clock TAs is
                         PSPACE-complete and that reachability is NP-hard.},
}
[LMS06] François Laroussinie, Nicolas Markey, and Philippe Schnoebelen. Efficient timed model checking for discrete-time systems. Theoretical Computer Science 353(1-3):249-271. Elsevier, March 2006.
Abstract

We consider model checking of timed temporal formulae in durational transition graphs (DTGs), i.e., Kripke structures where transitions have integer durations. Two semantics for DTGs are presented and motivated. We consider timed versions of CTL where subscripts put quantitative constraints on the time it takes before a property is satisfied.

We exhibit an important gap between logics where subscripts of the form "= c" (exact duration) are allowed, and simpler logics that only allow subscripts of the form "≤ c" or "≥ c" (bounded duration).

Without exact durations, model checking can be done in polynomial time, but with exact durations, it becomes Δ2P-complete or PSPACE-complete depending on the considered semantics.

@article{tcs353(1-3)-LMS,
  author =              {Laroussinie, Fran{\c c}ois and Markey, Nicolas and
                         Schnoebelen, {\relax Ph}ilippe},
  title =               {Efficient timed model checking for discrete-time
                         systems},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {353},
  number =              {1-3},
  pages =               {249-271},
  year =                {2006},
  month =               mar,
  doi =                 {10.1016/j.tcs.2005.11.020},
  abstract =            {We consider model checking of timed temporal
                         formulae in \emph{durational transition graphs}
                         (DTGs), \emph{i.e.}, Kripke structures where
                         transitions have integer durations. Two semantics
                         for DTGs are presented and motivated. We consider
                         timed versions of CTL where subscripts put
                         quantitative constraints on the time it takes before
                         a property is satisfied. \par We exhibit an
                         important gap between logics where subscripts of the
                         form {"}\(= c\){"} (exact duration) are allowed, and
                         simpler logics that only allow subscripts of the
                         form {"}\(\leq c\){"} or {"}\(\geq c\){"} (bounded
                         duration).\par Without exact durations, model
                         checking can be done in polynomial time, but with
                         exact durations, it becomes
                         \(\Delta_{2}^{P}\)-complete or PSPACE-complete
                         depending on the considered semantics.},
}
[LMS15] François Laroussinie, Nicolas Markey, and Arnaud Sangnier. ATLsc with partial observation. In GandALF'15, Electronic Proceedings in Theoretical Computer Science 193, pages 43-57. September 2015.
Abstract

Alternating-time temporal logic with strategy contexts (ATLsc) is a powerful formalism for expressing properties of multi-agent systems: it extends CTL with strategy quantifiers, offering a convenient way of expressing both collaboration and antagonism between several agents. Incomplete observation of the state space is a desirable feature in such a framework, but it quickly leads to undecidable verification problems. In this paper, we prove that uniform incomplete observation (where all players have the same observation) preserves decidability of the model checking problem, even for very expressive logics such as ATLsc.

@inproceedings{gandalf2015-LMS,
  author =              {Laroussinie, Fran{\c c}ois and Markey, Nicolas and
                         Sangnier, Arnaud},
  title =               {{{\(\textsf{ATL}_{\textsf{sc}}\)}} with partial
                         observation},
  editor =              {Esparza, Javier and Tronci, Enrico},
  booktitle =           {{P}roceedings of the 6th {I}nternational {S}ymposium
                         on {G}ames, {A}utomata, {L}ogics and {F}ormal
                         {V}erification ({GandALF}'15)},
  acronym =             {{GandALF}'15},
  series =              {Electronic Proceedings in Theoretical Computer
                         Science},
  volume =              {193},
  pages =               {43-57},
  year =                {2015},
  month =               sep,
  doi =                 {10.4204/EPTCS.193.4},
  abstract =            {Alternating-time temporal logic with strategy
                         contexts ({{\(\textsf{ATL}_{\textsf{sc}}\)}}) is a
                         powerful formalism for expressing properties of
                         multi-agent systems: it~extends \textsf{CTL} with
                         \emph{strategy quantifiers}, offering a convenient
                         way of expressing both collaboration and antagonism
                         between several agents. Incomplete observation of
                         the state space is a desirable feature in such a
                         framework, but it quickly leads to undecidable
                         verification problems. In this paper, we prove that
                         \emph{uniform} incomplete observation (where all
                         players have the same observation) preserves
                         decidability of the model checking problem, even for
                         very expressive logics such as
                         {{\(\textsf{ATL}_{\textsf{sc}}\)}}.},
}
[LMS+99] Clemens Lautermann, Pierre McKenzie, Thomas Schwentick, and Heribert Vollmer. The Descriptive Complexity Approach to LOGCFL. In STACS'99, Lecture Notes in Computer Science 1563, pages 444-454. Springer-Verlag, March 1999. 
@inproceedings{stacs1999-LMSV,
  author =              {Lautermann, Clemens and McKenzie, Pierre and
                         Schwentick, Thomas and Vollmer, Heribert},
  title =               {The Descriptive Complexity Approach to {LOGCFL}},
  editor =              {Meinel, {\relax Ch}ristoph and Tison, Sophie},
  booktitle =           {{P}roceedings of the 16th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'99)},
  acronym =             {{STACS}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1563},
  pages =               {444-454},
  year =                {1999},
  month =               mar,
}
[LN00] Salvatore La Torre and Margherita Napoli. A Decidable Dense Branching-time Temporal Logic. In FSTTCS'00, Lecture Notes in Computer Science 1974, pages 139-150. Springer-Verlag, December 2000. 
@inproceedings{fsttcs2000-LN,
  author =              {La{~}Torre, Salvatore and Napoli, Margherita},
  title =               {A Decidable Dense Branching-time Temporal Logic},
  editor =              {Kapoor, Sanjiv and Prasad, Sanjiva},
  booktitle =           {{P}roceedings of the 20th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'00)},
  acronym =             {{FSTTCS}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1974},
  pages =               {139-150},
  year =                {2000},
  month =               dec,
}
[LN01] Salvatore La Torre and Margherita Napoli. Timed tree automata with an application to temporal logic. Acta Informatica 38(2):89-116. Springer-Verlag, 2001. 
@article{acta38(2)-LN,
  author =              {La{~}Torre, Salvatore and Napoli, Margherita},
  title =               {Timed tree automata with an application to temporal
                         logic},
  publisher =           {Springer-Verlag},
  journal =             {Acta Informatica},
  volume =              {38},
  number =              {2},
  pages =               {89-116},
  year =                {2001},
}
[LNZ04] Denis Lugiez, Peter Niebert, and Sarah Zennou. A partial order semantics approach to the clock explosion problem of timed automata. In TACAS'04, Lecture Notes in Computer Science 2988, pages 296-311. Springer-Verlag, March 2004. 
@inproceedings{tacas2004-LNZ,
  author =              {Lugiez, Denis and Niebert, Peter and Zennou, Sarah},
  title =               {A~partial order semantics approach to the clock
                         explosion problem of timed automata},
  editor =              {Jensen, Kurt and Podelski, Andreas},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'04)},
  acronym =             {{TACAS}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2988},
  pages =               {296-311},
  year =                {2004},
  month =               mar,
}
[LNZ05] Denis Lugiez, Peter Niebert, and Sarah Zennou. A partial order semantics approach to the clock explosion problem of timed automata. Theoretical Computer Science 345(1):27-59. Elsevier, November 2005. 
@article{tcs345(1)-LNZ,
  author =              {Lugiez, Denis and Niebert, Peter and Zennou, Sarah},
  title =               {A~partial order semantics approach to the clock
                         explosion problem of timed automata},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {345},
  number =              {1},
  pages =               {27-59},
  year =                {2005},
  month =               nov,
}
[Lod01] Christof Löding. Efficient minimization of deterministic weak ω-automata. Information Processing Letters 79(3):105-109. Elsevier, July 2001. 
@article{ipl79(3)-Lod,
  author =              {L{\"o}ding, Christof},
  title =               {Efficient minimization of deterministic weak
                         {\(\omega\)}-automata},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {79},
  number =              {3},
  pages =               {105-109},
  year =                {2001},
  month =               jul,
}
[Lod21] Christof Löding. Automata on infinite trees. In Jean-Éric Pin (eds.), Handbook of automata theory. EMS Press, 2021. 
@incollection{hat-ch8,
  author =              {L{\"o}ding, Christof},
  title =               {Automata on infinite trees},
  editor =              {Pin, Jean-{\'E}ric},
  booktitle =           {Handbook of automata theory},
  publisher =           {EMS~Press},
  volume =              {1},
  pages =               {265-302},
  chapter =             {8},
  year =                {2021},
  doi =                 {10.4171/AUTOMATA-1/8},
}
[Loh05] Markus Lohrey. Model Checking Hierarchical Structures. In LICS'05, pages 168- 177. IEEE Comp. Soc. Press, July 2005. 
@inproceedings{lics2005-Loh,
  author =              {Lohrey, Markus},
  title =               {Model Checking Hierarchical Structures},
  booktitle =           {{P}roceedings of the 20th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'05)},
  acronym =             {{LICS}'05},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {168- 177},
  year =                {2005},
  month =               jul,
}
[LP85] Orna Lichtenstein and Amir Pnueli. Checking that Finite State Concurrent Programs Satisfy their Linear Specifiction. In POPL'85, pages 97-107. ACM Press, January 1985. 
@inproceedings{popl1985-LP,
  author =              {Lichtenstein, Orna and Pnueli, Amir},
  title =               {Checking that Finite State Concurrent Programs
                         Satisfy their Linear Specifiction},
  booktitle =           {Conference Record of the 12th {ACM} {S}ymposium on
                         {P}rinciples of {P}rogramming {L}anguages
                         ({POPL}'85)},
  acronym =             {{POPL}'85},
  publisher =           {ACM Press},
  pages =               {97-107},
  year =                {1985},
  month =               jan,
}
[LP06] Kamal Lodaya and Paritosh K. Pandya. A Dose of Timed Logic, in Guarded Measure. In FORMATS'06, Lecture Notes in Computer Science 4202, pages 260-273. Springer-Verlag, September 2006. 
@inproceedings{formats2006-LP,
  author =              {Lodaya, Kamal and Pandya, Paritosh K.},
  title =               {A Dose of Timed Logic, in Guarded Measure},
  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 =               {260-273},
  year =                {2006},
  month =               sep,
}
[LP07] Yuri M. Lifshits and Dmitri S. Pavlov. Potential Theory for Mean Payoff Games. Journal of Mathematical Science 145(3):4967-4974. Springer-Verlag, September 2007. 
@article{jms145(3)-LP,
  author =              {Lifshits, Yuri M. and Pavlov, Dmitri S.},
  title =               {Potential Theory for Mean Payoff Games},
  publisher =           {Springer-Verlag},
  journal =             {Journal of Mathematical Science},
  volume =              {145},
  number =              {3},
  pages =               {4967-4974},
  year =                {2007},
  month =               sep,
}
[LP14] Jun Liu and Pavithra Prabhakar. Switching control of dynamical systems from metric temporal logic specifications. In ICRA'01, pages 5333-5338. IEEE Robotics & Automation Soc., May 2014. 
@inproceedings{icra2014-LP,
  author =              {Liu, Jun and Prabhakar, Pavithra},
  title =               {Switching control of dynamical systems from metric
                         temporal logic specifications},
  booktitle =           {{P}roceedings of the 2014 {IEEE} {I}nternational
                         {C}onference on {R}obotics and {A}utomation
                         ({ICRA}'14)},
  acronym =             {{ICRA}'01},
  publisher =           {IEEE Robotics~\& Automation Soc.},
  pages =               {5333-5338},
  year =                {2014},
  month =               may,
  doi =                 {10.1109/ICRA.2014.6907643},
}
[LPS04] Banjamin Lynn, Manoj Prabhakaran, and Amit Sahai. Positive Results and Techniques for Obfuscation. In EUROCRYPT'04, Lecture Notes in Computer Science 3027, pages 20-39. Springer-Verlag, August 2004. 
@inproceedings{eurocrypt2004-LPS,
  author =              {Lynn, Banjamin and Prabhakaran, Manoj and Sahai,
                         Amit},
  title =               {Positive Results and Techniques for Obfuscation},
  editor =              {Cachin, Christian and Camenisch, Jan},
  booktitle =           {{P}roceedings of the 23rd {I}nternational
                         {C}onference on the {T}heory and {A}pplications of
                         {C}ryptographic {T}echniques ({EUROCRYPT}'04)},
  acronym =             {{EUROCRYPT}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3027},
  pages =               {20-39},
  year =                {2004},
  month =               aug,
}
[LPT09] Kai Lampka, Simon Perathoner, and Lothar Thiele. Analytic Real-time Analysis and Timed Automata: A Hybrid Method for Analyzing Embedded Real-time Systems. In EMSOFT'09, pages 107-116. ACM Press, October 2009. 
@inproceedings{emsoft2009-LPT,
  author =              {Lampka, Kai and Perathoner, Simon and Thiele,
                         Lothar},
  title =               {Analytic Real-time Analysis and Timed Automata:
                         A~Hybrid Method for Analyzing Embedded Real-time
                         Systems},
  editor =              {Chakraborty, Samarjit and Halbwachs, Nicolas},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference on {E}mbedded {S}oftware ({EMSOFT}'09)},
  acronym =             {{EMSOFT}'09},
  publisher =           {ACM Press},
  pages =               {107-116},
  year =                {2009},
  month =               oct,
  doi =                 {10.1145/1629335.1629351},
}
[LPW+99] Kim Guldstrand Larsen, Justin Pearson, Carsten Weise, and Wang Yi. Clock Difference Diagrams. Nordic Journal of Computing 6(3):271-298. Publishing Association Nordic Journal of Computing, 1999. 
@article{njc6(3)-LPWY,
  author =              {Larsen, Kim Guldstrand and Pearson, Justin and
                         Weise, Carsten and Yi, Wang},
  title =               {Clock Difference Diagrams},
  publisher =           {Publishing Association Nordic Journal of Computing},
  journal =             {Nordic Journal of Computing},
  volume =              {6},
  number =              {3},
  pages =               {271-298},
  year =                {1999},
}
[LPY97] Kim Guldstrand Larsen, Paul Pettersson, and Wang Yi. Uppaal in a nutshell. International Journal on Software Tools for Technology Transfer 1(1-2):134-152. Springer-Verlag, October 1997. 
@article{sttt1(1-2)-LPY,
  author =              {Larsen, Kim Guldstrand and Pettersson, Paul and Yi,
                         Wang},
  title =               {{\textsc{Uppaal}} in a nutshell},
  publisher =           {Springer-Verlag},
  journal =             {International Journal on Software Tools for
                         Technology Transfer},
  volume =              {1},
  number =              {1-2},
  pages =               {134-152},
  year =                {1997},
  month =               oct,
}
[LPZ85] Orna Lichtenstein, Amir Pnueli, and Lenore D. Zuck. The Glory of the Past. In CLP'85, Lecture Notes in Computer Science 193, pages 413-424. Springer-Verlag, June 1985. 
@inproceedings{clp1985-LPZ,
  author =              {Lichtenstein, Orna and Pnueli, Amir and Zuck, Lenore
                         D.},
  title =               {The Glory of the Past},
  editor =              {Parikh, Rohit},
  booktitle =           {Proceedings of the Conference on Logics of Programs
                         ({CLP}'85)},
  acronym =             {{CLP}'85},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {193},
  pages =               {413-424},
  year =                {1985},
  month =               jun,
}
[LR03] Christof Löding and Philipp Rohde. Solving the Sabotage Game is PSPACE-hard. In MFCS'03, Lecture Notes in Computer Science 2747, pages 531-540. Springer-Verlag, August 2003. 
@inproceedings{mfcs2003-LR,
  author =              {L{\"o}ding, Christof and Rohde, Philipp},
  title =               {Solving the Sabotage Game is {PSPACE}-hard},
  editor =              {Rovan, Branislav and Vojt{\'a}s, Peter},
  booktitle =           {{P}roceedings of the 28th {I}nternational
                         {S}ymposium on {M}athematical {F}oundations of
                         {C}omputer {S}cience ({MFCS}'03)},
  acronym =             {{MFCS}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2747},
  pages =               {531-540},
  year =                {2003},
  month =               aug,
}
[LR05] Kim Guldstrand Larsen and Jacob Illum Rasmussen. Optimal Conditional reachability for Multi-Priced Timed Automata. In FoSSaCS'05, Lecture Notes in Computer Science 3441, pages 234-249. Springer-Verlag, April 2005. 
@inproceedings{fossacs2005-LR,
  author =              {Larsen, Kim Guldstrand and Rasmussen, Jacob Illum},
  title =               {Optimal Conditional reachability for Multi-Priced
                         Timed Automata},
  editor =              {Sassone, Vladimiro},
  booktitle =           {{P}roceedings of the 8th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'05)},
  acronym =             {{FoSSaCS}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3441},
  pages =               {234-249},
  year =                {2005},
  month =               apr,
}
[LR08] Kim Guldstrand Larsen and Jacob Illum Rasmussen. Optimal Conditional reachability for Multi-Priced Timed Automata. Theoretical Computer Science 390(2-3):197-213. Elsevier, January 2008. 
@article{tcs390(2-3)-LR,
  author =              {Larsen, Kim Guldstrand and Rasmussen, Jacob Illum},
  title =               {Optimal Conditional reachability for Multi-Priced
                         Timed Automata},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {390},
  number =              {2-3},
  pages =               {197-213},
  year =                {2008},
  month =               jan,
}
[LR16] Anthony W. Lin and Philipp Rümmer. Liveness of Randomised Parameterised Systems under Arbitrary Schedulers. In CAV'16, Lecture Notes in Computer Science 9779, pages 112-133. Springer-Verlag, July 2016. 
@inproceedings{cav2016-LR,
  author =              {Lin, Anthony W. and R{\"u}mmer, Philipp},
  title =               {Liveness of Randomised Parameterised Systems under
                         Arbitrary Schedulers},
  editor =              {Chaudhuri, Swarat and Farzan, Azadeh},
  booktitle =           {{P}roceedings of the 28th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'16)},
  acronym =             {{CAV}'16},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9779},
  pages =               {112-133},
  year =                {2016},
  month =               jul,
  doi =                 {10.1007/978-3-319-41540-6_7},
}
[LRL98] Zhiming Liu, Anders P. Ravn, and Xiaochan Li. Verifying Duration Properties of Timed Transition Systems. In PROCOMET'98, IFIP Conference Proceedings 125, pages 327-345. Chapman & Hall, June 1998. 
@inproceedings{ifipprocomet1998-LRL,
  author =              {Liu, Zhiming and Ravn, Anders P. and Li, Xiaochan},
  title =               {Verifying Duration Properties of Timed Transition
                         Systems},
  editor =              {Gries, David and de Roever, Willem-Paul},
  booktitle =           {{P}roceedings of the 2nd {IFIP} {I}nternational
                         {C}onference on {P}rogramming {C}oncepts and
                         {M}ethods ({PROCOMET}'98)},
  acronym =             {{PROCOMET}'98},
  publisher =           {Chapman \& Hall},
  series =              {IFIP Conference Proceedings},
  volume =              {125},
  pages =               {327-345},
  year =                {1998},
  month =               jun,
}
[LS92] Nancy Lynch and Nir Shavit. Timing-Based Mutual Exclusion. In RTSS'92, pages 2-11. IEEE Comp. Soc. Press, December 1992. 
@inproceedings{rts1992-LS,
  author =              {Lynch, Nancy and Shavit, Nir},
  title =               {Timing-Based Mutual Exclusion},
  booktitle =           {{P}roceedings of the 13th {S}ymposium on {R}eal-Time
                         {S}ystems ({RTSS}'92)},
  acronym =             {{RTSS}'92},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {2-11},
  year =                {1992},
  month =               dec,
}
[LS94] François Laroussinie and Philippe Schnoebelen. A Hierarchy of Temporal Logics with Past. In STACS'94, Lecture Notes in Computer Science 775, pages 47-58. Springer-Verlag, February 1994. 
@inproceedings{stacs1994-LS,
  author =              {Laroussinie, Fran{\c c}ois and Schnoebelen, {\relax
                         Ph}ilippe},
  title =               {A Hierarchy of Temporal Logics with Past},
  editor =              {Enjalbert, Patrice and Mayr, Ernst W. and Wagner,
                         Klaus W.},
  booktitle =           {{P}roceedings of the 11th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'94)},
  acronym =             {{STACS}'94},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {775},
  pages =               {47-58},
  year =                {1994},
  month =               feb,
}
[LS95] François Laroussinie and Philippe Schnoebelen. A Hierarchy of Temporal Logics with Past. Theoretical Computer Science 148(2):303-324. Elsevier, September 1995. 
@article{tcs148(2)-LS,
  author =              {Laroussinie, Fran{\c c}ois and Schnoebelen, {\relax
                         Ph}ilippe},
  title =               {A Hierarchy of Temporal Logics with Past},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {148},
  number =              {2},
  pages =               {303-324},
  year =                {1995},
  month =               sep,
}
[LS98] Xinxin Liu and Scott A. Smolka. Simple Linear-Time Algorithms for Minimal Fixed Points. In ICALP'98, Lecture Notes in Computer Science 1443, pages 53-66. Springer-Verlag, July 1998. 
@inproceedings{icalp1998-LS,
  author =              {Liu, Xinxin and Smolka, Scott A.},
  title =               {Simple Linear-Time Algorithms for Minimal Fixed
                         Points},
  editor =              {Larsen, Kim Guldstrand and Skyum, Sven and Winskel,
                         Glynn},
  booktitle =           {{P}roceedings of the 25th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'98)},
  acronym =             {{ICALP}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1443},
  pages =               {53-66},
  year =                {1998},
  month =               jul,
}
[LS00] François Laroussinie and Philippe Schnoebelen. Specification in CTL+Past for Verification in CTL. Information and Computation 156(1-2):236-263. Academic Press, January 2000. 
@article{icomp156(1-2)-LS,
  author =              {Laroussinie, Fran{\c c}ois and Schnoebelen, {\relax
                         Ph}ilippe},
  title =               {Specification in {CTL}+{P}ast for Verification in
                         {CTL}},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {156},
  number =              {1-2},
  pages =               {236-263},
  year =                {2000},
  month =               jan,
}
[LS00] François Laroussinie and Philippe Schnoebelen. The State-Explosion Problem from Trace to Bisimulation Equivalence. In FoSSaCS'00, Lecture Notes in Computer Science 1784, pages 192-207. Springer-Verlag, March 2000. 
@inproceedings{fossacs2000-LS,
  author =              {Laroussinie, Fran{\c c}ois and Schnoebelen, {\relax
                         Ph}ilippe},
  title =               {The State-Explosion Problem from Trace to
                         Bisimulation Equivalence},
  editor =              {Tiuryn, Jerzy},
  booktitle =           {{P}roceedings of the 3rd {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'00)},
  acronym =             {{FoSSaCS}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1784},
  pages =               {192-207},
  year =                {2000},
  month =               mar,
  doi =                 {10.1007/3-540-46432-8_13},
}
[LS01] Jan Lunze and Jochen Schröder. State observation and diagnosis of discrete-event systems described by stochastic automata. Discrete Event Dynamic Systems 11(4):319-369. Kluwer Academic, October 2001. 
@article{deds11(4)-LS,
  author =              {Lunze, Jan and Schr{\"o}der, Jochen},
  title =               {State observation and diagnosis of discrete-event
                         systems described by stochastic automata},
  publisher =           {Kluwer Academic},
  journal =             {Discrete Event Dynamic Systems},
  volume =              {11},
  number =              {4},
  pages =               {319-369},
  year =                {2001},
  month =               oct,
  doi =                 {10.1023/A:1011273108731},
}
[LS02] Martin Lange and Colin Stirling. Model Checking Fixed Point Logic with Chop. In FoSSaCS'02, Lecture Notes in Computer Science 2303, pages 250-263. Springer-Verlag, April 2002. 
@inproceedings{fossacs2002-LS,
  author =              {Lange, Martin and Stirling, Colin},
  title =               {Model Checking Fixed Point Logic with Chop},
  editor =              {Nielsen, Mogens and Engberg, Uffe},
  booktitle =           {{P}roceedings of the 5th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'02)},
  acronym =             {{FoSSaCS}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2303},
  pages =               {250-263},
  year =                {2002},
  month =               apr,
}
[LS09] Martin Leucker and Christian Schallart. A brief account of runtime verification. Journal of Logic and Algebraic Programming 78(5):293-303. Elsevier, May 2009. 
@article{jlap78(5)-LS,
  author =              {Leucker, Martin and Schallart, Christian},
  title =               {A brief account of runtime verification},
  publisher =           {Elsevier},
  journal =             {Journal of Logic and Algebraic Programming},
  volume =              {78},
  number =              {5},
  pages =               {293-303},
  year =                {2009},
  month =               may,
  doi =                 {10.1016/j.jlap.2008.08.004},
}
[LST00] François Laroussinie, Philippe Schnoebelen, and Mathieu Turuani. On the Expressive and Complexity of Quantitative Branching-Time Temporal Logics. In LATIN'00, Lecture Notes in Computer Science 1776, pages 437-446. Springer-Verlag, April 2000. 
@inproceedings{latin2000-LST,
  author =              {Laroussinie, Fran{\c c}ois and Schnoebelen, {\relax
                         Ph}ilippe and Turuani, Mathieu},
  title =               {On the Expressive and Complexity of Quantitative
                         Branching-Time Temporal Logics},
  editor =              {Gonnet, Gastn H. and Panario, Daniel and Viola,
                         Alfredo},
  booktitle =           {{P}roceedings of the 4th {L}atin {A}merican
                         {S}ymposium on {T}heoretical {IN}formatics
                         ({LATIN}'00)},
  acronym =             {{LATIN}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1776},
  pages =               {437-446},
  year =                {2000},
  month =               apr,
}
[LST03] François Laroussinie, Philippe Schnoebelen, and Mathieu Turuani. On the expressivity and complexity of quantitative branching-time temporal logics. Theoretical Computer Science 297(1-3):297-315. Elsevier, March 2003. 
@article{tcs297(1-3)-LST,
  author =              {Laroussinie, Fran{\c c}ois and Schnoebelen, {\relax
                         Ph}ilippe and Turuani, Mathieu},
  title =               {On the expressivity and complexity of quantitative
                         branching-time temporal logics},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {297},
  number =              {1-3},
  pages =               {297-315},
  year =                {2003},
  month =               mar,
}
[LSW01] Carsten Lutz, Ulrike Sattler, and Frank Wolter. Modal Logic and the Two-Variable Fragment. In CSL'01, Lecture Notes in Computer Science 2142, pages 247-261. Springer-Verlag, September 2001. 
@inproceedings{csl2001-LSW,
  author =              {Lutz, Carsten and Sattler, Ulrike and Wolter, Frank},
  title =               {Modal Logic and the Two-Variable Fragment},
  editor =              {Fribourg, Laurent},
  booktitle =           {{P}roceedings of the 15th {I}nternational {W}orkshop
                         on {C}omputer {S}cience {L}ogic ({CSL}'01)},
  acronym =             {{CSL}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2142},
  pages =               {247-261},
  year =                {2001},
  month =               sep,
}
[LT00] Christof Löding and Wolfgang Thomas. Alternating Automata and Logics over Infinite Words. In IFIPTCS'00, Lecture Notes in Computer Science 1872, pages 521-535. Springer-Verlag, August 2000. 
@inproceedings{ifiptcs2000-LT,
  author =              {L{\"o}ding, Christof and Thomas, Wolfgang},
  title =               {Alternating Automata and Logics over Infinite Words},
  editor =              {van Leeuwen, Jan and Watanabe, Osamu and Hagiya,
                         Masami and Mosses, Peter D. and Ito, Takayasu},
  booktitle =           {{E}xploring {N}ew {F}rontiers of {T}heoretical
                         {I}nformatics~--- {P}roceedings of the 1st {IFIP}
                         {I}nternational {C}onference on {T}heoretical
                         {C}omputer {S}cience ({IFIPTCS}'00)},
  acronym =             {{IFIPTCS}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1872},
  pages =               {521-535},
  year =                {2000},
  month =               aug,
}
[Lug03] Denis Lugiez. Counting and Equality Constraints for Multitree Automata. In FoSSaCS'03, Lecture Notes in Computer Science 2620, pages 328-342. Springer-Verlag, April 2003. 
@inproceedings{fossacs2003-Lug,
  author =              {Lugiez, Denis},
  title =               {Counting and Equality Constraints for Multitree
                         Automata},
  editor =              {Gordon, Andrew D.},
  booktitle =           {{P}roceedings of the 6th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'03)},
  acronym =             {{FoSSaCS}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2620},
  pages =               {328-342},
  year =                {2003},
  month =               apr,
}
[Lut08] Michael Luttenberger. Strategy Iteration using Non-Deterministic Strategies for Solving Parity Games. Research Report cs.GT/0806.2923, arXiv, June 2008. 
@techreport{arxiv-cs.GT/0806.2923,
  author =              {Luttenberger, Michael},
  title =               {Strategy Iteration using Non-Deterministic
                         Strategies for Solving Parity Games},
  number =              {cs.GT/0806.2923},
  year =                {2008},
  month =               jun,
  institution =         {arXiv},
  type =                {Research Report},
}
[LV99] Richard J. Lipton and Anastasios Viglas. On the Complexity of SAT. In FOCS'99, pages 459-464. IEEE Comp. Soc. Press, November 1999. 
@inproceedings{focs1999-LV,
  author =              {Lipton, Richard J. and Viglas, Anastasios},
  title =               {On the Complexity of {SAT}},
  booktitle =           {{P}roceedings of the 40th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'99)},
  acronym =             {{FOCS}'99},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {459-464},
  year =                {1999},
  month =               nov,
}
[LW05] Sławomir Lasota and Igor Walukiewicz. Alternating Timed Automata. In FoSSaCS'05, Lecture Notes in Computer Science 3441, pages 250-265. Springer-Verlag, April 2005. 
@inproceedings{fossacs2005-LW,
  author =              {Lasota, S{\l}awomir and Walukiewicz, Igor},
  title =               {Alternating Timed Automata},
  editor =              {Sassone, Vladimiro},
  booktitle =           {{P}roceedings of the 8th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'05)},
  acronym =             {{FoSSaCS}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3441},
  pages =               {250-265},
  year =                {2005},
  month =               apr,
}
[LW08] Sławomir Lasota and Igor Walukiewicz. Alternating Timed Automata. ACM Transactions on Computational Logic 9(2). ACM Press, March 2008. 
@article{tocl9(2)-LW,
  author =              {Lasota, S{\l}awomir and Walukiewicz, Igor},
  title =               {Alternating Timed Automata},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Computational Logic},
  volume =              {9},
  number =              {2},
  year =                {2008},
  month =               mar,
}
[LWW07] Carsten Lutz, Dirk Walther, and Frank Wolter. Quantitative temporal logics over the reals: PSPACE and below. Information and Computation 205(1):99-123. Elsevier, January 2007. 
@article{lww-icomp2007,
  author =              {Lutz, Carsten and Walther, Dirk and Wolter, Frank},
  title =               {Quantitative temporal logics over the reals:
                         {PSPACE} and below},
  publisher =           {Elsevier},
  journal =             {Information and Computation},
  volume =              {205},
  number =              {1},
  pages =               {99-123},
  year =                {2007},
  month =               jan,
  doi =                 {10.1016/j.ic.2006.08.006},
}
[LY94] Kim Guldstrand Larsen and Wang Yi. Time Abstracted Bisimiulation: Implicit Specifications and Decidability. In MFPS'93, Lecture Notes in Computer Science 802, pages 160-176. Springer-Verlag, 1994. 
@inproceedings{mfps1993-LY,
  author =              {Larsen, Kim Guldstrand and Yi, Wang},
  title =               {Time Abstracted Bisimiulation: Implicit
                         Specifications and Decidability},
  editor =              {Brookes, Setphen D. and Main, Michael G. and Melton,
                         Austin and Mislove, Michael W. and Schmidt, David
                         A.},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference on {M}athematical {F}oundations of
                         {P}rogramming {S}emantics ({MFPS}'93)},
  acronym =             {{MFPS}'93},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {802},
  pages =               {160-176},
  year =                {1994},
  confyear =            {1993},
  confmonth =           {4},
}
[LZ20] Karoliina Lehtinen and Martin Zimmermann. Good-for-games ω-pushdown automata. In LICS'20, pages 689-702. IEEE Comp. Soc. Press, July 2020. 
@inproceedings{lics2020-LZ,
  author =              {Lehtinen, Karoliina and Zimmermann, Martin},
  title =               {Good-for-games {\(\omega\)}-pushdown automata},
  editor =              {Hermanns, Holger and Zhang, Lijun and Kobayashi,
                         Naoki and Miller, Dale},
  booktitle =           {{P}roceedings of the 35th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'20)},
  acronym =             {{LICS}'20},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {689-702},
  year =                {2020},
  month =               jul,
  doi =                 {10.1145/3373718.3394737},
}
M
[Mad80] Roger Maddux. The equational theory of CA3 is undecidable. Journal of Symbolic Logic 45(2):311-316. Association for Symbolic Logic, June 1980. 
@article{jsl45(2)-Mad,
  author =              {Maddux, Roger},
  title =               {The equational theory of \(CA_{3}\) is undecidable},
  publisher =           {Association for Symbolic Logic},
  journal =             {Journal of Symbolic Logic},
  volume =              {45},
  number =              {2},
  pages =               {311-316},
  year =                {1980},
  month =               jun,
  doi =                 {10.2307/2273191},
}
[Mad11] Parthasarathy Madhusudan. Synthesizing Reactive Programs. In CSL'11, Leibniz International Proceedings in Informatics 12, pages 428-442. Leibniz-Zentrum für Informatik, September 2011. 
@inproceedings{csl2011-Mad,
  author =              {Madhusudan, Parthasarathy},
  title =               {Synthesizing Reactive Programs},
  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 =               {428-442},
  year =                {2011},
  month =               sep,
}
[Mai78] David Maier. The Complexity of Some Problems on Subsequences and Supersequences. Journal of the ACM 25(2):322-336. ACM Press, April 1978. 
@article{jacm25(2)-Mai,
  author =              {Maier, David},
  title =               {The Complexity of Some Problems on Subsequences and
                         Supersequences},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {25},
  number =              {2},
  pages =               {322-336},
  year =                {1978},
  month =               apr,
}
[Mai00] Monika Maidl. The Common Fragment of CTL and LTL. In FOCS'00, pages 643-652. IEEE Comp. Soc. Press, November 2000. 
@inproceedings{focs2000-Mai,
  author =              {Maidl, Monika},
  title =               {The Common Fragment of {CTL} and~{LTL}},
  booktitle =           {{P}roceedings of the 41st {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'00)},
  acronym =             {{FOCS}'00},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {643-652},
  year =                {2000},
  month =               nov,
}
[Mal00] Oded Maler. Systèmes discrets, temporisés et hybrides. Mémoire d'habilitation, Université Joseph Fourier, Grenoble, France, May 2000. 
@phdthesis{hab-maler,
  author =              {Maler, Oded},
  title =               {Syst{\`e}mes discrets, temporis{\'e}s et hybrides},
  year =                {2000},
  month =               may,
  institution =         {Universit{\'e} Joseph Fourier, Grenoble, France},
  school =              {Universit{\'e} Joseph Fourier, Grenoble, France},
  type =                {M\'emoire d'habilitation},
}
[Mal02] Oded Maler. Control from Computer Science. Annual Reviews in Control 26(2):175-187. Elsevier, 2002. 
@article{aric26(2)-Mal,
  author =              {Maler, Oded},
  title =               {Control from Computer Science},
  publisher =           {Elsevier},
  journal =             {Annual Reviews in Control},
  volume =              {26},
  number =              {2},
  pages =               {175-187},
  year =                {2002},
}
[Man00] Panagiotis Manolios. Mu-Calculus Model-Checking. In Matt Kaufmann, Panagiotis Manolios, and J. Strother Moore (eds.), Computer Aided Reasoning: ACL2 Case Studies. Kluwer Academic, June 2000. 
@incollection{CAR-ACL2CS-Man,
  author =              {Manolios, Panagiotis},
  title =               {Mu-Calculus Model-Checking},
  editor =              {Kaufmann, Matt and Manolios, Panagiotis and Moore,
                         J. Strother},
  booktitle =           {Computer Aided Reasoning: {ACL2} Case Studies},
  publisher =           {Kluwer Academic},
  pages =               {93-111},
  year =                {2000},
  month =               jun,
}
[Mar75] Donald A. Martin. Borel Determinacy. Annals of Mathematics 102(2):363-371. Princeton University Press, September 1975. 
@article{am102(2)-Mar,
  author =              {Martin, Donald A.},
  title =               {{B}orel Determinacy},
  publisher =           {Princeton University Press},
  journal =             {Annals of Mathematics},
  volume =              {102},
  number =              {2},
  pages =               {363-371},
  year =                {1975},
  month =               sep,
  doi =                 {10.2307/1971035},
}
[Mar00] Nicolas Markey. Complexité de la logique temporelle avec passé. Rapport de DEA, Lab. Spécification & Vérification, ENS Cachan, France, June 2000. 
@mastersthesis{dea2000-Mar,
  author =              {Markey, Nicolas},
  title =               {Complexit{\'e} de la logique temporelle avec
                         pass{\'e}},
  year =                {2000},
  month =               jun,
  school =              {Lab.~Sp\'ecification \& V\'erification, ENS Cachan,
                         France},
  type =                {Rapport de~{DEA}},
}
[Mar02] Nicolas Markey. Past is for Free: On the Complexity of Verifying Linear Temporal Properties with Past. In EXPRESS'02, Electronic Notes in Theoretical Computer Science 68(2), pages 89-106. Elsevier, August 2002.
Abstract

We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (PLTL). More precisely, we consider several fragments of PLTL, depending on the allowed set of temporal modalities, the use of negations or the nesting of future formulae into past formulae. Our results show that "past is for free", that is it does not bring additional theoretical complexity, even for small fragments, and even when nesting future formulae into past formulae. We also remark that existential and universal model-checking can have different complexity for certain fragments.

@inproceedings{express2002-Mar,
  author =              {Markey, Nicolas},
  title =               {Past is for Free: On the Complexity of Verifying
                         Linear Temporal Properties with Past},
  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 =               {89-106},
  year =                {2002},
  month =               aug,
  doi =                 {10.1016/S1571-0661(05)80366-4},
  abstract =            {We study the complexity of satisfiability and
                         model-checking of the linear-time temporal logic
                         with past~(PLTL). More precisely, we consider
                         several fragments of PLTL, depending on the allowed
                         set of temporal modalities, the use of negations or
                         the nesting of future formulae into past formulae.
                         Our~results show that {"}past is for free{"}, that
                         is it does not bring additional theoretical
                         complexity, even for small fragments, and even when
                         nesting future formulae into past formulae. We~also
                         remark that existential and universal model-checking
                         can have different complexity for certain
                         fragments.},
}
[Mar03] Nicolas Markey. Temporal Logic with Past is Exponentially More Succinct. EATCS Bulletin 79:122-128. EATCS, February 2003.
Abstract

We positively answer the old question whether temporal logic with past is more succinct than pure-future temporal logic. Surprisingly, the proof is quite simple and elementary, although the question has been open for twenty years.

@article{eatcs-bull79()-Mar,
  author =              {Markey, Nicolas},
  title =               {Temporal Logic with Past is Exponentially More
                         Succinct},
  publisher =           {EATCS},
  journal =             {EATCS Bulletin},
  volume =              {79},
  pages =               {122-128},
  year =                {2003},
  month =               feb,
  abstract =            {We positively answer the old question whether
                         temporal logic with past is more succinct than
                         pure-future temporal logic. Surprisingly, the proof
                         is quite simple and elementary, although the
                         question has been open for twenty years.},
}
[Mar03] Nicolas Markey. Logiques temporelles pour la vérification : expressivité, complexité, algorithmes. Thèse de doctorat, Lab. Informatique Fondamentale d'Orléans, France, April 2003. 
@phdthesis{phd2003-Mar,
  author =              {Markey, Nicolas},
  title =               {Logiques temporelles pour la v{\'e}rification~:
                         expressivit{\'e}, complexit{\'e}, algorithmes},
  year =                {2003},
  month =               apr,
  school =              {Lab.~Informatique Fondamentale d'Orl{\'e}ans,
                         France},
  type =                {Th\`ese de doctorat},
}
[Mar04] Nicolas Markey. TSMV : model-checking symbolique de systémes simplement temporisés. In AFADL'04. June 2004. 
@inproceedings{afadl2004-Mar,
  author =              {Markey, Nicolas},
  title =               {{TSMV}~: model-checking symbolique de syst{\'e}mes
                         simplement temporis{\'e}s},
  editor =              {Julliand, Jacques},
  booktitle =           {Actes de la 6\`eme Conf\'erence {A}pproches
                         {F}ormelles dans l'{A}ssistance au
                         {D}{\'e}veloppement de {L}ogiciels ({AFADL}'04)},
  acronym =             {{AFADL}'04},
  year =                {2004},
  month =               jun,
}
[Mar04] Nicolas Markey. Past is for Free: On the Complexity of Verifying Linear Temporal Properties with Past. Acta Informatica 40(6-7):431-458. Springer-Verlag, May 2004.
Abstract

We study the complexity of satisfiability and model checking problems for fragments of linear-time temporal logic with past (PLTL). We consider many fragments of PLTL, obtained by restricting the set of allowed temporal modalities, the use of negations or the nesting of future formulas into past formulas. Our results strengthen the widely accepted fact that "past is for free", in the sense that allowing symmetric past-time modalities does not bring additional theoretical complexity. This result holds even for small fragments and even when nesting future formulas into past formulas.

@article{acta40(6-7)-Mar,
  author =              {Markey, Nicolas},
  title =               {Past is for Free: On the Complexity of Verifying
                         Linear Temporal Properties with Past},
  publisher =           {Springer-Verlag},
  journal =             {Acta Informatica},
  volume =              {40},
  number =              {6-7},
  pages =               {431-458},
  year =                {2004},
  month =               may,
  doi =                 {10.1007/s00236-003-0136-5},
  abstract =            {We study the complexity of satisfiability and model
                         checking problems for fragments of linear-time
                         temporal logic with past (PLTL). We consider many
                         fragments of PLTL, obtained by restricting the set
                         of allowed temporal modalities, the use of negations
                         or the nesting of future formulas into past
                         formulas. Our results strengthen the widely accepted
                         fact that {"}past is for free{"}, in the sense that
                         allowing symmetric past-time modalities does not
                         bring additional theoretical complexity. This result
                         holds even for small fragments and even when nesting
                         future formulas into past formulas.},
}
[Mar05] Wilfredo R. Marrero. Using BDDs to Decide CTL. In TACAS'05, Lecture Notes in Computer Science 3440, pages 222-236. Springer-Verlag, April 2005. 
@inproceedings{tacas2005-Mar,
  author =              {Marrero, Wilfredo R.},
  title =               {Using {BDD}s to Decide~{CTL}},
  editor =              {Halbwachs, Nicolas and Zuck, Lenore D.},
  booktitle =           {{P}roceedings of the 11th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'05)},
  acronym =             {{TACAS}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3440},
  pages =               {222-236},
  year =                {2005},
  month =               apr,
}
[Mar10] Pavel V. Martyugin. Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA. In CSR'10, Lecture Notes in Computer Science 6072, pages 288-302. Springer-Verlag, June 2010. 
@inproceedings{csr2010-Mar,
  author =              {Martyugin, Pavel V.},
  title =               {Complexity of Problems Concerning Carefully
                         Synchronizing Words for~{PFA} and Directing Words
                         for~{NFA}},
  editor =              {Ablayev, Farid M. and Mayr, Ernst W.},
  booktitle =           {{P}roceedings of the 5th {I}nternational {C}omputer
                         {S}cience {S}ymposium in {R}usia ({CSR}'10)},
  acronym =             {{CSR}'10},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6072},
  pages =               {288-302},
  year =                {2010},
  month =               jun,
  doi =                 {10.1007/978-3-642-13182-0_27},
}
[Mar10] Manuel Biscaia Martins. Supervisory Control of Petri Nets using Linear Temporal Logic. Thèse de doctorat, Instituto Superior Técnico, Universidade Técnica de Lisboa, Portugal, January 2010. 
@phdthesis{phd-mbmartins,
  author =              {Martins, Manuel Biscaia},
  title =               {Supervisory Control of {P}etri Nets using Linear
                         Temporal Logic},
  year =                {2010},
  month =               jan,
  school =              {Instituto Superior T\'ecnico, Universidade T\'ecnica
                         de Lisboa, Portugal},
  type =                {Th\`ese de doctorat},
}
[Mar11] Nicolas Markey. Robustness in Real-time Systems. In SIES'11, pages 28-34. IEEE Comp. Soc. Press, June 2011.
Abstract

We review several aspects of robustness of real-time systems, and present recent results on the robust verification of timed automata.

@inproceedings{sies2011-Mar,
  author =              {Markey, Nicolas},
  title =               {Robustness in Real-time Systems},
  booktitle =           {{P}roceedings of the 6th {IEEE} {I}nternational
                         {S}ymposium on {I}ndustrial {E}mbedded {S}ystems
                         ({SIES}'11)},
  acronym =             {{SIES}'11},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {28-34},
  year =                {2011},
  month =               jun,
  doi =                 {10.1109/SIES.2011.5953652},
  abstract =            {We~review several aspects of robustness of real-time
                         systems, and present recent results on the robust
                         verification of timed automata.},
}
[Mar11] Nicolas Markey. Verification of Embedded Systems – Algorithms and Complexity. Mémoire d'habilitation, École Normale Supérieure de Cachan, France, April 2011. 
@phdthesis{hdr2011-Mar,
  author =              {Markey, Nicolas},
  title =               {Verification of Embedded Systems -- Algorithms and
                         Complexity},
  year =                {2011},
  month =               apr,
  school =              {{\'E}cole Normale Sup{\'e}rieure de Cachan, France},
  type =                {M\'emoire d'habilitation},
}
[Mar14] Nicolas Markey. Cassting: Synthesizing Complex Systems Using Non-Zero-Sum Games. ERCIM News 97:25-26. European Research Consortium for Informatics and Mathematics, April 2014. 
@article{ercimnews97-Mar,
  author =              {Markey, Nicolas},
  title =               {Cassting: Synthesizing Complex Systems Using
                         Non-Zero-Sum Games},
  publisher =           {European Research Consortium for Informatics and
                         Mathematics},
  journal =             {ERCIM News},
  volume =              {97},
  pages =               {25-26},
  year =                {2014},
  month =               apr,
  url =                 {http://ercim-news.ercim.eu/en97/special/
  cassting-synthesizing-complex-systems-using-non-zero-sum-games},
}
[Mar17] Nicolas Markey. Temporal logics for multi-agent systems (invited talk). In MFCS'17, Leibniz International Proceedings in Informatics 84, pages 84:1-84:3. Leibniz-Zentrum für Informatik, August 2017. 
@inproceedings{mfcs2017-Mar,
  author =              {Markey, Nicolas},
  title =               {Temporal logics for multi-agent systems
                         (invited~talk)},
  editor =              {Larsen, Kim Guldstrand and Bodlaender, Hans L. and
                         Raskin, Jean-Fran{\c c}ois},
  booktitle =           {{P}roceedings of the 42nd {I}nternational
                         {S}ymposium on {M}athematical {F}oundations of
                         {C}omputer {S}cience ({MFCS}'17)},
  acronym =             {{MFCS}'17},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {84},
  pages =               {84:1-84:3},
  year =                {2017},
  month =               aug,
  doi =                 {10.4230/LIPIcs.MFCS.2017.84},
}
[Mar23] Nicolas Markey. Computing the price of anarchy in atomic network congestion games (invited talk). In FORMATS'23, Lecture Notes in Computer Science 14138, pages 3-12. Springer-Verlag, September 2023.
Abstract

Network congestion games are a simple model for reasoning about routing problems in a network. They are a very popular topic in algorithmic game theory, and a huge amount of results about existence and (in)efficiency of equilibrium strategy profiles in those games have been obtained over the last 20 years.

In particular, the price of anarchy has been defined as an important notion for measuring the inefficiency of Nash equilibria. Generic bounds have been obtained for the price of anarchy over various classes of networks, but little attention has been put on the effective computation of this value for a given network. This talk presents recent results on this problem in different settings.

@inproceedings{formats2023-Mar,
  author =              {Markey, Nicolas},
  title =               {Computing the price of anarchy in atomic network
                         congestion games (invited~talk)},
  editor =              {Petrucci, Laure and Sproston, Jeremy},
  booktitle =           {{P}roceedings of the 21st {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'23)},
  acronym =             {{FORMATS}'23},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {14138},
  pages =               {3-12},
  year =                {2023},
  month =               sep,
  doi =                 {10.1007/978-3-031-42626-1_1},
  abstract =            {Network congestion games are a simple model for
                         reasoning about routing problems in a network. They
                         are a very popular topic in algorithmic game theory,
                         and a huge amount of results about existence and
                         (in)efficiency of equilibrium strategy profiles in
                         those games have been obtained over the last
                         20~years. \par In~particular, the price of anarchy
                         has been defined as an important notion for
                         measuring the inefficiency of Nash equilibria.
                         Generic bounds have been obtained for the price of
                         anarchy over various classes of networks, but little
                         attention has been put on the effective computation
                         of this value for a given network. This talk
                         presents recent results on this problem in different
                         settings.},
}
[Mat02] Radu Mateescu. Local Model-Checking of Modal Mu-Calculus on Acyclic Labeled Transition Systems. Research Report 4430, INRIA Rhône-Alpes, Montbonnot, France, April 2002. 
@techreport{inria-4430,
  author =              {Mateescu, Radu},
  title =               {Local Model-Checking of Modal Mu-Calculus on Acyclic
                         Labeled Transition Systems},
  number =              {4430},
  year =                {2002},
  month =               apr,
  institution =         {INRIA Rh\^one-Alpes, Montbonnot, France},
  type =                {Research Report},
}
[Maz02] René Mazala. Infinite Games. In Erich Grädel, Wolfgang Thomas, and Thomas Wilke (eds.), Automata, Logics, and Infinite Games, Lecture Notes in Computer Science 2500, pages 23-42. Springer-Verlag, 2002. 
@incollection{lncs2500-mazala,
  author =              {Mazala, Ren{\'e}},
  title =               {Infinite Games},
  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 =               {23-42},
  year =                {2002},
}
[MB08] Oded Maler and Grégory Batt. Approximating continuous systems by timed automata. In FMSB'08, Lecture Notes in Bioinformatics 5054, pages 77-89. Springer-Verlag, June 2008. 
@inproceedings{fmsb2008-MB,
  author =              {Maler, Oded and Batt, Gr{\'e}gory},
  title =               {Approximating continuous systems by timed automata},
  editor =              {Fisher, Jasmin},
  booktitle =           {{P}roceedings of the 1st {I}nternational {W}okshop
                         on {F}ormal {M}ethods in {S}ystems {B}iology
                         ({FMSB}'08)},
  acronym =             {{FMSB}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Bioinformatics},
  volume =              {5054},
  pages =               {77-89},
  year =                {2008},
  month =               jun,
  doi =                 {10.1007/978-3-540-68413-8_6},
}
[MBK03] Malik Magdon-Ismail, Costas Busch, and Mukkai S. Krishnamoorthy. Cake-Cutting is not a Piece of Cake. In STACS'03, Lecture Notes in Computer Science 2607, pages 596-607. Springer-Verlag, February 2003. 
@inproceedings{stacs2003-MBK,
  author =              {Magdon{-}Ismail, Malik and Busch, Costas and
                         Krishnamoorthy, Mukkai S.},
  title =               {Cake-Cutting is not a Piece of Cake},
  editor =              {Alt, Helmut and Habib, Michel},
  booktitle =           {{P}roceedings of the 20th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'03)},
  acronym =             {{STACS}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2607},
  pages =               {596-607},
  year =                {2003},
  month =               feb,
}
[MBL+98] Hervé Marchand, Patricia Bournai, Michel Le Borgne, and Paul Le Guernic. A Design Environment for Discrete-Event Controllers based on the SIGNAL Language. In SMC'98, pages 770-775. IEEE Comp. Soc. Press, October 1998. 
@inproceedings{ieeesmc1998-MBLL,
  author =              {Marchand, Herv{\'e} and Bournai, Patricia and
                         Le{~}Borgne, Michel and Le{~}Guernic, Paul},
  title =               {A Design Environment for Discrete-Event Controllers
                         based on the {SIGNAL} Language},
  booktitle =           {{P}roceedings of the 1998 {IEEE} {I}nternational
                         {C}onference on {S}ystems, {M}an, {A}nd
                         {C}ybernetics ({SMC}'98)},
  acronym =             {{SMC}'98},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {770-775},
  year =                {1998},
  month =               oct,
}
[McM93] Kenneth L. McMillan. Symbolic Model Checking – An Approach to the State Explosion Problem. PhD thesis, Carnegie Mellon University, 1993. 
@phdthesis{phd-mcmillan,
  author =              {McMillan, Kenneth L.},
  title =               {Symbolic Model Checking~-- An~Approach to the State
                         Explosion Problem},
  year =                {1993},
  school =              {Carnegie Mellon University},
}
[McM93] Kenneth L. McMillan. Symbolic Model Checking. Kluwer Academic, 1993. 
@book{McM93-book,
  author =              {McMillan, Kenneth L.},
  title =               {Symbolic Model Checking},
  publisher =           {Kluwer Academic},
  year =                {1993},
}
[McM99] Kenneth L. McMillan. Verification of infinite state systems by compositional model checking. In CHARME'99, Lecture Notes in Computer Science 1703, pages 219-237. Springer-Verlag, September 1999. 
@inproceedings{charme1999-McM,
  author =              {McMillan, Kenneth L.},
  title =               {Verification of infinite state systems by
                         compositional model checking},
  editor =              {Pierre, Laurence and Kropf, {\relax Th}omas},
  booktitle =           {{P}roceedings of the 10th {C}orrect {H}ardware
                         {D}esign and {V}erification {M}ethods ({CHARME}'99)},
  acronym =             {{CHARME}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1703},
  pages =               {219-237},
  year =                {1999},
  month =               sep,
  doi =                 {10.1007/3-540-48153-2_17},
}
[McM02] Kenneth L. McMillan. Applying SAT Methods in Unbounded Symbolic Model Checking. In CAV'02, Lecture Notes in Computer Science 2404, pages 250-264. Springer-Verlag, July 2002. 
@inproceedings{cav2002-McM,
  author =              {McMillan, Kenneth L.},
  title =               {Applying {SAT} Methods in Unbounded Symbolic Model
                         Checking},
  editor =              {Brinksma, Ed and Larsen, Kim Guldstrand},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'02)},
  acronym =             {{CAV}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2404},
  pages =               {250-264},
  year =                {2002},
  month =               jul,
}
[McM06] Kenneth L. McMillan. Lazy Abstraction with Interpolants. In CAV'06, Lecture Notes in Computer Science 4144, pages 123-136. Springer-Verlag, July 2006. 
@inproceedings{cav2006-McM,
  author =              {McMillan, Kenneth L.},
  title =               {Lazy Abstraction with Interpolants},
  editor =              {Ball, Thomas and Jones, Robert},
  booktitle =           {{P}roceedings of the 18th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'06)},
  acronym =             {{CAV}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4144},
  pages =               {123-136},
  year =                {2006},
  month =               jul,
  doi =                 {10.1007/11817963_14},
}
[McN66] Robert McNaughton. Testing and Generating Infinite Sequences by a Finite Automaton. Information and Control 9(6):521-530. Academic Press, December 1966. 
@article{icont9(6)-Mcn,
  author =              {McNaughton, Robert},
  title =               {Testing and Generating Infinite Sequences by a
                         Finite Automaton},
  publisher =           {Academic Press},
  journal =             {Information and Control},
  volume =              {9},
  number =              {6},
  pages =               {521-530},
  year =                {1966},
  month =               dec,
}
[McN93] Robert McNaughton. Infinite Games Played on Finite Graphs. Annals of Pure and Applied Logic 65(2):149-184. Elsevier, December 1993. 
@article{apal65(2)-Mcn,
  author =              {McNaughton, Robert},
  title =               {Infinite Games Played on Finite Graphs},
  publisher =           {Elsevier},
  journal =             {Annals of Pure and Applied Logic},
  volume =              {65},
  number =              {2},
  pages =               {149-184},
  year =                {1993},
  month =               dec,
}
[MH84] Satoru Miyano and Takeshi Hayashi. Alternating Finite Automata on ω-words. Theoretical Computer Science 32:321-330. Elsevier, 1984. 
@article{tcs32()-MH,
  author =              {Miyano, Satoru and Hayashi, Takeshi},
  title =               {Alternating Finite Automata on {\(\omega\)}-words},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {32},
  pages =               {321-330},
  year =                {1984},
}
[Mil80] Robin Milner. A Calculus of Communicating Systems. Lecture Notes in Computer Science 92. Springer-Verlag, 1980. 
@book{Milner-lncs92,
  author =              {Milner, Robin},
  title =               {A Calculus of Communicating Systems},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {92},
  year =                {1980},
}
[Mil89] Robin Milner. Communication and concurrency. Prentice Hall International Series in Computer Science. Prentice Hall, December 1989. 
@book{Milner-CC1989,
  author =              {Milner, Robin},
  title =               {Communication and concurrency},
  publisher =           {Prentice Hall},
  series =              {Prentice Hall International Series in Computer
                         Science},
  year =                {1989},
  month =               dec,
}
[Mil00] Joseph S. Miller. Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata. In HSCC'00, Lecture Notes in Computer Science 1790, pages 296-310. Springer-Verlag, March 2000. 
@inproceedings{hscc2000-Mil,
  author =              {Miller, Joseph S.},
  title =               {Decidability and Complexity Results for Timed
                         Automata and Semi-linear Hybrid Automata},
  editor =              {Lynch, Nancy and Krogh, Bruce H.},
  booktitle =           {{P}roceedings of the 3rd {I}nternational {W}orkshop
                         on {H}ybrid {S}ystems: {C}omputation and {C}ontrol
                         ({HSCC}'00)},
  acronym =             {{HSCC}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1790},
  pages =               {296-310},
  year =                {2000},
  month =               mar,
}
[Min61] Marvin L. Minsky. Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines. Annals of Mathematics 74(3):437-455. Princeton University Press, November 1961. 
@article{am74(3)-Min,
  author =              {Minsky, Marvin L.},
  title =               {Recursive Unsolvability of {P}ost's Problem of
                         {"}Tag{"} and other Topics in Theory of {T}uring
                         Machines},
  publisher =           {Princeton University Press},
  journal =             {Annals of Mathematics},
  volume =              {74},
  number =              {3},
  pages =               {437-455},
  year =                {1961},
  month =               nov,
}
[Min67] Marvin L. Minsky. Computation: Finite and Infinite Machines. Prentice Hall, Inc., 1967. 
@book{cfim1967-Min,
  author =              {Minsky, Marvin L.},
  title =               {Computation: Finite and Infinite Machines},
  booktitle =           {Computation: Finite and Infinite Machines},
  publisher =           {Prentice Hall, Inc.},
  year =                {1967},
}
[Min99] Marius Minea. Partial Order Reduction for Model Checking of Timed Automata. In CONCUR'99, Lecture Notes in Computer Science 1664, pages 431-446. Springer-Verlag, August 1999. 
@inproceedings{concur1999-Min,
  author =              {Minea, Marius},
  title =               {Partial Order Reduction for Model Checking of Timed
                         Automata},
  editor =              {Baeten, Jos C. M. and Mauw, Sjouke},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'99)},
  acronym =             {{CONCUR}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1664},
  pages =               {431-446},
  year =                {1999},
  month =               aug,
}
[Min99] Marius Minea. Partial-order reduction for verification of timed systems. PhD thesis, Computer Science Deparment, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA, December 1999. 
@phdthesis{phd-minea,
  author =              {Minea, Marius},
  title =               {Partial-order reduction for verification of timed
                         systems},
  year =                {1999},
  month =               dec,
  school =              {Computer Science Deparment, Carnegie Mellon
                         University, Pittsburgh, Pennsylvania, USA},
}
[Mit05] David G. Mitchell. A SAT Solver Primer. EATCS Bulletin 85:112-132. EATCS, February 2005. 
@article{eatcs-bull85()-Mit,
  author =              {Mitchell, David G.},
  title =               {A {SAT} Solver Primer},
  publisher =           {EATCS},
  journal =             {EATCS Bulletin},
  volume =              {85},
  pages =               {112-132},
  year =                {2005},
  month =               feb,
}
[Miy91] Satoru Miyano. Δ2P-complete lexicographically first maximal subgraph problems. Theoretical Computer Science 88(1):33-57. Elsevier, 1991. 
@article{tcs88(1)-Miy,
  author =              {Miyano, Satoru},
  title =               {{\(\Delta_2^P\)}-complete lexicographically first
                         maximal subgraph problems},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {88},
  number =              {1},
  pages =               {33-57},
  year =                {1991},
}
[MLA+99] Jesper B. Møller, Jakob Lichtenberg, Henrik Reif Andersen, and Henrik Hulgaard. Difference Decision Diagrams. In CSL'99, Lecture Notes in Computer Science 1862, pages 111-125. Springer-Verlag, September 1999. 
@inproceedings{csl1999-MLAH,
  author =              {M{\o}ller, Jesper B. and Lichtenberg, Jakob and
                         Andersen, Henrik Reif and Hulgaard, Henrik},
  title =               {Difference Decision Diagrams},
  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 =               {111-125},
  year =                {1999},
  month =               sep,
}
[MM02] Annabelle K. McIver and Carroll C. Morgan. Games, Probability and the Quantitative μ-calculus. In LPAR'02, Lecture Notes in Computer Science 2514, pages 292-310. Springer-Verlag, October 2002. 
@inproceedings{lpar2002-MM,
  author =              {McIver, Annabelle K. and Morgan, Carroll C.},
  title =               {Games, Probability and the Quantitative
                         {\(\mu\)}-calculus},
  editor =              {Baaz, Matthias and Voronkov, Andrei},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference {L}ogic {P}rogramming and {A}utomated
                         {R}easoning ({LPAR}'02)},
  acronym =             {{LPAR}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2514},
  pages =               {292-310},
  year =                {2002},
  month =               oct,
}
[MMK+94] Louise E. Moser, P. Michael Melliar-Smith, George Kutty, and Y. Srinivas Ramakrishna. Completeness and Soundness of Axiomatizations for Temporal Logics without Next. Fundamenta Informaticae 21(4):257-305. IOS Press, October 1994. 
@article{fundi21(4)-MMKR,
  author =              {Moser, Louise E. and Melliar{-}Smith, P. Michael and
                         Kutty, George and Ramakrishna, Y. Srinivas},
  title =               {Completeness and Soundness of Axiomatizations for
                         Temporal Logics without Next},
  publisher =           {IOS Press},
  journal =             {Fundamenta Informaticae},
  volume =              {21},
  number =              {4},
  pages =               {257-305},
  year =                {1994},
  month =               oct,
}
[MMP+20] Bastien Maubert, Aniello Murano, Sophie Pinchinat, François Schwarzentruber, and Silvia Stranieri. Dynamic Epistemic Logic Games with Epistemic Temporal Goals. Technical Report 2001-07141, arXiv, January 2020. 
@techreport{arxiv2001.07141-MMPSS,
  author =              {Maubert, Bastien and Murano, Aniello and Pinchinat,
                         Sophie and Schwarzentruber, Fran{\c c}ois and
                         Stranieri, Silvia},
  title =               {Dynamic Epistemic Logic Games with Epistemic
                         Temporal Goals},
  number =              {2001-07141},
  year =                {2020},
  month =               jan,
  institution =         {arXiv},
}
[MMP+12] Fabio Mogavero, Aniello Murano, Giuseppe Perelli, and Moshe Y. Vardi. What Makes ATL* Decidable? A Decidable Fragment of Strategy Logic. In CONCUR'12, Lecture Notes in Computer Science 7454, pages 193-208. Springer-Verlag, September 2012. 
@inproceedings{concur2012-MMPV,
  author =              {Mogavero, Fabio and Murano, Aniello and Perelli,
                         Giuseppe and Vardi, Moshe Y.},
  title =               {What Makes {ATL\(^{*}\)} Decidable? {A}~Decidable
                         Fragment of Strategy Logic},
  editor =              {Koutny, Maciej and Ulidowski, Irek},
  booktitle =           {{P}roceedings of the 23rd {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'12)},
  acronym =             {{CONCUR}'12},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7454},
  pages =               {193-208},
  year =                {2012},
  month =               sep,
}
[MMP+12] Fabio Mogavero, Aniello Murano, Giuseppe Perelli, and Moshe Y. Vardi. Reasoning About Strategies: On the Model-Checking Problem. Research Report cs.LO/1112.6275, arXiv, December 2012. 
@techreport{arxiv-cd.LO-1112.6275,
  author =              {Mogavero, Fabio and Murano, Aniello and Perelli,
                         Giuseppe and Vardi, Moshe Y.},
  title =               {Reasoning About Strategies: On the Model-Checking
                         Problem},
  number =              {cs.LO/1112.6275},
  year =                {2012},
  month =               dec,
  institution =         {arXiv},
  type =                {Research Report},
}
[MMP+14] Fabio Mogavero, Aniello Murano, Giuseppe Perelli, and Moshe Y. Vardi. Reasoning About Strategies: On the Model-Checking Problem. ACM Transactions on Computational Logic 15(4):34:1-34:47. ACM Press, August 2014. 
@article{tocl15(4)-MMPV,
  author =              {Mogavero, Fabio and Murano, Aniello and Perelli,
                         Giuseppe and Vardi, Moshe Y.},
  title =               {Reasoning About Strategies: On the Model-Checking
                         Problem},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Computational Logic},
  volume =              {15},
  number =              {4},
  pages =               {34:1-34:47},
  year =                {2014},
  month =               aug,
  doi =                 {10.1145/2631917},
}
[MMP+17] Fabio Mogavero, Aniello Murano, Giuseppe Perelli, and Moshe Y. Vardi. Reasoning About Strategies: On the Satisfiability Problem. Logical Methods in Computer Science 13(1). March 2017. 
@article{lmcs13(1)-MMPV,
  author =              {Mogavero, Fabio and Murano, Aniello and Perelli,
                         Giuseppe and Vardi, Moshe Y.},
  title =               {Reasoning About Strategies: On~the~Satisfiability
                         Problem},
  journal =             {Logical Methods in Computer Science},
  volume =              {13},
  number =              {1},
  year =                {2017},
  month =               mar,
  doi =                 {10.23638/LMCS-13(1:9)2017},
}
[MMS13] Fabio Mogavero, Aniello Murano, and Luigi Sauro. On the Boundary of Behavioral Strategies. In LICS'13, pages 263-272. IEEE Comp. Soc. Press, June 2013. 
@inproceedings{lics2013-MMS,
  author =              {Mogavero, Fabio and Murano, Aniello and Sauro,
                         Luigi},
  title =               {On the Boundary of Behavioral Strategies},
  booktitle =           {{P}roceedings of the 28th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'13)},
  acronym =             {{LICS}'13},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {263-272},
  year =                {2013},
  month =               jun,
}
[MMS14] Fabio Mogavero, Aniello Murano, and Luigi Sauro. A Behavioral Hierarchy of Strategy Logic. In CLIMA'14, Lecture Notes in Artificial Intelligence 8624, pages 148-165. Springer-Verlag, August 2014. 
@inproceedings{clima2014-MMS,
  author =              {Mogavero, Fabio and Murano, Aniello and Sauro,
                         Luigi},
  title =               {A Behavioral Hierarchy of Strategy Logic},
  editor =              {Bulling, Nils and van der Torre, Leendert W. N. and
                         Villata, Serena and Jamroga, Wojciech and
                         Vasconcelos, Wamberto Weber},
  booktitle =           {{P}roceedings of the 15th {I}nternational {W}orkshop
                         on {C}omputational {L}ogic in {M}ulti-{A}gent
                         {S}ystems ({CLIMA}'14)},
  acronym =             {{CLIMA}'14},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Artificial Intelligence},
  volume =              {8624},
  pages =               {148-165},
  year =                {2014},
  month =               aug,
  doi =                 {10.1007/978-3-319-09764-0_10},
}
[MMT+08] Arne Meier, Martin Mundhenk, Michael Thomas, and Heribert Vollmer. The Complexity of Satisfiability for Fragmentf of CTL and CTL*. In RP'08, pages 201-213. September 2008. 
@inproceedings{mmtv-rp08,
  author =              {Meier, Arne and Mundhenk, Martin and Thomas, Michael
                         and Vollmer, Heribert},
  title =               {The Complexity of Satisfiability for Fragmentf of
                         {CTL} and {CTL}\(^{*}\)},
  editor =              {Halava, Vesa and Potapov, Igor},
  booktitle =           {{P}roceedings of the 2nd {W}orkshop on
                         {R}eachability {P}roblems in {C}omputational
                         {M}odels ({RP}'08)},
  acronym =             {{RP}'08},
  pages =               {201-213},
  year =                {2008},
  month =               sep,
}
[MMV10] Fabio Mogavero, Aniello Murano, and Moshe Y. Vardi. Reasoning about strategies. In FSTTCS'10, Leibniz International Proceedings in Informatics 8, pages 133-144. Leibniz-Zentrum für Informatik, December 2010. 
@inproceedings{fsttcs2010-MMV,
  author =              {Mogavero, Fabio and Murano, Aniello and Vardi, Moshe
                         Y.},
  title =               {Reasoning about strategies},
  editor =              {Lodaya, Kamal and Mahajan, Meena},
  booktitle =           {{P}roceedings of the 30th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'10)},
  acronym =             {{FSTTCS}'10},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {8},
  pages =               {133-144},
  year =                {2010},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2010.133},
}
[MMV10] Fabio Mogavero, Aniello Murano, and Moshe Y. Vardi. Relentful Strategic Reasoning in Alternating-Time Temporal Logic. In LPAR'10, Lecture Notes in Artificial Intelligence 6355, pages 371-386. Springer-Verlag, April 2010. 
@inproceedings{lpar2010(dakar)-MMV,
  author =              {Mogavero, Fabio and Murano, Aniello and Vardi, Moshe
                         Y.},
  title =               {Relentful Strategic Reasoning in Alternating-Time
                         Temporal Logic},
  editor =              {Clarke, Edmund M. and Voronkov, Andrei},
  booktitle =           {{P}roceedings of the 16th {I}nternational
                         {C}onference {L}ogic {P}rogramming and {A}utomated
                         {R}easoning ({LPAR}'10)},
  acronym =             {{LPAR}'10},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Artificial Intelligence},
  volume =              {6355},
  pages =               {371-386},
  year =                {2010},
  month =               apr,
}
[MvN47] Oskar Morgenstern and John von Neumann. The Theory of Games and Economic Behavior. Princeton University Press, 1947. 
@book{MvN-game1947,
  author =              {Morgenstern, Oskar and von~Neumann, John},
  title =               {The Theory of Games and Economic Behavior},
  publisher =           {Princeton University Press},
  year =                {1947},
}
[MN04] Oded Maler and Dejan Nickovic. Monitoring Temporal Properties of Continuous Signals. In FORMATS-FTRTFT'04, Lecture Notes in Computer Science 3253, pages 152-166. Springer-Verlag, September 2004. 
@inproceedings{formats2004-MN,
  author =              {Maler, Oded and Nickovic, Dejan},
  title =               {Monitoring Temporal Properties of Continuous
                         Signals},
  editor =              {Lakhnech, Yassine and Yovine, Sergio},
  booktitle =           {{P}roceedings of the {J}oint {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'04) and {F}ormal
                         {T}echniques in {R}eal-Time and {F}ault-Tolerant
                         {S}ystems ({FTRTFT}'04)},
  acronym =             {{FORMATS-FTRTFT}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3253},
  pages =               {152-166},
  year =                {2004},
  month =               sep,
}
[MN10] Janusz Malinowski and Peter Niebert. SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata. In TACAS'10, Lecture Notes in Computer Science 6015, pages 405-419. Springer-Verlag, March 2010. 
@inproceedings{tacas2010-MN,
  author =              {Malinowski, Janusz and Niebert, Peter},
  title =               {{SAT} Based Bounded Model Checking with Partial
                         Order Semantics for Timed Automata},
  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 =               {405-419},
  year =                {2010},
  month =               mar,
}
[MNP06] Oded Maler, Dejan Nickovic, and Amir Pnueli. From MITL to Timed Automata. In FORMATS'06, Lecture Notes in Computer Science 4202, pages 274-289. Springer-Verlag, September 2006. 
@inproceedings{formats2006-MNP,
  author =              {Maler, Oded and Nickovic, Dejan and Pnueli, Amir},
  title =               {From {MITL} to 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 =               {274-289},
  year =                {2006},
  month =               sep,
}
[MO97] Dieter van Melkebeek and Mitsunori Ogihara. Sparse Hard Sets for P. In Ding-zhu Du and Ker-I Ko (eds.), Advances in Algorithms, Languages and Complexity. Kluwer Academic, 1997. 
@incollection{AALC1997-MO,
  author =              {Melkebeek, Dieter van and Ogihara, Mitsunori},
  title =               {Sparse Hard Sets for~{P}},
  editor =              {Du, Ding-zhu and Ko, Ker-I},
  booktitle =           {Advances in Algorithms, Languages and Complexity},
  publisher =           {Kluwer Academic},
  pages =               {191-208},
  year =                {1997},
}
[MO07] Maura Mazzarello and Ennio Ottaviani. A traffic management system for real-time traffic optimisation in railways. Transportation Research Part B: Methodological 41(2):246-274. Elsevier, February 2007. 
@article{transpB41(2)-MO,
  author =              {Mazzarello, Maura and Ottaviani, Ennio},
  title =               {A~traffic management system for real-time traffic
                         optimisation in railways},
  publisher =           {Elsevier},
  journal =             {Transportation Research Part B: Methodological},
  volume =              {41},
  number =              {2},
  pages =               {246-274},
  year =                {2007},
  month =               feb,
  doi =                 {10.1016/j.trb.2006.02.005},
}
[Mon08] David Monniaux. A Quantifier Elimination Algorithm for Linear Real Arithmetic. In LPAR'08, Lecture Notes in Computer Science 5330, pages 243-257. Springer-Verlag, November 2008. 
@inproceedings{lpar2008-Mon,
  author =              {Monniaux, David},
  title =               {A~Quantifier Elimination Algorithm for Linear Real
                         Arithmetic},
  editor =              {Cervesato, Iliano and Veith, Helmutand Voronkov,
                         Andrei},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}onference {L}ogic {P}rogramming and {A}utomated
                         {R}easoning ({LPAR}'08)},
  acronym =             {{LPAR}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5330},
  pages =               {243-257},
  year =                {2008},
  month =               nov,
  doi =                 {10.1007/978-3-540-89439-1_18},
}
[Moo56] Edward F. Moore. Gedanken-Experiments on Sequential Machines. In Claude E. Shannon and John McCarthy (eds.), Automata Studies, Annals of Mathematics Studies 34, pages 129-153. Princeton University Press, 1956. 
@incollection{am34-Moo,
  author =              {Moore, Edward F.},
  title =               {Gedanken-Experiments on Sequential Machines},
  editor =              {Shannon, Claude E. and McCarthy, John},
  booktitle =           {Automata Studies},
  publisher =           {Princeton University Press},
  series =              {Annals of Mathematics Studies},
  volume =              {34},
  pages =               {129-153},
  year =                {1956},
  doi =                 {10.1515/9781400882618-006},
}
[Moo96] Cristopher Moore. Recursion Theory on the Reals and Continuous-Time Computation. Theoretical Computer Science 162(1):23-44. Elsevier, August 1996. 
@article{tcs162(1)-Moo,
  author =              {Moore, Cristopher},
  title =               {Recursion Theory on the Reals and Continuous-Time
                         Computation},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {162},
  number =              {1},
  pages =               {23-44},
  year =                {1996},
  month =               aug,
}
[Mos91] Andrzej Mostowski. Games with forbidden positions. Research Report 78, University of Danzig, 1991. 
@techreport{TR78-Mos91,
  author =              {Mostowski, Andrzej},
  title =               {Games with forbidden positions},
  number =              {78},
  year =                {1991},
  institution =         {University of Danzig},
  type =                {Research Report},
}
[MP88] Zohar Manna and Amir Pnueli. The Anchored Version of the Temporal Framework. In REX'88, Lecture Notes in Computer Science 354, pages 201-284. Springer-Verlag, May 1988. 
@inproceedings{rex1988-MP,
  author =              {Manna, Zohar and Pnueli, Amir},
  title =               {The Anchored Version of the Temporal Framework},
  editor =              {de~Bakker, Jaco W. and de Roever, Willem-Paul and
                         Rozenberg, Grzegorz},
  booktitle =           {{L}inear {T}ime, {B}ranching {T}ime and {P}artial
                         {O}rder in {L}ogics and {M}odels for
                         {C}oncurrency~--- {P}roceedings of {REX}
                         {S}chool{\slash}{W}orkshop~1988 ({REX}'88)},
  acronym =             {{REX}'88},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {354},
  pages =               {201-284},
  year =                {1988},
  month =               may,
}
[MP90] Oded Maler and Amir Pnueli. Tight Bounds on the Complexity of Cascaded Decomposition of Automata. In FOCS'90, pages 672-682. IEEE Comp. Soc. Press, October 1990. 
@inproceedings{focs1990-MP,
  author =              {Maler, Oded and Pnueli, Amir},
  title =               {Tight Bounds on the Complexity of Cascaded
                         Decomposition of Automata},
  booktitle =           {{P}roceedings of the 31st {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'90)},
  acronym =             {{FOCS}'90},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {672-682},
  year =                {1990},
  month =               oct,
}
[MP90] Zohar Manna and Amir Pnueli. A Hierarchy of Temporal Properties. In PODC'90, pages 377-410. ACM Press, August 1990. 
@inproceedings{podc1990-MP,
  author =              {Manna, Zohar and Pnueli, Amir},
  title =               {A Hierarchy of Temporal Properties},
  booktitle =           {{P}roceedings of the 9th {ACM} {S}ymposium on
                         {P}rinciples of {D}istributed {C}omputing
                         ({PODC}'90)},
  acronym =             {{PODC}'90},
  publisher =           {ACM Press},
  pages =               {377-410},
  year =                {1990},
  month =               aug,
}
[MP91] Zohar Manna and Amir Pnueli. Completing the Temporal Picture. Theoretical Computer Science 83(1):91-130. Elsevier, 1991. 
@article{tcs83(1)-MP,
  author =              {Manna, Zohar and Pnueli, Amir},
  title =               {Completing the Temporal Picture},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {83},
  number =              {1},
  pages =               {91-130},
  year =                {1991},
}
[MP93] Zohar Manna and Amir Pnueli. Verifying Hybrid Systems. In HSCC'92, Lecture Notes in Computer Science 736, pages 4-35. Springer-Verlag, 1993. 
@inproceedings{hscc1992-MP,
  author =              {Manna, Zohar and Pnueli, Amir},
  title =               {Verifying Hybrid Systems},
  editor =              {Grossman, Robert L. and Nerode, Anil and Ravn,
                         Anders P. and Rischel, Hans},
  booktitle =           {{H}ybrid {S}ystems ({HSCC}'92)},
  acronym =             {{HSCC}'92},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {736},
  pages =               {4-35},
  year =                {1993},
}
[MP05] Filippo Mera and Giovanni Pighizzini. Complementing Unary Nondeterministic Automata. Theoretical Computer Science 330(2):349-360. Elsevier, February 2005. 
@article{tcs330(2)-MP,
  author =              {Mera, Filippo and Pighizzini, Giovanni},
  title =               {Complementing Unary Nondeterministic Automata},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {330},
  number =              {2},
  pages =               {349-360},
  year =                {2005},
  month =               feb,
}
[MPS95] Oded Maler, Amir Pnueli, and Joseph Sifakis. On the Synthesis of Discrete Controllers for Timed Systems (An Extended Abstract). In STACS'95, Lecture Notes in Computer Science 900, pages 229-242. Springer-Verlag, March 1995. 
@inproceedings{stacs1995-MPS,
  author =              {Maler, Oded and Pnueli, Amir and Sifakis, Joseph},
  title =               {On the Synthesis of Discrete Controllers for Timed
                         Systems (An~Extended Abstract)},
  editor =              {Mayr, Ernst W. and Puech, Claude},
  booktitle =           {{P}roceedings of the 12th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'95)},
  acronym =             {{STACS}'95},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {900},
  pages =               {229-242},
  year =                {1995},
  month =               mar,
}
[MPS19] Bastien Maubert, Sophie Pinchinat, and François Schwarzentruber. Reachability Games in Dynamic Epistemic Logic. In IJCAI'19, pages 499-505. IJCAI organization, August 2019. 
@inproceedings{ijcai2019-MPS,
  author =              {Maubert, Bastien and Pinchinat, Sophie and
                         Schwarzentruber, Fran{\c c}ois},
  title =               {Reachability Games in Dynamic Epistemic Logic},
  editor =              {Kraus, Sarit},
  booktitle =           {{P}roceedings of the 28th {I}nternational {J}oint
                         {C}onference on {A}rtificial {I}ntelligence
                         ({IJCAI}'19)},
  acronym =             {{IJCAI}'19},
  publisher =           {IJCAI organization},
  pages =               {499-505},
  year =                {2019},
  month =               aug,
  doi =                 {10.24963/ijcai.2019/71},
}
[MPS+21] Bastien Maubert, Sophie Pinchinat, François Schwarzentruber, and Silvia Stranieri. Concurrent Games in Dynamic Epistemic Logic. In IJCAI'20, pages 1877-1883. IJCAI organization, January 2021. 
@inproceedings{ijcai2020-MPSS,
  author =              {Maubert, Bastien and Pinchinat, Sophie and
                         Schwarzentruber, Fran{\c c}ois and Stranieri,
                         Silvia},
  title =               {Concurrent Games in Dynamic Epistemic Logic},
  editor =              {Bessiere, Christian},
  booktitle =           {{P}roceedings of the 29th {I}nternational {J}oint
                         {C}onference on {A}rtificial {I}ntelligence
                         ({IJCAI}'20)},
  acronym =             {{IJCAI}'20},
  publisher =           {IJCAI organization},
  pages =               {1877-1883},
  year =                {2021},
  month =               jan,
  doi =                 {10.24963/ijcai.2020/260},
}
[MR95] Rajeev Motwani and Prabhakar Raghavan. Randomized algorithms. Cambridge University Press, 1995. 
@book{MR95-RA,
  author =              {Motwani, Rajeev and Raghavan, Prabhakar},
  title =               {Randomized algorithms},
  publisher =           {Cambridge University Press},
  year =                {1995},
}
[MR99] Faron Moller and Alexander Rabinovich. On the expressive power of CTL*. In LICS'99, pages 360-368. IEEE Comp. Soc. Press, July 1999. 
@inproceedings{lics1999-MR,
  author =              {Moller, Faron and Rabinovich, Alexander},
  title =               {On the expressive power of
                         {CTL}{\textsuperscript{*}}},
  booktitle =           {{P}roceedings of the 14th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'99)},
  acronym =             {{LICS}'99},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {360-368},
  year =                {1999},
  month =               jul,
  doi =                 {10.1109/LICS.1999.782631},
}
[MR03] Faron Moller and Alexander Rabinovich. Counting on CTL*: on the expressive power of monadic path logic. Information and Computation 184(1):147-159. Academic Press, July 2003. 
@article{icomp184(1)-MR,
  author =              {Moller, Faron and Rabinovich, Alexander},
  title =               {Counting on {CTL}{\textsuperscript{*}}: on~the
                         expressive power of monadic path logic},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {184},
  number =              {1},
  pages =               {147-159},
  year =                {2003},
  month =               jul,
}
[MR04] Nicolas Markey and Jean-François Raskin. Model Checking Restricted Sets of Timed Paths. In CONCUR'04, Lecture Notes in Computer Science 3170, pages 432-447. Springer-Verlag, August 2004.
Abstract

In this paper, we study the complexity of model-checking formulas of three important real-time logics (MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of restricted sets of timed paths that we consider are (i) a single finite (or ultimately periodic) timed path, (ii) a infinite set of finite (or infinite) timed paths defined by a finite (or ultimately periodic) path in a region graph, (iii) a infinite set of finite (or infinite) timed paths defined by a finite (or ultimately periodic) path in a zone graph.

@inproceedings{concur2004-MR,
  author =              {Markey, Nicolas and Raskin, Jean-Fran{\c c}ois},
  title =               {Model Checking Restricted Sets of Timed Paths},
  editor =              {Gardner, {\relax Ph}ilippa and Yoshida, Nobuko},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'04)},
  acronym =             {{CONCUR}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3170},
  pages =               {432-447},
  year =                {2004},
  month =               aug,
  doi =                 {10.1007/978-3-540-28644-8_28},
  abstract =            {In this paper, we study the complexity of
                         model-checking formulas of three important real-time
                         logics (MTL, MITL, and TCTL) over restricted sets of
                         timed paths. The classes of restricted sets of timed
                         paths that we consider are \textit{(i)} a single
                         finite (or ultimately periodic) timed path,
                         \textit{(ii)} a infinite set of finite (or infinite)
                         timed paths defined by a finite (or ultimately
                         periodic) path in a region graph, \textit{(iii)} a
                         infinite set of finite (or infinite) timed paths
                         defined by a finite (or ultimately periodic) path in
                         a zone graph.},
}
[MR06] Nicolas Markey and Jean-François Raskin. Model Checking Restricted Sets of Timed Paths. Theoretical Computer Science 358(2-3):273-292. Elsevier, August 2006.
Abstract

In this paper, we study the complexity of model-checking formulas of four important real-time logics (TPTL, MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of restricted sets of timed paths that we consider are (i) a single finite (or ultimately periodic) timed path, (ii) an infinite set of finite (or infinite) timed paths defined by a finite (or ultimately periodic) path in a region graph, (iii) an infinite set of finite (or infinite) timed paths defined by a finite (or ultimately periodic) path in a zone graph.

Several results are quite negative: TPTL and MTL remain undecidable along region- and zone-paths. On the other hand, we obtained PTIME algorithms for model checking TCTL along a region path, and for MTL along a single timed path.

@article{tcs358(2-3)-MR,
  author =              {Markey, Nicolas and Raskin, Jean-Fran{\c c}ois},
  title =               {Model Checking Restricted Sets of Timed Paths},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {358},
  number =              {2-3},
  pages =               {273-292},
  year =                {2006},
  month =               aug,
  doi =                 {10.1016/j.tcs.2006.01.019},
  abstract =            {In this paper, we study the complexity of
                         model-checking formulas of four important real-time
                         logics (TPTL, MTL, MITL, and TCTL) over restricted
                         sets of timed paths. The classes of restricted sets
                         of timed paths that we consider are
                         \textit{(i)}~a~single finite (or ultimately
                         periodic) timed path, \textit{(ii)}~an~infinite set
                         of finite (or infinite) timed paths defined by a
                         finite (or ultimately periodic) path in a region
                         graph, \textit{(iii)}~an~infinite set of finite (or
                         infinite) timed paths defined by a finite (or
                         ultimately periodic) path in a zone graph. \par
                         Several results are quite negative: TPTL and MTL
                         remain undecidable along region- and zone-paths. On
                         the other hand, we obtained PTIME algorithms for
                         model checking TCTL along a region path, and for MTL
                         along a single timed path.},
}
[MRK88] Gary L. Miller, Vijaya Ramachandran, and Erich Kaltofen. Efficient Parallel Evaluation of Straight-line Code and Arithmetic Circuits. SIAM Journal on Computing 17(4):687-695. Society for Industrial and Applied Math., August 1988. 
@article{siamcomp17(4)-MRK,
  author =              {Miller, Gary L. and Ramachandran, Vijaya and
                         Kaltofen, Erich},
  title =               {Efficient Parallel Evaluation of Straight-line Code
                         and Arithmetic Circuits},
  publisher =           {Society for Industrial and Applied Math.},
  journal =             {SIAM Journal on Computing},
  volume =              {17},
  number =              {4},
  pages =               {687-695},
  year =                {1988},
  month =               aug,
}
[MRV99] Pierre McKenzie, Klaus Reinhardt, and V. Vinay. Circuits and Context-free Languages. In COCOON'99, Lecture Notes in Computer Science 1627, pages 194-203. Springer-Verlag, July 1999. 
@inproceedings{cocoon1999-MRV,
  author =              {McKenzie, Pierre and Reinhardt, Klaus and Vinay, V.},
  title =               {Circuits and Context-free Languages},
  editor =              {Asano, Takao and Imai, Hiroshi and Lee, D. T. and
                         Nakano, Shin-Ichi and Tokuyama, Takeshi},
  booktitle =           {{P}roceedings of the 5th {C}omputing and
                         {C}ombinatorics ({COCOON}'99)},
  acronym =             {{COCOON}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1627},
  pages =               {194-203},
  year =                {1999},
  month =               jul,
}
[MRW05] Peter Bro Miltersen, Jaikumar Radhakrishnan, and Ingo Wegener. On Converting CNF to DNF. Theoretical Computer Science 347(1-2):325-335. Elsevier, November 2005. 
@article{tcs347(1-2)-MRW,
  author =              {Miltersen, Peter Bro and Radhakrishnan, Jaikumar and
                         Wegener, Ingo},
  title =               {On Converting {CNF} to {DNF}},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {347},
  number =              {1-2},
  pages =               {325-335},
  year =                {2005},
  month =               nov,
}
[MS72] Albert R. Meyer and Larry J. Stockmeyer. The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space. In FOCS'72, pages 125-129. IEEE Comp. Soc. Press, October 1972. 
@inproceedings{focs1972-MS,
  author =              {Meyer, Albert R. and Stockmeyer, Larry J.},
  title =               {The Equivalence Problem for Regular Expressions with
                         Squaring Requires Exponential Space},
  booktitle =           {{P}roceedings of the 13th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'72)},
  acronym =             {{FOCS}'72},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {125-129},
  year =                {1972},
  month =               oct,
}
[MS85] David E. Muller and Paul E. Schupp. Alternating automata on infinite objects, determinacy and Rabin's theorem. In EPIT'84, Lecture Notes in Computer Science 192, pages 99-107. Springer-Verlag, 1985. 
@inproceedings{epit1984-MS,
  author =              {Muller, David E. and Schupp, Paul E.},
  title =               {Alternating automata on infinite objects,
                         determinacy and {R}abin's theorem},
  editor =              {Nivat, Maurice and Perrin, Dominique},
  booktitle =           {{A}utomata on {I}nfinite {W}ords~-- {{\'E}}cole de
                         {P}rintemps d'{I}nformatique {T}h{\'e}orique
                         ({EPIT}'84)},
  acronym =             {{EPIT}'84},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {192},
  pages =               {99-107},
  year =                {1985},
  confyear =            {1984},
  confmonth =           {5},
  doi =                 {10.1007/3-540-15641-0_27},
}
[MS87] David E. Muller and Paul E. Schupp. Alternating Automata on Infinite Trees. Theoretical Computer Science 54(2-3):267-276. Elsevier, October 1987. 
@article{tcs54(2-3)-MS,
  author =              {Muller, David E. and Schupp, Paul E.},
  title =               {Alternating Automata on Infinite Trees},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {54},
  number =              {2-3},
  pages =               {267-276},
  year =                {1987},
  month =               oct,
}
[MS95] David E. Muller and Paul E. Schupp. Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra. Theoretical Computer Science 141(1-2):69-107. Elsevier, April 1995. 
@article{tcs141(1-2)-MS,
  author =              {Muller, David E. and Schupp, Paul E.},
  title =               {Simulating alternating tree automata by
                         nondeterministic automata: New results and new
                         proofs of the theorems of {R}abin, {M}c{N}aughton
                         and {S}afra},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {141},
  number =              {1-2},
  pages =               {69-107},
  year =                {1995},
  month =               apr,
}
[MS96] Dov Monderer and Lloyd S. Shapley. Potential Games. Games and Economic Behavior 14(1):124-143. May 1996. 
@article{geb14(1)-MS,
  author =              {Monderer, Dov and Shapley, Lloyd S.},
  title =               {Potential Games},
  journal =             {Games and Economic Behavior},
  volume =              {14},
  number =              {1},
  pages =               {124-143},
  year =                {1996},
  month =               may,
  doi =                 {10.1006/game.1996.0044},
}
[MS97] Oded Maler and Ludwig Staiger. On Syntactic Congruences fpr ω-languages. Theoretical Computer Science 183(1):93-112. Elsevier, August 1997. 
@article{tcs183(1)-MS,
  author =              {Maler, Oded and Staiger, Ludwig},
  title =               {On Syntactic Congruences fpr {\(\omega\)}-languages},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {183},
  number =              {1},
  pages =               {93-112},
  year =                {1997},
  month =               aug,
}
[MS00] Zohar Manna and Henny Sipma. Alternating the Temporal Picture for Safety. In ICALP'00, Lecture Notes in Computer Science 1853, pages 429-450. Springer-Verlag, July 2000. 
@inproceedings{icalp2000-MS,
  author =              {Manna, Zohar and Sipma, Henny},
  title =               {Alternating the Temporal Picture for Safety},
  editor =              {Montanari, Ugo and Rolim, Jos\'e D. P. and Welzl,
                         Emo},
  booktitle =           {{P}roceedings of the 27th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'00)},
  acronym =             {{ICALP}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1853},
  pages =               {429-450},
  year =                {2000},
  month =               jul,
}
[MS02] Paolo Maggi and Riccardo Sisto. Using SPIN to verify security properties of cryptographic protocols. In SPIN'02, Lecture Notes in Computer Science 2318, pages 187-204. Springer-Verlag, April 2002. 
@inproceedings{spin2002-MS,
  author =              {Maggi, Paolo and Sisto, Riccardo},
  title =               {Using SPIN to verify security properties of
                         cryptographic protocols},
  editor =              {Bosnacki, Dragan and Leue, Stefan},
  booktitle =           {{P}roceedings of the 9th {I}nternational {SPIN}
                         {W}orkshop ({SPIN}'02)},
  acronym =             {{SPIN}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2318},
  pages =               {187-204},
  year =                {2002},
  month =               apr,
}
[MS03] Nicolas Markey and Philippe Schnoebelen. Model Checking a Path (Preliminary Report). In CONCUR'03, Lecture Notes in Computer Science 2761, pages 251-265. Springer-Verlag, August 2003.
Abstract

We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of "runtime verification" but it also appears in many other situations. By considering several extended temporal logics, we show that the problem of model checking a path can usually be solved efficiently, and profit from specialized algorithms. We further show it is possible to efficiently check paths given in compressed form.

@inproceedings{concur2003-MS,
  author =              {Markey, Nicolas and Schnoebelen, {\relax Ph}ilippe},
  title =               {Model Checking a Path (Preliminary Report)},
  editor =              {Amadio, Roberto and Lugiez, Denis},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'03)},
  acronym =             {{CONCUR}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2761},
  pages =               {251-265},
  year =                {2003},
  month =               aug,
  doi =                 {10.1007/978-3-540-45187-7_17},
  abstract =            {We consider the problem of checking whether a finite
                         (or ultimately periodic) run satisfies a temporal
                         logic formula. This problem is at the heart of
                         {"}runtime verification{"} but it also appears in
                         many other situations. By considering several
                         extended temporal logics, we show that the problem
                         of model checking a path can usually be solved
                         efficiently, and profit from specialized algorithms.
                         We further show it is possible to efficiently check
                         paths given in compressed form.},
}
[MS04] Nicolas Markey and Philippe Schnoebelen. Symbolic Model Checking for Simply Timed Systems. In FORMATS-FTRTFT'04, Lecture Notes in Computer Science 3253, pages 102-117. Springer-Verlag, September 2004.
Abstract

We describe OBDD-based symbolic model checking algorithms for simply-timed systems, i.e. finite state graphs where transitions carry a duration. These durations can be arbitrary natural numbers. A simple and natural semantics for these systems opens the way for improved efficiency. Our algorithms have been implemented in NuSMV and perform well in practice (on standard case studies).

@inproceedings{formats2004-MS,
  author =              {Markey, Nicolas and Schnoebelen, {\relax Ph}ilippe},
  title =               {Symbolic Model Checking for Simply Timed Systems},
  editor =              {Lakhnech, Yassine and Yovine, Sergio},
  booktitle =           {{P}roceedings of the {J}oint {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'04) and {F}ormal
                         {T}echniques in {R}eal-Time and {F}ault-Tolerant
                         {S}ystems ({FTRTFT}'04)},
  acronym =             {{FORMATS-FTRTFT}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3253},
  pages =               {102-117},
  year =                {2004},
  month =               sep,
  doi =                 {10.1007/978-3-540-30206-3_9},
  abstract =            {We describe OBDD-based symbolic model checking
                         algorithms for simply-timed systems, i.e. finite
                         state graphs where transitions carry a duration.
                         These durations can be arbitrary natural numbers.
                         A~simple and natural semantics for these systems
                         opens the way for improved efficiency. Our
                         algorithms have been implemented in NuSMV and
                         perform well in practice (on standard case
                         studies).},
}
[MS04] Nicolas Markey and Philippe Schnoebelen. TSMV: Symbolic Model Checking for Simply Timed Systems. In QEST'04, pages 330-331. IEEE Comp. Soc. Press, September 2004.
Abstract

TSMV is an extension of NuSMV, the open-source symbolic model checker, aimed at dealing with timed versions of (models of) circuits, PLC controllers, protocols, etc. The underlying model is an extension of Kripke structures, where every transition carries an integer duration (possibly zero). This simple model supports efficient symbolic algorithms for RTCTL formulae.

@inproceedings{qest2004-MS,
  author =              {Markey, Nicolas and Schnoebelen, {\relax Ph}ilippe},
  title =               {{TSMV}: Symbolic Model Checking for Simply Timed
                         Systems},
  booktitle =           {{P}roceedings of the 1st {I}nternational
                         {C}onference on {Q}uantitative {E}valuation of
                         {S}ystems ({QEST}'04)},
  acronym =             {{QEST}'04},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {330-331},
  year =                {2004},
  month =               sep,
  doi =                 {10.1109/QEST.2004.1348052},
  abstract =            {TSMV is an extension of NuSMV, the open-source
                         symbolic model checker, aimed at dealing with timed
                         versions of (models of) circuits, PLC controllers,
                         protocols, etc. The underlying model is an extension
                         of Kripke structures, where every transition carries
                         an integer duration (possibly zero). This simple
                         model supports efficient symbolic algorithms for
                         RTCTL formulae.},
}
[MS04] Nicolas Markey and Philippe Schnoebelen. A PTIME-Complete Matching Problem for SLP-Compressed Words. Information Processing Letters 90(1):3-6. Elsevier, April 2004.
Abstract

SLP-compressed words are words given by simple deterministic grammars called "straight-line programs". We prove that the problem of deciding whether an SLP-compressed word is recognized by a FSA is complete for polynomial-time.

@article{ipl90(1)-MS,
  author =              {Markey, Nicolas and Schnoebelen, {\relax Ph}ilippe},
  title =               {A {PTIME}-Complete Matching Problem for
                         {SLP}-Compressed Words},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {90},
  number =              {1},
  pages =               {3-6},
  year =                {2004},
  month =               apr,
  doi =                 {10.1016/j.ipl.2004.01.002},
  abstract =            {SLP-compressed words are words given by simple
                         deterministic grammars called {"}straight-line
                         programs{"}. We prove that the problem of deciding
                         whether an SLP-compressed word is recognized by a
                         FSA is complete for polynomial-time.},
}
[MS06] Nicolas Markey and Philippe Schnoebelen. Mu-calculus path checking. Information Processing Letters 97(6):225-230. Elsevier, March 2006.
Abstract

We investigate the path model checking problem for the μ-calculus. Surprisingly, restricting to deterministic structures does not allow for more efficient model checking algorithm, as we prove that it can encode any instance of the standard model checking problem for the μ-calculus.

@article{ipl97(6)-MS,
  author =              {Markey, Nicolas and Schnoebelen, {\relax Ph}ilippe},
  title =               {Mu-calculus path checking},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {97},
  number =              {6},
  pages =               {225-230},
  year =                {2006},
  month =               mar,
  doi =                 {10.1016/j.ipl.2005.11.010},
  abstract =            {We investigate the path model checking problem for
                         the \(\mu\)-calculus. Surprisingly, restricting to
                         deterministic structures does not allow for more
                         efficient model checking algorithm, as we prove that
                         it can encode any instance of the standard model
                         checking problem for the \(\mu\)-calculus.},
}
[MS07] Marios Mavronicolas and Paul G. Spirakis. The price of selfish routing. Algorithmica 48(1):91-126. Springer-Verlag, May 2007. 
@article{alga48(1)-MS,
  author =              {Mavronicolas, Marios and Spirakis, Paul G.},
  title =               {The price of selfish routing},
  publisher =           {Springer-Verlag},
  journal =             {Algorithmica},
  volume =              {48},
  number =              {1},
  pages =               {91-126},
  year =                {2007},
  month =               may,
  doi =                 {10.1007/s00453-006-0056-1},
}
[MS12] Carol A. Meyers and Andreas S. Schulz. The complexity of welfare maximization in congestion games. Networks 59(2):252-260. John Wiley & Sons, March 2012. 
@article{netw59(2)-MS,
  author =              {Meyers, Carol A. and Schulz, Andreas S.},
  title =               {The~complexity of welfare maximization in congestion
                         games},
  publisher =           {John Wiley \& Sons},
  journal =             {Networks},
  volume =              {59},
  number =              {2},
  pages =               {252-260},
  year =                {2012},
  month =               mar,
  doi =                 {10.1002/net.20439},
}
[MSS86] David E. Muller, Ahmed Saoudi, and Paul E. Schupp. Alternating Automata, the Weak Monadic Theory of the Tree, and its Complexity. In ICALP'86, Lecture Notes in Computer Science 226, pages 275-283. Springer-Verlag, July 1986. 
@inproceedings{icalp1986-MSS,
  author =              {Muller, David E. and Saoudi, Ahmed and Schupp, Paul
                         E.},
  title =               {Alternating Automata, the Weak Monadic Theory of the
                         Tree, and its Complexity},
  editor =              {Kott, Laurent},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'86)},
  acronym =             {{ICALP}'86},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {226},
  pages =               {275-283},
  year =                {1986},
  month =               jul,
}
[MSS88] David E. Muller, Ahmed Saoudi, and Paul E. Schupp. Weak Alternating Automata Give a Simple Explanation of Why Most Temporal Logics are Decidable in Exponential Time. In LICS'88, pages 422-427. IEEE Comp. Soc. Press, July 1988. 
@inproceedings{lics1988-MSS,
  author =              {Muller, David E. and Saoudi, Ahmed and Schupp, Paul
                         E.},
  title =               {Weak Alternating Automata Give a Simple Explanation
                         of Why Most Temporal Logics are Decidable in
                         Exponential Time},
  booktitle =           {{P}roceedings of the 3rd {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'88)},
  acronym =             {{LICS}'88},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {422-427},
  year =                {1988},
  month =               jul,
}
[MST97] Masamichi Miyazaki, Ayumi Shinohara, and Masayuki Takeda. An Improved Pattern-Matching Algorithm for Strings in Terms of Straight-Line Programs. In CPM'97, Lecture Notes in Computer Science 1264, pages 1-11. Springer-Verlag, June 1997. 
@inproceedings{cpm1997-MST,
  author =              {Miyazaki, Masamichi and Shinohara, Ayumi and Takeda,
                         Masayuki},
  title =               {An Improved Pattern-Matching Algorithm for Strings
                         in Terms of Straight-Line Programs},
  booktitle =           {{P}roceedings of the 8th {A}nnual {S}ymposium on
                         {C}ombinatorial {P}attern {M}atching ({CPM}'97)},
  acronym =             {{CPM}'97},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1264},
  pages =               {1-11},
  year =                {1997},
  month =               jun,
}
[MT99] Alexis Maciel and Denis Thérien. Efficient Threshold Circuits for Power Series. Information and Computation 152(1):62-73. Academic Press, June 1999. 
@article{icomp152(1)-MT,
  author =              {Maciel, Alexis and Th{\'e}rien, Denis},
  title =               {Efficient Threshold Circuits for Power Series},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {152},
  number =              {1},
  pages =               {62-73},
  year =                {1999},
  month =               jun,
}
[Mul99] Markus Müller-Olm. A Modal Fixpoint Logic with Chop. In STACS'99, Lecture Notes in Computer Science 1563, pages 510-520. Springer-Verlag, March 1999. 
@inproceedings{stacs1999-Mul,
  author =              {M{\"u}ller{-}Olm, Markus},
  title =               {A Modal Fixpoint Logic with Chop},
  editor =              {Meinel, {\relax Ch}ristoph and Tison, Sophie},
  booktitle =           {{P}roceedings of the 16th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'99)},
  acronym =             {{STACS}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1563},
  pages =               {510-520},
  year =                {1999},
  month =               mar,
}
[Mun71] J. Ian Munro. Efficient Determination of the Transitive Closure of a Directed Graph. Information Processing Letters 1(2):56-58. Elsevier, June 1971. 
@article{ipl1(2)-Mun,
  author =              {Munro, J. Ian},
  title =               {Efficient Determination of the Transitive Closure of
                         a Directed Graph},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {1},
  number =              {2},
  pages =               {56-58},
  year =                {1971},
  month =               jun,
}
[MV14] Nicolas Markey and Steen Vester. Symmetry Reduction in Infinite Games with Finite Branching. In ATVA'14, Lecture Notes in Computer Science 8837, pages 281-296. Springer-Verlag, November 2014.
Abstract

Symmetry reductions have been applied extensively for the verification of finite-state concurrent systems and hardware designs using model-checking of temporal logics such as LTL, CTL and CTL*, as well as real-time and probabilistic-system model-checking. In this paper we extend the technique to handle infinite-state games on graphs with finite branching where the objectives of the players can be very general. As particular applications, it is shown that the technique can be applied to reduce the state space in parity games as well as when doing model-checking of the temporal logic ATL*.

@inproceedings{atva2014-MV,
  author =              {Markey, Nicolas and Vester, Steen},
  title =               {Symmetry Reduction in Infinite Games with Finite
                         Branching},
  editor =              {Cassez, Franck and Raskin, Jean-Fran{\c c}ois},
  booktitle =           {{P}roceedings of the 12th {I}nternational
                         {S}ymposium on {A}utomated {T}echnology for
                         {V}erification and {A}nalysis ({ATVA}'14)},
  acronym =             {{ATVA}'14},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8837},
  pages =               {281-296},
  year =                {2014},
  month =               nov,
  doi =                 {10.1007/978-3-319-11936-6_21},
  abstract =            {Symmetry reductions have been applied extensively
                         for the verification of finite-state concurrent
                         systems and hardware designs using model-checking of
                         temporal logics such as LTL, CTL and
                         CTL\textsuperscript{*}, as well as real-time and
                         probabilistic-system model-checking. In this paper
                         we extend the technique to handle infinite-state
                         games on graphs with finite branching where the
                         objectives of the players can be very general. As
                         particular applications, it is shown that the
                         technique can be applied to reduce the state space
                         in parity games as well as when doing model-checking
                         of the temporal logic ATL\textsuperscript{*}.},
}
[MVZ15] Pablo Muñoz, Nils Vortmeier, and Thomas Zeume. Dynamic Graph Queries. Research Report 1512.05511, arXiv, December 2015. 
@techreport{arxiv-1512.05511,
  author =              {Mu{\~n}oz, Pablo and Vortmeier, Nils and Zeume,
                         Thomas},
  title =               {Dynamic Graph Queries},
  number =              {1512.05511},
  year =                {2015},
  month =               dec,
  institution =         {arXiv},
  type =                {Research Report},
}
[MW98] Helmut Melcher and Klaus Winkelmann. Controller synthesis for the `production cell' case study. In FMSP'98, pages 24-33. ACM Press, March 1998. 
@inproceedings{fmsp1998-MW,
  author =              {Melcher, Helmut and Winkelmann, Klaus},
  title =               {Controller synthesis for the `production cell' case
                         study},
  editor =              {Ardis, Mark},
  booktitle =           {{P}roceedings of the 2nd {W}orkshop on {F}ormal
                         {M}ethods in {S}oftware {P}ractice ({FMSP}'98)},
  acronym =             {{FMSP}'98},
  publisher =           {ACM Press},
  pages =               {24-33},
  year =                {1998},
  month =               mar,
}
[MW99] Angelika Mader and Hanno Wupper. Timed automaton models for simple programmable logic controllers. In ECRTS'99, pages 106-113. IEEE Comp. Soc. Press, June 1999. 
@inproceedings{ecrta1999-MW,
  author =              {Mader, Angelika and Wupper, Hanno},
  title =               {Timed automaton models for simple programmable logic
                         controllers},
  booktitle =           {{P}roceedings of the 11th {E}uromicro {C}onference
                         on {R}eal-{T}ime {S}ystems ({ECRTS}'99)},
  acronym =             {{ECRTS}'99},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {106-113},
  year =                {1999},
  month =               jun,
}
[MW03] Pierre McKenzie and Klaus W. Wagner. The Complexity of Membership Problems for Circuits over Sets of Natural Numbers. In STACS'03, Lecture Notes in Computer Science 2607, pages 571-582. Springer-Verlag, February 2003. 
@inproceedings{stacs2003-MW,
  author =              {McKenzie, Pierre and Wagner, Klaus W.},
  title =               {The Complexity of Membership Problems for Circuits
                         over Sets of Natural Numbers},
  editor =              {Alt, Helmut and Habib, Michel},
  booktitle =           {{P}roceedings of the 20th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'03)},
  acronym =             {{STACS}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2607},
  pages =               {571-582},
  year =                {2003},
  month =               feb,
}
[MW05] Anca Muscholl and Igor Walukiewicz. An NP-complete Fragment of LTL. International Journal of Foundations of Computer Science 16(4):743-753. August 2005. 
@article{ijfcs16(4)-MW,
  author =              {Muscholl, Anca and Walukiewicz, Igor},
  title =               {An {NP}-complete Fragment of~{LTL}},
  journal =             {International Journal of Foundations of Computer
                         Science},
  volume =              {16},
  number =              {4},
  pages =               {743-753},
  year =                {2005},
  month =               aug,
}
[MW10] Nicolas Markey and Jef Wijsen (eds.) Proceedings of the 17th International Symposium on Temporal Representation and Reasoning (TIME'10). IEEE Comp. Soc. Press, September 2010. 
@proceedings{time2010-MW,
  title =               {{P}roceedings of the 17th {I}nternational
                         {S}ymposium on {T}emporal {R}epresentation and
                         {R}easoning ({TIME}'10)},
  editor =              {Markey, Nicolas and Wijsen, Jef},
  booktitle =           {{P}roceedings of the 17th {I}nternational
                         {S}ymposium on {T}emporal {R}epresentation and
                         {R}easoning ({TIME}'10)},
  acronym =             {{TIME}'10},
  publisher =           {IEEE Comp. Soc. Press},
  year =                {2010},
  month =               sep,
  doi =                 {10.1109/TIME.2010.4},
  url =                 {http://ieeexplore.ieee.org/xpl/ tocresult.jsp?
                         reload=true&isnumber=5601852},
}
N
[dN86] Rocco de Nicola. Extensional Equivalences for Transitions Systems. Acta Informatica 24(2):211-237. Springer-Verlag, 1986. 
@article{acta24(2)-Den,
  author =              {de Nicola, Rocco},
  title =               {Extensional Equivalences for Transitions Systems},
  publisher =           {Springer-Verlag},
  journal =             {Acta Informatica},
  volume =              {24},
  number =              {2},
  pages =               {211-237},
  year =                {1986},
}
[Nas50] John F. Nash. Equilibrium Points in n-Person Games. Proceedings of the National Academy of Sciences 36(1):48-49. National Academy of Sciences of the United States of America, January 1950. 
@article{pnas36(1)-Nash,
  author =              {Nash, Jr., John F.},
  title =               {Equilibrium Points in {\(n\)}-Person Games},
  publisher =           {National Academy of Sciences of the United States of
                         America},
  journal =             {Proceedings of the National Academy of Sciences},
  volume =              {36},
  number =              {1},
  pages =               {48-49},
  year =                {1950},
  month =               jan,
}
[Nas51] John F. Nash. Non-cooperative Games. Annals of Mathematics 54(2):286-295. Princeton University Press, September 1951. 
@article{am54(2)-Nash,
  author =              {Nash, Jr., John F.},
  title =               {Non-cooperative Games},
  publisher =           {Princeton University Press},
  journal =             {Annals of Mathematics},
  volume =              {54},
  number =              {2},
  pages =               {286-295},
  year =                {1951},
  month =               sep,
}
[NB07] Sriram Narasimhan and Gautam Biswas. Model-Based Diagnosis of Hybrid Systems. IEEE Transactions on Systems, Man, and Cybernetics – Part A: Systems and Humans 37(3):348-361. IEEE, May 2007. 
@article{tsmcA37(3)-NB,
  author =              {Narasimhan, Sriram and Biswas, Gautam},
  title =               {Model-Based Diagnosis of Hybrid Systems},
  publisher =           {IEEE},
  journal =             {IEEE Transactions on Systems, Man, and
                         Cybernetics~-- Part~A: Systems and Humans},
  volume =              {37},
  number =              {3},
  pages =               {348-361},
  year =                {2007},
  month =               may,
  doi =                 {10.1109/TSMCA.2007.893487},
}
[dNH84] Rocco de Nicola and Matthew C. B. Hennessy. Testing Equivalence for Processes. Theoretical Computer Science 34:83-133. Elsevier, 1984. 
@article{tcs34()-DH,
  author =              {de Nicola, Rocco and Hennessy, Matthew C. B.},
  title =               {Testing Equivalence for Processes},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {34},
  pages =               {83-133},
  year =                {1984},
}
[Nic08] Dejan Nickovic. Checking Timed and Hybrid Properties: Theory and Applications. PhD thesis, Lab. VERIMAG, Grenoble, France, October 2008. 
@phdthesis{phd-nickovic,
  author =              {Nickovic, Dejan},
  title =               {Checking Timed and Hybrid Properties: Theory and
                         Applications},
  year =                {2008},
  month =               oct,
  school =              {Lab. VERIMAG, Grenoble, France},
}
[Nic19] Cyril Nicaud. The Černý conjecture holds with high probability. Journal of Automata, Languages and Combinatorics 24(2-4):343-365. 2019. 
@article{jalc24(2-4)-Nic,
  author =              {Nicaud, Cyril},
  title =               {The {{\v{C}}}ern{\'y} conjecture holds with high
                         probability},
  journal =             {Journal of Automata, Languages and Combinatorics},
  volume =              {24},
  number =              {2-4},
  pages =               {343-365},
  year =                {2019},
  doi =                 {10.25596/jalc-2019-343},
}
[Nie02] Frank Nießner. Non-deterministic tree automata. In Erich Grädel, Wolfgang Thomas, and Thomas Wilke (eds.), Automata, Logics, and Infinite Games, Lecture Notes in Computer Science 2500, pages 227-232. Springer-Verlag, 2002. 
@incollection{lncs2500-niessner,
  author =              {Nie{\ss}ner, Frank},
  title =               {Non-deterministic tree 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 =               {227-232},
  year =                {2002},
}
[Nis94] Noam Nisan. RL ⊆SC. Computational Complexity 4:1-11. Birkhäuser, 1994. 
@article{cc4()-Nis,
  author =              {Nisan, Noam},
  title =               {\(RL \subseteq SC\)},
  publisher =           {Birkh{\"a}user},
  journal =             {Computational Complexity},
  volume =              {4},
  pages =               {1-11},
  year =                {1994},
}
[Niw97] Damian Niwiński. Fixed point characterization of infinite behavior of finite-state systems. Theoretical Computer Science 189(1-2):1-69. Elsevier, December 1997. 
@article{tcs189(1-2)-Niw,
  author =              {Niwi{\'n}ski, Damian},
  title =               {Fixed point characterization of infinite behavior of
                         finite-state systems},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {189},
  number =              {1-2},
  pages =               {1-69},
  year =                {1997},
  month =               dec,
  doi =                 {10.1016/S0304-3975(97)00039-X},
}
[Niw02] Damian Niwiński. μ-calculus via Games. In CSL'02, Lecture Notes in Computer Science 2471, pages 27-43. Springer-Verlag, September 2002. 
@inproceedings{csl2002-Niw,
  author =              {Niwi{\'n}ski, Damian},
  title =               {{\(\mu\)}-calculus via Games},
  booktitle =           {{P}roceedings of the 16th {I}nternational {W}orkshop
                         on {C}omputer {S}cience {L}ogic ({CSL}'02)},
  acronym =             {{CSL}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2471},
  pages =               {27-43},
  year =                {2002},
  month =               sep,
}
[NJM+22] Reiya Noguchi, Thierry Jéron, Nicolas Markey, and Ocan Sankur. Method and system for testing the operation of a target computer system by using timed requirements. Patent EP 3 907 615 B1, November 2022, 
@patent{EP3907615B1,
  author =              {Noguchi, Reiya and J{\'e}ron, Thierry and Markey,
                         Nicolas and Sankur, Ocan},
  title =               {Method and system for testing the operation of a
                         target computer system by using timed requirements},
  number =              {EP 3 907 615 B1},
  year =                {2022},
  month =               nov,
}
[NJM+23] Reiya Noguchi, Thierry Jéron, Nicolas Markey, and Ocan Sankur. Method and system for correcting the operation of a target computer system by using timed requirements. Patent EP 4 064 057 B1, July 2023, 
@patent{EP4064057B1,
  author =              {Noguchi, Reiya and J{\'e}ron, Thierry and Markey,
                         Nicolas and Sankur, Ocan},
  title =               {Method and system for correcting the operation of a
                         target computer system by using timed requirements},
  number =              {EP 4 064 057 B1},
  year =                {2023},
  month =               jul,
}
[NOK10] Takeshi Nagaoka, Kozo Okano, and Shinji Kusumoto. An abstraction refinement technique for timed automata based on counterexample-guided abstraction refinement loop. IEICE Transactions on Information and Systems 5(5):994-1005. Institute of Electronics, Information and Communication Engineers, May 2010. 
@article{IEICEtransinfE93D(5)-NOK,
  author =              {Nagaoka, Takeshi and Okano, Kozo and Kusumoto,
                         Shinji},
  title =               {An abstraction refinement technique for timed
                         automata based on counterexample-guided abstraction
                         refinement loop},
  publisher =           {Institute of Electronics, Information and
                         Communication Engineers},
  journal =             {IEICE Transactions on Information and Systems},
  volume =              {5},
  number =              {5},
  pages =               {994-1005},
  year =                {2010},
  month =               may,
  doi =                 {10.1587/transinf.E93.D.994},
}
[NOS+93] Xavier Nicollin, Alfredo Olivero, Joseph Sifakis, and Sergio Yovine. An Approach to the Description and Analysis of Hybrid Systems. In HSCC'92, Lecture Notes in Computer Science 736, pages 149-178. Springer-Verlag, 1993. 
@inproceedings{hscc1992-NOSY,
  author =              {Nicollin, Xavier and Olivero, Alfredo and Sifakis,
                         Joseph and Yovine, Sergio},
  title =               {An Approach to the Description and Analysis of
                         Hybrid Systems},
  editor =              {Grossman, Robert L. and Nerode, Anil and Ravn,
                         Anders P. and Rischel, Hans},
  booktitle =           {{H}ybrid {S}ystems ({HSCC}'92)},
  acronym =             {{HSCC}'92},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {736},
  pages =               {149-178},
  year =                {1993},
}
[NRT+07] Noam Nisan, Tim Roughgarden, Éva Tardos, and Vijay V. Vazirani. Algorithmic Game Theory. Cambridge University Press, 2007. 
@book{agt2007-NRTV,
  title =               {Algorithmic Game Theory},
  editor =              {Nisan, Noam and Roughgarden, Tim and Tardos, {\'E}va
                         and Vazirani, Vijay V.},
  booktitle =           {Algorithmic Game Theory},
  publisher =           {Cambridge University Press},
  year =                {2007},
}
[NS03] Brian Nielsen and Arne Skou. Automated test generation from timed automata. International Journal on Software Tools for Technology Transfer 5(1):59-77. Springer-Verlag, November 2003. 
@article{sttt5(1)-NS,
  author =              {Nielsen, Brian and Skou, Arne},
  title =               {Automated test generation from timed automata},
  publisher =           {Springer-Verlag},
  journal =             {International Journal on Software Tools for
                         Technology Transfer},
  volume =              {5},
  number =              {1},
  pages =               {59-77},
  year =                {2003},
  month =               nov,
  doi =                 {10.1007/s10009-002-0094-1},
}
[NSJ+22] Reiya Noguchi, Ocan Sankur, Thierry Jéron, Nicolas Markey, and David Mentré. Repairing Real-Time Requirements. In ATVA'22, Lecture Notes in Computer Science 13505, pages 371-387. Springer-Verlag, October 2022.
Abstract

We consider the problem of repairing inconsistent real-time requirements with respect to two consistency notions: non-vacuity, which means that each requirement can be realized without violating other ones, and rt-consistency, which means that inevitable violations are detected immediately. We provide an iterative algorithm, based on solving SMT queries, to replace designated parameters of real-time requirements with new Boolean expressions and time constraints, so that the resulting set of requirements becomes consistent.

@inproceedings{atva2022-NSJMM,
  author =              {Noguchi, Reiya and Sankur, Ocan and J{\'e}ron,
                         Thierry and Markey, Nicolas and Mentr{\'e}, David},
  title =               {Repairing Real-Time Requirements},
  editor =              {Bouajjani, Ahmed and Hol{\'\i}k, Luk{\'a}{\v s} and
                         Wu, Zhilin},
  booktitle =           {{P}roceedings of the 20th {I}nternational
                         {S}ymposium on {A}utomated {T}echnology for
                         {V}erification and {A}nalysis ({ATVA}'22)},
  acronym =             {{ATVA}'22},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {13505},
  pages =               {371-387},
  year =                {2022},
  month =               oct,
  doi =                 {10.1007/978-3-031-19992-9_24},
  abstract =            {We~consider the problem of repairing inconsistent
                         real-time requirements with respect to two
                         consistency notions: non-vacuity, which means that
                         each requirement can be realized without violating
                         other ones, and rt-consistency, which means that
                         inevitable violations are detected immediately.
                         We~provide an iterative algorithm, based on solving
                         SMT queries, to replace designated parameters of
                         real-time requirements with new Boolean expressions
                         and time constraints, so that the resulting set of
                         requirements becomes consistent.},
}
[NSL+12] Truong Khanh Nguyen, Jun Sun, Yang Liu, Jin Song Dong, and Yan Liu. Improved BDD-Based Discrete Analysis of Timed Systems. In FM'12, Lecture Notes in Computer Science 7436, pages 326-340. Springer-Verlag, August 2012. 
@inproceedings{fm2012-NSLDL,
  author =              {Nguyen, Truong Khanh and Sun, Jun and Liu, Yang and
                         Dong, Jin Song and Liu, Yan},
  title =               {Improved {BDD}-Based Discrete Analysis of Timed
                         Systems},
  editor =              {Giannakopoulou, Dimitra and M{\'e}ry, Dominique},
  booktitle =           {{P}roceedings of the 18th {I}nternational
                         {S}ymposium on {F}ormal {M}ethods ({FM}'12)},
  acronym =             {{FM}'12},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7436},
  pages =               {326-340},
  year =                {2012},
  month =               aug,
  doi =                 {10.1007/978-3-642-32759-9_28},
}
[NTS95] Noam Nisan and Amnon Ta-Shma. Symmetric LOGSPACE is Closed Under Complement. In STOC'95, pages 140-146. ACM Press, May 1995. 
@inproceedings{stoc1995-NT,
  author =              {Nisan, Noam and Ta-Shma, Amnon},
  title =               {Symmetric {LOGSPACE} is Closed Under Complement},
  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 =               {140-146},
  year =                {1995},
  month =               may,
}
[NU02] Matti Nykänen and Esko Ukkonen. The Exact Path Length Problem. Journal of Algorithms 42(1):41-53. Elsevier, January 2002. 
@article{ja42(1)-NU,
  author =              {Nyk{\"a}nen, Matti and Ukkonen, Esko},
  title =               {The Exact Path Length Problem},
  publisher =           {Elsevier},
  journal =             {Journal of Algorithms},
  volume =              {42},
  number =              {1},
  pages =               {41-53},
  year =                {2002},
  month =               jan,
  doi =                 {10.1006/jagm.2001.1201},
}
[dNV90] Rocco de Nicola and Frits Vaandrager. Action versus state based logics for transition systems. In Semantics of Systems of Concurrent Processes, Lecture Notes in Computer Science 469, pages 407-419. Springer-Verlag, April 1990. 
@inproceedings{litp1990-DV,
  author =              {de Nicola, Rocco and Vaandrager, Frits},
  title =               {Action versus state based logics for transition
                         systems},
  editor =              {Guessarian, Ir{\`e}ne},
  booktitle =           {Semantics of Systems of Concurrent Processes},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {469},
  pages =               {407-419},
  year =                {1990},
  month =               apr,
  doi =                 {10.1007/3-540-53479-2_17},
}
[NYY92] Anil Nerode, Alexander Yakhnis, and Vladimir Yakhnis. Concurrent programs as strategies in games. In Logic from Computer Science, Mathematical Sciences Research Institute Publications 21, pages 405-479. Springer-Verlag, 1992. 
@inproceedings{lcs1989-NYY,
  author =              {Nerode, Anil and Yakhnis, Alexander and Yakhnis,
                         Vladimir},
  title =               {Concurrent programs as strategies in games},
  editor =              {Moschovakis, Yiannis N.},
  booktitle =           {{L}ogic from {C}omputer {S}cience},
  publisher =           {Springer-Verlag},
  series =              {Mathematical Sciences Research Institute
                         Publications},
  volume =              {21},
  pages =               {405-479},
  year =                {1992},
  confyear =            {1989},
  confmonth =           {11},
}
O
[Obd03] Jan Obdržálek. Fast Mu-Calculus Model Checking When Tree-Width is Bounded. In CAV'03, Lecture Notes in Computer Science 2725, pages 80-92. Springer-Verlag, July 2003. 
@inproceedings{cav2003-obd,
  author =              {Obdr{\v z}{\'a}lek, Jan},
  title =               {Fast Mu-Calculus Model Checking When Tree-Width is
                         Bounded},
  editor =              {Hunt, Jr, Warren A. and Somenzi, Fabio},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'03)},
  acronym =             {{CAV}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2725},
  pages =               {80-92},
  year =                {2003},
  month =               jul,
  doi =                 {10.1007/978-3-540-45069-6_7},
}
[Odd00] Denis Oddoux. Génération efficace d'automates de Büchi à partir de formules LTL. Mémoire de D.E.A., Lab. Informatique Algorithmique: Fondements et Applications, Université Paris 7, France, June 2000. 
@mastersthesis{dea-oddoux,
  author =              {Oddoux, Denis},
  title =               {G{\'e}n{\'e}ration efficace d'automates de
                         {B}{\"u}chi {\`a} partir de formules {LTL}},
  year =                {2000},
  month =               jun,
  school =              {Lab.~Informatique Algorithmique: Fondements et
                         Applications, Universit{\'e} Paris~7, France},
  type =                {M\'emoire de D.E.A.},
}
[Odd03] Denis Oddoux. Utilisation des automates alternants pour un model-checking efficace des logiques temporelles linéaires. Thèse de doctorat, Lab. Informatique Algorithmique: Fondements et Applications, Université Paris 7, France, December 2003. 
@phdthesis{phd-oddoux,
  author =              {Oddoux, Denis},
  title =               {Utilisation des automates alternants pour un
                         model-checking efficace des logiques temporelles
                         lin{\'e}aires},
  year =                {2003},
  month =               dec,
  school =              {Lab.~Informatique Algorithmique: Fondements et
                         Applications, Universit{\'e} Paris~7, France},
  type =                {Th\`ese de doctorat},
}
[ON80] Hiroakira Ono and Akira Nakamura. On the Size of Refutation Kripke Models for Some Linear Modal and Tense Logics. Studia Logica 39(4):325-333. Kluwer Academic, 1980. 
@article{studlog39(4)-ON,
  author =              {Ono, Hiroakira and Nakamura, Akira},
  title =               {On the Size of Refutation Kripke Models for Some
                         Linear Modal and Tense Logics},
  publisher =           {Kluwer Academic},
  journal =             {Studia Logica},
  volume =              {39},
  number =              {4},
  pages =               {325-333},
  year =                {1980},
}
[OR94] Martin J. Osborne and Ariel Rubinstein. A Course in Game Theory. MIT Press, 1994. 
@book{cgt-OR94,
  author =              {Osborne, Martin J. and Rubinstein, Ariel},
  title =               {A Course in Game Theory},
  publisher =           {MIT Press},
  year =                {1994},
}
[Ore08] Ghassan Oreiby. Logiques temporelles pour le contrôle temporisé. Thèse de doctorat, Lab. Spécification & Vérification, ENS Cachan, France, December 2008. 
@phdthesis{phd-oreiby,
  author =              {Oreiby, Ghassan},
  title =               {Logiques temporelles pour le contr{\^o}le
                         temporis{\'e}},
  year =                {2008},
  month =               dec,
  school =              {Lab.~Sp\'ecification \& V\'erification, ENS Cachan,
                         France},
  type =                {Th\`ese de doctorat},
}
[ORS14] Youssouf Oualhadj, Pierre-Alain Reynier, and Ocan Sankur. Probabilistic Robust Timed Games. In CONCUR'14, Lecture Notes in Computer Science 8704, pages 203-217. Springer-Verlag, September 2014. 
@inproceedings{concur2014-ORS,
  author =              {Oualhadj, Youssouf and Reynier, Pierre-Alain and
                         Sankur, Ocan},
  title =               {Probabilistic Robust Timed Games},
  editor =              {Baldan, Paolo and Gorla, Daniele},
  booktitle =           {{P}roceedings of the 25th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'14)},
  acronym =             {{CONCUR}'14},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8704},
  pages =               {203-217},
  year =                {2014},
  month =               sep,
  doi =                 {10.1007/978-3-662-44584-6_15},
}
[ORW09] Joël Ouaknine, Alexander Rabinovich, and James Worrell. Time-Bounded Verification. In CONCUR'09, Lecture Notes in Computer Science 5710, pages 496-510. Springer-Verlag, September 2009. 
@inproceedings{concur2009-ORW,
  author =              {Ouaknine, Jo{\"e}l and Rabinovich, Alexander and
                         Worrell, James},
  title =               {Time-Bounded Verification},
  editor =              {Bravetti, Mario and Zavattaro, Gianluigi},
  booktitle =           {{P}roceedings of the 20th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'09)},
  acronym =             {{CONCUR}'09},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5710},
  pages =               {496-510},
  year =                {2009},
  month =               sep,
}
[Osb04] Martin J. Osborne. An Introduction to Game Theory. Oxford University Press, 2004. 
@book{igt-Osb04,
  author =              {Osborne, Martin J.},
  title =               {An~Introduction to Game Theory},
  publisher =           {Oxford University Press},
  year =                {2004},
}
[Ost92] Jonathan S. Ostroff. Formal methods for the specification and design of real-time safety critical systems. Journal of Systems and Software 18(1):33-60. Elsevier, April 1992. 
@article{jss18(1)-Ost,
  author =              {Ostroff, Jonathan S.},
  title =               {Formal methods for the specification and design of
                         real-time safety critical systems},
  publisher =           {Elsevier},
  journal =             {Journal of Systems and Software},
  volume =              {18},
  number =              {1},
  pages =               {33-60},
  year =                {1992},
  month =               apr,
  doi =                 {10.1016/0164-1212(92)90045-L},
}
[OW02] Joël Ouaknine and James Worrell. Timed CSP = Closed Timed Safety Automata. In EXPRESS'02, Electronic Notes in Theoretical Computer Science 68(2), pages 145-162. Elsevier, August 2002. 
@inproceedings{express2002-OW,
  author =              {Ouaknine, Jo{\"e}l and Worrell, James},
  title =               {Timed {CSP} = Closed Timed Safety Automata},
  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 =               {145-162},
  year =                {2002},
  month =               aug,
}
[OW03] Joël Ouaknine and James Worrell. Revisiting Digitization, Robustness, and Decidability for Timed Automata. In LICS'03, pages 198-207. IEEE Comp. Soc. Press, June 2003. 
@inproceedings{lics2003-OW,
  author =              {Ouaknine, Jo{\"e}l and Worrell, James},
  title =               {Revisiting Digitization, Robustness, and
                         Decidability for Timed Automata},
  booktitle =           {{P}roceedings of the 18th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'03)},
  acronym =             {{LICS}'03},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {198-207},
  year =                {2003},
  month =               jun,
}
[OW04] Joël Ouaknine and James Worrell. On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap. In LICS'04, pages 54-63. IEEE Comp. Soc. Press, July 2004. 
@inproceedings{lics2004-OW,
  author =              {Ouaknine, Jo{\"e}l and Worrell, James},
  title =               {On the Language Inclusion Problem for Timed
                         Automata: {C}losing a Decidability Gap},
  booktitle =           {{P}roceedings of the 19th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'04)},
  acronym =             {{LICS}'04},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {54-63},
  year =                {2004},
  month =               jul,
}
[OW05] Joël Ouaknine and James Worrell. On the Decidability of Metric Temporal Logic. In LICS'05, pages 188-197. IEEE Comp. Soc. Press, July 2005. 
@inproceedings{lics2005-OW,
  author =              {Ouaknine, Jo{\"e}l and Worrell, James},
  title =               {On the Decidability of Metric Temporal Logic},
  booktitle =           {{P}roceedings of the 20th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'05)},
  acronym =             {{LICS}'05},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {188-197},
  year =                {2005},
  month =               jul,
}
[OW06] Joël Ouaknine and James Worrell. Safety Metric Temporal Logic is Fully Decidable. In TACAS'06, Lecture Notes in Computer Science 3920, pages 411-425. Springer-Verlag, March 2006. 
@inproceedings{tacas2006-OW,
  author =              {Ouaknine, Jo{\"e}l and Worrell, James},
  title =               {Safety Metric Temporal Logic is Fully Decidable},
  editor =              {Hermanns, Holger and Palsberg, Jens},
  booktitle =           {{P}roceedings of the 12th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'06)},
  acronym =             {{TACAS}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3920},
  pages =               {411-425},
  year =                {2006},
  month =               mar,
}
[OW06] Joël Ouaknine and James Worrell. On Metric Temporal Logic and Faulty Turing Machines. In FoSSaCS'06, Lecture Notes in Computer Science 3921, pages 217-230. Springer-Verlag, March 2006. 
@inproceedings{fossacs2006-OW,
  author =              {Ouaknine, Jo{\"e}l and Worrell, James},
  title =               {On Metric Temporal Logic and Faulty {T}uring
                         Machines},
  editor =              {Aceto, Luca and Ing{\'o}lfsd{\'o}ttir, Anna},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'06)},
  acronym =             {{FoSSaCS}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3921},
  pages =               {217-230},
  year =                {2006},
  month =               mar,
}
[OW07] Joël Ouaknine and James Worrell. On the Decidability and Complexity of Metric Temporal Logic over Finite Words. Logical Methods in Computer Science 3(1). March 2007. 
@article{lmcs3(1)-OW,
  author =              {Ouaknine, Jo{\"e}l and Worrell, James},
  title =               {On the Decidability and Complexity of Metric
                         Temporal Logic over Finite Words},
  journal =             {Logical Methods in Computer Science},
  volume =              {3},
  number =              {1},
  year =                {2007},
  month =               mar,
  doi =                 {10.2168/LMCS-3(1:8)2007},
}
[OW10] Joël Ouaknine and James Worrell. Towards a theory of time-bounded verification. In ICALP'10, Lecture Notes in Computer Science 6199, pages 22-37. Springer-Verlag, July 2010. 
@inproceedings{icalp2010-ORW,
  author =              {Ouaknine, Jo{\"e}l and Worrell, James},
  title =               {Towards a theory of time-bounded verification},
  editor =              {Abramsky, Samson and Gavoille, Cyril and Kirchner,
                         Claude and Meyer auf der Heide, Friedhelm and
                         Spirakis, Paul G.},
  booktitle =           {{P}roceedings of the 37th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'10)~-- Part~{II}},
  acronym =             {{ICALP}'10},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6199},
  pages =               {22-37},
  year =                {2010},
  month =               jul,
}
P
[Pan01] Paritosh K. Pandya. Specifying and deciding quantified discrete-time duration calculus formulae using DCVALID. In RT-TOOLS'01. August 2001. 
@inproceedings{rttools2001-Pan,
  author =              {Pandya, Paritosh K.},
  title =               {Specifying and deciding quantified discrete-time
                         duration calculus formulae using {DCVALID}},
  editor =              {Pettersson, Paul and Yovine, Sergio},
  booktitle =           {{P}roceedings of the 1st {W}orkshop on {R}eal-Time
                         {T}ools ({RT-TOOLS}'01)},
  acronym =             {{RT-TOOLS}'01},
  year =                {2001},
  month =               aug,
}
[Pap84] Christos H. Papadimitriou. On the Complexity of Unique Solutions. Journal of the ACM 31(2):392-400. ACM Press, April 1984. 
@article{jacm31(2)-Pap,
  author =              {Papadimitriou, {\relax Ch}ristos H.},
  title =               {On the Complexity of Unique Solutions},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {31},
  number =              {2},
  pages =               {392-400},
  year =                {1984},
  month =               apr,
}
[Pap94] Christos H. Papadimitriou. On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence. Journal of Computer and System Sciences 48(3):498-532. Academic Press, June 1994. 
@article{jcss48(3)-Pap,
  author =              {Papadimitriou, {\relax Ch}ristos H.},
  title =               {On the Complexity of the Parity Argument and Other
                         Inefficient Proofs of Existence},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {48},
  number =              {3},
  pages =               {498-532},
  year =                {1994},
  month =               jun,
  doi =                 {10.1016/S0022-0000(05)80063-7},
}
[Pap94] Christos H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994. 
@book{Pap-compcomp94,
  author =              {Papadimitriou, {\relax Ch}ristos H.},
  title =               {Computational Complexity},
  publisher =           {Addison-Wesley},
  year =                {1994},
}
[Pap07] Christos H. Papadimitriou. The complexity of finding Nash equilibria. In Noam Nisan, Tim Roughgarden, Éva Tardos, and Vijay V. Vazirani (eds.), Algorithmic Game Theory. Cambridge University Press, 2007. 
@incollection{agt2007-Pap,
  author =              {Papadimitriou, {\relax Ch}ristos H.},
  title =               {The complexity of finding {N}ash equilibria},
  editor =              {Nisan, Noam and Roughgarden, Tim and Tardos, {\'E}va
                         and Vazirani, Vijay V.},
  booktitle =           {Algorithmic Game Theory},
  publisher =           {Cambridge University Press},
  pages =               {29-51},
  chapter =             {2},
  year =                {2007},
}
[Par81] David Michael Ritchie Park. Concurrency and Automata on Infinite Sequences. In TCS'81, Lecture Notes in Computer Science 104, pages 167-183. Springer-Verlag, March 1981. 
@inproceedings{gitcs1981-Park,
  author =              {Park, David Michael Ritchie},
  title =               {Concurrency and Automata on Infinite Sequences},
  editor =              {Deussen, Peter},
  booktitle =           {{P}roceedings of the 5th {GI}-{C}onference on
                         {T}heoretical {C}omputer {S}cience ({TCS}'81)},
  acronym =             {{TCS}'81},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {104},
  pages =               {167-183},
  year =                {1981},
  month =               mar,
}
[PBD+02] Anindya C. Patthak, Indrajit Bhattacharya, Anirban Dasgupta, Pallab Dasgupta, and P. P. Chakrabarti. Quantified Computation Tree Logic. Information Processing Letters 82(3):123-129. Elsevier, 2002. 
@article{ipl82(3)-PBDDC,
  author =              {Patthak, Anindya C. and Bhattacharya, Indrajit and
                         Dasgupta, Anirban and Dasgupta, Pallab and
                         Chakrabarti, P. P.},
  title =               {Quantified Computation Tree Logic},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {82},
  number =              {3},
  pages =               {123-129},
  year =                {2002},
}
[Pel98] Doron A. Peled. Ten years of partial-order reduction. In CAV'98, Lecture Notes in Computer Science 1427, pages 17-28. Springer-Verlag, June 1998. 
@inproceedings{cav1998-Pel,
  author =              {Peled, Doron A.},
  title =               {Ten years of partial-order reduction},
  editor =              {Hu, Alan J. and Vardi, Moshe Y.},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'98)},
  acronym =             {{CAV}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1427},
  pages =               {17-28},
  year =                {1998},
  month =               jun,
  doi =                 {10.1007/BFb0028727},
}
[Pet62] Carl Adam Petri. Kommunikation mit Automaten. PhD thesis, Darmstadt University of Technology, Germany, 1962. 
@phdthesis{phd-petri,
  author =              {Petri, Carl Adam},
  title =               {Kommunikation mit Automaten},
  year =                {1962},
  school =              {Darmstadt University of Technology, Germany},
}
[Pet02] Holger Petersen. Expressions with Intersection Is Complete in LOGCFL. In STACS'02, Lecture Notes in Computer Science 2285, pages 513-522. Springer-Verlag, March 2002. 
@inproceedings{stacs2002-Pet,
  author =              {Petersen, Holger},
  title =               {Expressions with Intersection Is Complete in
                         {LOGCFL}},
  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 =               {513-522},
  year =                {2002},
  month =               mar,
}
[PHP11] Amalinda Post, Jochen Hoenicke, and Andreas Podelski. RT-Inconsistency: A New Property for Real-Time Requirements. In FASE'11, Lecture Notes in Computer Science 6603, pages 34-49. Springer-Verlag, March 2011. 
@inproceedings{fase2011-PHP,
  author =              {Post, Amalinda and Hoenicke, Jochen and Podelski,
                         Andreas},
  title =               {RT-Inconsistency: A~New Property for Real-Time
                         Requirements},
  editor =              {Giannakopoulou, Dimitra and Orejas, Fernando},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {C}onference on {F}undamental {A}pproaches to
                         {S}oftware {E}ngineering ({FASE}'11)},
  acronym =             {{FASE}'11},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6603},
  pages =               {34-49},
  year =                {2011},
  month =               mar,
  doi =                 {978-3-642-19811-3_4},
}
[PI97] Sushant Patnaik and Neil Immerman. Dyn-FO: A Parallel, Dynamic Complexity Class. Journal of Computer and System Sciences 55(2):199-209. Academic Press, October 1997. 
@article{jcss55(2)-PI,
  author =              {Patnaik, Sushant and Immerman, Neil},
  title =               {Dyn-{FO}: A~Parallel, Dynamic Complexity Class},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {55},
  number =              {2},
  pages =               {199-209},
  year =                {1997},
  month =               oct,
  doi =                 {10.1006/jcss.1997.1520},
}
[Pig20] Arthur C. Pigou. The economics of welfare. MacMillan and Co., 1920. 
@book{Pigou1920,
  author =              {Pigou, Arthur C.},
  title =               {The~economics of welfare},
  publisher =           {MacMillan and Co.},
  year =                {1920},
}
[Pin83] Jean-Éric Pin. On two combinatorial problems arising from automata theory. In ICGTC'81, North-Holland Mathematics Studies 75, pages 535-548. Elsevier, 1983. 
@inproceedings{icgtc1981-Pin,
  author =              {Pin, Jean-{\'E}ric},
  title =               {On two combinatorial problems arising from automata
                         theory},
  booktitle =           {{P}roceedings of the {I}nternational {C}olloquium on
                         {G}raph {T}heory and {C}ombinatorics ({ICGTC}'81)},
  acronym =             {{ICGTC}'81},
  publisher =           {Elsevier},
  series =              {North-Holland Mathematics Studies},
  volume =              {75},
  pages =               {535-548},
  year =                {1983},
  confyear =            {1981},
  confmonth =           {6},
  doi =                 {10.1016/S0304-0208(08)73432-7},
}
[Pin96] Jean-Éric Pin. Logic, Semigroups and Automata on Words. Annals of Mathematics and Artificial Intelligence 16:343-384. Kluwer Academic, 1996. 
@article{amai16()-Pin,
  author =              {Pin, Jean-{\'E}ric},
  title =               {Logic, Semigroups and Automata on Words},
  publisher =           {Kluwer Academic},
  journal =             {Annals of Mathematics and Artificial Intelligence},
  volume =              {16},
  pages =               {343-384},
  year =                {1996},
}
[Pin01] Jean-Éric Pin. Logic on Words. In Gheorghe Păun, Grzegorz Rozenberg, and Arto Salomaa (eds.), Current Trends in Theoretical Computer Science: Entering the 21th Century. World Scientific, 2001. 
@incollection{CTTCS2001-Pin,
  author =              {Pin, Jean-{\'E}ric},
  title =               {Logic on Words},
  editor =              {P{\u a}un, Gheorghe and Rozenberg, Grzegorz and
                         Salomaa, Arto},
  booktitle =           {Current Trends in Theoretical Computer Science:
                         Entering the 21th Century},
  publisher =           {World Scientific},
  pages =               {254-273},
  year =                {2001},
}
[Pin07] Sophie Pinchinat. A Generic constructive Solution for Concurrent Games with Expressive Constraints on Strategies. In ATVA'07, Lecture Notes in Computer Science 4762, pages 253-267. Springer-Verlag, October 2007. 
@inproceedings{atva2007-Pin,
  author =              {Pinchinat, Sophie},
  title =               {A Generic constructive Solution for Concurrent Games
                         with Expressive Constraints on Strategies},
  editor =              {Namjoshi, Kedar and Yoneda, Tomohiro and Higashino,
                         Teruo and Okamura, Yoshio},
  booktitle =           {{P}roceedings of the 5th {I}nternational {S}ymposium
                         on {A}utomated {T}echnology for {V}erification and
                         {A}nalysis ({ATVA}'07)},
  acronym =             {{ATVA}'07},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4762},
  pages =               {253-267},
  year =                {2007},
  month =               oct,
}
[Pin07] Sophie Pinchinat. Quantified Mu-Calculus with Decision Modalities for Concurrent Game Structures. Technical Report TR-CS-07-02, The Australian National University, Australia, January 2007. 
@techreport{TRCS0702-Pin,
  author =              {Pinchinat, Sophie},
  title =               {Quantified Mu-Calculus with Decision Modalities for
                         Concurrent Game Structures},
  number =              {TR-CS-07-02},
  year =                {2007},
  month =               jan,
  institution =         {The Australian National University, Australia},
}
[Pin21] Jean-Éric Pin. Handbook of automata theory. EMS Press, 2021. 
@book{hat-pin-1,
  title =               {Handbook of automata theory},
  editor =              {Pin, Jean-{\'E}ric},
  booktitle =           {Handbook of automata theory},
  publisher =           {EMS~Press},
  volume =              {1},
  year =                {2021},
  doi =                 {10.4171/AUTOMATA-1},
}
[PK02] Amir Pnueli and Yonit Kesten. A Deductive Proof System for CTL. In CONCUR'02, Lecture Notes in Computer Science 2421, pages 24-40. Springer-Verlag, August 2002. 
@inproceedings{concur2002-PK,
  author =              {Pnueli, Amir and Kesten, Yonit},
  title =               {A~Deductive Proof System for~{CTL}},
  editor =              {Brim, Lubo{\v s} and Jan{\v c}ar, Petr and K{\v
                         r}et{\'\i}nsk{\'y}, Mojm{\'\i}r and Ku{\v c}era,
                         Anton{\'\i}n},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'02)},
  acronym =             {{CONCUR}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2421},
  pages =               {24-40},
  year =                {2002},
  month =               aug,
}
[Pnu77] Amir Pnueli. The Temporal Logic of Programs. In FOCS'77, pages 46-57. IEEE Comp. Soc. Press, October 1977. 
@inproceedings{focs1977-Pnu,
  author =              {Pnueli, Amir},
  title =               {The Temporal Logic of Programs},
  booktitle =           {{P}roceedings of the 18th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'77)},
  acronym =             {{FOCS}'77},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {46-57},
  year =                {1977},
  month =               oct,
  doi =                 {10.1109/SFCS.1977.32},
}
[Pnu81] Amir Pnueli. The Temporal Semantics of Concurrent Programs. Theoretical Computer Science 13:45-60. Elsevier, 1981. 
@article{tcs13()-Pnu,
  author =              {Pnueli, Amir},
  title =               {The Temporal Semantics of Concurrent Programs},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {13},
  pages =               {45-60},
  year =                {1981},
}
[PP95] Dominique Perrin and Jean-Éric Pin. Semigroups and Automata on Infinite Words. In John B. Fountain and Victoria Gould (eds.), NATO Advanced Study Institute: Semigroups, Formal Languages and Groups. Kluwer Academic, 1995. 
@incollection{SFLG1995-PP,
  author =              {Perrin, Dominique and Pin, Jean-{\'E}ric},
  title =               {Semigroups and Automata on Infinite Words},
  editor =              {Fountain, John B. and Gould, Victoria},
  booktitle =           {{NATO} Advanced Study Institute: Semigroups, Formal
                         Languages and Groups},
  publisher =           {Kluwer Academic},
  pages =               {49-72},
  year =                {1995},
}
[PPQ05] Davide Prandi, Corrado Priami, and Paola Quaglia. Process Calculi in a Biological Context. EATCS Bulletin 85:53-69. EATCS, February 2005. 
@article{eatcs-bull85()-PPQ,
  author =              {Prandi, Davide and Priami, Corrado and Quaglia,
                         Paola},
  title =               {Process Calculi in a Biological Context},
  publisher =           {EATCS},
  journal =             {EATCS Bulletin},
  volume =              {85},
  pages =               {53-69},
  year =                {2005},
  month =               feb,
}
[PPT09] Michal Penn, Maria Polukarov, and Moshe Tennenholtz. Random Order Congestion Games. Mathematics of Operations Research 34(3):706-725. Informs, August 2009. 
@article{moor34(3)-PPT,
  author =              {Penn, Michal and Polukarov, Maria and Tennenholtz,
                         Moshe},
  title =               {Random Order Congestion Games},
  publisher =           {Informs},
  journal =             {Mathematics of Operations Research},
  volume =              {34},
  number =              {3},
  pages =               {706-725},
  year =                {2009},
  month =               aug,
  doi =                 {10.1287/moor.1090.0394},
}
[PPT+16] Srinivas Pinisetty, Viorel Preoteasa, Stavros Tripakis, Thierry Jéron, Yliès Falcone, and Hervé Marchand. Predictive Runtime Enforcement. In SAC'16, pages 1628-1633. ACM Press, April 2016. 
@inproceedings{sac2016-PPTJFM,
  author =              {Pinisetty, Srinivas and Preoteasa, Viorel and
                         Tripakis, Stavros and J{\'e}ron, Thierry and
                         Falcone, Yli{\`e}s and Marchand, Herv{\'e}},
  title =               {Predictive Runtime Enforcement},
  editor =              {Ossowski, Sascha},
  booktitle =           {{P}roceedings of the 31st {A}nnual {ACM} {S}ymposium
                         on {A}pplied {C}omputing ({SAC}'16)},
  acronym =             {{SAC}'16},
  publisher =           {ACM Press},
  pages =               {1628-1633},
  year =                {2016},
  month =               apr,
  doi =                 {10.1145/2851613.2851827},
}
[PR89] Amir Pnueli and Roni Rosner. On the Synthesis of a Reactive Module. In POPL'89, pages 179-190. ACM Press, January 1989. 
@inproceedings{popl1989-PR,
  author =              {Pnueli, Amir and Rosner, Roni},
  title =               {On the Synthesis of a Reactive Module},
  booktitle =           {Conference Record of the 16th {ACM} {S}ymposium on
                         {P}rinciples of {P}rogramming {L}anguages
                         ({POPL}'89)},
  acronym =             {{POPL}'89},
  publisher =           {ACM Press},
  pages =               {179-190},
  year =                {1989},
  month =               jan,
}
[PR89] Amir Pnueli and Roni Rosner. On the Synthesis of an Asynchronous Reactive Module. In ICALP'89, Lecture Notes in Computer Science 372, pages 652-671. Springer-Verlag, July 1989. 
@inproceedings{icalp1989-PR,
  author =              {Pnueli, Amir and Rosner, Roni},
  title =               {On the Synthesis of an Asynchronous Reactive Module},
  editor =              {Ausiello, Giorgio and Dezani{-}Ciancaglini,
                         Mariangiola and Ronchi{ }Della{~}Rocca, Simona},
  booktitle =           {{P}roceedings of the 16th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'89)},
  acronym =             {{ICALP}'89},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {372},
  pages =               {652-671},
  year =                {1989},
  month =               jul,
}
[PR90] Amir Pnueli and Roni Rosner. Distributed Reactive Systems Are Hard to Synthesize. In FOCS'90, pages 746-757. IEEE Comp. Soc. Press, October 1990. 
@inproceedings{focs1990-PR,
  author =              {Pnueli, Amir and Rosner, Roni},
  title =               {Distributed Reactive Systems Are Hard to Synthesize},
  booktitle =           {{P}roceedings of the 31st {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'90)},
  acronym =             {{FOCS}'90},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {746-757},
  year =                {1990},
  month =               oct,
}
[PR99] Wojciech Plandowski and Wojciech Rytter. Complexity of Language Recognition Problems for Compressed Words. In Juhani Karhumäki, Hermann Maurer, Gheorghe Păun, and Grzegorz Rozenberg (eds.), Jewels are Forever – Contributions on Theoretical Computer Science in Honor of Arto Salomaa. Springer-Verlag, 1999. 
@incollection{jaf1999-PR,
  author =              {Plandowski, Wojciech and Rytter, Wojciech},
  title =               {Complexity of Language Recognition Problems for
                         Compressed Words},
  editor =              {Karhum{\"a}ki, Juhani and Maurer, Hermann and P{\u
                         a}un, Gheorghe and Rozenberg, Grzegorz},
  booktitle =           {Jewels are Forever~-- Contributions on Theoretical
                         Computer Science in Honor of {A}rto {S}alomaa},
  publisher =           {Springer-Verlag},
  pages =               {262-272},
  year =                {1999},
}
[Pri57] Arthur N. Prior. Time and Modality. Oxford University Press, 1957. 
@book{Prior-1957,
  author =              {Prior, Arthur N.},
  title =               {Time and Modality},
  publisher =           {Oxford University Press},
  year =                {1957},
}
[Pri67] Arthur N. Prior. Past, Present and Future. Oxford University Press, 1967. 
@book{Prior-1967,
  author =              {Prior, Arthur N.},
  title =               {Past, Present and Future},
  publisher =           {Oxford University Press},
  year =                {1967},
}
[Pri68] Arthur N. Prior. Papers on Time and Tense. Oxford University Press, 1968. 
@book{Prior-1968,
  author =              {Prior, Arthur N.},
  title =               {Papers on Time and Tense},
  publisher =           {Oxford University Press},
  year =                {1968},
}
[PS05] Radek Pelánek and Jan Strejček. Deeper Connections Between LTL and Alternating Automata.. In CIAA'05, Lecture Notes in Computer Science 3845, pages 238-249. Springer-Verlag, June 2005. 
@inproceedings{ciaa2005-PS,
  author =              {Pel{\'a}nek, Radek and Strej{\v c}ek, Jan},
  title =               {Deeper Connections Between {LTL} and Alternating
                         Automata.},
  editor =              {Farr{\'e}, Jacques and Litovsky, Igor and Schmitz,
                         Sylvain},
  booktitle =           {{R}evised {S}elected {P}apers of the 10th
                         {I}nternational {C}onference on Implementation and
                         Application of Automata ({CIAA}'05)},
  acronym =             {{CIAA}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3845},
  pages =               {238-249},
  year =                {2005},
  month =               jun,
}
[PS10] Soumya Paul and Sunil Simon. Nash Equilibrium in Generalised Muller Games. In FSTTCS'09, Leibniz International Proceedings in Informatics 4, pages 335-346. Leibniz-Zentrum für Informatik, December 2010. 
@inproceedings{fsttcs2009-PS,
  author =              {Paul, Soumya and Simon, Sunil},
  title =               {{N}ash Equilibrium in Generalised {M}uller Games},
  editor =              {Kannan, Ravi and Narayan Kumar, K.},
  booktitle =           {{P}roceedings of the 29th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'09)},
  acronym =             {{FSTTCS}'09},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {4},
  pages =               {335-346},
  year =                {2010},
  month =               dec,
}
[PS11] Paritosh K. Pandya and Simoni S. Shah. On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, and Deterministic Freezing. In CONCUR'11, Lecture Notes in Computer Science 6901, pages 60-75. Springer-Verlag, September 2011. 
@inproceedings{concur2011-PS,
  author =              {Pandya, Paritosh K. and Shah, Simoni S.},
  title =               {On Expressive Powers of Timed Logics: Comparing
                         Boundedness, Non-punctuality, and Deterministic
                         Freezing},
  editor =              {Katoen, Joost-Pieter and K{\"o}nig, Barbara},
  booktitle =           {{P}roceedings of the 22nd {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'11)},
  acronym =             {{CONCUR}'11},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6901},
  pages =               {60-75},
  year =                {2011},
  month =               sep,
  doi =                 {10.1007/978-3-642-23217-6_5},
}
[PS16] Nicolas Perrin and Philipp Schlehuber-Caissier. Fast diffeomorphic matching to learn globally asymptotically stable nonlinear dynamical systems. Systems & Control Letters 96:51-59. Elsevier, October 2016. 
@article{scl96()-PS,
  author =              {Perrin, Nicolas and Schlehuber{-}Caissier, Philipp},
  title =               {Fast diffeomorphic matching to learn globally
                         asymptotically stable nonlinear dynamical systems},
  publisher =           {Elsevier},
  journal =             {Systems~\& Control Letters},
  volume =              {96},
  pages =               {51-59},
  year =                {2016},
  month =               oct,
  doi =                 {10.1016/j.sysconle.2016.06.018},
}
[PSS+03] Matteo Pradella, Pierluigi San Pietro, Paola Spoletini, and Angelo Morzenti. Practical Model Checking of LTL with Past. In ATVA'03. December 2003. 
@inproceedings{atva2003-PSSM,
  author =              {Pradella, Matteo and San{~}Pietro, Pierluigi and
                         Spoletini, Paola and Morzenti, Angelo},
  title =               {Practical Model Checking of {LTL} with Past},
  booktitle =           {{P}roceedings of the 1st {I}nternational {W}orkshop
                         on {A}utomated {T}echnology for {V}erification and
                         {A}nalysis ({ATVA}'03)},
  acronym =             {{ATVA}'03},
  year =                {2003},
  month =               dec,
}
[PST12] Renato Paes Leme, Vasilis Syrgkanis, and Éva Tardos. The curse of simultaneity. In ITCS'12, pages 60-67. ACM Press, January 2012. 
@inproceedings{itcs2012-PST,
  author =              {Paes{ }Leme, Renato and Syrgkanis, Vasilis and
                         Tardos, {\'E}va},
  title =               {The curse of simultaneity},
  editor =              {Goldwasser, Shafi},
  booktitle =           {{P}roceedings of the 3rd {C}onference on
                         {I}nnovations in {T}heoretical {C}omputer {S}cience
                         ({ITCS}'12)},
  acronym =             {{ITCS}'12},
  publisher =           {ACM Press},
  pages =               {60-67},
  year =                {2012},
  month =               jan,
  doi =                 {10.1145/2090236.2090242},
}
[Pur98] Anuj Puri. Dynamical Properties of Timed Automata. In FTRTFT'98, Lecture Notes in Computer Science 1486, pages 210-227. Springer-Verlag, September 1998. 
@inproceedings{ftrtft1998-Pur,
  author =              {Puri, Anuj},
  title =               {Dynamical Properties of Timed Automata},
  editor =              {Ravn, Anders P. and Rischel, Hans},
  booktitle =           {{P}roceedings of the 5th {F}ormal {T}echniques in
                         {R}eal-Time and {F}ault-Tolerant {S}ystems
                         ({FTRTFT}'98)},
  acronym =             {{FTRTFT}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1486},
  pages =               {210-227},
  year =                {1998},
  month =               sep,
}
[Pur99] Anuj Puri. An Undecidable Problem for Timed Automata. Discrete Event Dynamic Systems 9(2):135-146. Kluwer Academic, May 1999. 
@article{deds9(2)-Pur,
  author =              {Puri, Anuj},
  title =               {An Undecidable Problem for Timed Automata},
  publisher =           {Kluwer Academic},
  journal =             {Discrete Event Dynamic Systems},
  volume =              {9},
  number =              {2},
  pages =               {135-146},
  year =                {1999},
  month =               may,
}
[Pur00] Anuj Puri. Dynamical Properties of Timed Systems. Discrete Event Dynamic Systems 10(1-2):87-113. Kluwer Academic, January 2000. 
@article{deds10(1-2)-Pur,
  author =              {Puri, Anuj},
  title =               {Dynamical Properties of Timed Systems},
  publisher =           {Kluwer Academic},
  journal =             {Discrete Event Dynamic Systems},
  volume =              {10},
  number =              {1-2},
  pages =               {87-113},
  year =                {2000},
  month =               jan,
  doi =                 {10.1023/A:1008387132377},
}
[PV01] Nir Piterman and Moshe Y. Vardi. From Bidirectionality to Alternation. In MFCS'01, Lecture Notes in Computer Science 2136, pages 598-610. Springer-Verlag, August 2001. 
@inproceedings{mfcs2001-PV,
  author =              {Piterman, Nir and Vardi, Moshe Y.},
  title =               {From Bidirectionality to Alternation},
  editor =              {Sgall, Ji{\v r}{\'\i} and Pultr, Ales and Kolman,
                         Petr},
  booktitle =           {{P}roceedings of the 26th {I}nternational
                         {S}ymposium on {M}athematical {F}oundations of
                         {C}omputer {S}cience ({MFCS}'01)},
  acronym =             {{MFCS}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2136},
  pages =               {598-610},
  year =                {2001},
  month =               aug,
}
[PV03] Nir Piterman and Moshe Y. Vardi. From Bidirectionality to Alternation. Theoretical Computer Science 295(1-3):295-321. Elsevier, February 2003. 
@article{tcs295(1-3)-PV,
  author =              {Piterman, Nir and Vardi, Moshe Y.},
  title =               {From Bidirectionality to Alternation},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {295},
  number =              {1-3},
  pages =               {295-321},
  year =                {2003},
  month =               feb,
}
[PW97] Doron A. Peled and Thomas Wilke. Stutter-Invariant Temporal Properties are Expressible Without the Next-time Operator. Information Processing Letters 63(5):243-246. Elsevier, 1997. 
@article{ipl63(5)-PW,
  author =              {Peled, Doron A. and Wilke, Thomas},
  title =               {Stutter-Invariant Temporal Properties are
                         Expressible Without the Next-time Operator},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {63},
  number =              {5},
  pages =               {243-246},
  year =                {1997},
}
[PXZ02] Amir Pnueli, Jessie Xu, and Lenore D. Zuck. Liveness with (0,1,infty)-Counter Abstraction. In CAV'02, Lecture Notes in Computer Science 2404, pages 107-122. Springer-Verlag, July 2002. 
@inproceedings{cav2002-PXZ,
  author =              {Pnueli, Amir and Xu, Jessie and Zuck, Lenore D.},
  title =               {Liveness with {{\((0,1,infty)\)}}-Counter
                         Abstraction},
  editor =              {Brinksma, Ed and Larsen, Kim Guldstrand},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'02)},
  acronym =             {{CAV}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2404},
  pages =               {107-122},
  year =                {2002},
  month =               jul,
  doi =                 {10.1007/3-540-45657-0_9},
}
[PY82] Christos H. Papadimitriou and Mihalis Yannakakis. The Complexity of Facets (and Some Facets of Complexity). In STOC'82, pages 255-260. ACM Press, May 1982. 
@inproceedings{stoc1982-PY,
  author =              {Papadimitriou, {\relax Ch}ristos H. and Yannakakis,
                         Mihalis},
  title =               {The Complexity of Facets (and Some Facets of
                         Complexity)},
  booktitle =           {{P}roceedings of the 14th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'82)},
  acronym =             {{STOC}'82},
  publisher =           {ACM Press},
  pages =               {255-260},
  year =                {1982},
  month =               may,
}
[PZ93] Amir Pnueli and Lenore D. Zuck. In and Out of Temporal Logic. In LICS'93, pages 124-135. IEEE Comp. Soc. Press, June 1993. 
@inproceedings{lics1993-PZ,
  author =              {Pnueli, Amir and Zuck, Lenore D.},
  title =               {In and Out of Temporal Logic},
  booktitle =           {{P}roceedings of the 8th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'93)},
  acronym =             {{LICS}'93},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {124-135},
  year =                {1993},
  month =               jun,
}
[PZM+04] Dan Pei, Beichuan Zhang, Dan Massey, and Lixia Zhang. An Analysis of Path-Vector Routing Protocol Convergence Algorithms. Technical Report TR040009, Computer Science Department, University of California at Los Angeles, USA, March 2004. 
@techreport{UCLA-TR040009,
  author =              {Pei, Dan and Zhang, Beichuan and Massey, Dan and
                         Zhang, Lixia},
  title =               {An Analysis of Path-Vector Routing Protocol
                         Convergence Algorithms},
  number =              {TR040009},
  year =                {2004},
  month =               mar,
  institution =         {Computer Science Department, University of
                         California at Los~Angeles, USA},
  type =                {Technical Report},
}
Q
[QBI04] Michael Melholt Quottrup, Thomas Bak, and Roozbeh Izadi-Zamanabadi. Multi-robot planning: a timed automata approach. In ICRA'04, pages 4417-4422. IEEE Robotics & Automation Soc., April 2004. 
@inproceedings{icra2004-QBI,
  author =              {Quottrup, Michael Melholt and Bak, Thomas and
                         Izadi{-}Zamanabadi, Roozbeh},
  title =               {Multi-robot planning: a~timed automata approach},
  booktitle =           {{P}roceedings of the 2004 {IEEE} {I}nternational
                         {C}onference on {R}obotics and {A}utomation
                         ({ICRA}'04)},
  acronym =             {{ICRA}'04},
  publisher =           {IEEE Robotics~\& Automation Soc.},
  pages =               {4417-4422},
  year =                {2004},
  month =               apr,
  doi =                 {10.1109/ROBOT.2004.1302413},
}
[QS82] Jean-Pierre Queille and Joseph Sifakis. Specification and verification of concurrent systems in CESAR. In SOP'82, Lecture Notes in Computer Science 137, pages 337-351. Springer-Verlag, April 1982. 
@inproceedings{sop1982-QS,
  author =              {Queille, Jean-Pierre and Sifakis, Joseph},
  title =               {Specification and verification of concurrent systems
                         in {CESAR}},
  editor =              {Dezani{-}Ciancaglini, Mariangiola and Montanari,
                         Ugo},
  booktitle =           {{P}roceedings of the 5th {I}nternational {S}ymposium
                         on {P}rogramming ({SOP}'82)},
  acronym =             {{SOP}'82},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {137},
  pages =               {337-351},
  year =                {1982},
  month =               apr,
  doi =                 {10.1007/3-540-11494-7_22},
}
[QS82] Jean-Pierre Queille and Joseph Sifakis. A Temporal Logic to Deal with Fairness in Transition Systems. In FOCS'82, pages 217-225. IEEE Comp. Soc. Press, November 1982. 
@inproceedings{focs1982-QS,
  author =              {Queille, Jean-Pierre and Sifakis, Joseph},
  title =               {A~Temporal Logic to Deal with Fairness in Transition
                         Systems},
  booktitle =           {{P}roceedings of the 23rd {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'82)},
  acronym =             {{FOCS}'82},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {217-225},
  year =                {1982},
  month =               nov,
}
[QS19] Karin Quaas and Mahsa Shirmohammadi. Synchronizing Data Words for Register Automata. ACM Transactions on Computational Logic 20(2):11:1-11:27. ACM Press, April 2019. 
@article{tocl20(2)-QS,
  author =              {Quaas, Karin and Shirmohammadi, Mahsa},
  title =               {Synchronizing Data Words for Register Automata},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Computational Logic},
  volume =              {20},
  number =              {2},
  pages =               {11:1-11:27},
  year =                {2019},
  month =               apr,
  doi =                 {10.1145/3309760},
}
[Qua11] Karin Quaas. MSO logics for weighted timed automata. Formal Methods in System Design 38(3):193-222. Springer-Verlag, June 2011. 
@article{fmsd38(3)-quaas,
  author =              {Quaas, Karin},
  title =               {{MSO} logics for weighted timed automata},
  publisher =           {Springer-Verlag},
  journal =             {Formal Methods in System Design},
  volume =              {38},
  number =              {3},
  pages =               {193-222},
  year =                {2011},
  month =               jun,
  doi =                 {10.1007/s10703-011-0112-6},
}
[Qua11] Karin Quaas. On the Interval-Bound Problem for Weighted Timed Automata. In LATA'11, Lecture Notes in Computer Science 6638, pages 452-464. Springer-Verlag, May 2011. 
@inproceedings{lata2011-quaas,
  author =              {Quaas, Karin},
  title =               {On the Interval-Bound Problem for Weighted Timed
                         Automata},
  editor =              {Dediu, Adrian Horia and Inenaga, Shunsuke and
                         Mart{\'\i}n-Vide, Carlos},
  booktitle =           {{P}roceedings of the 5th {I}nternational
                         {C}onference on {L}anguage and {A}utomata {T}heory
                         and {A}pplications ({LATA}'11)},
  acronym =             {{LATA}'11},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6638},
  pages =               {452-464},
  year =                {2011},
  month =               may,
}
[QYZ+03] Lili Qiu, Richard Yang, Yin Zhang, and Scott Shenker. On selfish routing in internet-like environments. In SIGCOMM'03, pages 151-162. ACM Press, August 2003. 
@inproceedings{sigcomm2003-QYZS,
  author =              {Qiu, Lili and Yang, Richard and Zhang, Yin and
                         Shenker, Scott},
  title =               {On selfish routing in internet-like environments},
  editor =              {Feldmann, Anja and Zitterbart, Martina and
                         Crowcroft, Jon and Wetherall, David},
  booktitle =           {{P}roceedings of {ACM} {SIGCOMM}~2003 {C}onference
                         on {A}pplications, {T}echnologies, {A}rchitectures,
                         and {P}rotocols for {C}omputer {C}ommunication
                         ({SIGCOMM}'03)},
  acronym =             {{SIGCOMM}'03},
  publisher =           {ACM Press},
  pages =               {151-162},
  year =                {2003},
  month =               aug,
  doi =                 {10.1145/863955.863974},
}
[QYZ+06] Lili Qiu, Richard Yang, Yin Zhang, and Scott Shenker. On selfish routing in internet-like environments. IEEE Transactions on Computers 14(4):725-738. IEEE Comp. Soc. Press, August 2006. 
@article{tn14(4)-QYZS,
  author =              {Qiu, Lili and Yang, Richard and Zhang, Yin and
                         Shenker, Scott},
  title =               {On selfish routing in internet-like environments},
  publisher =           {IEEE Comp. Soc. Press},
  journal =             {IEEE Transactions on Computers},
  volume =              {14},
  number =              {4},
  pages =               {725-738},
  year =                {2006},
  month =               aug,
  doi =                 {10.1109/TNET.2006.880179},
}
R
[Rab69] Michael O. Rabin. Decidability of Second-Order Theories and Automata on Infinite Trees. Transactions of the American Mathematical Society 141:1-35. American Mathematical Society, July 1969. 
@article{TAMS141-Rab,
  author =              {Rabin, Michael O.},
  title =               {Decidability of Second-Order Theories and Automata
                         on Infinite Trees},
  publisher =           {American Mathematical Society},
  journal =             {Transactions of the American Mathematical Society},
  volume =              {141},
  pages =               {1-35},
  year =                {1969},
  month =               jul,
}
[Rab70] Michael O. Rabin. Weakly definable relations and special automata. In SMLFST'70, pages 1-23. North-Holland, 1970. 
@inproceedings{smlfst1970-Rab,
  author =              {Rabin, Michael O.},
  title =               {Weakly definable relations and special automata},
  editor =              {Bar{-}Hillel, Yehoshua},
  booktitle =           {{P}roceedings of the {S}ymposium on {M}athematical
                         {L}ogic and {F}oundations of {S}et {T}heory
                         ({SMLFST}'70)},
  acronym =             {{SMLFST}'70},
  publisher =           {North-Holland},
  pages =               {1-23},
  year =                {1970},
}
[Rab72] Michael O. Rabin. Automata on infinite objects and Church's thesis. Regional Conference Series in Mathematics 13. American Mathematical Society, 1972. 
@book{AIOCT1972-Rab,
  author =              {Rabin, Michael O.},
  title =               {Automata on infinite objects and {C}hurch's thesis},
  publisher =           {American Mathematical Society},
  series =              {Regional Conference Series in Mathematics},
  number =              {13},
  year =                {1972},
}
[Rab00] Alexander Rabinovich. Star Free Expressions over the Reals. Theoretical Computer Science 233(1-2):233-245. Elsevier, February 2000. 
@article{tcs233(1-2)-Rab,
  author =              {Rabinovich, Alexander},
  title =               {Star Free Expressions over the Reals},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {233},
  number =              {1-2},
  pages =               {233-245},
  year =                {2000},
  month =               feb,
}
[Rab02] Alexander Rabinovich. Expressive Power of Temporal Logic. In CONCUR'02, Lecture Notes in Computer Science 2421, pages 57-75. Springer-Verlag, August 2002. 
@inproceedings{concur2002-Rab,
  author =              {Rabinovich, Alexander},
  title =               {Expressive Power of Temporal Logic},
  editor =              {Brim, Lubo{\v s} and Jan{\v c}ar, Petr and K{\v
                         r}et{\'\i}nsk{\'y}, Mojm{\'\i}r and Ku{\v c}era,
                         Anton{\'\i}n},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'02)},
  acronym =             {{CONCUR}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2421},
  pages =               {57-75},
  year =                {2002},
  month =               aug,
}
[Rab03] Alexander Rabinovich. Quantitative analysis of probabilistic lossy channel systems. In ICALP'03, Lecture Notes in Computer Science 2719, pages 1008-1021. Springer-Verlag, June 2003. 
@inproceedings{icalp2003-Rab,
  author =              {Rabinovich, Alexander},
  title =               {Quantitative analysis of probabilistic lossy channel
                         systems},
  editor =              {Baeten, Jos C. M. and Lenstra, Jan Karel and Parrow,
                         Joachim and Woeginger, Gerhard J.},
  booktitle =           {{P}roceedings of the 30th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'03)},
  acronym =             {{ICALP}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2719},
  pages =               {1008-1021},
  year =                {2003},
  month =               jun,
}
[Rab03] Alexander Rabinovich. Automata over Continuous Time. Theoretical Computer Science 300(1-3):331-363. Elsevier, May 2003. 
@article{tcs300(1-3)-Rab,
  author =              {Rabinovich, Alexander},
  title =               {Automata over Continuous Time},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {300},
  number =              {1-3},
  pages =               {331-363},
  year =                {2003},
  month =               may,
}
[Rab08] Roman Rabinovich. Complexity Measures for Directed Graphs. Diplomarbeit, RWTH Aachen, Germany, August 2008. 
@mastersthesis{diplom08-Rab,
  author =              {Rabinovich, Roman},
  title =               {Complexity Measures for Directed Graphs},
  year =                {2008},
  month =               aug,
  school =              {RWTH Aachen, Germany},
  type =                {Diplomarbeit},
}
[Rac78] Charles Rackoff. The Covering and Boundedness Problems for Vector Addition Systems. Theoretical Computer Science 6:223-231. Elsevier, 1978. 
@article{tcs6()-Rac,
  author =              {Rackoff, Charles},
  title =               {The Covering and Boundedness Problems for Vector
                         Addition Systems},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {6},
  pages =               {223-231},
  year =                {1978},
  doi =                 {10.1016/0304-3975(78)90036-1},
}
[Rah09] George Rahonis. Fuzzy Languages. In Manfred Droste, Werner Kuich, and Walter Vogler (eds.), Handbook of Weighted Automata. Springer-Verlag, 2009. 
@incollection{hwa-ch12-Rah,
  author =              {Rahonis, George},
  title =               {Fuzzy Languages},
  editor =              {Droste, Manfred and Kuich, Werner and Vogler,
                         Walter},
  booktitle =           {Handbook of Weighted Automata},
  publisher =           {Springer-Verlag},
  pages =               {481-517},
  chapter =             {12},
  year =                {2009},
  doi =                 {10.1007/978-3-642-01492-5 12},
}
[Ram98] Jorge Luis Ramírez Alfonsín. On Variations of the Subset Sum Problem. Discrete Applied Mathematics 81(1-3):1-7. Elsevier, January 1998. 
@article{dam81(1-3)-Ram,
  author =              {Ram{\'\i}rez{ }Alfons{\'\i}n, Jorge Luis},
  title =               {On Variations of the Subset Sum Problem},
  publisher =           {Elsevier},
  journal =             {Discrete Applied Mathematics},
  volume =              {81},
  number =              {1-3},
  pages =               {1-7},
  year =                {1998},
  month =               jan,
}
[Ram98] Solofo Ramangalahi. Strategies for comformance testing. Research Report 98-010, Max-Planck Institut für Informatik, Germany, May 1998. 
@techreport{mpi-i-98-010-Ram,
  author =              {Ramangalahi, Solofo},
  title =               {Strategies for comformance testing},
  number =              {98-010},
  year =                {1998},
  month =               may,
  institution =         {Max-Planck Institut f{\"u}r Informatik, Germany},
  type =                {Research Report},
}
[Ras99] Jean-François Raskin. Logics, Automata and Classical theories for Deciding Real Time. Thèse de doctorat, FUNDP, Namur, Belgium, June 1999. 
@phdthesis{phd-raskin,
  author =              {Raskin, Jean-Fran{\c c}ois},
  title =               {Logics, Automata and Classical theories for Deciding
                         Real Time},
  year =                {1999},
  month =               jun,
  school =              {FUNDP, Namur, Belgium},
  type =                {Th\`ese de doctorat},
}
[RB98] Theo C. Ruys and Ed Brinksma. Experience with Literate Programming in the Modelling and Validation of Systems. In TACAS'98, Lecture Notes in Computer Science 1384, pages 393-407. Springer-Verlag, March 1998. 
@inproceedings{tacas1998-RB,
  author =              {Ruys, Theo C. and Brinksma, Ed},
  title =               {Experience with Literate Programming in the
                         Modelling and Validation of Systems},
  editor =              {Steffen, Bernhard},
  booktitle =           {{P}roceedings of the 4th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'98)},
  acronym =             {{TACAS}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1384},
  pages =               {393-407},
  year =                {1998},
  month =               mar,
}
[RBL07] Jacob Illum Rasmussen, Gerd Behrmann, and Kim Guldstrand Larsen. Complexity in Simplicity: Flexible Agent-Based State Space Exploration. In TACAS'07, Lecture Notes in Computer Science 4424, pages 231-245. Springer-Verlag, March 2007. 
@inproceedings{tacas2007-RBL,
  author =              {Rasmussen, Jacob Illum and Behrmann, Gerd and
                         Larsen, Kim Guldstrand},
  title =               {Complexity in Simplicity: Flexible Agent-Based State
                         Space Exploration},
  editor =              {Grumberg, Orna and Huth, Michael},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'07)},
  acronym =             {{TACAS}'07},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4424},
  pages =               {231-245},
  year =                {2007},
  month =               mar,
  doi =                 {10.1007/978-3-540-71209-1_19},
}
[Rei84] John H. Reif. The Complexity of Two-Player Games of Incomplete Information. Journal of Computer and System Sciences 29(2):274-301. Academic Press, October 1984. 
@article{jsl66(3)-Reif,
  author =              {Reif, John H.},
  title =               {The Complexity of Two-Player Games of Incomplete
                         Information},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {29},
  number =              {2},
  pages =               {274-301},
  year =                {1984},
  month =               oct,
}
[Rei13] Julien Reichert. On The Complexity of Counter Reachability Games. In RP'13, Lecture Notes in Computer Science 8169, pages 196-208. Springer-Verlag, September 2013. 
@inproceedings{rp2013-Rei,
  author =              {Reichert, Julien},
  title =               {On The Complexity of Counter Reachability Games},
  editor =              {Abdulla, Parosh Aziz and Potapov, Igor},
  booktitle =           {{P}roceedings of the 7th {W}orkshop on
                         {R}eachability {P}roblems in {C}omputational
                         {M}odels ({RP}'13)},
  acronym =             {{RP}'13},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8169},
  pages =               {196-208},
  year =                {2013},
  month =               sep,
  doi =                 {10.1007/978-3-642-41036-9_18},
}
[Rei16] Julien Reichert. On The Complexity of Counter Reachability Games. Fundamenta Informaticae 143(3-4):415-436. IOS Press, 2016. 
@article{fundi143(3-4)-Rei,
  author =              {Reichert, Julien},
  title =               {On The Complexity of Counter Reachability Games},
  publisher =           {IOS Press},
  journal =             {Fundamenta Informaticae},
  volume =              {143},
  number =              {3-4},
  pages =               {415-436},
  year =                {2016},
  doi =                 {10.3233/FI-2016-1320},
}
[Rey99] Mark Reynolds. The Complexity of Temporal Logic over the Reals. Research Report cs.LO/9910012, arXiv, October 1999. 
@techreport{arxiv-cs.LO/9910012,
  author =              {Reynolds, Mark},
  title =               {The Complexity of Temporal Logic over the Reals},
  number =              {cs.LO/9910012},
  year =                {1999},
  month =               oct,
  institution =         {arXiv},
  type =                {Research Report},
}
[Rey01] Mark Reynolds. An Axiomatization of Full Computation Tree Logic. Journal of Symbolic Logic 66(3):1011-1057. Association for Symbolic Logic, September 2001. 
@article{jsl66(3)-Rey,
  author =              {Reynolds, Mark},
  title =               {An Axiomatization of Full Computation Tree Logic},
  publisher =           {Association for Symbolic Logic},
  journal =             {Journal of Symbolic Logic},
  volume =              {66},
  number =              {3},
  pages =               {1011-1057},
  year =                {2001},
  month =               sep,
}
[Rey04] Mark Reynolds. The Complexity of the Temporal Logic with "Until" Over General Linear Time. Journal of Computer and System Sciences 66(2):393-426. Academic Press, March 2004. 
@article{jcss66(2)-Rey,
  author =              {Reynolds, Mark},
  title =               {The Complexity of the Temporal Logic with
                         {"}Until{"} Over General Linear Time},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {66},
  number =              {2},
  pages =               {393-426},
  year =                {2004},
  month =               mar,
}
[Rey05] Mark Reynolds. An Axiomatization of PCTL*. Information and Computation 201(1):72-119. Academic Press, August 2005. 
@article{icomp201(1)-Rey,
  author =              {Reynolds, Mark},
  title =               {An Axiomatization of {PCTL}{\(^*\)}},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {201},
  number =              {1},
  pages =               {72-119},
  year =                {2005},
  month =               aug,
}
[Rey07] Pierre-Alain Reynier. Vérification de systèmes temporisés et distribués : modèles, algorithmes et implémentabilité. PhD thesis, Lab. Spécification & Vérification, ENS Cachan, France, June 2007. 
@phdthesis{phd-reynier,
  author =              {Reynier, Pierre-Alain},
  title =               {V{\'e}rification de syst{\`e}mes temporis{\'e}s et
                         distribu{\'e}s~: mod{\`e}les, algorithmes et
                         impl{\'e}mentabilit{\'e}},
  year =                {2007},
  month =               jun,
  school =              {Lab.~Sp\'ecification \& V\'erification, ENS Cachan,
                         France},
}
[Rey10] Mark Reynolds. The Complexity of Temporal Logic over the Reals. Annals of Pure and Applied Logic 161(8):1063-1096. Elsevier, May 2010. 
@article{apal161(8)-Rey,
  author =              {Reynolds, Mark},
  title =               {The Complexity of Temporal Logic over the Reals},
  publisher =           {Elsevier},
  journal =             {Annals of Pure and Applied Logic},
  volume =              {161},
  number =              {8},
  pages =               {1063-1096},
  year =                {2010},
  month =               may,
}
[RG01] Muriel Roger and Jean Goubault-Larrecq. Log Auditing through Model-Checking. In CSFW'01, pages 220-236. IEEE Comp. Soc. Press, June 2001. 
@inproceedings{csfw2001-RG,
  author =              {Roger, Muriel and Goubault{-}Larrecq, Jean},
  title =               {Log Auditing through Model-Checking},
  booktitle =           {{P}roceedings of the 14th {IEEE} {C}omputer
                         {S}cience {F}oundations {W}orkshop ({CSFW}'01)},
  acronym =             {{CSFW}'01},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {220-236},
  year =                {2001},
  month =               jun,
}
[RJL+10] Christopher Thomas Ryan, Albert Xin Jiang, and Kevin Leyton-Brown. Symmetric Games with Piecewise Linear Utilities. In BQGT'10. ACM Press, May 2010. 
@inproceedings{bqgt10-RJL,
  author =              {Ryan, Christopher Thomas and Jiang, Albert Xin and
                         Leyton-Brown, Kevin},
  title =               {Symmetric Games with Piecewise Linear Utilities},
  editor =              {Dror, Moshe and So{\v{s}}i{\'c}, Greys},
  booktitle =           {{P}roceedings of the {B}ehavioral and {Q}uantitative
                         {G}ame {T}heory: {C}onference on {F}uture
                         {D}irections ({BQGT}'10)},
  acronym =             {{BQGT}'10},
  publisher =           {ACM Press},
  year =                {2010},
  month =               may,
  doi =                 {10.1145/1807406.1807447},
}
[RK97] Jürgen Ruf and Thomas Kropf. A New Algorithm for Discrete Timed Symbolic Model Checking. In HART'97, Lecture Notes in Computer Science 1201, pages 18-32. Springer-Verlag, March 1997. 
@inproceedings{hart1997-RK,
  author =              {Ruf, J{\"u}rgen and Kropf, {\relax Th}omas},
  title =               {A New Algorithm for Discrete Timed Symbolic Model
                         Checking},
  editor =              {Maler, Oded},
  booktitle =           {{P}roceedings of the 1997 {I}nternational {W}orkshop
                         on {H}ybrid and {R}eal-Time {S}ystems ({HART}'97)},
  acronym =             {{HART}'97},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1201},
  pages =               {18-32},
  year =                {1997},
  month =               mar,
}
[RK00] Jürgen Ruf and Thomas Kropf. Analyzing Real-Time Systems. In DATE'00, pages 243-248. IEEE Comp. Soc. Press, March 2000. 
@inproceedings{date2000-RK,
  author =              {Ruf, J{\"u}rgen and Kropf, {\relax Th}omas},
  title =               {Analyzing Real-Time Systems},
  booktitle =           {{P}roceedings of the 2000 {D}esign, {A}utomation and
                         {T}est in {E}urope ({DATE}'00)},
  acronym =             {{DATE}'00},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {243-248},
  year =                {2000},
  month =               mar,
}
[RLS06] Jacob Illum Rasmussen, Kim Guldstrand Larsen, and K. Subramani. On using priced timed automata to achieve optimal scheduling. Formal Methods in System Design 29(1):97-114. Springer-Verlag, July 2006. 
@article{fmsd29(1)-RLS,
  author =              {Rasmussen, Jacob Illum and Larsen, Kim Guldstrand
                         and Subramani, K.},
  title =               {On using priced timed automata to achieve optimal
                         scheduling},
  publisher =           {Springer-Verlag},
  journal =             {Formal Methods in System Design},
  volume =              {29},
  number =              {1},
  pages =               {97-114},
  year =                {2006},
  month =               jul,
  doi =                 {10.1007/s10703-006-0014-1},
}
[RM00] Alexander Rabinovich and Shahar Maoz. Why so many Temporal Logics Climb un the Trees?. In MFCS'00, Lecture Notes in Computer Science 1893, pages 629-639. Springer-Verlag, August 2000. 
@inproceedings{mfcs2000-RM,
  author =              {Rabinovich, Alexander and Maoz, Shahar},
  title =               {Why so many Temporal Logics Climb un the Trees?},
  editor =              {Nielsen, Mogens and Rovan, Branislav},
  booktitle =           {{P}roceedings of the 25th {I}nternational
                         {S}ymposium on {M}athematical {F}oundations of
                         {C}omputer {S}cience ({MFCS}'00)},
  acronym =             {{MFCS}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1893},
  pages =               {629-639},
  year =                {2000},
  month =               aug,
}
[RM01] Alexander Rabinovich and Shahar Maoz. An Infinite Hierarchy of Temporal Logics over Branching Time. Information and Computation 171(2):306-332. Academic Press, December 2001. 
@article{icomp171(2)-RM,
  author =              {Rabinovich, Alexander and Maoz, Shahar},
  title =               {An Infinite Hierarchy of Temporal Logics over
                         Branching Time},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {171},
  number =              {2},
  pages =               {306-332},
  year =                {2001},
  month =               dec,
}
[RMD+92] Y. Srinivas Ramakrishna, Louise E. Moser, Laura K. Dillon, P. Michael Melliar-Smith, and George Kutty. An Automata Theoretic Decision Procedure for Propositional Temporal Logic with Since and Until. Fundamenta Informaticae 17(3):272-282. IOS Press, November 1992. 
@article{fundi17(3)-RMDMK,
  author =              {Ramakrishna, Y. Srinivas and Moser, Louise E. and
                         Dillon, Laura K. and Melliar{-}Smith, P. Michael and
                         Kutty, George},
  title =               {An Automata Theoretic Decision Procedure for
                         Propositional Temporal Logic with Since and Until},
  publisher =           {IOS Press},
  journal =             {Fundamenta Informaticae},
  volume =              {17},
  number =              {3},
  pages =               {272-282},
  year =                {1992},
  month =               nov,
}
[RN95] Stuart J. Russell and Peter Norvig. Artificial Intelligence – A modern approach. Prentice Hall, 1995. 
@book{RN95-AIMA,
  author =              {Russell, Stuart J. and Norvig, Peter},
  title =               {Artificial Intelligence~-- A~modern approach},
  publisher =           {Prentice Hall},
  year =                {1995},
}
[Rog03] Muriel Roger. Raffinements de la résolution et vérification de protocoles cryptographiques. Thèse de doctorat, Lab. Spécification & Vérification, ENS Cachan, France, October 2003. 
@phdthesis{phd-roger,
  author =              {Roger, Muriel},
  title =               {Raffinements de la r{\'e}solution et
                         v{\'e}rification de protocoles cryptographiques},
  year =                {2003},
  month =               oct,
  school =              {Lab.~Sp\'ecification \& V\'erification, ENS Cachan,
                         France},
  type =                {Th\`ese de doctorat},
}
[Roh97] Scott Rohde. Alternating automata and the temporal logic of ordinals. PhD thesis, University of Illinois, 1997. 
@phdthesis{phd-rohde,
  author =              {Rohde, Scott},
  title =               {Alternating automata and the temporal logic of
                         ordinals},
  year =                {1997},
  school =              {University of Illinois},
}
[Ros67] Pierre Rosenstiehl. Theory of Graphs. Gordon and Breach Science Publishers, 1967. 
@book{ToG-Ros67,
  title =               {Theory of Graphs},
  editor =              {Rosenstiehl, Pierre},
  booktitle =           {Theory of Graphs},
  publisher =           {Gordon and Breach Science Publishers},
  year =                {1967},
}
[Ros73] Robert W. Rosenthal. A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory 2(1):65-67. Springer-Verlag, December 1973. 
@article{ijgt2(1)-Ros,
  author =              {Rosenthal, Robert W.},
  title =               {A~class of games possessing pure-strategy {N}ash
                         equilibria},
  publisher =           {Springer-Verlag},
  journal =             {International Journal of Game Theory},
  volume =              {2},
  number =              {1},
  pages =               {65-67},
  year =                {1973},
  month =               dec,
  doi =                 {10.1007/BF01737559},
}
[Ros73] Robert W. Rosenthal. The network equilibrium problem in integers. Networks 3(1):53-59. John Wiley & Sons, January 1973. 
@article{netw3(1)-Ros,
  author =              {Rosenthal, Robert W.},
  title =               {The network equilibrium problem in integers},
  publisher =           {John Wiley \& Sons},
  journal =             {Networks},
  volume =              {3},
  number =              {1},
  pages =               {53-59},
  year =                {1973},
  month =               jan,
  doi =                 {10.1002/net.3230030104},
}
[Ros03] Laurent Rosaz. The word problem for 1LC congruences is NP-hard. Theoretical Computer Science 306(1-3):245-268. Elsevier, September 2003. 
@article{tcs306(1-3)-Ros,
  author =              {Rosaz, Laurent},
  title =               {The word problem for {\(1\mathcal{LC}\)} congruences
                         is {NP}-hard},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {306},
  number =              {1-3},
  pages =               {245-268},
  year =                {2003},
  month =               sep,
}
[Rot02] Günter Rote. Crossing the Bridge at Night. EATCS Bulletin 78:241-246. EATCS, October 2002. 
@article{eatcs-bull78()-Rot,
  author =              {Rote, G{\"u}nter},
  title =               {Crossing the Bridge at Night},
  publisher =           {EATCS},
  journal =             {EATCS Bulletin},
  volume =              {78},
  pages =               {241-246},
  year =                {2002},
  month =               oct,
}
[Rou07] Tim Roughgarden. Routing games. In Noam Nisan, Tim Roughgarden, Éva Tardos, and Vijay V. Vazirani (eds.), Algorithmic Game Theory. Cambridge University Press, 2007. 
@incollection{agt2007-ch18-Rou,
  author =              {Roughgarden, Tim},
  title =               {Routing games},
  editor =              {Nisan, Noam and Roughgarden, Tim and Tardos, {\'E}va
                         and Vazirani, Vijay V.},
  booktitle =           {Algorithmic Game Theory},
  publisher =           {Cambridge University Press},
  pages =               {461-486},
  chapter =             {18},
  year =                {2007},
}
[Rou20] Victor Roussanaly. Efficient verification of real-time systems. Thèse de doctorat, Université Rennes 1, France, November 2020. 
@phdthesis{phd-roussanaly,
  author =              {Roussanaly, Victor},
  title =               {Efficient verification of real-time systems},
  year =                {2020},
  month =               nov,
  school =              {Universit{\'e} Rennes~1, France},
  type =                {Th\`ese de doctorat},
}
[RP86] Roni Rosner and Amir Pnueli. A Choppy Logic. In LICS'86, pages 306-313. IEEE Comp. Soc. Press, June 1986. 
@inproceedings{lics1986-RP,
  author =              {Rosner, Roni and Pnueli, Amir},
  title =               {A Choppy Logic},
  booktitle =           {{P}roceedings of the 1st {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'86)},
  acronym =             {{LICS}'86},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {306-313},
  year =                {1986},
  month =               jun,
}
[RP03] Stéphane Riedweg and Sophie Pinchinat. Quantified μ-Calculus for Control Synthesis. In MFCS'03, Lecture Notes in Computer Science 2747, pages 642-651. Springer-Verlag, August 2003. 
@inproceedings{mfcs2003-RP,
  author =              {Riedweg, St{\'e}phane and Pinchinat, Sophie},
  title =               {Quantified {{\(\mu\)}}-Calculus for Control
                         Synthesis},
  editor =              {Rovan, Branislav and Vojt{\'a}s, Peter},
  booktitle =           {{P}roceedings of the 28th {I}nternational
                         {S}ymposium on {M}athematical {F}oundations of
                         {C}omputer {S}cience ({MFCS}'03)},
  acronym =             {{MFCS}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2747},
  pages =               {642-651},
  year =                {2003},
  month =               aug,
  doi =                 {10.1007/978-3-540-45138-9_58},
}
[RP03] Stéphane Riedweg and Sophie Pinchinat. Quantified Loop-mu-calculus for Control under Partial Observation. Research Report 4949, IRISA, September 2003. 
@techreport{inria4949-RP,
  author =              {Riedweg, St{\'e}phane and Pinchinat, Sophie},
  title =               {Quantified Loop-mu-calculus for Control under
                         Partial Observation},
  number =              {4949},
  year =                {2003},
  month =               sep,
  institution =         {IRISA},
  type =                {Research Report},
}
[RP03] Stéphane Riedweg and Sophie Pinchinat. Quantified Mu-calculus for Control Synthesis. Research Report 4793, IRISA, April 2003. 
@techreport{inria4793-RP,
  author =              {Riedweg, St{\'e}phane and Pinchinat, Sophie},
  title =               {Quantified Mu-calculus for Control Synthesis},
  number =              {4793},
  year =                {2003},
  month =               apr,
  institution =         {IRISA},
  type =                {Research Report},
}
[RPV17] Nima Roohi, Pavithra Prabhakar, and Mahesh Viswanathan. Robust model checking of timed automata under clock drifts. In HSCC'17, pages 153-162. ACM Press, April 2017. 
@inproceedings{hscc2017-RPV,
  author =              {Roohi, Nima and Prabhakar, Pavithra and Viswanathan,
                         Mahesh},
  title =               {Robust model checking of timed automata under clock
                         drifts},
  editor =              {Frehse, Goran and Mitra, Sayan},
  booktitle =           {{P}roceedings of the 20th {I}nternational {W}orkshop
                         on {H}ybrid {S}ystems: {C}omputation and {C}ontrol
                         ({HSCC}'14)},
  acronym =             {{HSCC}'17},
  publisher =           {ACM Press},
  pages =               {153-162},
  year =                {2017},
  month =               apr,
  doi =                 {10.1145/3049797.3049821},
}
[RR95] Olivier F. Roux and Vlad Rusu. Deciding time-bounded properties for ELECTRE reactive programs with stopwatch automata. In HSCC'94, Lecture Notes in Computer Science 999, pages 405-416. Springer-Verlag, 1995. 
@inproceedings{hscc1994-RR,
  author =              {Roux, Olivier F. and Rusu, Vlad},
  title =               {Deciding time-bounded properties for {ELECTRE}
                         reactive programs with stopwatch automata},
  editor =              {Antsaklis, Panos and Kohn, Wolf and Nerode, Anil and
                         Sastry, Shankar},
  booktitle =           {{H}ybrid {S}ystems~{II} ({HSCC}'94)},
  acronym =             {{HSCC}'94},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {999},
  pages =               {405-416},
  year =                {1995},
}
[RRD+07] Talal Rahwan, Sarvapali D. Ramchurn, Viet Dung Dang, Andrea Giovannucci, and Nicholas R. Jennings. Anytime Optimal Coalition Structure Generation. In AAAI-IAAI'07, pages 1184-1190. AAAI Press, July 2007. 
@inproceedings{aaai2007-RRDGJ,
  author =              {Rahwan, Talal and Ramchurn, Sarvapali D. and Dung
                         Dang, Viet and Giovannucci, Andrea and Jennings,
                         Nicholas R.},
  title =               {Anytime Optimal Coalition Structure Generation},
  booktitle =           {{P}roceedings of the 22nd {N}ational {C}onference on
                         {A}rtificial {I}ntelligence ({AAAI}'07) and 19th
                         {I}nnovative {A}pplications of {A}rtificial
                         {I}ntelligence {C}onference ({IAAI}'07)},
  acronym =             {{AAAI-IAAI}'07},
  publisher =           {AAAI Press},
  pages =               {1184-1190},
  year =                {2007},
  month =               jul,
}
[RS84] Neil Robertson and Paul D. Seymour. Graph minors III: Planar tree-width. Journal of Combinatorial Theory, series B 86(1):49-64. Elsevier, February 1984. 
@article{jctB36(1)-RS,
  author =              {Robertson, Neil and Seymour, Paul D.},
  title =               {Graph minors~{III}: Planar tree-width},
  publisher =           {Elsevier},
  journal =             {Journal of Combinatorial Theory, series~{B}},
  volume =              {86},
  number =              {1},
  pages =               {49-64},
  year =                {1984},
  month =               feb,
  doi =                 {10.1016/0095-8956(84)90013-3},
}
[RS86] Neil Robertson and Paul D. Seymour. Graph minors II: Algorithmic aspects of tree-width. Journal of Algorithms 7(3):309-322. Elsevier, September 1986. 
@article{ja7(3)-RS,
  author =              {Robertson, Neil and Seymour, Paul D.},
  title =               {Graph minors~{II}: Algorithmic aspects of
                         tree-width},
  publisher =           {Elsevier},
  journal =             {Journal of Algorithms},
  volume =              {7},
  number =              {3},
  pages =               {309-322},
  year =                {1986},
  month =               sep,
  doi =                 {10.1016/0196-6774(86)90023-4},
}
[RS97] Jean-François Raskin and Pierre-Yves Schobbens. State Clock Logic: A Decidable Real-Time Logic. In HART'97, Lecture Notes in Computer Science 1201, pages 33-47. Springer-Verlag, March 1997. 
@inproceedings{hart1997-RS,
  author =              {Raskin, Jean-Fran{\c c}ois and Schobbens,
                         Pierre-Yves},
  title =               {State Clock Logic: A~Decidable Real-Time Logic},
  editor =              {Maler, Oded},
  booktitle =           {{P}roceedings of the 1997 {I}nternational {W}orkshop
                         on {H}ybrid and {R}eal-Time {S}ystems ({HART}'97)},
  acronym =             {{HART}'97},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1201},
  pages =               {33-47},
  year =                {1997},
  month =               mar,
}
[RS99] Jean-François Raskin and Pierre-Yves Schobbens. The Logic of Event-Clocks: Decidability, Complexity and Expressiveness. Journal of Automata, Languages and Combinatorics 4(3):247-286. 1999. 
@article{jalc4(3)-RS,
  author =              {Raskin, Jean-Fran{\c c}ois and Schobbens,
                         Pierre-Yves},
  title =               {The Logic of Event-Clocks: Decidability, Complexity
                         and Expressiveness},
  journal =             {Journal of Automata, Languages and Combinatorics},
  volume =              {4},
  number =              {3},
  pages =               {247-286},
  year =                {1999},
}
[RS06] Alexander Rabinovich and Philippe Schnoebelen. BTL2 and Expressive Completeness for ECTL+. Information and Computation 204(7):1023-1044. Elsevier, July 2006. 
@article{icomp204(7)-RS,
  author =              {Rabinovich, Alexander and Schnoebelen, {\relax
                         Ph}ilippe},
  title =               {{BTL}{\(_2\)} and Expressive Completeness for
                         {ECTL}{\(^+\)}},
  publisher =           {Elsevier},
  journal =             {Information and Computation},
  volume =              {204},
  number =              {7},
  pages =               {1023-1044},
  year =                {2006},
  month =               jul,
}
[RS08] R. Ramanujam and Sunil Simon. Dynamic Logic on Games with Structured Strategies. In KR'08, pages 49-58. AAAI Press, September 2008. 
@inproceedings{kr2008-RS,
  author =              {Ramanujam, R. and Simon, Sunil},
  title =               {Dynamic Logic on Games with Structured Strategies},
  editor =              {Brewka, Gerhard and Lang, J{\'e}r{\^o}me},
  booktitle =           {{P}roceedings of the 11th {I}nternational
                         {C}onference on {P}rinciples of {K}nowledge
                         {R}epresentation and {R}easoning ({KR}'08)},
  acronym =             {{KR}'08},
  publisher =           {AAAI Press},
  pages =               {49-58},
  year =                {2008},
  month =               sep,
}
[RSM19] Victor Roussanaly, Ocan Sankur, and Nicolas Markey. Abstraction Refinement Algorithms for Timed Automata. In CAV'19, Lecture Notes in Computer Science 11561, pages 22-40. Springer-Verlag, July 2019.
Abstract

We present abstraction-refinement algorithms for model checking safety properties of timed automata. The abstraction domain we consider abstracts away zones by restricting the set of clock constraints that can be used to define them, while the refinement procedure computes the set of constraints that must be taken into consideration in the abstraction so as to exclude a given spurious counterexample. We implement this idea in two ways: an enumerative algorithm where a lazy abstraction approach is adopted, meaning that possibly different abstract domains are assigned to each exploration node; and a symbolic algorithm where the abstract transition system is encoded with Boolean formulas.

@inproceedings{cav2019-RSM,
  author =              {Roussanaly, Victor and Sankur, Ocan and Markey,
                         Nicolas},
  title =               {Abstraction Refinement Algorithms for Timed
                         Automata},
  editor =              {Dillig, I{\c s}il and Ta{\c s}iran, Serdar},
  booktitle =           {{P}roceedings of the 31st {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'19)},
  acronym =             {{CAV}'19},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {11561},
  pages =               {22-40},
  year =                {2019},
  month =               jul,
  doi =                 {10.1007/978-3-030-25540-4_2},
  abstract =            {We~present abstraction-refinement algorithms for
                         model checking safety properties of timed automata.
                         The~abstraction domain we consider abstracts away
                         zones by restricting the set of clock constraints
                         that can be used to define them, while the
                         refinement procedure computes the set of constraints
                         that must be taken into consideration in the
                         abstraction so as to exclude a given spurious
                         counterexample. We~implement this idea in two~ways:
                         an~enumerative algorithm where a lazy abstraction
                         approach is adopted, meaning that possibly different
                         abstract domains are assigned to each exploration
                         node; and a symbolic algorithm where the abstract
                         transition system is encoded with Boolean formulas.},
}
[RT98] Jérôme Renault and Tristan Tomala. Repeated proximity games. International Journal of Game Theory 27(4):539-559. Springer-Verlag, December 1998. 
@article{ijgt27(4)-RT,
  author =              {Renault, J{\'e}r{\^o}me and Tomala, Tristan},
  title =               {Repeated proximity games},
  publisher =           {Springer-Verlag},
  journal =             {International Journal of Game Theory},
  volume =              {27},
  number =              {4},
  pages =               {539-559},
  year =                {1998},
  month =               dec,
}
[RT01] Michaël Rusinowitch and Mathieu Turuani. Protocol Insecurity with Finite Number of Sessions is NP-complete. Research Report 4134, LORIA, Nancy, France, March 2001. 
@techreport{inria4134-RT,
  author =              {Rusinowitch, Micha{\"e}l and Turuani, Mathieu},
  title =               {Protocol Insecurity with Finite Number of Sessions
                         is {NP}-complete},
  number =              {4134},
  year =                {2001},
  month =               mar,
  institution =         {LORIA, Nancy, France},
  type =                {Research Report},
}
[RT02] Tim Roughgarden and Éva Tardos. How bad is selfish routing?. Journal of the ACM 49(2):236-259. ACM Press, March 2002. 
@article{jacm49(2)-RT,
  author =              {Roughgarden, Tim and Tardos, {\'E}va},
  title =               {How bad is selfish routing?},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {49},
  number =              {2},
  pages =               {236-259},
  year =                {2002},
  month =               mar,
  doi =                 {10.1145/506147.506153},
}
[RT04] Tim Roughgarden and Éva Tardos. Bounding the inefficiency of equilibria in non-atomic congestion games. Games and Economic Behavior 47(2):389-403. May 2004. 
@article{geb47(2)-RT,
  author =              {Roughgarden, Tim and Tardos, {\'E}va},
  title =               {Bounding the inefficiency of equilibria in
                         non-atomic congestion games},
  journal =             {Games and Economic Behavior},
  volume =              {47},
  number =              {2},
  pages =               {389-403},
  year =                {2004},
  month =               may,
  doi =                 {10.1016/j.geb.2003.06.004},
}
[RT08] Frank G. Radmacher and Wolfgang Thomas. A Game Theoretic Approach to the Analysis of Dynamic Networks. In VerAS'07, Electronic Notes in Theoretical Computer Science 200(2), pages 21-37. Elsevier, February 2008. 
@inproceedings{veras2007-RT,
  author =              {Radmacher, Frank G. and Thomas, Wolfgang},
  title =               {A~Game Theoretic Approach to the Analysis of Dynamic
                         Networks},
  editor =              {Ballis, Demis and Escobar, Santiago and Marchiori,
                         Massimo},
  booktitle =           {{P}roceedings of the 1st {W}orkshop on
                         {V}erification of {A}daptive {S}ystems ({VerAS}'07)},
  acronym =             {{VerAS}'07},
  publisher =           {Elsevier},
  series =              {Electronic Notes in Theoretical Computer Science},
  volume =              {200(2)},
  pages =               {21-37},
  year =                {2008},
  month =               feb,
  confyear =            {2007},
}
[Ruf01] Jürgen Ruf. RAVEN: Real-Time Analyzing and Verification Environment. Journal of Universal Computer Science 7(1):89-104. Know-Center, Technische Universität Graz, Austria, January 2001. 
@article{jucs7(1)-Ruf,
  author =              {Ruf, J{\"u}rgen},
  title =               {{RAVEN}: {R}eal-Time Analyzing and Verification
                         Environment},
  publisher =           {Know-Center, Technische Universit{\"a}t Graz,
                         Austria},
  journal =             {Journal of Universal Computer Science},
  volume =              {7},
  number =              {1},
  pages =               {89-104},
  year =                {2001},
  month =               jan,
}
[Rut01] Éric Rutten. A Framework for Using Discrete Control Synthesis in Safe Robotic Programming and Teleoperation. In ICRA'01, pages 4104-4109. IEEE Comp. Soc. Press, May 2001. 
@inproceedings{icra2001-Rut,
  author =              {Rutten, {\'E}ric},
  title =               {A Framework for Using Discrete Control Synthesis in
                         Safe Robotic Programming and Teleoperation},
  booktitle =           {{P}roceedings of the 2001 {IEEE} {I}nternational
                         {C}onference on {R}obotics and {A}utomation
                         ({ICRA}'01)},
  acronym =             {{ICRA}'01},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {4104-4109},
  year =                {2001},
  month =               may,
}
[Rut11] Michał Rutkowski. Two-Player Reachability-Price Games on Single-Clock Timed Automata. In QAPL'11, Electronic Proceedings in Theoretical Computer Science 57, pages 31-46. Massink, Mieke and Norman, Gethin, April 2011. 
@inproceedings{qapl2011-Rut,
  author =              {Rutkowski, Micha{\l}},
  title =               {Two-Player Reachability-Price Games on Single-Clock
                         Timed Automata},
  booktitle =           {{P}roceedings of the 9th {W}orkshop on
                         {Q}uantitative {A}spects of {P}rogramming
                         {L}anguages ({QAPL}'11)},
  acronym =             {{QAPL}'11},
  publisher =           {Massink, Mieke and Norman, Gethin},
  series =              {Electronic Proceedings in Theoretical Computer
                         Science},
  volume =              {57},
  pages =               {31-46},
  year =                {2011},
  month =               apr,
}
[Ruz81] Walter L. Ruzzo. On uniform circuit complexity. Journal of Computer and System Sciences 22(3):365-383. Academic Press, June 1981. 
@article{jcss22(3)-Ruz,
  author =              {Ruzzo, Walter L.},
  title =               {On uniform circuit complexity},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {22},
  number =              {3},
  pages =               {365-383},
  year =                {1981},
  month =               jun,
  doi =                 {10.1016/0022-0000(81)90038-6},
}
[RV76] Ronald L. Rivest and Jean Vuillemin. On Recognizing Graph Properties from Adjacency Matrices. Theoretical Computer Science 3(3):371-384. Elsevier, 1976. 
@article{tcs3(3)-RV,
  author =              {Rivest, Ronald L. and Vuillemin, Jean},
  title =               {On Recognizing Graph Properties from Adjacency
                         Matrices},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {3},
  number =              {3},
  pages =               {371-384},
  year =                {1976},
}
[RV98] Steffen Reith and Heribert Vollmer. The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae. Research Report cs.CC/9809116, arXiv, September 1998. 
@techreport{arxiv-cs.CC/9809116,
  author =              {Reith, Steffen and Vollmer, Heribert},
  title =               {The Complexity of Computing Optimal Assignments of
                         Generalized Propositional Formulae},
  number =              {cs.CC/9809116},
  year =                {1998},
  month =               sep,
  institution =         {arXiv},
  type =                {Research Report},
}
[RW87] Peter J. Ramadge and W. Murray Wonham. Supervisory Control of a Class of Discrete Event Processes. SIAM Journal on Control and Optimization 25(1):206-230. Society for Industrial and Applied Math., January 1987. 
@article{siamjco25(1)-RW,
  author =              {Ramadge, Peter J. and Wonham, W. Murray},
  title =               {Supervisory Control of a Class of Discrete Event
                         Processes},
  publisher =           {Society for Industrial and Applied Math.},
  journal =             {SIAM Journal on Control and Optimization},
  volume =              {25},
  number =              {1},
  pages =               {206-230},
  year =                {1987},
  month =               jan,
  doi =                 {10.1137/0325013},
}
[RW89] Peter J. Ramadge and W. Murray Wonham. The Control of Discrete Event Systems. Proceedings of the IEEE 77(1):81-98. IEEE Comp. Soc. Press, January 1989. 
@article{ieee77(1)-RW,
  author =              {Ramadge, Peter J. and Wonham, W. Murray},
  title =               {The Control of Discrete Event Systems},
  publisher =           {IEEE Comp. Soc. Press},
  journal =             {Proceedings of the IEEE},
  volume =              {77},
  number =              {1},
  pages =               {81-98},
  year =                {1989},
  month =               jan,
}
[RY86] Louis E. Rosier and Hsu-Chun Yen. A Multiparameter Analysis of the Boundedness Problem for Vector Addition Systems. Journal of Computer and System Sciences 32(1):105-135. Academic Press, February 1986. 
@article{jcss32(1)-RY,
  author =              {Rosier, Louis E. and Yen, Hsu-Chun},
  title =               {A~Multiparameter Analysis of the Boundedness Problem
                         for Vector Addition Systems},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {32},
  number =              {1},
  pages =               {105-135},
  year =                {1986},
  month =               feb,
  doi =                 {10.1016/0022-0000(86)90006-1},
}
[Rys83] Igor K. Rystsov. Polynomial-complete problems in automata theory. Information Processing Letters 16(1):147-151. Elsevier, April 1983. 
@article{ipl16(3)-Rys,
  author =              {Rystsov, Igor K.},
  title =               {Polynomial-complete problems in automata theory},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {16},
  number =              {1},
  pages =               {147-151},
  year =                {1983},
  month =               apr,
  doi =                 {10.1016/0020-0190(83)90067-4},
}
[Ryt99] Wojciech Rytter. Algorithms on Compressed Strings and Arrays. In SOFSEM'99, Lecture Notes in Computer Science 1725, pages 48-65. Springer-Verlag, November 1999. 
@inproceedings{sofsem1999-Ryt,
  author =              {Rytter, Wojciech},
  title =               {Algorithms on Compressed Strings and Arrays},
  editor =              {Pavelka, Jan and Tel, Gerard and Bartosek, Miroslav},
  booktitle =           {{P}roceedings of the 26th {C}onference on {C}urrent
                         {T}rends in {T}heory and {P}ractice of {I}nformatics
                         ({SOFSEM}'99)},
  acronym =             {{SOFSEM}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1725},
  pages =               {48-65},
  year =                {1999},
  month =               nov,
}
[Ryt00] Wojciech Rytter. Compressed and Fully Compressed Pattern-Matching in One and Two Dimensions. Proceedings of the IEEE 88(11):1769 - 1778. IEEE Comp. Soc. Press, November 2000. 
@article{ieee88(11)-Ryt,
  author =              {Rytter, Wojciech},
  title =               {Compressed and Fully Compressed Pattern-Matching in
                         One and Two Dimensions},
  publisher =           {IEEE Comp. Soc. Press},
  journal =             {Proceedings of the IEEE},
  volume =              {88},
  number =              {11},
  pages =               {1769 - 1778},
  year =                {2000},
  month =               nov,
  doi =                 {10.1109/5.892712},
}
[Ryt03] Wojciech Rytter. Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression. Theoretical Computer Science 302(1-3):211-222. Elsevier, June 2003. 
@article{tcs302(1-3)-Ryt,
  author =              {Rytter, Wojciech},
  title =               {Application of {L}empel-{Z}iv Factorization to the
                         Approximation of Grammar-Based Compression},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {302},
  number =              {1-3},
  pages =               {211-222},
  year =                {2003},
  month =               jun,
}
S
[Sad21] Suman Sadhukhan. A Verification Viewpoint on Network Congestion Games. PhD thesis, Université Rennes 1, France, December 2021. 
@phdthesis{phd-sadhukhan,
  author =              {Sadhukhan, Suman},
  title =               {A Verification Viewpoint on Network Congestion
                         Games},
  year =                {2021},
  month =               dec,
  school =              {Universit{\'e} Rennes~1, France},
}
[Saf89] Shmuel Safra. Complexity of Automata on Infinite Objects. PhD thesis, Weizmann Institute of Science, Rehovot, Israel, March 1989. 
@phdthesis{phd-safra,
  author =              {Safra, Shmuel},
  title =               {Complexity of Automata on Infinite Objects},
  year =                {1989},
  month =               mar,
  school =              {Weizmann Institute of Science, Rehovot, Israel},
}
[Saf92] Shmuel Safra. Exponential Determinization for ω-Automata with Strong-Fairness Acceptance Condition. In STOC'92, pages 272-282. ACM Press, 1992. 
@inproceedings{stoc1992-Saf,
  author =              {Safra, Shmuel},
  title =               {Exponential Determinization for
                         {\(\omega\)}-Automata with Strong-Fairness
                         Acceptance Condition},
  booktitle =           {{P}roceedings of the 24th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'92)},
  acronym =             {{STOC}'92},
  publisher =           {ACM Press},
  pages =               {272-282},
  year =                {1992},
}
[San05] Sven Sandberg. Homing and Synchronizing Sequences. In MBTRS'04, Lecture Notes in Computer Science 3472, pages 5-33. Springer-Verlag, 2005. 
@inproceedings{mbtrs2004-San,
  author =              {Sandberg, Sven},
  title =               {Homing and Synchronizing Sequences},
  editor =              {Broy, Manfred and Jonsson, Bengt and Katoen,
                         Joost-Pieter and Leucker, Martin and Pretschner,
                         Alexander},
  booktitle =           {{A}dvanced {L}ectures on {M}odel-{B}ased {T}esting
                         of {R}eactive {S}ystems ({MBTRS}'04)},
  acronym =             {{MBTRS}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3472},
  pages =               {5-33},
  year =                {2005},
  confyear =            {2004},
  confmonth =           {1},
}
[San10] Ocan Sankur. Model-checking robuste des automates temporisés via les machines à canaux. Mémoire de master, Lab. Spécification & Vérification, ENS Cachan, France, 2010. 
@mastersthesis{master10-sankur,
  author =              {Sankur, Ocan},
  title =               {Model-checking robuste des automates temporis{\'e}s
                         via les machines {\`a} canaux},
  year =                {2010},
  school =              {Lab.~Sp\'ecification \& V\'erification, ENS Cachan,
                         France},
  type =                {M\'emoire de master},
}
[San13] Ocan Sankur. Robustness in Timed Automata: Analysis, Synthesis, Implementation. Thèse de doctorat, Lab. Spécification & Vérification, ENS Cachan, France, May 2013. 
@phdthesis{phd-sankur,
  author =              {Sankur, Ocan},
  title =               {Robustness in Timed Automata: Analysis, Synthesis,
                         Implementation},
  year =                {2013},
  month =               may,
  school =              {Lab.~Sp\'ecification \& V\'erification, ENS Cachan,
                         France},
  type =                {Th\`ese de doctorat},
}
[San15] Ocan Sankur. Symbolic Quantitative Robustness Analysis of Timed Automata. In TACAS'15, Lecture Notes in Computer Science 9035, pages 484-498. Springer-Verlag, April 2015. 
@inproceedings{tacas2015-San,
  author =              {Sankur, Ocan},
  title =               {Symbolic Quantitative Robustness Analysis of Timed
                         Automata},
  editor =              {Baier, {\relax Ch}ristel and Tinelli, Cesare},
  booktitle =           {{P}roceedings of the 21st {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'15)},
  acronym =             {{TACAS}'15},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9035},
  pages =               {484-498},
  year =                {2015},
  month =               apr,
  doi =                 {10.1007/978-3-662-46681-0_48},
}
[Sar93] Ramnath Sarnath. Doubly Logarithmic Time Parallel Sorting. Technical Report 93-01, suny, January 1993. 
@techreport{suny-93-01,
  author =              {Sarnath, Ramnath},
  title =               {Doubly Logarithmic Time Parallel Sorting},
  number =              {93-01},
  year =                {1993},
  month =               jan,
  institution =         {suny},
  type =                {Technical Report},
}
[Sav70] Walter Savitch. Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences 4(2):177-192. Academic Press, April 1970. 
@article{jcss4(2)-Sav,
  author =              {Savitch, Walter},
  title =               {Relationships between nondeterministic and
                         deterministic tape complexities},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {4},
  number =              {2},
  pages =               {177-192},
  year =                {1970},
  month =               apr,
  doi =                 {10.1016/S0022-0000(70)80006-X},
}
[Saw03] Zdeněk Sawa. Equivalence Checking of Non-flat Systems is EXPTIME-hard. In CONCUR'03, Lecture Notes in Computer Science 2761, pages 237-250. Springer-Verlag, August 2003. 
@inproceedings{concur2003-Saw,
  author =              {Sawa, Zden{\v{e}}k},
  title =               {Equivalence Checking of Non-flat Systems is
                         EXPTIME-hard},
  editor =              {Amadio, Roberto and Lugiez, Denis},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'03)},
  acronym =             {{CONCUR}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2761},
  pages =               {237-250},
  year =                {2003},
  month =               aug,
}
[SB00] Fabio Somenzi and Roderick Bloem. Efficient Büchi Automata from LTL Formulae. In CAV'00, Lecture Notes in Computer Science 1855, pages 248-263. Springer-Verlag, July 2000. 
@inproceedings{cav2000-SB,
  author =              {Somenzi, Fabio and Bloem, Roderick},
  title =               {Efficient {B}{\"u}chi Automata from {LTL} Formulae},
  editor =              {Emerson, E. Allen and Sistla, A. Prasad},
  booktitle =           {{P}roceedings of the 12th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'00)},
  acronym =             {{CAV}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1855},
  pages =               {248-263},
  year =                {2000},
  month =               jul,
}
[SB03] Sanjit A. Seshia and Randal E. Bryant. Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods. In CAV'03, Lecture Notes in Computer Science 2725, pages 154-166. Springer-Verlag, July 2003. 
@inproceedings{cav2003-SB,
  author =              {Seshia,Sanjit A. and Bryant, Randal E.},
  title =               {Unbounded, Fully Symbolic Model Checking of Timed
                         Automata using Boolean Methods},
  editor =              {Hunt, Jr, Warren A. and Somenzi, Fabio},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'03)},
  acronym =             {{CAV}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2725},
  pages =               {154-166},
  year =                {2003},
  month =               jul,
  doi =                 {10.1007/978-3-540-45069-6_16},
}
[SB11] Fabio Somenzi and Steven Bradley. IC3: where monolithic and incremental meet. In FMCAD'11, pages 3-8. October 2011. 
@inproceedings{fmcad2011-SB,
  author =              {Somenzi, Fabio and Bradley, Steven},
  title =               {{IC3:} where monolithic and incremental meet},
  booktitle =           {{P}roceedings of the 11th {I}nternational
                         {C}onference on {F}ormal {M}ethods in
                         {C}omputer-{A}ided {D}esign ({FMCAD}'11)},
  acronym =             {{FMCAD}'11},
  pages =               {3-8},
  year =                {2011},
  month =               oct,
}
[SBM11] Ocan Sankur, Patricia Bouyer, and Nicolas Markey. Shrinking Timed Automata. In FSTTCS'11, Leibniz International Proceedings in Informatics 13, pages 90-102. Leibniz-Zentrum für Informatik, December 2011.
Abstract

We define and study a new approach to the implementability of timed automata, where the semantics is perturbed by imprecisions and finite frequency of the hardware. In order to circumvent these effects, we introduce parametric shrinking of clock constraints, which corresponds to tightening the guards. We propose symbolic procedures to decide the existence of (and then compute) parameters under which the shrunk version of a given timed automaton is non-blocking and can time-abstract simulate the exact semantics. We then define an implementation semantics for timed automata with a digital clock and positive reaction times, and show that for shrinkable timed automata both properties are preserved in implementation.

@inproceedings{fsttcs2011-SBM,
  author =              {Sankur, Ocan and Bouyer, Patricia and Markey,
                         Nicolas},
  title =               {Shrinking Timed Automata},
  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},
  pages =               {90-102},
  year =                {2011},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2011.90},
  abstract =            {We define and study a new approach to the
                         implementability of timed automata, where the
                         semantics is perturbed by imprecisions and finite
                         frequency of the hardware. In order to circumvent
                         these effects, we introduce \emph{parametric
                         shrinking} of clock constraints, which corresponds
                         to tightening the guards. We propose symbolic
                         procedures to decide the existence of (and then
                         compute) parameters under which the shrunk version
                         of a given timed automaton is non-blocking and can
                         time-abstract simulate the exact semantics. We then
                         define an implementation semantics for timed
                         automata with a digital clock and positive reaction
                         times, and show that for shrinkable timed automata
                         both properties are preserved in implementation.},
}
[SBM14] Ocan Sankur, Patricia Bouyer, and Nicolas Markey. Shrinking Timed Automata. Information and Computation 234:107-132. Elsevier, February 2014.
Abstract

We define and study a new approach to the implementability of timed automata, where the semantics is perturbed by imprecisions and finite frequency of the hardware. In order to circumvent these effects, we introduce parametric shrinking of clock constraints, which corresponds to tightening the guards. We propose symbolic procedures to decide the existence of (and then compute) parameters under which the shrunk version of a given timed automaton is non-blocking and can time-abstract simulate the exact semantics. We then define an implementation semantics for timed automata with a digital clock and positive reaction times, and show that for shrinkable timed automata, non-blockingness and time-abstract simulation are preserved in implementation.

@article{icomp234()-SBM,
  author =              {Sankur, Ocan and Bouyer, Patricia and Markey,
                         Nicolas},
  title =               {Shrinking Timed Automata},
  publisher =           {Elsevier},
  journal =             {Information and Computation},
  volume =              {234},
  pages =               {107-132},
  year =                {2014},
  month =               feb,
  doi =                 {10.1016/j.ic.2014.01.002},
  abstract =            {We define and study a new approach to the
                         implementability of timed automata, where the
                         semantics is perturbed by imprecisions and finite
                         frequency of the hardware. In order to circumvent
                         these effects, we introduce \emph{parametric
                         shrinking} of clock constraints, which corresponds
                         to tightening the guards. We propose symbolic
                         procedures to decide the existence of (and then
                         compute) parameters under which the shrunk version
                         of a given timed automaton is non-blocking and can
                         time-abstract simulate the exact semantics. We then
                         define an implementation semantics for timed
                         automata with a digital clock and positive reaction
                         times, and show that for shrinkable timed automata,
                         non-blockingness and time-abstract simulation are
                         preserved in implementation.},
}
[SBM+13] Ocan Sankur, Patricia Bouyer, Nicolas Markey, and Pierre-Alain Reynier. Robust Controller Synthesis in Timed Automata. In CONCUR'13, Lecture Notes in Computer Science 8052, pages 546-560. Springer-Verlag, August 2013.
Abstract

We consider the fundamental problem of Büchi acceptance in timed automata in a robust setting. The problem is formalised in terms of controller synthesis: timed automata are equipped with a parametrised game-based semantics that models the possible perturbations of the decisions taken by the controller. We characterise timed automata that are robustly controllable for some parameter, with a simple graph theoretic condition, by showing the equivalence with the existence of an aperiodic lasso that satisfies the winning condition (aperiodicity was defined and used earlier in different contexts to characterise convergence phenomena in timed automata). We then show decidability and PSPACE-completeness of our problem.

@inproceedings{concur2013-SBMR,
  author =              {Sankur, Ocan and Bouyer, Patricia and Markey,
                         Nicolas and Reynier, Pierre-Alain},
  title =               {Robust Controller Synthesis in Timed Automata},
  editor =              {D{'}Argenio, Pedro R. and Melgratt, Hern{\'a}n C.},
  booktitle =           {{P}roceedings of the 24th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'13)},
  acronym =             {{CONCUR}'13},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8052},
  pages =               {546-560},
  year =                {2013},
  month =               aug,
  doi =                 {10.1007/978-3-642-40184-8_38},
  abstract =            {We consider the fundamental problem of B{\"u}chi
                         acceptance in timed automata in a robust setting.
                         The problem is formalised in terms of controller
                         synthesis: timed automata are equipped with a
                         parametrised game-based semantics that models the
                         possible perturbations of the decisions taken by the
                         controller. We characterise timed automata that are
                         robustly controllable for some parameter, with a
                         simple graph theoretic condition, by showing the
                         equivalence with the existence of an aperiodic lasso
                         that satisfies the winning condition (aperiodicity
                         was defined and used earlier in different contexts
                         to characterise convergence phenomena in timed
                         automata). We then show decidability and
                         PSPACE-completeness of our problem.},
}
[SC85] A. Prasad Sistla and Edmund M. Clarke. The Complexity of Propositional Linear Temporal Logics. Journal of the ACM 32(3):733-749. ACM Press, July 1985. 
@article{jacm32(3)-SC,
  author =              {Sistla, A. Prasad and Clarke, Edmund M.},
  title =               {The Complexity of Propositional Linear Temporal
                         Logics},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {32},
  number =              {3},
  pages =               {733-749},
  year =                {1985},
  month =               jul,
  doi =                 {10.1145/3828.3837},
}
[SC02] Michael Soltys and Stephen A. Cook. The Proof Complexity of Linear Algebra. In LICS'02, pages 335-344. IEEE Comp. Soc. Press, July 2002. 
@inproceedings{lics2002-SC,
  author =              {Soltys, Michael and Cook, Stephen A.},
  title =               {The Proof Complexity of Linear Algebra},
  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 =               {335-344},
  year =                {2002},
  month =               jul,
}
[Sch61] Marcel-Paul Schützenberger. On the Definition of a Family of Automata. Information and Control 4(2-3):245-270. Academic Press, September 1961. 
@article{icont4(2-3)-Sch,
  author =              {Sch{\"u}tzenberger, Marcel-Paul},
  title =               {On the Definition of a Family of Automata},
  publisher =           {Academic Press},
  journal =             {Information and Control},
  volume =              {4},
  number =              {2-3},
  pages =               {245-270},
  year =                {1961},
  month =               sep,
}
[Sch98] Stefan Schwendimann. A New One-Pass Tableau Calculus for PLTL. In TABLEAUX'98, Lecture Notes in Computer Science 1397, pages 277-292. Springer-Verlag, May 1998. 
@inproceedings{tableaux1998-Sch,
  author =              {Schwendimann, Stefan},
  title =               {A New One-Pass Tableau Calculus for {PLTL}},
  editor =              {de Swart, Harrie C. M.},
  booktitle =           {{P}roceedings of the 7th {I}nternational
                         {C}onference on {A}utomated {R}easoning with
                         {A}nalytic {T}ableaux and {R}elated {M}ethods
                         ({TABLEAUX}'98)},
  acronym =             {{TABLEAUX}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1397},
  pages =               {277-292},
  year =                {1998},
  month =               may,
}
[Sch01] Philippe Schnoebelen. Spécification et Vérification des Systèmes Concurrents. Mémoire d'habilitation, Lab. Spécification & Vérification, ENS Cachan, France, October 2001. 
@phdthesis{hab-schnoebelen,
  author =              {Schnoebelen, {\relax Ph}ilippe},
  title =               {Sp{\'e}cification et V{\'e}rification des
                         Syst{\`e}mes Concurrents},
  year =                {2001},
  month =               oct,
  school =              {Lab.~Sp\'ecification \& V\'erification, ENS Cachan,
                         France},
  type =                {M\'emoire d'habilitation},
}
[Sch02] Philippe Schnoebelen. Verifying Lossy Channel Systems has Nonprimitive Recursive Complexity. Information Processing Letters 83(5):251-261. Elsevier, September 2002. 
@article{ipl83(5)-Sch,
  author =              {Schnoebelen, {\relax Ph}ilippe},
  title =               {Verifying Lossy Channel Systems has Nonprimitive
                         Recursive Complexity},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {83},
  number =              {5},
  pages =               {251-261},
  year =                {2002},
  month =               sep,
}
[Sch03] Philippe Schnoebelen. The Complexity of Temporal Logic Model Checking. In AIML'02, pages 481-517. King's College Publications, 2003. 
@inproceedings{aiml2002-Sch,
  author =              {Schnoebelen, {\relax Ph}ilippe},
  title =               {The Complexity of Temporal Logic Model Checking},
  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 =               {481-517},
  year =                {2003},
  confyear =            {2002},
  confmonth =           {9-10},
}
[Sch03] Philippe Schnoebelen. Oracle Circuits for Branching-Time Model Checking. In ICALP'03, Lecture Notes in Computer Science 2719, pages 790-801. Springer-Verlag, June 2003. 
@inproceedings{icalp2003-Sch,
  author =              {Schnoebelen, {\relax Ph}ilippe},
  title =               {Oracle Circuits for Branching-Time Model Checking},
  editor =              {Baeten, Jos C. M. and Lenstra, Jan Karel and Parrow,
                         Joachim and Woeginger, Gerhard J.},
  booktitle =           {{P}roceedings of the 30th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'03)},
  acronym =             {{ICALP}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2719},
  pages =               {790-801},
  year =                {2003},
  month =               jun,
}
[Sch04] Pierre-Yves Schobbens. Alternating-Time Logic with Imperfect Recall. In LCMAS'03, Electronic Notes in Theoretical Computer Science 85(2), pages 82-93. Elsevier, April 2004. 
@inproceedings{lcmas2003-Sch,
  author =              {Schobbens, Pierre-Yves},
  title =               {Alternating-Time Logic with Imperfect Recall},
  editor =              {van der Hoek, Wiebe and Lomuscio, Alessio and de
                         Vink, Erik and Wooldridge, Michael},
  booktitle =           {{P}roceedings of the {W}orkshop on Logic and
                         Communication in Multi-Agent Systems ({LCMAS}'03)},
  acronym =             {{LCMAS}'03},
  publisher =           {Elsevier},
  series =              {Electronic Notes in Theoretical Computer Science},
  volume =              {85(2)},
  pages =               {82-93},
  year =                {2004},
  month =               apr,
  confyear =            {2003},
  confmonth =           {6},
  doi =                 {10.1016/S1571-0661(05)82604-0},
}
[Sch08] Sven Schewe. ATL* Satisfiability Is 2EXPTIME-Complete. In ICALP'08, Lecture Notes in Computer Science 5126, pages 373-385. Springer-Verlag, July 2008. 
@inproceedings{icalp2008-Sch,
  author =              {Schewe, Sven},
  title =               {{ATL}{\(^*\)} Satisfiability Is 2{EXPTIME}-Complete},
  editor =              {Aceto, Luca and Damg{\aa}rd, Ivan and Goldberg,
                         Leslie Ann and Halld{\'o}rsson, Magn{\'u}s M. and
                         Ing{\'o}lfsd{\'o}ttir, Anna and Walukiewicz, Igor},
  booktitle =           {{P}roceedings of the 35th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'08)~-- Part~{II}},
  acronym =             {{ICALP}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5126},
  pages =               {373-385},
  year =                {2008},
  month =               jul,
}
[Sch08] Sven Schewe. Synthesis of Distributed Systems. PhD thesis, Saarland University, Germany, July 2008. 
@phdthesis{phd-schewe,
  author =              {Schewe, Sven},
  title =               {Synthesis of Distributed Systems},
  year =                {2008},
  month =               jul,
  school =              {Saarland University, Germany},
}
[Sch13] Sylvain Schmitz. Complexity Hierarchies Beyond Elementary. Research Report cs.CC/1312.5686, arXiv, December 2013. 
@techreport{arxiv-cs.CC/1312.5686,
  author =              {Schmitz, Sylvain},
  title =               {Complexity Hierarchies Beyond Elementary},
  number =              {cs.CC/1312.5686},
  year =                {2013},
  month =               dec,
  institution =         {arXiv},
  type =                {Research Report},
}
[Sch16] Sylvain Schmitz. Complexity Hierarchies Beyond Elementary. ACM Transactions on Computation Theory 8(1):3:1-3:36. ACM Press, February 2016. 
@article{toct8(1)-Sch,
  author =              {Schmitz, Sylvain},
  title =               {Complexity Hierarchies Beyond Elementary},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Computation Theory},
  volume =              {8},
  number =              {1},
  pages =               {3:1-3:36},
  year =                {2016},
  month =               feb,
  doi =                 {10.1145/2858784},
}
[SE89] Robert S. Streett and E. Allen Emerson. An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus. Information and Computation 81(3):249-264. Academic Press, 1989. 
@article{icomp81(3)-SE,
  author =              {Streett, Robert S. and Emerson, E. Allen},
  title =               {An Automata Theoretic Decision Procedure for the
                         Propositional Mu-Calculus},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {81},
  number =              {3},
  pages =               {249-264},
  year =                {1989},
}
[See76] Detlef G. Seese. Entscheidbarkeits- und Interpretierbarkeitsfragen monadischer Theorien zweiter Stufe gewisser Klassen von Graphen. PhD thesis, Humboldt-Universität zu Berlin, German Democratic Republic, 1976. 
@phdthesis{phd-seese,
  author =              {Seese, Detlef G.},
  title =               {Entscheidbarkeits- und {I}nterpretierbarkeitsfragen
                         monadischer {T}heorien zweiter {S}tufe gewisser
                         {K}lassen von {G}raphen},
  year =                {1976},
  school =              {Humboldt-Universit{\"a}t zu Berlin, German
                         Democratic Republic},
}
[Ser04] Olivier Serre. Vectorial Languages and Linear Temporal Logic. Theoretical Computer Science 310(1-3):79-116. Elsevier, January 2004. 
@article{tcs310(1-3)-ser,
  author =              {Serre, Olivier},
  title =               {Vectorial Languages and Linear Temporal Logic},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {310},
  number =              {1-3},
  pages =               {79-116},
  year =                {2004},
  month =               jan,
}
[Ser06] Olivier Serre. Parity games played on transition graphs of one-counter processes. In FoSSaCS'06, Lecture Notes in Computer Science 3921, pages 337-351. Springer-Verlag, March 2006. 
@inproceedings{fossacs2006-Ser,
  author =              {Serre, Olivier},
  title =               {Parity games played on transition graphs of
                         one-counter processes},
  editor =              {Aceto, Luca and Ing{\'o}lfsd{\'o}ttir, Anna},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'06)},
  acronym =             {{FoSSaCS}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3921},
  pages =               {337-351},
  year =                {2006},
  month =               mar,
  doi =                 {10.1007/11690634_23},
}
[SF06] Sven Schewe and Bernd Finkbeiner. Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus. In CSL'06, Lecture Notes in Computer Science 4207, pages 591-605. Springer-Verlag, September 2006. 
@inproceedings{csl2006-SF,
  author =              {Schewe, Sven and Finkbeiner, Bernd},
  title =               {Satisfiability and Finite Model Property for the
                         Alternating-Time {\(\mu\)}-Calculus},
  editor =              {{\'E}sik, Zolt{\'a}n},
  booktitle =           {{P}roceedings of the 20th {I}nternational {W}orkshop
                         on {C}omputer {S}cience {L}ogic ({CSL}'06)},
  acronym =             {{CSL}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4207},
  pages =               {591-605},
  year =                {2006},
  month =               sep,
}
[SF07] Sven Schewe and Bernd Finkbeiner. Synthesis of Asynchronous Systems. In LOPSTR'06, Lecture Notes in Computer Science 4407, pages 127-142. Springer-Verlag, 2007. 
@inproceedings{lopstr2006-SF,
  author =              {Schewe, Sven and Finkbeiner, Bernd},
  title =               {Synthesis of Asynchronous Systems},
  editor =              {Puebla, Germ{\'a}n},
  booktitle =           {{R}evised {S}elected {P}apers of the 16th
                         {I}nternational {S}ymposium on {L}ogic-{B}ased
                         {P}rogram {S}ynthesis and {T}ransformation
                         ({LOPSTR}'06)},
  acronym =             {{LOPSTR}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4407},
  pages =               {127-142},
  year =                {2007},
  confyear =            {2006},
  confmonth =           {7},
}
[SF07] Mani Swaminathan and Martin Fränzle. A Symbolic Decision Procedure for Robust Safety of Timed Systems. In TIME'07, pages 192. IEEE Comp. Soc. Press, June 2007. 
@inproceedings{time2007-SF,
  author =              {Swaminathan, Mani and Fr{\"a}nzle, Martin},
  title =               {A Symbolic Decision Procedure for Robust Safety of
                         Timed Systems},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {S}ymposium on {T}emporal {R}epresentation and
                         {R}easoning ({TIME}'07)},
  acronym =             {{TIME}'07},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {192},
  year =                {2007},
  month =               jun,
}
[SFK08] Mani Swaminathan, Martin Fränzle, and Joost-Pieter Katoen. The Surprising Robustness of (Closed) Timed Automata against Clock-Drift. In IFIPTCS'08, IFIP Conference Proceedings 273, pages 537-553. Springer-Verlag, September 2008. 
@inproceedings{ifiptcs2008-SFK,
  author =              {Swaminathan, Mani and Fr{\"a}nzle, Martin and
                         Katoen, Joost-Pieter},
  title =               {The Surprising Robustness of (Closed) Timed Automata
                         against Clock-Drift},
  editor =              {Karhum{\"a}ki, Juhani and Ong, Luke},
  booktitle =           {{P}roceedings of the 5th {IFIP} {I}nternational
                         {C}onference on {T}heoretical {C}omputer {S}cience
                         ({IFIPTCS}'08)},
  acronym =             {{IFIPTCS}'08},
  publisher =           {Springer-Verlag},
  series =              {IFIP Conference Proceedings},
  volume =              {273},
  pages =               {537-553},
  year =                {2008},
  month =               sep,
}
[Sha53] Lloyd S. Shapley. Stochastic games. Proceedings of the National Academy of Sciences 39(10):1095-1100. National Academy of Sciences of the United States of America, October 1953. 
@article{pnas39(10)-Sha,
  author =              {Shapley, Lloyd S.},
  title =               {Stochastic games},
  publisher =           {National Academy of Sciences of the United States of
                         America},
  journal =             {Proceedings of the National Academy of Sciences},
  volume =              {39},
  number =              {10},
  pages =               {1095-1100},
  year =                {1953},
  month =               oct,
  doi =                 {10.1073/pnas.39.10.1095},
}
[She59] John C. Shepherdson. The Reduction of Two-Way Automata to One-Way Automata. IBM Journal of Research and Development 3:198-200. April 1959. 
@article{IBM-JRD3-She,
  author =              {Shepherdson, John C.},
  title =               {The Reduction of Two-Way Automata to One-Way
                         Automata},
  journal =             {IBM Journal of Research and Development},
  volume =              {3},
  pages =               {198-200},
  year =                {1959},
  month =               apr,
}
[Shi14] Mahsa Shirmohammadi. Qualitative analysis of synchronizing probabilistic systems. Thèse de doctorat, Lab. Spécification & Vérification, ENS Cachan, France and Département d'Informatique, Université Libre de Bruxelles, Belgium, December 2014. 
@phdthesis{phd-shirmohammadi,
  author =              {Shirmohammadi, Mahsa},
  title =               {Qualitative analysis of synchronizing probabilistic
                         systems},
  year =                {2014},
  month =               dec,
  school =              {Lab.~Sp\'ecification \& V\'erification, ENS Cachan,
                         France and D{\'e}partement d'Informatique,
                         Universit{\'e} Libre de Bruxelles, Belgium},
  type =                {Th\`ese de doctorat},
}
[Shi19] Yaroslav Shitov. An Improvement to a Recent Upper Bound for Synchronizing Words of Finite Automata. Journal of Automata, Languages and Combinatorics 24(2-4):367-373. 2019. 
@article{jalc24(2-4)-Shi,
  author =              {Shitov, Yaroslav},
  title =               {An Improvement to a Recent Upper Bound for
                         Synchronizing Words of Finite Automata},
  journal =             {Journal of Automata, Languages and Combinatorics},
  volume =              {24},
  number =              {2-4},
  pages =               {367-373},
  year =                {2019},
  doi =                 {10.25596/jalc-2019-367},
}
[Sho08] Yoav Shoham. Computer Science and Game Theory. Communications of the ACM 51(8):74-79. ACM Press, August 2008. 
@article{cacm51(8)-Sho,
  author =              {Shoham, Yoav},
  title =               {Computer Science and Game Theory},
  publisher =           {ACM Press},
  journal =             {Communications of the ACM},
  volume =              {51},
  number =              {8},
  pages =               {74-79},
  year =                {2008},
  month =               aug,
  doi =                 {10.1145/1378704.1378721},
}
[Sic19] Salomon Sickert. A unified translation of Linear Temporal Logic to ω-automata. PhD thesis, Technischen Universität München, Germany, July 2019. 
@phdthesis{phd-sickert,
  author =              {Sickert, Salomon},
  title =               {A~unified translation of Linear Temporal Logic to
                         {\(\omega\)}-automata},
  year =                {2019},
  month =               jul,
  school =              {Technischen Universit{\"a}t M{\"u}nchen, Germany},
}
[Sip80] Michael Sipser. Halting Space-bounded Computations. Theoretical Computer Science 10(3):335-338. Elsevier, 1980. 
@article{tcs10(3)-Sip,
  author =              {Sipser, Michael},
  title =               {Halting Space-bounded Computations},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {10},
  number =              {3},
  pages =               {335-338},
  year =                {1980},
}
[Sip97] Michael Sipser. Introduction to the theory of computation. PWS Publishing Company, 1997. 
@book{Sip97-ITC,
  author =              {Sipser, Michael},
  title =               {Introduction to the theory of computation},
  publisher =           {PWS Publishing Company},
  year =                {1997},
}
[Sip06] Michael Sipser. Introduction to the theory of computation. Thomson Course Technology, 2006. 
@book{Sip06-ITC,
  author =              {Sipser, Michael},
  title =               {Introduction to the theory of computation},
  publisher =           {Thomson Course Technology},
  year =                {2006},
}
[Sip13] Michael Sipser. Introduction to the theory of computation. Cengage Learning, 2013. 
@book{Sip13-ITC,
  author =              {Sipser, Michael},
  title =               {Introduction to the theory of computation},
  publisher =           {Cengage Learning},
  year =                {2013},
}
[Sis83] A. Prasad Sistla. Theoretical Issues in the Design and Verification of Distributed Systems. PhD thesis, Harvard University, 1983. 
@phdthesis{phd-sistla,
  author =              {Sistla, A. Prasad},
  title =               {Theoretical Issues in the Design and Verification of
                         Distributed Systems},
  year =                {1983},
  school =              {Harvard University},
}
[SJ01] Zdeněk Sawa and Petr Jančar. P-hardness of Equivalence Testing on Finite State Processes. In SOFSEM'01, Lecture Notes in Computer Science 2234, pages 326-335. Springer-Verlag, November 2001. 
@inproceedings{sofsem2001-SJ,
  author =              {Sawa, Zden{\v{e}}k and Jan{\v c}ar, Petr},
  title =               {{P}-hardness of Equivalence Testing on Finite State
                         Processes},
  editor =              {Pacholski, Leszek and Ruzicka, Peter},
  booktitle =           {{P}roceedings of the 28th {C}onference on {C}urrent
                         {T}rends in {T}heory and {P}ractice of {I}nformatics
                         ({SOFSEM}'01)},
  acronym =             {{SOFSEM}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2234},
  pages =               {326-335},
  year =                {2001},
  month =               nov,
}
[SK21] Neda Saeedloei and Feliks Kluźniak. Minimization of the Number of Clocks for Timed Scenarios. In SBMF'21, Lecture Notes in Computer Science 13130, pages 122-139. Springer-Verlag, 2021. 
@inproceedings{sbmf2021-SK,
  author =              {Saeedloei, Neda and Klu{\'z}niak, Feliks},
  title =               {Minimization of the Number of Clocks for Timed
                         Scenarios},
  editor =              {Campos, S{\'e}rgio Vale Aguiar and Minea, Marius},
  booktitle =           {{P}roceedings of the24th {B}razilian {S}ymposium on
                         {F}ormal {M}ethods ({SBMF}'21)},
  acronym =             {{SBMF}'21},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {13130},
  pages =               {122-139},
  year =                {2021},
  confmonth =           {12},
  doi =                 {10.1007/978-3-030-92137-8_8},
}
[SKL06] Oleg Sokolsky, Sampath Kannan, and Insup Lee. Simulation-Based Graph Similarity. In TACAS'06, Lecture Notes in Computer Science 3920, pages 426-440. Springer-Verlag, March 2006. 
@inproceedings{tacas2006-SKL,
  author =              {Sokolsky, Oleg and Kannan, Sampath and Lee, Insup},
  title =               {Simulation-Based Graph Similarity},
  editor =              {Hermanns, Holger and Palsberg, Jens},
  booktitle =           {{P}roceedings of the 12th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'06)},
  acronym =             {{TACAS}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3920},
  pages =               {426-440},
  year =                {2006},
  month =               mar,
}
[SKS03] Shoham Shamir, Orna Kupferman, and Eli Shamir. Branching-Depth Hierarchies. In EXPRESS'00, Electronic Notes in Theoretical Computer Science 39(1). Elsevier, February 2003. 
@inproceedings{express2000-SKS,
  author =              {Shamir, Shoham and Kupferman, Orna and Shamir, Eli},
  title =               {Branching-Depth Hierarchies},
  editor =              {Aceto, Luca and Victor, Bjorn},
  booktitle =           {{P}roceedings of the 7th {I}nternational {W}orkshop
                         on {E}xpressiveness in {C}oncurrency ({EXPRESS}'00)},
  acronym =             {{EXPRESS}'00},
  publisher =           {Elsevier},
  series =              {Electronic Notes in Theoretical Computer Science},
  volume =              {39},
  number =              {1},
  year =                {2003},
  month =               feb,
  confyear =            {2000},
  confmonth =           {8},
}
[Sla05] John K. Slaney. Semipositive LTL with an Uninterpreted Past Operator. Logic Journal of the IGPL 13(2):211-229. Oxford University Press, March 2005. 
@article{jigpl13(2)-Sla,
  author =              {Slaney, John K.},
  title =               {Semipositive {LTL} with an Uninterpreted Past
                         Operator},
  publisher =           {Oxford University Press},
  journal =             {Logic Journal of the IGPL},
  volume =              {13},
  number =              {2},
  pages =               {211-229},
  year =                {2005},
  month =               mar,
}
[SLB09] Yoav Shoham and Kevin Leyton-Brown. Multiagent Systems – Algorithmic, Game-Theoretic, and Logical Foundations. Cambridge University Press, 2009. 
@book{mas-SL09,
  author =              {Shoham, Yoav and Leyton-Brown, Kevin},
  title =               {Multiagent Systems~-- Algorithmic, Game-Theoretic,
                         and Logical Foundations},
  publisher =           {Cambridge University Press},
  year =                {2009},
}
[SLS+14] Youcheng Sun, Giuseppe Lipari, Romain Soulat, Laurent Fribourg, and Nicolas Markey. Component-Based Analysis of Hierarchical Scheduling using Linear Hybrid Automata. In RTCSA'14. IEEE Comp. Soc. Press, August 2014.
Abstract

Formal methods (e.g. Timed Automata or Linear Hybrid Automata) can be used to analyse a real-time system by performing a reachability analysis on the model. The advantage of using formal methods is that they are more expressive than classical analytic models used in schedulability analysis. For example, it is possible to express state-dependent behaviour, arbitrary activation patterns, etc.

In this paper we use the formalism of Linear Hybrid Automata to encode a hierarchical scheduling system. In particular, we model a dynamic server algorithm and the tasks contained within, abstracting away the rest of the system, thus enabling component-based scheduling analysis. We prove the correctness of the model and the decidability of the reachability analysis for the case of periodic tasks. Then, we compare the results of our model against classical schedulability analysis techniques, showing that our analysis performs better than analytic methods in terms of resource utilisation. We further present two case studies: a component with state-dependent tasks, and a simplified model of a real avionics system. Finally, through extensive tests with various configurations, we demonstrate that this approach is usable for medium size components.

@inproceedings{rtcsa2014-SLSFM,
  author =              {Sun, Youcheng and Lipari, Giuseppe and Soulat,
                         Romain and Fribourg, Laurent and Markey, Nicolas},
  title =               {Component-Based Analysis of Hierarchical Scheduling
                         using Linear Hybrid Automata},
  booktitle =           {{P}roceedings of the 20th {I}nternational
                         {C}onference on {R}eal-{T}ime {C}omputing {S}ystems
                         and {A}pplications ({RTCSA}'14)},
  acronym =             {{RTCSA}'14},
  publisher =           {IEEE Comp. Soc. Press},
  year =                {2014},
  month =               aug,
  doi =                 {10.1109/RTCSA.2014.6910502},
  abstract =            {Formal methods (e.g. Timed Automata or Linear Hybrid
                         Automata) can be used to analyse a real-time system
                         by performing a reachability analysis on the model.
                         The advantage of using formal methods is that they
                         are more expressive than classical analytic models
                         used in schedulability analysis. For example, it is
                         possible to express state-dependent behaviour,
                         arbitrary activation patterns,~etc.\par In this
                         paper we use the formalism of Linear Hybrid Automata
                         to encode a hierarchical scheduling system. In
                         particular, we model a dynamic server algorithm and
                         the tasks contained within, abstracting away the
                         rest of the system, thus enabling component-based
                         scheduling analysis. We prove the correctness of the
                         model and the decidability of the reachability
                         analysis for the case of periodic tasks. Then, we
                         compare the results of our model against classical
                         schedulability analysis techniques, showing that our
                         analysis performs better than analytic methods in
                         terms of resource utilisation. We further present
                         two case studies: a~component with state-dependent
                         tasks, and a simplified model of a real avionics
                         system. Finally, through extensive tests with
                         various configurations, we demonstrate that this
                         approach is usable for medium size components.},
}
[SLT98] Meera Sampath, Stéphane Lafortune, and Demosthenis Teneketzis. Active diagnosis of discrete-event systems. IEEE Transactions on Automatic Control 43(7):908-929. IEEE Comp. Soc. Press, July 1998. 
@article{tac43(7)-SLT,
  author =              {Sampath, Meera and Lafortune, St{\'e}phane and
                         Teneketzis, Demosthenis},
  title =               {Active diagnosis of discrete-event systems},
  publisher =           {IEEE Comp. Soc. Press},
  journal =             {IEEE Transactions on Automatic Control},
  volume =              {43},
  number =              {7},
  pages =               {908-929},
  year =                {1998},
  month =               jul,
  doi =                 {10.1109/9.701089},
}
[SM73] Larry J. Stockmeyer and Albert R. Meyer. Word Problems Requiring Exponential Time: Preliminary Report. In STOC'73, pages 1-9. ACM Press, April 1973. 
@inproceedings{stoc1973-SM,
  author =              {Stockmeyer, Larry J. and Meyer, Albert R.},
  title =               {Word Problems Requiring Exponential Time:
                         Preliminary Report},
  booktitle =           {{P}roceedings of the 5th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'73)},
  acronym =             {{STOC}'73},
  publisher =           {ACM Press},
  pages =               {1-9},
  year =                {1973},
  month =               apr,
}
[Sor02] Maria Sorea. A Decidable Fixpoint Logic for Time-Outs. In CONCUR'02, Lecture Notes in Computer Science 2421, pages 255-271. Springer-Verlag, August 2002. 
@inproceedings{concur2002-Sor,
  author =              {Sorea, Maria},
  title =               {A Decidable Fixpoint Logic for Time-Outs},
  editor =              {Brim, Lubo{\v s} and Jan{\v c}ar, Petr and K{\v
                         r}et{\'\i}nsk{\'y}, Mojm{\'\i}r and Ku{\v c}era,
                         Anton{\'\i}n},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'02)},
  acronym =             {{CONCUR}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2421},
  pages =               {255-271},
  year =                {2002},
  month =               aug,
}
[Sor14] Mathias Grund Sørensen. Controller synthesis for home automation. Master's thesis, Computer Science Department, Aalborg University, Denmark, 2014. 
@mastersthesis{sorensen-master14,
  author =              {S{\o}rensen, Mathias Grund},
  title =               {Controller synthesis for home automation},
  year =                {2014},
  school =              {Computer Science Department, Aalborg University,
                         Denmark},
}
[Spe10] Heike Sperber. How to find Nash equilibria with extreme total latency in network congestion games?. Mathematical Methods of Operations Research 71(2):245-265. Springer-Verlag, April 2010. 
@article{mmor71(2)-Spe,
  author =              {Sperber, Heike},
  title =               {How to find {N}ash equilibria with extreme total
                         latency in network congestion games?},
  publisher =           {Springer-Verlag},
  journal =             {Mathematical Methods of Operations Research},
  volume =              {71},
  number =              {2},
  pages =               {245-265},
  year =                {2010},
  month =               apr,
  doi =                 {10.1007/s00186-009-0293-6},
}
[SPN+08] P. Vijay Suman, Paritosh K. Pandya, Shankara Narayanan Krishna, and Lakshmi Manasa. Timed Automata with Integer Resets: Language Inclusion and Expressiveness. In FORMATS'08, Lecture Notes in Computer Science 5215, pages 78-92. Springer-Verlag, September 2008. 
@inproceedings{formats2008-SPNM,
  author =              {Suman, P. Vijay and Pandya, Paritosh K. and
                         Narayanan Krishna, Shankara and Manasa, Lakshmi},
  title =               {Timed Automata with Integer Resets: Language
                         Inclusion and Expressiveness},
  editor =              {Cassez, Franck and Jard, Claude},
  booktitle =           {{P}roceedings of the 6th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'08)},
  acronym =             {{FORMATS}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5215},
  pages =               {78-92},
  year =                {2008},
  month =               sep,
}
[SR99] Pierre-Yves Schobbens and Jean-François Raskin. The Logic of "Initially" and "Next". Information Processing Letters 69(5):221-225. Elsevier, 1999. 
@article{ipl69(5)-SR,
  author =              {Schobbens, Pierre-Yves and Raskin, Jean-Fran{\c
                         c}ois},
  title =               {The Logic of {"}Initially{"} and {"}Next{"}},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {69},
  number =              {5},
  pages =               {221-225},
  year =                {1999},
}
[Srb02] Jiří Srba. Undecidability of Weak Bisimulation for Pushdown Processes. In CONCUR'02, Lecture Notes in Computer Science 2421, pages 579-593. Springer-Verlag, August 2002. 
@inproceedings{concur2002-Srb,
  author =              {Srba, Ji{\v r}{\'\i}},
  title =               {Undecidability of Weak Bisimulation for Pushdown
                         Processes},
  editor =              {Brim, Lubo{\v s} and Jan{\v c}ar, Petr and K{\v
                         r}et{\'\i}nsk{\'y}, Mojm{\'\i}r and Ku{\v c}era,
                         Anton{\'\i}n},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'02)},
  acronym =             {{CONCUR}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2421},
  pages =               {579-593},
  year =                {2002},
  month =               aug,
}
[SRH02] Pierre-Yves Schobbens, Jean-François Raskin, and Thomas A. Henzinger. Axioms for Real-Time Logics. Theoretical Computer Science 274(1-2):151-182. Elsevier, March 2002. 
@article{tcs274(1-2)-SRH,
  author =              {Schobbens, Pierre-Yves and Raskin, Jean-Fran{\c
                         c}ois and Henzinger, Thomas A.},
  title =               {Axioms for Real-Time Logics},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {274},
  number =              {1-2},
  pages =               {151-182},
  year =                {2002},
  month =               mar,
}
[SRS09] Anu Singh, C. R. Ramakrishnan, and Scott A. Smolka. Query-Based Model Checking of Ad Hoc Network Protocols. In CONCUR'09, Lecture Notes in Computer Science 5710, pages 603-619. Springer-Verlag, September 2009. 
@inproceedings{concur2009-SRS,
  author =              {Singh, Anu and Ramakrishnan, C. R. and Smolka, Scott
                         A.},
  title =               {Query-Based Model Checking of Ad~Hoc Network
                         Protocols},
  editor =              {Bravetti, Mario and Zavattaro, Gianluigi},
  booktitle =           {{P}roceedings of the 20th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'09)},
  acronym =             {{CONCUR}'09},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5710},
  pages =               {603-619},
  year =                {2009},
  month =               sep,
  doi =                 {10.1007/978-3-642-04081-8_40},
}
[SS78] William J. Sakoda and Michael Sipser. Nondeterminism and the Size of Two Way Finite Automata. In STOC'78, pages 275-286. ACM Press, May 1978. 
@inproceedings{stoc1978-SS,
  author =              {Sakoda, William J. and Sipser, Michael},
  title =               {Nondeterminism and the Size of Two Way Finite
                         Automata},
  booktitle =           {{P}roceedings of the 10th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'78)},
  acronym =             {{STOC}'78},
  publisher =           {ACM Press},
  pages =               {275-286},
  year =                {1978},
  month =               may,
}
[SS82] James A. Storer and Thomas G. Szymanski. Data Compression via Textual Substitution. Journal of the ACM 29(4):928-951. ACM Press, October 1982. 
@article{jacm29(4)-SS,
  author =              {Storer, James A. and Szymanski, Thomas G.},
  title =               {Data Compression via Textual Substitution},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {29},
  number =              {4},
  pages =               {928-951},
  year =                {1982},
  month =               oct,
}
[SS02] Vladimiro Sassone and Paweł Sobocoński. Deriving Bisimulationn Congruences: A 2-Categorical Approach. In EXPRESS'02, Electronic Notes in Theoretical Computer Science 68(2), pages 107-126. Elsevier, August 2002. 
@inproceedings{express2002-SS,
  author =              {Sassone, Vladimiro and Soboco{\'n}ski, Pawe{\l}},
  title =               {Deriving Bisimulationn Congruences:
                         A~{\(2\)}-Categorical Approach},
  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 =               {107-126},
  year =                {2002},
  month =               aug,
}
[SSL+95] Meera Sampath, Raja Sengupta, Stéphane Lafortune, Kasim Sinnamohideen, and Demosthenis Teneketzis. Diagnosability of discrete-event systems. IEEE Transactions on Automatic Control 40(9):1555-1575. IEEE Comp. Soc. Press, September 1995. 
@article{tac40(9)-SSLST,
  author =              {Sampath, Meera and Sengupta, Raja and Lafortune,
                         St{\'e}phane and Sinnamohideen, Kasim and
                         Teneketzis, Demosthenis},
  title =               {Diagnosability of discrete-event systems},
  publisher =           {IEEE Comp. Soc. Press},
  journal =             {IEEE Transactions on Automatic Control},
  volume =              {40},
  number =              {9},
  pages =               {1555-1575},
  year =                {1995},
  month =               sep,
  doi =                 {10.1109/9.412626},
}
[SSL+96] Meera Sampath, Raja Sengupta, Stéphane Lafortune, Kasim Sinnamohideen, and Demosthenis Teneketzis. Failure diagnosis using discrete-event models. IEEE Transactions on Computers 35(1):105-124. IEEE Comp. Soc. Press, January 1996. 
@article{tocst4(2)-SSLST,
  author =              {Sampath, Meera and Sengupta, Raja and Lafortune,
                         St{\'e}phane and Sinnamohideen, Kasim and
                         Teneketzis, Demosthenis},
  title =               {Failure diagnosis using discrete-event models},
  publisher =           {IEEE Comp. Soc. Press},
  journal =             {IEEE Transactions on Computers},
  volume =              {35},
  number =              {1},
  pages =               {105-124},
  year =                {1996},
  month =               jan,
  doi =                 {10.1109/87.486338},
}
[SSS+01] Hiroshi Sakamoto, Shinichi Shimozono, Ayumi Shinohara, and Masayuki Takeda. On the Minimization Problem of Text Compression Scheme by a Reduced Grammar Transform. Technical Report 195, Department of Informatics, Kyushu University, Japan, August 2001. 
@techreport{kyushu-TR195,
  author =              {Sakamoto, Hiroshi and Shimozono, Shinichi and
                         Shinohara, Ayumi and Takeda, Masayuki},
  title =               {On the Minimization Problem of Text Compression
                         Scheme by a Reduced Grammar Transform},
  number =              {195},
  year =                {2001},
  month =               aug,
  institution =         {Department of Informatics, Kyushu University, Japan},
  type =                {Technical Report},
}
[ST85] Daniel Dominic Sleator and Robert Endre Tarjan. Self-adjusting binary search trees. Journal of the ACM 32(3):652-686. ACM Press, July 1985. 
@article{jacm32(3)-ST,
  author =              {Sleator, Daniel Dominic and Tarjan, Robert Endre},
  title =               {Self-adjusting binary search trees},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {32},
  number =              {3},
  pages =               {652-686},
  year =                {1985},
  month =               jul,
  doi =                 {10.1145/3828.3835},
}
[ST03] Roberto Sebastiani and Stefano Tonetta. "More Deterministic" vs. "Smaller" Büchi Automata for Efficient LTL Model Checking. In CHARME'03, Lecture Notes in Computer Science 2860. Springer-Verlag, October 2003. 
@inproceedings{charme2003-ST,
  author =              {Sebastiani, Roberto and Tonetta, Stefano},
  title =               {{"}More Deterministic{"} vs. {"}Smaller{"} B{\"u}chi
                         Automata for Efficient {LTL} Model Checking},
  editor =              {Geist, Daniel and Tronci, Enrico},
  booktitle =           {{P}roceedings of the 12th {C}orrect {H}ardware
                         {D}esign and {V}erification {M}ethods ({CHARME}'03)},
  acronym =             {{CHARME}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2860},
  year =                {2003},
  month =               oct,
}
[ST17] Ocan Sankur and Jean-Pierre Talpin. An Abstraction Technique For Parameterized Model Checking of Leader Election Protocols: Application to FTSP. In TACAS'17, Lecture Notes in Computer Science 10205. Springer-Verlag, April 2017. 
@inproceedings{tacas2017-ST,
  author =              {Sankur, Ocan and Talpin, Jean-Pierre},
  title =               {An~Abstraction Technique For Parameterized Model
                         Checking of Leader Election Protocols: Application
                         to~{FTSP}},
  editor =              {Legay, Axel and Margaria, Tiziana},
  booktitle =           {{P}roceedings of the 23rd {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'17)~-- {P}art~{I}},
  acronym =             {{TACAS}'17},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {10205},
  year =                {2017},
  month =               apr,
  doi =                 {10.1007/978-3-662-54577-5_2},
}
[Sta17] Daniel Stan. Randomized strategies in concurrent games. Thèse de doctorat, Lab. Spécification & Vérification, ENS Cachan, France, March 2017. 
@phdthesis{phd-stan,
  author =              {Stan, Daniel},
  title =               {Randomized strategies in concurrent games},
  year =                {2017},
  month =               mar,
  school =              {Lab.~Sp\'ecification \& V\'erification, ENS Cachan,
                         France},
  type =                {Th\`ese de doctorat},
}
[Sti95] Colin Stirling. Local Model Checking Games (Extended Abstract). In CONCUR'95, Lecture Notes in Computer Science 962, pages 1-11. Springer-Verlag, August 1995. 
@inproceedings{concur1995-Sti,
  author =              {Stirling, Colin},
  title =               {Local Model Checking Games (Extended Abstract)},
  editor =              {Lee, Insup and Smolka, Scott A.},
  booktitle =           {{P}roceedings of the 6th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'95)},
  acronym =             {{CONCUR}'95},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {962},
  pages =               {1-11},
  year =                {1995},
  month =               aug,
}
[Sto74] Larry J. Stockmeyer. The Complexity of Decision Problems in Automata Theory and Logic. PhD thesis, MIT, 1974. 
@phdthesis{phd-stockmeyer,
  author =              {Stockmeyer, Larry J.},
  title =               {The Complexity of Decision Problems in Automata
                         Theory and Logic},
  year =                {1974},
  school =              {MIT},
}
[Sto76] Larry J. Stockmeyer. The Polynomial-Time Hierarchy. Theoretical Computer Science 3(1):1-22. Elsevier, 1976. 
@article{tcs3(1)-Sto,
  author =              {Stockmeyer, Larry J.},
  title =               {The Polynomial-Time Hierarchy},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {3},
  number =              {1},
  pages =               {1-22},
  year =                {1976},
}
[Sto87] Larry J. Stockmeyer. Classifying the Computational Complexity of Problems. Journal of Symbolic Logic 52(1):1-43. Association for Symbolic Logic, March 1987. 
@article{jsl52(1)-Sto,
  author =              {Stockmeyer, Larry J.},
  title =               {Classifying the Computational Complexity of
                         Problems},
  publisher =           {Association for Symbolic Logic},
  journal =             {Journal of Symbolic Logic},
  volume =              {52},
  number =              {1},
  pages =               {1-43},
  year =                {1987},
  month =               mar,
}
[Str52] Arthur N. Strahler. Hypsometric (area-altitude) analysis of erosional topography. Geological Society of America Bulletin 63(11):1117-1142. Geological Society of America, November 1952. 
@article{gsab63(11)-Str,
  author =              {Strahler, Arthur N.},
  title =               {Hypsometric (area-altitude) analysis of erosional
                         topography},
  publisher =           {Geological Society of America},
  journal =             {Geological Society of America Bulletin},
  volume =              {63},
  number =              {11},
  pages =               {1117-1142},
  year =                {1952},
  month =               nov,
  doi =                 {10.1130/0016-7606(1952)63[1117:HAAOET]2.0.CO;2},
}
[Str04] Jan Strejček. Linear Temporal Logic: Expressiveness and Model Checking. PhD thesis, Faculty of Informatics, Masaryk University, Brno, Czech Republic, 2004. 
@phdthesis{phd-strejcek,
  author =              {Strej{\v c}ek, Jan},
  title =               {Linear Temporal Logic: Expressiveness and Model
                         Checking},
  year =                {2004},
  school =              {Faculty of Informatics, Masaryk University, Brno,
                         Czech Republic},
}
[STZ07] Subhash Suri, Csaba D. Tóth, and Yunhong Zhou. Selfish Load Balancing and Atomic Congestion Games. Algorithmica 47(1):79-96. Springer-Verlag, January 2007. 
@article{alga2007-STZ,
  author =              {Suri, Subhash and T{\'o}th, Csaba D. and Zhou,
                         Yunhong},
  title =               {Selfish Load Balancing and Atomic Congestion Games},
  publisher =           {Springer-Verlag},
  journal =             {Algorithmica},
  volume =              {47},
  number =              {1},
  pages =               {79-96},
  year =                {2007},
  month =               jan,
  doi =                 {10.1007/s00453-006-1211-4},
}
[SU02] Marcus Schaefer and Christopher Umans. Completeness in the Polynomial-Time hierarchy: A Compendium. SIGACT News 33(3):32-49. ACM Press, September 2002. 
@article{sigact-news-33(3)-SU,
  author =              {Schaefer, Marcus and Umans, Christopher},
  title =               {Completeness in the Polynomial-Time hierarchy: A
                         Compendium},
  publisher =           {ACM Press},
  journal =             {SIGACT News},
  volume =              {33},
  number =              {3},
  pages =               {32-49},
  year =                {2002},
  month =               sep,
}
[SU02] Marcus Schaefer and Christopher Umans. Completeness in the Polynomial-Time hierarchy: Part II. SIGACT News 33(4):22-36. ACM Press, December 2002. 
@article{sigact-news33(4)-SU,
  author =              {Schaefer, Marcus and Umans, Christopher},
  title =               {Completeness in the Polynomial-Time hierarchy:
                         Part~II},
  publisher =           {ACM Press},
  journal =             {SIGACT News},
  volume =              {33},
  number =              {4},
  pages =               {22-36},
  year =                {2002},
  month =               dec,
}
[SVD01] Jan Springintveld, Frits Vaandrager, and Pedro R. D'Argenio. Testing timed automata. Theoretical Computer Science 254(1-2):225-257. Elsevier, March 2001. 
@article{tcs254(1-2)-SVD,
  author =              {Springintveld, Jan and Vaandrager, Frits and
                         D{'}Argenio, Pedro R.},
  title =               {Testing timed automata},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {254},
  number =              {1-2},
  pages =               {225-257},
  year =                {2001},
  month =               mar,
  doi =                 {10.1016/S0304-3975(99)00134-6},
}
[SVM+12] Diego V. Simões De Sousa, Henrique Viana, Nicolas Markey, and Jose Antônio F. de Macêdo. Querying Trajectories through Model Checking based on Timed Automata. In SBBD'12, pages 33-40. Sociedade Brasileira de Computação, October 2012.
Abstract

The popularization of geographical position devices (e.g. GPS) creates new opportunities for analyzing behavior of moving objects. However, such analysis are hindered by a lack of semantic information associated to the basic information provided by GPS. Previous works propose semantic enrichment of trajectories. Through the semantic enrichment, we could check which trajectories have a given moving sequence in an application. Often, this sequence is expressed according to the semantic application, using the approach of semantic trajectories proposed in the literature. This trajectory can be represented as a sequence of predicates that holds in some time interval. However, the solutions for querying moving sequence proposed by previous works have a high computational cost. In this paper, we propose an expressive query language to semantic trajectories that allows temporal constraints. To evaluate a query we will use model checking based on timed automata, that can be performed in polynomial time. As this model checking algorithm is not implemented yet, we propose to use UPPAAL tool, that can be more expensive theoretically, but we expected that will be ecient for our approach. In addition, we will present a query example that demonstrates the expressive power of our language. Although in this paper we will focus on semantic trajectories data, our approach is general enough for being applied to other purposes.

@inproceedings{sbbd2012-SVMM,
  author =              {Sim{\~o}es{ }De{~}Sousa, Diego V. and Viana,
                         Henrique and Markey, Nicolas and de Mac{\^e}do, Jose
                         Ant{\^o}nio F.},
  title =               {Querying Trajectories through Model Checking based
                         on Timed Automata},
  editor =              {Casanova, Marco A.},
  booktitle =           {{P}roceedings of the 27th {B}razilian {S}ymposium on
                         {D}atabases ({SBBD}'12)},
  acronym =             {{SBBD}'12},
  publisher =           {Sociedade Brasileira de Computa{\c c}{\~a}o},
  pages =               {33-40},
  year =                {2012},
  month =               oct,
  abstract =            {The popularization of geographical position devices
                         (e.g.~GPS) creates new opportunities for analyzing
                         behavior of moving objects. However, such analysis
                         are hindered by a lack of semantic information
                         associated to the basic information provided by~GPS.
                         Previous works propose semantic enrichment of
                         trajectories. Through the semantic enrichment,
                         we~could check which trajectories have a given
                         moving sequence in an application. Often,
                         this~sequence is expressed according to the semantic
                         application, using the approach of semantic
                         trajectories proposed in the literature.
                         This~trajectory can be represented as a sequence of
                         predicates that holds in some time interval.
                         However, the solutions for querying moving sequence
                         proposed by previous works have a high computational
                         cost. In~this paper, we~propose an expressive query
                         language to semantic trajectories that allows
                         temporal constraints. To~evaluate a query we will
                         use model checking based on timed automata, that can
                         be performed in polynomial time. As~this model
                         checking algorithm is not implemented yet, we
                         propose to use UPPAAL tool, that can be more
                         expensive theoretically, but we expected that will
                         be ecient for our approach. In addition, we will
                         present a query example that demonstrates the
                         expressive power of our language. Although in this
                         paper we will focus on semantic trajectories data,
                         our approach is general enough for being applied to
                         other purposes.},
}
[SVW85] A. Prasad Sistla, Moshe Y. Vardi, and Pierre Wolper. The Complementation Problem for Büchi Automata, with Applications to Temporal Logic. In ICALP'85, Lecture Notes in Computer Science 194, pages 465-474. Springer-Verlag, July 1985. 
@inproceedings{icalp1985-SVW,
  author =              {Sistla, A. Prasad and Vardi, Moshe Y. and Wolper,
                         Pierre},
  title =               {The Complementation Problem for {B}{\"u}chi
                         Automata, with Applications to Temporal Logic},
  editor =              {Brauer, Wilfried},
  booktitle =           {{P}roceedings of the 12th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'85)},
  acronym =             {{ICALP}'85},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {194},
  pages =               {465-474},
  year =                {1985},
  month =               jul,
}
[SVW87] A. Prasad Sistla, Moshe Y. Vardi, and Pierre Wolper. The Complementation Problem for Büchi Automata with Applications to Temporal Logics. Theoretical Computer Science 49:217-237. Elsevier, 1987. 
@article{tcs49()-SVW,
  author =              {Sistla, A. Prasad and Vardi, Moshe Y. and Wolper,
                         Pierre},
  title =               {The Complementation Problem for {B}{\"u}chi Automata
                         with Applications to Temporal Logics},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {49},
  pages =               {217-237},
  year =                {1987},
}
[SW10] Chrstoffer Sloth and Rafael Wisniewski. Timed Game Abstraction of Control Systems. Technical Report 1012.5113, arXiv, December 2010. 
@techreport{arxiv1012.5113-SW,
  author =              {Sloth, Chrstoffer and Wisniewski, Rafael},
  title =               {Timed Game Abstraction of Control Systems},
  number =              {1012.5113},
  year =                {2010},
  month =               dec,
  institution =         {arXiv},
}
[SW13] Chrstoffer Sloth and Rafael Wisniewski. Complete abstractions of dynamical systems by timed automata. Nonlinear Analysis: Hybrid Systems 7(1):80-100. February 2013. 
@article{nahs7(1)-SW,
  author =              {Sloth, Chrstoffer and Wisniewski, Rafael},
  title =               {Complete abstractions of dynamical systems by timed
                         automata},
  journal =             {Nonlinear Analysis: Hybrid Systems},
  volume =              {7},
  number =              {1},
  pages =               {80-100},
  year =                {2013},
  month =               feb,
  doi =                 {10.1007/s10703-011-0118-0},
}
[SZH+09] Mathijs Schuts, Yunshan Zhu, Faranak Heidarian, and Frits Vaandrager. Modelling Clock Synchronization in the Chess gMAC WSN Protocol. In QFM'09, Electronic Proceedings in Theoretical Computer Science 13, pages 41-54. November 2009. 
@inproceedings{qfm2009-SZHV,
  author =              {Schuts, Mathijs and Zhu, Yunshan and Heidarian,
                         Faranak and Vaandrager, Frits},
  title =               {Modelling Clock Synchronization in the Chess g{MAC}
                         {WSN} Protocol},
  editor =              {Andova, Suzana and McIver, Annabelle K. and
                         D{'}Argenio, Pedro R. and Cuijpers, Pieter J. L. and
                         Markovski, Jasen and Morgan, Carroll C. and
                         N{\'u}{\~n}ez, Manuel},
  booktitle =           {{P}roceedings of the 1st {W}orkshop on
                         {Q}uantitative {F}ormal {M}ethods: {T}heory and
                         {A}pplications ({QFM}'09)},
  acronym =             {{QFM}'09},
  series =              {Electronic Proceedings in Theoretical Computer
                         Science},
  volume =              {13},
  pages =               {41-54},
  year =                {2009},
  month =               nov,
}
[Szy18] Marek Szykuła. Improving the Upper Bound on the Length of the Shortest Reset Word. In STACS'18, Leibniz International Proceedings in Informatics 96, pages 56:1-56:13. Leibniz-Zentrum für Informatik, February 2018. 
@inproceedings{stacs2018-Szy,
  author =              {Szyku{\l}a, Marek},
  title =               {Improving the Upper Bound on the Length of the
                         Shortest Reset Word},
  editor =              {Niedermeier, Rolf and Vall{\'e}e, Brigitte},
  booktitle =           {{P}roceedings of the 35th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'18)},
  acronym =             {{STACS}'18},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {96},
  pages =               {56:1-56:13},
  year =                {2018},
  month =               feb,
  doi =                 {10.4230/LIPIcs.STACS.2018.56},
}
T
[TA99] Stavros Tripakis and Karine Altisen. On-the-Fly Controller Synthesis for Discrete and Dense-Time Systems. In FM'99, Lecture Notes in Computer Science 1708, pages 233-252. Springer-Verlag, September 1999. 
@inproceedings{fm1999-TA,
  author =              {Tripakis, Stavros and Altisen, Karine},
  title =               {On-the-Fly Controller Synthesis for Discrete and
                         Dense-Time Systems},
  editor =              {Wing, Jeannette M. and Woodcock, Jim and Davies,
                         Jim},
  booktitle =           {{P}roceedings of the {W}orld {C}ongress on {F}ormal
                         {M}ethods ({FM}'99)},
  acronym =             {{FM}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1708},
  pages =               {233-252},
  year =                {1999},
  month =               sep,
}
[Tak97] Masayuki Takeda. Pattern Maching Machine for Text Compressed Using Finite State Model. Technical Report DOI-TR-142, Dept. of Informatics, Kyushu University, Fukuoka, Japan, October 1997. 
@techreport{DOI-TR-142,
  author =              {Takeda, Masayuki},
  title =               {Pattern Maching Machine for Text Compressed Using
                         Finite State Model},
  number =              {DOI-TR-142},
  year =                {1997},
  month =               oct,
  institution =         {Dept. of Informatics, Kyushu University, Fukuoka,
                         Japan},
  type =                {Technical Report},
}
[TAK+96] Serdar Taşiran, Rajeev Alur, Robert P. Kurshan, and Robert K. Brayton. Verifying Abstractions of Timed Systems. In CONCUR'96, Lecture Notes in Computer Science 1119, pages 546-562. Springer-Verlag, August 1996. 
@inproceedings{concur1996-TAKB,
  author =              {Ta{\c s}iran, Serdar and Alur, Rajeev and Kurshan,
                         Robert P. and Brayton, Robert K.},
  title =               {Verifying Abstractions of Timed Systems},
  editor =              {Montanari, Ugo and Sassone, Vladimiro},
  booktitle =           {{P}roceedings of the 7th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'96)},
  acronym =             {{CONCUR}'96},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1119},
  pages =               {546-562},
  year =                {1996},
  month =               aug,
}
[Tan01] Till Tantau. A Note on the Complexity of the Reachability Problem for Tournaments. Research Report 01-092, Electronic Colloquium on Computational Complexity, 2001. 
@techreport{eccc2001-Tan,
  author =              {Tantau, Till},
  title =               {A Note on the Complexity of the Reachability Problem
                         for Tournaments},
  number =              {01-092},
  year =                {2001},
  institution =         {Electronic Colloquium on Computational Complexity},
  type =                {Research Report},
}
[Tan02] Till Tantau. Comparing Verboseness for Finite Automata and Turing Machines. In STACS'02, Lecture Notes in Computer Science 2285, pages 465-476. Springer-Verlag, March 2002. 
@inproceedings{stacs2002-Tan,
  author =              {Tantau, Till},
  title =               {Comparing Verboseness for Finite Automata and Turing
                         Machines},
  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 =               {465-476},
  year =                {2002},
  month =               mar,
}
[Tar55] Alfred Tarski. A Lattice-Theoretical Fixpoint Theorem and its Applications. Pacific Journal of Mathematics 5(2):285-309. 1955. 
@article{pjm5(2)-Tar,
  author =              {Tarski, Alfred},
  title =               {A Lattice-Theoretical Fixpoint Theorem and its
                         Applications},
  journal =             {Pacific Journal of Mathematics},
  volume =              {5},
  number =              {2},
  pages =               {285-309},
  year =                {1955},
}
[Tar72] Robert Endre Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing 1(2):146-160. Society for Industrial and Applied Math., June 1972. 
@article{siamcomp1(2)-Tar,
  author =              {Tarjan, Robert Endre},
  title =               {Depth-first search and linear graph algorithms},
  publisher =           {Society for Industrial and Applied Math.},
  journal =             {SIAM Journal on Computing},
  volume =              {1},
  number =              {2},
  pages =               {146-160},
  year =                {1972},
  month =               jun,
}
[Tar83] Robert Endre Tarjan. Data structures and network algorithms. CBMS-NSF Regional Conference Series in Applied Mathematics 44. Society for Industrial and Applied Math., 1983. 
@book{Tar83-DSNA,
  author =              {Tarjan, Robert Endre},
  title =               {Data structures and network algorithms},
  publisher =           {Society for Industrial and Applied Math.},
  series =              {CBMS-NSF Regional Conference Series in Applied
                         Mathematics},
  volume =              {44},
  year =                {1983},
}
[Tau03] Heikko Tauriainen. On Translating Linear Temporal Logic into Alternating and Nondeterministic Automata. Licentiate thesis, Helsinki University of Technology, Finland, 2003. 
@mastersthesis{licentiate-tauriainen,
  author =              {Tauriainen, Heikko},
  title =               {On Translating Linear Temporal Logic into
                         Alternating and Nondeterministic Automata},
  year =                {2003},
  school =              {Helsinki University of Technology, Finland},
  type =                {Licentiate thesis},
}
[Tau06] Heikko Tauriainen. Automata and Linear Temporal Logic: Translations with Transition-based Acceptance. Technical Report HUT-TCS-A104, Helsinki University of Technology, Finland, 2006. 
@techreport{hut-tcs-a104-Tau,
  author =              {Tauriainen, Heikko},
  title =               {Automata and Linear Temporal Logic: Translations
                         with Transition-based Acceptance},
  number =              {HUT-TCS-A104},
  year =                {2006},
  institution =         {Helsinki University of Technology, Finland},
}
[TD98] Josef Tapken and Henning Dierks. MOBY/PLC – Graphical Development of PLC-Automata. In FTRTFT'98, Lecture Notes in Computer Science 1486, pages 311-314. Springer-Verlag, September 1998. 
@inproceedings{ftrtft1998-TD,
  author =              {Tapken, Josef and Dierks, Henning},
  title =               {{MOBY/PLC}~-- Graphical Development of
                         {PLC}-Automata},
  editor =              {Ravn, Anders P. and Rischel, Hans},
  booktitle =           {{P}roceedings of the 5th {F}ormal {T}echniques in
                         {R}eal-Time and {F}ault-Tolerant {S}ystems
                         ({FTRTFT}'98)},
  acronym =             {{FTRTFT}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1486},
  pages =               {311-314},
  year =                {1998},
  month =               sep,
}
[TD09] Cong Tian and Zhenhua Duan. A Note on Stutter-Invariant PLTL. Information Processing Letters 109(13):663-667. Elsevier, June 2009. 
@article{ipl109(13)-TD,
  author =              {Tian, Cong and Duan, Zhenhua},
  title =               {A~Note on Stutter-Invariant {PLTL}},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {109},
  number =              {13},
  pages =               {663-667},
  year =                {2009},
  month =               jun,
}
[TvE+87] Leen Torenvliet and Peter van Emde Boas. A Note on Time and Space. In CSN'87. SION, November 1987. 
@inproceedings{csn1987-TE,
  author =              {Torenvliet, Leen and van Emde Boas, Peter},
  title =               {A Note on Time and Space},
  booktitle =           {{P}roceedings of the 1st {C}onference on {C}omputing
                         {S}cience in the {N}etherlands ({CSN}'87)},
  acronym =             {{CSN}'87},
  publisher =           {SION},
  year =                {1987},
  month =               nov,
}
[TFL10] Claus Thrane, Uli Fahrenberg, and Kim Guldstrand Larsen. Quantitative Analysis of Weighted Transition Systems. Journal of Logic and Algebraic Programming 79(7):689-703. Elsevier, October 2010. 
@article{jlap79(7)-TFL,
  author =              {Thrane, Claus and Fahrenberg, Uli and Larsen, Kim
                         Guldstrand},
  title =               {Quantitative Analysis of Weighted Transition
                         Systems},
  publisher =           {Elsevier},
  journal =             {Journal of Logic and Algebraic Programming},
  volume =              {79},
  number =              {7},
  pages =               {689-703},
  year =                {2010},
  month =               oct,
}
[TH00] Heikko Tauriainen and Keijo Heljanko. Testing SPIN's LTL Formula Conversion into Büchi Automata with Randomly Generated Input. In SPIN'00, Lecture Notes in Computer Science 1885, pages 54-72. Springer-Verlag, August 2000. 
@inproceedings{spin2000-TH,
  author =              {Tauriainen, Heikko and Heljanko, Keijo},
  title =               {Testing {SPIN}'s {LTL} Formula Conversion into
                         {B}{\"u}chi Automata with Randomly Generated Input},
  editor =              {Havelund, Klaus and Penix, John and Viser, Willem},
  booktitle =           {{P}roceedings of the 7th {I}nternational {SPIN}
                         {W}orkshop ({SPIN}'00)},
  acronym =             {{SPIN}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1885},
  pages =               {54-72},
  year =                {2000},
  month =               aug,
}
[THH+12] Takashi Tomita, Shin Hiura, Shigeki Hagihara, and Naoki Yonezaki. A Temporal Logic with Mean-Payoff Constraints. In ICFEM'12, Lecture Notes in Computer Science 7635, pages 249-265. Springer-Verlag, November 2012. 
@inproceedings{icfem2012-THHY,
  author =              {Tomita, Takashi and Hiura, Shin and Hagihara,
                         Shigeki and Yonezaki, Naoki},
  title =               {A~Temporal Logic with Mean-Payoff Constraints},
  editor =              {Aoki, Toshiaki and Taguchi, Kenji},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {C}onference on {F}ormal {E}ngineering {M}ethods
                         ({ICFEM}'12)},
  acronym =             {{ICFEM}'12},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7635},
  pages =               {249-265},
  year =                {2012},
  month =               nov,
  doi =                 {10.1007/978-3-642-34281-3_19},
}
[Thi15] Yann Thierry-Mieg. Symbolic Model-Checking Using ITS-Tools. In TACAS'15, Lecture Notes in Computer Science 9035, pages 231-237. Springer-Verlag, April 2015. 
@inproceedings{tacas2015-Thi,
  author =              {Thierry{-}Mieg, Yann},
  title =               {Symbolic Model-Checking Using {ITS}-Tools},
  editor =              {Baier, {\relax Ch}ristel and Tinelli, Cesare},
  booktitle =           {{P}roceedings of the 21st {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'15)},
  acronym =             {{TACAS}'15},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9035},
  pages =               {231-237},
  year =                {2015},
  month =               apr,
  doi =                 {10.1007/978-3-662-46681-0_20},
}
[Tho88] Wolfgang Thomas. Automata on Infinite Objects. Technical Report AIB-88-17, Aachener Informatik Berichte, Aachen, Germany, October 1988. 
@techreport{AIB-8817-Tho,
  author =              {Thomas, Wolfgang},
  title =               {Automata on Infinite Objects},
  number =              {AIB-88-17},
  year =                {1988},
  month =               oct,
  institution =         {Aachener Informatik Berichte, Aachen, Germany},
  type =                {Technical Report},
}
[Tho91] Wolfgang Thomas. On Logics, Tilings, and Automata. In ICALP'91, Lecture Notes in Computer Science 510, pages 441-454. Springer-Verlag, July 1991. 
@inproceedings{icalp1991-Tho,
  author =              {Thomas, Wolfgang},
  title =               {On Logics, Tilings, and Automata},
  editor =              {Albert, Javier Leach and Monien, Burkhard and
                         Rodr{\'\i}guez{-}Artalejo, Mario},
  booktitle =           {{P}roceedings of the 19th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'91)},
  acronym =             {{ICALP}'91},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {510},
  pages =               {441-454},
  year =                {1991},
  month =               jul,
}
[Tho95] Wolfgang Thomas. On the Synthesis of Strategies in Infinite Games. In STACS'95, Lecture Notes in Computer Science 900, pages 1-13. Springer-Verlag, March 1995. 
@inproceedings{stacs1995-Tho,
  author =              {Thomas, Wolfgang},
  title =               {On the Synthesis of Strategies in Infinite Games},
  editor =              {Mayr, Ernst W. and Puech, Claude},
  booktitle =           {{P}roceedings of the 12th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'95)},
  acronym =             {{STACS}'95},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {900},
  pages =               {1-13},
  year =                {1995},
  month =               mar,
}
[Tho96] Wolfgang Thomas. Languages, Automata and Logics. Technical Report 9607, Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität, Kiel, Germany, May 1996. 
@techreport{TR-9607-Tho,
  author =              {Thomas, Wolfgang},
  title =               {Languages, Automata and Logics},
  number =              {9607},
  year =                {1996},
  month =               may,
  institution =         {Institut f{\"u}r Informatik und Praktische
                         Mathematik, Christian-Albrechts-Universit{\"a}t,
                         Kiel, Germany},
  type =                {Technical Report},
}
[Tho97] Wolfgang Thomas. Automata Theory on Tress and Partial Orders. In TAPSOFT'97, Lecture Notes in Computer Science 1214, pages 20-38. Springer-Verlag, April 1997. 
@inproceedings{tapsoft1997-Tho,
  author =              {Thomas, Wolfgang},
  title =               {Automata Theory on Tress and Partial Orders},
  editor =              {Bidoit, Michel and Dauchet, Max},
  booktitle =           {{P}roceedings of the 7th {I}nternational {J}oint
                         {C}onference {CAAP}{\slash}{FASE} on {T}heory and
                         {P}ractice of {S}oftware {D}evelopment
                         ({TAPSOFT}'97)},
  acronym =             {{TAPSOFT}'97},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1214},
  pages =               {20-38},
  year =                {1997},
  month =               apr,
}
[Tho97] Wolfgang Thomas. Languages, Automata and Logics. In Grzegorz Rozenberg and Arto Salomaa (eds.), Handbook of Formal Languages. Springer-Verlag, 1997. 
@incollection{HFL1997(3)-Tho,
  author =              {Thomas, Wolfgang},
  title =               {Languages, Automata and Logics},
  editor =              {Rozenberg, Grzegorz and Salomaa, Arto},
  booktitle =           {Handbook of Formal Languages},
  publisher =           {Springer-Verlag},
  volume =              {3},
  pages =               {389-455},
  year =                {1997},
}
[Tho02] Wolfgang Thomas. Infinite Games and Verification (Extended Abstract of a Tutoral). In CAV'02, Lecture Notes in Computer Science 2404, pages 58-64. Springer-Verlag, July 2002. 
@inproceedings{cav2002-Tho,
  author =              {Thomas, Wolfgang},
  title =               {Infinite Games and Verification (Extended Abstract
                         of a Tutoral)},
  editor =              {Brinksma, Ed and Larsen, Kim Guldstrand},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'02)},
  acronym =             {{CAV}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2404},
  pages =               {58-64},
  year =                {2002},
  month =               jul,
}
[TM17] Tamás Tóth and István Majzik. Lazy reachability checking for timed automata using interpolants. In FORMATS'17, Lecture Notes in Computer Science 10419, pages 264-280. Springer-Verlag, September 2017. 
@inproceedings{formats2017-TM,
  author =              {T{\'o}th, Tam{\'a}s and Majzik, Istv{\'a}n},
  title =               {Lazy reachability checking for timed automata using
                         interpolants},
  editor =              {Abate, Alessandro and Geeraerts, Gilles},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'17)},
  acronym =             {{FORMATS}'17},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {10419},
  pages =               {264-280},
  year =                {2017},
  month =               sep,
  doi =                 {10.1007/978-3-319-65765-3_15},
}
[Too63] Andrei L. Toom. The complexity of a scheme of functional elements realizing the multiplication of integers. Doklady Akademii Nauk SSSR 150(3):496-498. Russian Academy of Sciences, 1963. 
@article{danSSSR150(3)-Too,
  author =              {Toom, Andrei L.},
  title =               {The complexity of a scheme of functional elements
                         realizing the multiplication of integers},
  publisher =           {Russian Academy of Sciences},
  journal =             {Doklady Akademii Nauk SSSR},
  volume =              {150},
  number =              {3},
  pages =               {496-498},
  year =                {1963},
}
[TR04] Prasanna Thati and Grigore Roşu. Monitoring Algorithms for Metric Temporal Logic Specifications. In RV'04, Electronic Notes in Theoretical Computer Science 113, pages 131-147. Elsevier, April 2004. 
@inproceedings{rv2004-TR,
  author =              {Thati, Prasanna and Ro{\c{s}}u, Grigore},
  title =               {Monitoring Algorithms for Metric Temporal Logic
                         Specifications},
  editor =              {Havelund, Klaus and Ro{\c{s}}u, Grigore},
  booktitle =           {{P}roceedings of the 4th {I}nternational {W}orkshop
                         on {R}untime {V}erification ({RV}'04)},
  acronym =             {{RV}'04},
  publisher =           {Elsevier},
  series =              {Electronic Notes in Theoretical Computer Science},
  volume =              {113},
  pages =               {131-147},
  year =                {2004},
  month =               apr,
  doi =                 {10.1016/j.entcs.2004.12.01},
}
[Tre96] Jan Tretmans. Test Generation with Inputs, Outputs, and Quiescence. In TACAS'96, Lecture Notes in Computer Science 1055, pages 127-146. Springer-Verlag, March 1996. 
@inproceedings{tacas1996-Tre,
  author =              {Tretmans, Jan},
  title =               {Test Generation with Inputs, Outputs, and
                         Quiescence},
  editor =              {Margaria, Tiziana and Steffen, Bernhard},
  booktitle =           {{P}roceedings of the 2nd {I}nternational {W}orkshop
                         on {T}ools and {A}lgorithms for {C}onstruction and
                         {A}nalysis of {S}ystems ({TACAS}'96)},
  acronym =             {{TACAS}'96},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1055},
  pages =               {127-146},
  year =                {1996},
  month =               mar,
  doi =                 {10.1007/3-540-61042-1_42},
}
[Tre96] Jan Tretmans. Conformance Testing with Labelled Transition Systems: Implementation Relations and Test Generation. Computer Networks and ISDN Systems 29(1):49-79. Elsevier, 1996. 
@article{cnISDNs29(1)-Tre,
  author =              {Tretmans, Jan},
  title =               {Conformance Testing with Labelled Transition
                         Systems: Implementation Relations and Test
                         Generation},
  publisher =           {Elsevier},
  journal =             {Computer Networks and {ISDN} Systems},
  volume =              {29},
  number =              {1},
  pages =               {49-79},
  year =                {1996},
  doi =                 {10.1016/S0169-7552(96)00017-7},
}
[Tri99] Stavros Tripakis. Timed Diagnostics for Reachability Properties. In TACAS'99, Lecture Notes in Computer Science 1579, pages 59-73. Springer-Verlag, March 1999. 
@inproceedings{tacas1999-Tri,
  author =              {Tripakis, Stavros},
  title =               {Timed Diagnostics for Reachability Properties},
  editor =              {Cleaveland, Rance},
  booktitle =           {{P}roceedings of the 5th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'99)},
  acronym =             {{TACAS}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1579},
  pages =               {59-73},
  year =                {1999},
  month =               mar,
}
[Tri02] Stavros Tripakis. Description and Schedulability Analysis of the Software Architecture of an Automated Vehicle Control System. In EMSOFT'02, Lecture Notes in Computer Science 2491, pages 123-137. Springer-Verlag, October 2002. 
@inproceedings{emsoft2002-Tri,
  author =              {Tripakis, Stavros},
  title =               {Description and Schedulability Analysis of the
                         Software Architecture of an Automated Vehicle
                         Control System},
  editor =              {Sangiovani{-}Vincentelli, Alberto L. and Sifakis,
                         Joseph},
  booktitle =           {{P}roceedings of the 2nd {I}nternational
                         {C}onference on {E}mbedded {S}oftware ({EMSOFT}'02)},
  acronym =             {{EMSOFT}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2491},
  pages =               {123-137},
  year =                {2002},
  month =               oct,
}
[Tri06] Stavros Tripakis. Folk theorems on the determinization and minimization of timed automata. Information Processing Letters 99(6):222-226. Elsevier, September 2006. 
@article{ipl99(6)-Tri,
  author =              {Tripakis, Stavros},
  title =               {Folk theorems on the determinization and
                         minimization of timed automata},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {99},
  number =              {6},
  pages =               {222-226},
  year =                {2006},
  month =               sep,
  doi =                 {10.1016/j.ipl.2006.04.015},
}
[Tri09] Stavros Tripakis. Checking Timed Büchi Automata Emptiness on Simulation Graphs. ACM Transactions on Computational Logic 10(3). ACM Press, April 2009. 
@article{tocl10(3)-Tri,
  author =              {Tripakis, Stavros},
  title =               {Checking Timed B{\"{u}}chi Automata Emptiness on
                         Simulation Graphs},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Computational Logic},
  volume =              {10},
  number =              {3},
  year =                {2009},
  month =               apr,
  doi =                 {10.1145/1507244.1507245},
}
[Tsa03] Boaz Tsaban. Bernoulli Numbers and the Probability of a Birthday Surprise. Discrete Applied Mathematics 127(1):657-663. Elsevier, April 2003. 
@article{dam127(1)-Tsa,
  author =              {Tsaban, Boaz},
  title =               {{B}ernoulli Numbers and the Probability of a
                         Birthday Surprise},
  publisher =           {Elsevier},
  journal =             {Discrete Applied Mathematics},
  volume =              {127},
  number =              {1},
  pages =               {657-663},
  year =                {2003},
  month =               apr,
}
[Tur37] Alan M. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society s2-42(1):230-265. 1937. 
@article{plms-s2-42(1)-Tur,
  author =              {Turing, Alan M.},
  title =               {On~computable numbers, with an application to the
                         {\emph{Entscheidungsproblem}}},
  journal =             {Proceedings of the London Mathematical Society},
  volume =              {s2-42},
  number =              {1},
  pages =               {230-265},
  year =                {1937},
  doi =                 {10.1112/plms/s2-42.1.230},
}
[Tur38] Alan M. Turing. On computable numbers, with an application to the Entscheidungsproblem. A Correction. Proceedings of the London Mathematical Society s2-43(6):544-546. 1938. 
@article{plms-s2-43(6)-Tur,
  author =              {Turing, Alan M.},
  title =               {On~computable numbers, with an application to the
                         {\emph{Entscheidungsproblem}}. A~Correction},
  journal =             {Proceedings of the London Mathematical Society},
  volume =              {s2-43},
  number =              {6},
  pages =               {544-546},
  year =                {1938},
  doi =                 {10.1112/plms/s2-43.6.544},
}
[TV87] Frank Thuijsman and Okko J. Vrieze. The bad match; A total reward stochastic game. OR Spektrum 9(2):93-99. 1987. 
@article{ORspectrum9(2)-TV,
  author =              {Thuijsman, Frank and Vrieze, Okko J.},
  title =               {The bad match; A~total reward stochastic game},
  journal =             {OR Spektrum},
  volume =              {9},
  number =              {2},
  pages =               {93-99},
  year =                {1987},
  doi =                 {10.1007/BF01732644},
}
[TW96] Denis Thérien and Thomas Wilke. Temporal Logic and Semidirect Products: an Effective Characterization of the Until Hierarchy. In FOCS'96, pages 256-263. IEEE Comp. Soc. Press, October 1996. 
@inproceedings{focs1996-TW,
  author =              {Th{\'e}rien, Denis and Wilke, Thomas},
  title =               {Temporal Logic and Semidirect Products: an Effective
                         Characterization of the Until Hierarchy},
  booktitle =           {{P}roceedings of the 37th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'96)},
  acronym =             {{FOCS}'96},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {256-263},
  year =                {1996},
  month =               oct,
}
[TW98] Denis Thérien and Thomas Wilke. Over Words, Two Variables Are as Powerful as One Quantifier Alternation: FO2 = Σ2 ∩Π2. In STOC'98, pages 234-240. ACM Press, May 1998. 
@inproceedings{stoc1998-TW,
  author =              {Th{\'e}rien, Denis and Wilke, Thomas},
  title =               {Over Words, Two Variables Are as Powerful as One
                         Quantifier Alternation: {\(\textup{FO}^2 = \Sigma_2
                         \cap \Pi_2\)}},
  booktitle =           {{P}roceedings of the 30th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'98)},
  acronym =             {{STOC}'98},
  publisher =           {ACM Press},
  pages =               {234-240},
  year =                {1998},
  month =               may,
}
[TW02] Denis Thérien and Thomas Wilke. Nesting Until and Since in Linear Temporal Logic. In STACS'02, Lecture Notes in Computer Science 2285, pages 455-464. Springer-Verlag, March 2002. 
@inproceedings{stacs2002-TW,
  author =              {Th{\'e}rien, Denis and Wilke, Thomas},
  title =               {Nesting Until and Since in Linear Temporal Logic},
  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 =               {455-464},
  year =                {2002},
  month =               mar,
}
[TW02] P. S. Thiagarajan and Igor Walukiewicz. An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces. Information and Computation 179(2):230-249. Academic Press, December 2002. 
@article{icomp179(2)-TW,
  author =              {Thiagarajan, P. S. and Walukiewicz, Igor},
  title =               {An Expressively Complete Linear Time Temporal Logic
                         for {M}azurkiewicz Traces},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {179},
  number =              {2},
  pages =               {230-249},
  year =                {2002},
  month =               dec,
}
[TW12] Nicolas Troquard and Dirk Walther. On Satisfiability in ATL with Strategy Contexts. In JELIA'12, Lecture Notes in Computer Science 7519, pages 398-410. Springer-Verlag, September 2012. 
@inproceedings{jelia2012-TW,
  author =              {Troquard, Nicolas and Walther, Dirk},
  title =               {On Satisfiability in {ATL} with Strategy Contexts},
  editor =              {Fari{\~n}as{ }del{ }Cerro, Luis and Herzig, Andreas
                         and Mengin, J{\'e}r{\^o}me},
  booktitle =           {{P}roceedings of the 13th {E}uropean {C}onference in
                         {L}ogics in {A}rtificial {I}ntelligence
                         ({JELIA}'12)},
  acronym =             {{JELIA}'12},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7519},
  pages =               {398-410},
  year =                {2012},
  month =               sep,
  doi =                 {10.1007/978-3-642-33353-8_31},
}
[TY01] Stavros Tripakis and Sergio Yovine. Timing Analysis and Code Generation of Vehicle Control Software using Taxys. In RV'01, Electronic Notes in Theoretical Computer Science 55(2), pages 277-286. Elsevier, July 2001. 
@inproceedings{rv2001-TY,
  author =              {Tripakis, Stavros and Yovine, Sergio},
  title =               {Timing Analysis and Code Generation of Vehicle
                         Control Software using {T}axys},
  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},
  pages =               {277-286},
  year =                {2001},
  month =               jul,
}
[TY01] Stavros Tripakis and Sergio Yovine. Analysis of Timed Systems Using Time-Abstracting Bisimulations. Formal Methods in System Design 18(1):25-68. Kluwer Academic, January 2001. 
@article{fmsd18(1)-TY,
  author =              {Tripakis, Stavros and Yovine, Sergio},
  title =               {Analysis of Timed Systems Using Time-Abstracting
                         Bisimulations},
  publisher =           {Kluwer Academic},
  journal =             {Formal Methods in System Design},
  volume =              {18},
  number =              {1},
  pages =               {25-68},
  year =                {2001},
  month =               jan,
  doi =                 {10.1023/A:1008734703554},
}
[TYB05] Stavros Tripakis, Sergio Yovine, and Ahmed Bouajjani. Checking Timed Büchi Automata Emptiness Efficiently. Formal Methods in System Design 26(3):267-292. Springer-Verlag, May 2005. 
@article{fmsd26(3)-TYB,
  author =              {Tripakis, Stavros and Yovine, Sergio and Bouajjani,
                         Ahmed},
  title =               {Checking Timed {B}{\"u}chi Automata Emptiness
                         {E}fficiently},
  publisher =           {Springer-Verlag},
  journal =             {Formal Methods in System Design},
  volume =              {26},
  number =              {3},
  pages =               {267-292},
  year =                {2005},
  month =               may,
  doi =                 {10.1007/s10703-005-1632-8},
}
U
[UB13] Michael Ummels and Christel Baier. Computing Quantiles in Markov Reward Models. In FoSSaCS'13, Lecture Notes in Computer Science 7794, pages 353-368. Springer-Verlag, March 2013. 
@inproceedings{UB-fossacs13,
  author =              {Ummels, Michael and Baier, {\relax Ch}ristel},
  title =               {Computing Quantiles in {M}arkov Reward Models},
  editor =              {Pfenning, Frank},
  booktitle =           {{P}roceedings of the 16th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'13)},
  acronym =             {{FoSSaCS}'13},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7794},
  pages =               {353-368},
  year =                {2013},
  month =               mar,
  doi =                 {10.1007/978-3-642-37075-5_23},
}
[Umm05] Michael Ummels. Rational Behavious and Strategy Construction in Infinite Multiplayer Games. Diplomarbeit, RWTH Aachen, Germany, July 2005. 
@mastersthesis{diplom05-Umm,
  author =              {Ummels, Michael},
  title =               {Rational Behavious and Strategy Construction in
                         Infinite Multiplayer Games},
  year =                {2005},
  month =               jul,
  school =              {RWTH Aachen, Germany},
  type =                {Diplomarbeit},
}
[Umm06] Michael Ummels. Rational Behavior and Strategy Construction in Infinite Multiplayer Games. In FSTTCS'06, Lecture Notes in Computer Science 4337, pages 212-223. Springer-Verlag, December 2006. 
@inproceedings{fsttcs2006-Umm,
  author =              {Ummels, Michael},
  title =               {Rational Behavior and Strategy Construction in
                         Infinite Multiplayer Games},
  editor =              {Arun-Kumar, S. and Garg, Naveen},
  booktitle =           {{P}roceedings of the 26th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'06)},
  acronym =             {{FSTTCS}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4337},
  pages =               {212-223},
  year =                {2006},
  month =               dec,
}
[Umm08] Michael Ummels. The Complexity of Nash Equilibria in Infinite Multiplayer Games. In FoSSaCS'08, Lecture Notes in Computer Science 4962, pages 20-34. Springer-Verlag, March 2008. 
@inproceedings{fossacs2008-Umm,
  author =              {Ummels, Michael},
  title =               {The Complexity of {N}ash Equilibria in Infinite
                         Multiplayer Games},
  editor =              {Amadio, Roberto},
  booktitle =           {{P}roceedings of the 11th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'08)},
  acronym =             {{FoSSaCS}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4962},
  pages =               {20-34},
  year =                {2008},
  month =               mar,
}
[Umm10] Michael Ummels. Stochastic multiplayer games: theory and algorithms. PhD thesis, RWTH Aachen, Germany, January 2010. 
@phdthesis{phd10-Umm,
  author =              {Ummels, Michael},
  title =               {Stochastic multiplayer games: theory and algorithms},
  year =                {2010},
  month =               jan,
  school =              {RWTH Aachen, Germany},
}
[UW09] Michael Ummels and Dominik Wojtczak. Decision Problems for Nash Equilibria in Stochastic Games. In CSL'09, Lecture Notes in Computer Science 5771, pages 51-530. Springer-Verlag, September 2009. 
@inproceedings{csl2009-UW,
  author =              {Ummels, Michael and Wojtczak, Dominik},
  title =               {Decision Problems for {N}ash Equilibria in
                         Stochastic Games},
  editor =              {Gr{\"a}del, Erich and Kahle, Reinhard},
  booktitle =           {{P}roceedings of the 23rd {I}nternational {W}orkshop
                         on {C}omputer {S}cience {L}ogic ({CSL}'09)},
  acronym =             {{CSL}'09},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5771},
  pages =               {51-530},
  year =                {2009},
  month =               sep,
}
[UW09] Michael Ummels and Dominik Wojtczak. The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games. In ICALP'09, Lecture Notes in Computer Science 5556, pages 297-308. Springer-Verlag, July 2009. 
@inproceedings{icalp2009-UW,
  author =              {Ummels, Michael and Wojtczak, Dominik},
  title =               {The Complexity of {N}ash Equilibria in Simple
                         Stochastic Multiplayer Games},
  editor =              {Albers, Susanne and Marchetti{-}Spaccamela Alberto
                         and Matias, Yossi and Nikoletseas, Sotiris and
                         Thomas, Wolfgang},
  booktitle =           {{P}roceedings of the 36th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'09)~-- Part~{II}},
  acronym =             {{ICALP}'09},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5556},
  pages =               {297-308},
  year =                {2009},
  month =               jul,
}
V
[Vaa07] Jouko Väänänen. Dependence Logic: A New Approach to Independence-Friendly Logic. London Mathematical Society Student Texts 70. Cambridge University Press, 2007. 
@book{DL07-Vaa,
  author =              {V{\"a}{\"a}n{\"a}nen, Jouko},
  title =               {Dependence Logic: A~New Approach to
                         Independence-Friendly Logic},
  publisher =           {Cambridge University Press},
  series =              {London Mathematical Society Student Texts},
  volume =              {70},
  year =                {2007},
  doi =                 {10.1017/CBO9780511611193},
}
[Val79] Leslie G. Valiant. The Complexity of Computing the Permanent. Theoretical Computer Science 8:189-201. Elsevier, 1979. 
@article{tcs8()-Val,
  author =              {Valiant, Leslie G.},
  title =               {The Complexity of Computing the Permanent},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {8},
  pages =               {189-201},
  year =                {1979},
}
[Val06] Antti Valmari. What the Small Rubik's Cube Taught Me on Data Structures, Information Theory and Randomization. International Journal on Software Tools for Technology Transfer 8(3):180-194. Springer-Verlag, June 2006. 
@article{sttt8(3)-Val,
  author =              {Valmari, Antti},
  title =               {What the Small {R}ubik's Cube Taught Me on Data
                         Structures, Information Theory and Randomization},
  publisher =           {Springer-Verlag},
  journal =             {International Journal on Software Tools for
                         Technology Transfer},
  volume =              {8},
  number =              {3},
  pages =               {180-194},
  year =                {2006},
  month =               jun,
}
[Van16] Marie Van den Bogaard. Motifs de flot d'information dans les jeux à information imparfaite. Thèse de doctorat, Lab. Spécification & Vérification, ENS Cachan, France, December 2016. 
@phdthesis{phd-vdb2016,
  author =              {Van{~}den{ }Bogaard, Marie},
  title =               {Motifs de flot d'information dans les jeux {\`a}
                         information imparfaite},
  year =                {2016},
  month =               dec,
  school =              {Lab.~Sp\'ecification \& V\'erification, ENS Cachan,
                         France},
  type =                {Th\`ese de doctorat},
}
[Var82] Moshe Y. Vardi. The Complexity of Relational Query Languages. In STOC'82, pages 137-146. ACM Press, May 1982. 
@inproceedings{stoc1982-Var,
  author =              {Vardi, Moshe Y.},
  title =               {The Complexity of Relational Query Languages},
  booktitle =           {{P}roceedings of the 14th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'82)},
  acronym =             {{STOC}'82},
  publisher =           {ACM Press},
  pages =               {137-146},
  year =                {1982},
  month =               may,
}
[Var85] Moshe Y. Vardi. Automatic Verification of Probabilistic Concurrent Finite-State Programs. In FOCS'85, pages 327-338. IEEE Comp. Soc. Press, October 1985. 
@inproceedings{focs1985-Var,
  author =              {Vardi, Moshe Y.},
  title =               {Automatic Verification of Probabilistic Concurrent
                         Finite-State Programs},
  booktitle =           {{P}roceedings of the 26th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'85)},
  acronym =             {{FOCS}'85},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {327-338},
  year =                {1985},
  month =               oct,
  doi =                 {10.1109/SFCS.1985.12},
}
[Var88] Moshe Y. Vardi. A Temporal Fixpoint Calculus. In POPL'88, pages 250-259. ACM Press, January 1988. 
@inproceedings{popl1988-Var,
  author =              {Vardi, Moshe Y.},
  title =               {A Temporal Fixpoint Calculus},
  booktitle =           {Conference Record of the 15th {ACM} {S}ymposium on
                         {P}rinciples of {P}rogramming {L}anguages
                         ({POPL}'88)},
  acronym =             {{POPL}'88},
  publisher =           {ACM Press},
  pages =               {250-259},
  year =                {1988},
  month =               jan,
}
[Var89] Moshe Y. Vardi. A Note on the Reduction of Two-Way Automata to One-Way Automata. Information Processing Letters 30(5):261-264. Elsevier, March 1989. 
@article{ipl30(5)-var,
  author =              {Vardi, Moshe Y.},
  title =               {A Note on the Reduction of Two-Way Automata to
                         One-Way Automata},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {30},
  number =              {5},
  pages =               {261-264},
  year =                {1989},
  month =               mar,
}
[Var94] Moshe Y. Vardi. Nontraditional Applications of Automata Theory. In TACS'94, Lecture Notes in Computer Science 789, pages 575-597. Springer-Verlag, April 1994. 
@inproceedings{tacs1994-Var,
  author =              {Vardi, Moshe Y.},
  title =               {Nontraditional Applications of Automata Theory},
  editor =              {Hagiya, Masami and Mitchell, John C.},
  booktitle =           {{P}roceedings of the 2nd {I}nternational {S}ymposium
                         on {T}heoretical {A}spects of {C}omputer {S}oftware
                         ({TACS}'94)},
  acronym =             {{TACS}'94},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {789},
  pages =               {575-597},
  year =                {1994},
  month =               apr,
}
[Var95] Moshe Y. Vardi. Alternating Automata and Program Verification. In Jan van Leeuwen (eds.), Computer Science Today: Recent Trends and Developments, Lecture Notes in Computer Science 1000, pages 471-485. Springer-Verlag, 1995. 
@incollection{lncs1000-Var,
  author =              {Vardi, Moshe Y.},
  title =               {Alternating Automata and Program Verification},
  editor =              {van Leeuwen, Jan},
  booktitle =           {Computer Science Today: Recent Trends and
                         Developments},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1000},
  pages =               {471-485},
  year =                {1995},
}
[Var96] Moshe Y. Vardi. An Automata-Theoretic Approach to Linear Temporal Logic. In Banff'94, Lecture Notes in Computer Science 1043, pages 238-266. Springer-Verlag, 1996. 
@inproceedings{banff1994-Var,
  author =              {Vardi, Moshe Y.},
  title =               {An Automata-Theoretic Approach to Linear Temporal
                         Logic},
  editor =              {Moller, Faron and Birtwistle, Graham M.},
  booktitle =           {{L}ogics for {C}oncurrency, {S}tructure versus
                         {A}utomata: {P}roceedings of the 8th {B}anff
                         {H}igher {O}rder {W}orkshop ({B}anff'94)},
  acronym =             {{B}anff'94},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1043},
  pages =               {238-266},
  year =                {1996},
  confyear =            {1994},
  confmonth =           {8-9},
}
[Var97] Moshe Y. Vardi. Alternating Automata: Checking Truth and Validity for Temporal Logics. In CADE'97, Lecture Notes in Artificial Intelligence 1249, pages 191-206. Springer-Verlag, July 1997. 
@inproceedings{cade1997-Var,
  author =              {Vardi, Moshe Y.},
  title =               {Alternating Automata: Checking Truth and Validity
                         for Temporal Logics},
  editor =              {McCune, William},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {C}onference on {A}utomated {D}eduction ({CADE}'97)},
  acronym =             {{CADE}'97},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Artificial Intelligence},
  volume =              {1249},
  pages =               {191-206},
  year =                {1997},
  month =               jul,
}
[Var98] Moshe Y. Vardi. Sometimes and Not Never Revisited: on Branching versus Linear Time. In CONCUR'98, Lecture Notes in Computer Science 1466, pages 1-17. Springer-Verlag, September 1998. 
@inproceedings{concur1998-Var,
  author =              {Vardi, Moshe Y.},
  title =               {Sometimes and Not Never Revisited: on Branching
                         versus Linear Time},
  editor =              {Sangiorgi, Davide and de Simone, Robert},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'98)},
  acronym =             {{CONCUR}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1466},
  pages =               {1-17},
  year =                {1998},
  month =               sep,
}
[Var98] Moshe Y. Vardi. Reasoning about the Past with Two-Way Automata. In ICALP'98, Lecture Notes in Computer Science 1443, pages 628-641. Springer-Verlag, July 1998. 
@inproceedings{icalp1998-Var,
  author =              {Vardi, Moshe Y.},
  title =               {Reasoning about the Past with Two-Way Automata},
  editor =              {Larsen, Kim Guldstrand and Skyum, Sven and Winskel,
                         Glynn},
  booktitle =           {{P}roceedings of the 25th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'98)},
  acronym =             {{ICALP}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1443},
  pages =               {628-641},
  year =                {1998},
  month =               jul,
}
[Var98] Moshe Y. Vardi. Linear versus Branching Time: a Complexity-Theoretic Approach. In LICS'98, pages 394-405. IEEE Comp. Soc. Press, June 1998. 
@inproceedings{lics1998-Var,
  author =              {Vardi, Moshe Y.},
  title =               {Linear versus Branching Time: a Complexity-Theoretic
                         Approach},
  booktitle =           {{P}roceedings of the 13th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'98)},
  acronym =             {{LICS}'98},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {394-405},
  year =                {1998},
  month =               jun,
}
[Var99] Moshe Y. Vardi. Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach. In ARTS'99, Lecture Notes in Computer Science 1601, pages 265-276. Springer-Verlag, May 1999. 
@inproceedings{arts1999-Var,
  author =              {Vardi, Moshe Y.},
  title =               {Probabilistic Linear-Time Model Checking: An
                         Overview of the Automata-Theoretic Approach},
  editor =              {Katoen, Joost-Pieter},
  booktitle =           {{P}roceedings of the 5th {I}nternational {AMAST}
                         {W}orkshop on {F}ormal {M}ethods for {R}eal-{T}ime
                         and {P}robabilistic {S}ystems ({ARTS}'99)},
  acronym =             {{ARTS}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1601},
  pages =               {265-276},
  year =                {1999},
  month =               may,
}
[Var01] Moshe Y. Vardi. Branching versus Linear Time: the Final Showdown. In TACAS'01, Lecture Notes in Computer Science 2031, pages 1-22. Springer-Verlag, April 2001. 
@inproceedings{tacas2001-Var,
  author =              {Vardi, Moshe Y.},
  title =               {Branching versus Linear Time: the Final Showdown},
  editor =              {Margaria, Tiziana and Yi, Wang},
  booktitle =           {{P}roceedings of the 7th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'01)},
  acronym =             {{TACAS}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2031},
  pages =               {1-22},
  year =                {2001},
  month =               apr,
}
[Var07] Moshe Y. Vardi. The Büchi Complementation Saga. In STACS'07, Lecture Notes in Computer Science 4393, pages 12-22. Springer-Verlag, February 2007. 
@inproceedings{stacs2007-Var,
  author =              {Vardi, Moshe Y.},
  title =               {The {B}{\"u}chi Complementation Saga},
  editor =              {Thomas, Wolfgang and Weil, Pascal},
  booktitle =           {{P}roceedings of the 24th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'07)},
  acronym =             {{STACS}'07},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4393},
  pages =               {12-22},
  year =                {2007},
  month =               feb,
}
[VCD+15] Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Rabinovich, and Jean-François Raskin. The complexity of multi-mean-payoff and multi-energy games. Information and Computation 241:177-196. Elsevier, April 2015. 
@article{icomp241()-VCDHRR,
  author =              {Velner, Yaron and Chatterjee, Krishnendu and Doyen,
                         Laurent and Henzinger, Thomas A. and Rabinovich,
                         Alexander and Raskin, Jean-Fran{\c c}ois},
  title =               {The complexity of multi-mean-payoff and multi-energy
                         games},
  publisher =           {Elsevier},
  journal =             {Information and Computation},
  volume =              {241},
  pages =               {177-196},
  year =                {2015},
  month =               apr,
  doi =                 {10.1016/j.ic.2015.03.001},
}
[Vea97] Margus Veanes. On Computational Complexity of Basic Decision Problems of Finite Tree Automata. Technical Report 133, Uppsala Programming Methodology and Artificial Intelligence Laboratory, Sweden, January 1997. 
@techreport{upmail-133-Vea,
  author =              {Veanes, Margus},
  title =               {On Computational Complexity of Basic Decision
                         Problems of Finite Tree Automata},
  number =              {133},
  year =                {1997},
  month =               jan,
  institution =         {Uppsala Programming Methodology and Artificial
                         Intelligence Laboratory, Sweden},
  type =                {Technical Report},
}
[Ven98] Yde Venema. Rectangular games. Journal of Symbolic Logic 63(4):1549-1564. Association for Symbolic Logic, December 1998. 
@article{jsl63(4)-Ven,
  author =              {Venema, Yde},
  title =               {Rectangular games},
  publisher =           {Association for Symbolic Logic},
  journal =             {Journal of Symbolic Logic},
  volume =              {63},
  number =              {4},
  pages =               {1549-1564},
  year =                {1998},
  month =               dec,
}
[Ves15] Steen Vester. On the Complexity of Model-checking Branching and Alternating-time Temporal Logics in One-counter systems. In ATVA'15, Lecture Notes in Computer Science 9364, pages 361-377. Springer-Verlag, October 2015. 
@inproceedings{atva2015-Ves,
  author =              {Vester, Steen},
  title =               {On the Complexity of Model-checking Branching and
                         Alternating-time Temporal Logics in One-counter
                         systems},
  editor =              {Finkbeiner, Bernd and Pu, Geguang and Zhang, Lijun},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {S}ymposium on {A}utomated {T}echnology for
                         {V}erification and {A}nalysis ({ATVA}'15)},
  acronym =             {{ATVA}'15},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9364},
  pages =               {361-377},
  year =                {2015},
  month =               oct,
  doi =                 {10.1007/978-3-319-24953-7_27},
}
[Vin01] Aymeric Vincent. Synthèse de contrôleurs et stratégies gagnantes dans les jeux de parité. In MSR'01, pages 87-98. Hermès, October 2001. 
@inproceedings{msr2001-Vin,
  author =              {Vincent, Aymeric},
  title =               {Synth{\`e}se de contr{\^o}leurs et strat{\'e}gies
                         gagnantes dans les jeux de parit{\'e}},
  booktitle =           {{A}ctes du 3{\`e}me {C}olloque {F}rancophone sur la
                         {M}od{\'e}lisation des {S}yst{\`e}mes r{\'e}actifs
                         ({MSR}'01)},
  acronym =             {{MSR}'01},
  publisher =           {Herm{\`e}s},
  pages =               {87-98},
  year =                {2001},
  month =               oct,
}
[Vin05] N. V. Vinodchandran. A Note on the Circuit Complexity of PP. Theoretical Computer Science 347(1-2):415-418. Elsevier, November 2005. 
@article{tcs347(1-2)-Vin,
  author =              {Vinodchandran, N. V.},
  title =               {A Note on the Circuit Complexity of~{PP}},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {347},
  number =              {1-2},
  pages =               {415-418},
  year =                {2005},
  month =               nov,
}
[Vol99] Heribert Vollmer. Introduction to circuit complexity. Springer-Verlag, 1999. 
@book{circuit-vol99,
  author =              {Vollmer, Heribert},
  title =               {Introduction to circuit complexity},
  publisher =           {Springer-Verlag},
  year =                {1999},
}
[Vol08] Mikhail V. Volkov. Synchronizing Automata and the Černý Conjecture. In LATA'08, Lecture Notes in Computer Science 5196, pages 11-27. Springer-Verlag, March 2008. 
@inproceedings{lata2008-Vol,
  author =              {Volkov, Mikhail V.},
  title =               {Synchronizing Automata and the {{\v{C}}}ern{\'y}
                         Conjecture},
  editor =              {Mart{\'\i}n-Vide, Carlos and Otto, Friedrich and
                         Fernau, Henning},
  booktitle =           {{R}evised {P}apers of the 2nd {I}nternational
                         {C}onference on {L}anguage and {A}utomata {T}heory
                         and {A}pplications ({LATA}'08)},
  acronym =             {{LATA}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5196},
  pages =               {11-27},
  year =                {2008},
  month =               mar,
}
[VPK+08] P. Vijay Suman, Paritosh K. Pandya, Shankara Narayanan Krishna, and Lakshmi Manasa. Timed Automata with Integer Resets: Language Inclusion and Expressiveness. In FORMATS'08, Lecture Notes in Computer Science 5215, pages 78-92. Springer-Verlag, September 2008. 
@inproceedings{formats2008-VPKM,
  author =              {Vijay{ }Suman, P. and Pandya, Paritosh K. and
                         Krishna, Shankara Narayanan and Manasa, Lakshmi},
  title =               {Timed Automata with Integer Resets: Language
                         Inclusion and Expressiveness},
  editor =              {Cassez, Franck and Jard, Claude},
  booktitle =           {{P}roceedings of the 6th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'08)},
  acronym =             {{FORMATS}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5215},
  pages =               {78-92},
  year =                {2008},
  month =               sep,
  doi =                 {10.1007/978-3-540-85778-5_7},
}
[VS85] Moshe Y. Vardi and Larry J. Stockmeyer. Improved Upper and Lower Bounds for Modal Logics of Programs. In STOC'85, pages 240-251. ACM Press, May 1985. 
@inproceedings{stoc1985-VS,
  author =              {Vardi, Moshe Y. and Stockmeyer, Larry J.},
  title =               {Improved Upper and Lower Bounds for Modal Logics of
                         Programs},
  booktitle =           {{P}roceedings of the 17th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'85)},
  acronym =             {{STOC}'85},
  publisher =           {ACM Press},
  pages =               {240-251},
  year =                {1985},
  month =               may,
}
[VTL79] Jacobo Valdes, Robert Endre Tarjan, and Eugene L. Lawler. The recognition of series-parallel digraphs. In STOC'79, pages 1-12. ACM Press, April 1979. 
@inproceedings{stoc1979-VTL,
  author =              {Valdes, Jacobo and Tarjan, Robert Endre and Lawler,
                         Eugene L.},
  title =               {The recognition of series-parallel digraphs},
  booktitle =           {{P}roceedings of the 11th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'79)},
  acronym =             {{STOC}'79},
  publisher =           {ACM Press},
  pages =               {1-12},
  year =                {1979},
  month =               apr,
  doi =                 {10.1145/800135.804393},
}
[VV06] Daniele Varacca and Hagen Völzer. Temporal Logics and Model Checking for Fairly Correct Systems. In LICS'06, pages 389-398. IEEE Comp. Soc. Press, July 2006. 
@inproceedings{lics2006-VV,
  author =              {Varacca, Daniele and V{\"o}lzer, Hagen},
  title =               {Temporal Logics and Model Checking for Fairly
                         Correct Systems},
  booktitle =           {{P}roceedings of the 21st {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'06)},
  acronym =             {{LICS}'06},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {389-398},
  year =                {2006},
  month =               jul,
  doi =                 {10.1109/LICS.2006.49},
}
[VW86] Moshe Y. Vardi and Pierre Wolper. An Automata-Theoretic Approach to Automatic Program Verification. In LICS'86, pages 332-344. IEEE Comp. Soc. Press, June 1986. 
@inproceedings{lics1986-VW,
  author =              {Vardi, Moshe Y. and Wolper, Pierre},
  title =               {An Automata-Theoretic Approach to Automatic Program
                         Verification},
  booktitle =           {{P}roceedings of the 1st {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'86)},
  acronym =             {{LICS}'86},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {332-344},
  year =                {1986},
  month =               jun,
}
[VW86] Moshe Y. Vardi and Pierre Wolper. Automata Theoretic Techniques for Modal Logics of Programs. Journal of Computer and System Sciences 32(2):183-221. Academic Press, April 1986. 
@article{jcss32(2)-VW,
  author =              {Vardi, Moshe Y. and Wolper, Pierre},
  title =               {Automata Theoretic Techniques for Modal Logics of
                         Programs},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {32},
  number =              {2},
  pages =               {183-221},
  year =                {1986},
  month =               apr,
}
[VW94] Moshe Y. Vardi and Pierre Wolper. Reasoning about Infinite Computations. Information and Computation 115(1):1-37. Academic Press, November 1994. 
@article{icomp115(1)-VW,
  author =              {Vardi, Moshe Y. and Wolper, Pierre},
  title =               {Reasoning about Infinite Computations},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {115},
  number =              {1},
  pages =               {1-37},
  year =                {1994},
  month =               nov,
}
[VW08] Moshe Y. Vardi and Thomas Wilke. Automata: from logics to algorithms. In Jörg Flum, Erich Grädel, and Thomas Wilke (eds.), Logic and Automata: History and Perspectives, Texts in Logic and Games 2, pages 629-736. Amsterdam University Press, 2008. 
@incollection{la2008-ala-VW,
  author =              {Vardi, Moshe Y. and Wilke, Thomas},
  title =               {Automata: from logics to algorithms},
  editor =              {Flum, J{\"o}rg and Gr{\"a}del, Erich and Wilke,
                         Thomas},
  booktitle =           {Logic and Automata: History and Perspectives},
  publisher =           {Amsterdam University Press},
  series =              {Texts in Logic and Games},
  volume =              {2},
  pages =               {629-736},
  year =                {2008},
}
W
[Wag87] Klaus W. Wagner. More complicated questions about maxima and minima, and some closures of NP. Theoretical Computer Science 51:53-80. Elsevier, 1987. 
@article{tcs51()-Wag,
  author =              {Wagner, Klaus W.},
  title =               {More complicated questions about maxima and minima,
                         and some closures of~{NP}},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {51},
  pages =               {53-80},
  year =                {1987},
}
[Wag88] Klaus W. Wagner. On Restricting the Access to an NP-Oracle. In ICALP'88, Lecture Notes in Computer Science 317, pages 682-696. Springer-Verlag, July 1988. 
@inproceedings{icalp1988-Wag,
  author =              {Wagner, Klaus W.},
  title =               {On Restricting the Access to an NP-Oracle},
  editor =              {Lepist{\"o}, Timo and Salomaa, Arto},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'88)},
  acronym =             {{ICALP}'88},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {317},
  pages =               {682-696},
  year =                {1988},
  month =               jul,
}
[Wag90] Klaus W. Wagner. Bounded Query Classes. SIAM Journal on Computing 19(5):833-846. Society for Industrial and Applied Math., October 1990. 
@article{siamjcomp19(5)-Wag,
  author =              {Wagner, Klaus W.},
  title =               {Bounded Query Classes},
  publisher =           {Society for Industrial and Applied Math.},
  journal =             {SIAM Journal on Computing},
  volume =              {19},
  number =              {5},
  pages =               {833-846},
  year =                {1990},
  month =               oct,
}
[Wal96] Igor Walukiewicz. Pushdown Processes: Games and Model Checking. In CAV'96, Lecture Notes in Computer Science 1102, pages 234-263. Springer-Verlag, July 1996. 
@inproceedings{cav1996-Wal,
  author =              {Walukiewicz, Igor},
  title =               {Pushdown Processes: Games and Model Checking},
  editor =              {Alur, Rajeev and Henzinger, Thomas A.},
  booktitle =           {{P}roceedings of the 8th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'96)},
  acronym =             {{CAV}'96},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1102},
  pages =               {234-263},
  year =                {1996},
  month =               jul,
}
[Wal00] Igor Walukiewicz. Model Checking CTL Properties of Pushdown Systems. In FSTTCS'00, Lecture Notes in Computer Science 1974, pages 127-138. Springer-Verlag, December 2000. 
@inproceedings{fsttcs2000-Wal,
  author =              {Walukiewicz, Igor},
  title =               {Model Checking {CTL} Properties of Pushdown Systems},
  editor =              {Kapoor, Sanjiv and Prasad, Sanjiva},
  booktitle =           {{P}roceedings of the 20th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'00)},
  acronym =             {{FSTTCS}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1974},
  pages =               {127-138},
  year =                {2000},
  month =               dec,
}
[Wal01] Dan S. Wallach. Copy Protection Technology is Doomed. IEEE Computer 34(10):48-49. IEEE Comp. Soc. Press, October 2001. 
@article{ieeecomp34(10)-Wal,
  author =              {Wallach, Dan S.},
  title =               {Copy Protection Technology is Doomed},
  publisher =           {IEEE Comp. Soc. Press},
  journal =             {IEEE Computer},
  volume =              {34},
  number =              {10},
  pages =               {48-49},
  year =                {2001},
  month =               oct,
}
[Wal02] Igor Walukiewicz. Monadic second order logic on tree-like structures. Theoretical Computer Science 275(1-2):311-346. Elsevier, March 2002. 
@article{tcs275(1-2)-Wal,
  author =              {Walukiewicz, Igor},
  title =               {Monadic second order logic on tree-like structures},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {275},
  number =              {1-2},
  pages =               {311-346},
  year =                {2002},
  month =               mar,
}
[Wal04] Igor Walukiewicz. A Landscape with Games in the Background. In LICS'04, pages 356-366. IEEE Comp. Soc. Press, July 2004. 
@inproceedings{lics2004-Wal,
  author =              {Walukiewicz, Igor},
  title =               {A Landscape with Games in the Background},
  booktitle =           {{P}roceedings of the 19th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'04)},
  acronym =             {{LICS}'04},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {356-366},
  year =                {2004},
  month =               jul,
}
[Wan90] Hao Wang. Computation, Logic, Philosophy. Mathematics ans its applications 2. Springer-Verlag, 1990. 
@book{Wang1990,
  author =              {Wang, Hao},
  title =               {Computation, Logic, Philosophy},
  publisher =           {Springer-Verlag},
  series =              {Mathematics ans its applications},
  volume =              {2},
  year =                {1990},
  doi =                 {10.1007/978-94-009-2356-0},
}
[Wan01] Farn Wang. Symbolic Verification of Complex Real-Time Systems with Clock-Restriction Diagram. In FORTE'01, IFIP Conference Proceedings 197, pages 235-250. Chapman & Hall, August 2001. 
@inproceedings{forte2001-Wan,
  author =              {Wang, Farn},
  title =               {Symbolic Verification of Complex Real-Time Systems
                         with Clock-Restriction Diagram},
  editor =              {Kim, Myungchul and Chin, Byoungmoon and Kang,
                         Sungwon and Lee, Danhyung},
  booktitle =           {{P}roceedings of the 21st {IFIP} {TC6/WG6.1}
                         {I}nternational {C}onference on {F}ormal
                         {T}echniques for {N}etworked and {D}istributed
                         {S}ystems ({FORTE}'01)},
  acronym =             {{FORTE}'01},
  publisher =           {Chapman \& Hall},
  series =              {IFIP Conference Proceedings},
  volume =              {197},
  pages =               {235-250},
  year =                {2001},
  month =               aug,
}
[Wan04] Farn Wang. Efficient verification of timed automata with BDD-like data structures. International Journal on Software Tools for Technology Transfer 6(1):77-97. Springer-Verlag, July 2004. 
@article{sttt6(1)-Wan,
  author =              {Wang, Farn},
  title =               {Efficient verification of timed automata with
                         {BDD}-like data structures},
  publisher =           {Springer-Verlag},
  journal =             {International Journal on Software Tools for
                         Technology Transfer},
  volume =              {6},
  number =              {1},
  pages =               {77-97},
  year =                {2004},
  month =               jul,
  doi =                 {10.1007/s10009-003-0135-4},
}
[Wan04] Farn Wang. Model-Checking Distributed Real-Time Systems with States, Events, and Multiple Fairness Assumptions. In AMAST'04, Lecture Notes in Computer Science 3116, pages 553-567. Springer-Verlag, July 2004. 
@inproceedings{amast2004-Wan,
  author =              {Wang, Farn},
  title =               {Model-Checking Distributed Real-Time Systems with
                         States, Events, and Multiple Fairness Assumptions},
  editor =              {Rattray, Charles and Maharaj, Savi and Shankland,
                         Carron},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {A}lgebraic {M}ethodology and
                         {S}oftware {T}echnology ({AMAST}'04)},
  acronym =             {{AMAST}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3116},
  pages =               {553-567},
  year =                {2004},
  month =               jul,
}
[Wan08] Farn Wang. Efficient Model-Checking of Dense-Time Systems with Time-Convexity Analysis. In RTSS'08, pages 195-205. IEEE Comp. Soc. Press, November 2008. 
@inproceedings{rts2008-Wan,
  author =              {Wang, Farn},
  title =               {Efficient Model-Checking of Dense-Time Systems with
                         Time-Convexity Analysis},
  booktitle =           {{P}roceedings of the 29th {S}ymposium on {R}eal-Time
                         {S}ystems ({RTSS}'08)},
  acronym =             {{RTSS}'08},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {195-205},
  year =                {2008},
  month =               nov,
  doi =                 {10.1109/RTSS.2008.53},
}
[Wan13] Farn Wang. Efficient Model-Checking of Dense-Time Systems with Time-Convexity Analysis. Theoretical Computer Science 467:89-108. Elsevier, January 2013. 
@article{tcs467-Wan,
  author =              {Wang, Farn},
  title =               {Efficient Model-Checking of Dense-Time Systems with
                         Time-Convexity Analysis},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {467},
  pages =               {89-108},
  year =                {2013},
  month =               jan,
  doi =                 {10.1016/j.tcs.2012.09.019},
}
[War52] John Glen Wardrop. Some theoretical aspects of road traffic research. Proceedings of the Institution of Civil Engineers 1(3):325-362. May 1952. 
@article{pice1(3)-War,
  author =              {Wardrop, John Glen},
  title =               {Some theoretical aspects of road traffic research},
  journal =             {Proceedings of the Institution of Civil Engineers},
  volume =              {1},
  number =              {3},
  pages =               {325-362},
  year =                {1952},
  month =               may,
  doi =                 {10.1680/ipeds.1952.11259},
}
[War62] Stephen Warshall. A Theorem on Boolean Matrices. Journal of the ACM 9(1):11-12. ACM Press, January 1962. 
@article{jacm9(1)-War,
  author =              {Warshall, Stephen},
  title =               {A~Theorem on Boolean Matrices},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {9},
  number =              {1},
  pages =               {11-12},
  year =                {1962},
  month =               jan,
  doi =                 {10.1145/321105.321107},
}
[WBB+10] Ralf Wimmer, Bettina Braitling, Bernd Becker, Pepijn Crouzen, Holger Hermanns, Abhishek Dhama, and Oliver E. Theel. Symblicit calculation of long-run averages for concurrent probabilistic systems. In QEST'10, pages 27-36. IEEE Comp. Soc. Press, September 2010. 
@inproceedings{qest2010-WBBHCHDT,
  author =              {Wimmer, Ralf and Braitling, Bettina and Becker,
                         Bernd and Crouzen, Pepijn and Hermanns, Holger and
                         Dhama, Abhishek and Theel, Oliver E.},
  title =               {Symblicit calculation of long-run averages for
                         concurrent probabilistic systems},
  booktitle =           {{P}roceedings of the 7th {I}nternational
                         {C}onference on {Q}uantitative {E}valuation of
                         {S}ystems ({QEST}'10)},
  acronym =             {{QEST}'10},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {27-36},
  year =                {2010},
  month =               sep,
}
[WBE08] Thomas Wahl, Nicolas Blanc, and E. Allen Emerson. SVISS: Symbolic Verification of Symmetric Systems. In TACAS'08, Lecture Notes in Computer Science 4963, pages 459-462. Springer-Verlag, March 2008. 
@inproceedings{tacas2008-WBE,
  author =              {Wahl, Thomas and Blanc, Nicolas and Emerson, E.
                         Allen},
  title =               {{SVISS}: Symbolic Verification of Symmetric Systems},
  editor =              {Ramakrishnan, C. R. and Rehof, Jakob},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'08)},
  acronym =             {{TACAS}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4963},
  pages =               {459-462},
  year =                {2008},
  month =               mar,
  doi =                 {10.1007/978-3-540-78800-3_34},
}
[WD04] Michael Wooldridge and Paul E. Dunne. On the Computational Complexity of Qualitative Coalition Games. Artificial Intelligence 158(1):27-73. Elsevier, September 2004. 
@article{ai158(1)-WD,
  author =              {Wooldridge, Michael and Dunne, Paul E.},
  title =               {On the Computational Complexity of Qualitative
                         Coalition Games},
  publisher =           {Elsevier},
  journal =             {Artificial Intelligence},
  volume =              {158},
  number =              {1},
  pages =               {27-73},
  year =                {2004},
  month =               sep,
  doi =                 {10.1016/j.artint.2004.04.002},
}
[Web09] Michael Weber. On the Complexity of Branching-Time Logics. In CSL'09, Lecture Notes in Computer Science 5771, pages 530-545. Springer-Verlag, September 2009. 
@inproceedings{csl2009-Web,
  author =              {Weber, Michael},
  title =               {On the Complexity of Branching-Time Logics},
  editor =              {Gr{\"a}del, Erich and Kahle, Reinhard},
  booktitle =           {{P}roceedings of the 23rd {I}nternational {W}orkshop
                         on {C}omputer {S}cience {L}ogic ({CSL}'09)},
  acronym =             {{CSL}'09},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5771},
  pages =               {530-545},
  year =                {2009},
  month =               sep,
}
[Wee05] Hoeteck Wee. On Obfuscating Point Functions. In STOC'05, pages 523-532. ACM Press, May 2005. 
@inproceedings{stoc2005-Wee,
  author =              {Wee, Hoeteck},
  title =               {On Obfuscating Point Functions},
  editor =              {Gabow, Harold N. and Fagin, Ronald},
  booktitle =           {{P}roceedings of the 37th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'05)},
  acronym =             {{STOC}'05},
  publisher =           {ACM Press},
  pages =               {523-532},
  year =                {2005},
  month =               may,
}
[Wei97] Volker Weispfenning. Complexity and Uhiformity of Elimination in Presburger Arithmetic. In ISSAC'97, pages 48-53. ACM Press, July 1997. 
@inproceedings{issac1997-Wei,
  author =              {Weispfenning, Volker},
  title =               {Complexity and Uhiformity of Elimination in
                         {P}resburger Arithmetic},
  editor =              {K{\"u}chlin, Wolfgang},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {S}ymposium on {S}ymbolic and {A}lgebraic
                         {C}omputation ({ISSAC}'97)},
  acronym =             {{ISSAC}'97},
  publisher =           {ACM Press},
  pages =               {48-53},
  year =                {1997},
  month =               jul,
}
[Wei99] Volker Weispfenning. Mixed Real-Integer Linear Quantifier Elimination. In ISSAC'99, pages 129-136. ACM Press, July 1999. 
@inproceedings{issac1999-Wei,
  author =              {Weispfenning, Volker},
  title =               {Mixed Real-Integer Linear Quantifier Elimination},
  booktitle =           {{P}roceedings of the 12th {I}nternational
                         {S}ymposium on {S}ymbolic and {A}lgebraic
                         {C}omputation ({ISSAC}'99)},
  acronym =             {{ISSAC}'99},
  publisher =           {ACM Press},
  pages =               {129-136},
  year =                {1999},
  month =               jul,
}
[Wei04] Pascal Weil. Algebraic Recognizability of Languages. In MFCS'04, Lecture Notes in Computer Science 3153, pages 149-175. Springer-Verlag, August 2004. 
@inproceedings{mfcs2004-Wei,
  author =              {Weil, Pascal},
  title =               {Algebraic Recognizability of Languages},
  editor =              {Fiala, Ji{\v r}{\'\i} and Koubek, V{\'a}clav and
                         Kratoch{\'\i}l, Jan},
  booktitle =           {{P}roceedings of the 29th {I}nternational
                         {S}ymposium on {M}athematical {F}oundations of
                         {C}omputer {S}cience ({MFCS}'04)},
  acronym =             {{MFCS}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3153},
  pages =               {149-175},
  year =                {2004},
  month =               aug,
}
[WH91] Howard Wong-Toi and Gérard Hoffmann. The Control of Dense Real-Time Discrete Event Systems. In CDC'91, pages 1527-1528. IEEE Comp. Soc. Press, December 1991. 
@inproceedings{cdc1991-WH,
  author =              {Wong{-}Toi, Howard and Hoffmann, G{\'e}rard},
  title =               {The Control of Dense Real-Time Discrete Event
                         Systems},
  booktitle =           {{P}roceedings of the 30th {IEEE} {C}onference on
                         {D}ecision and {C}ontrol ({CDC}'91)},
  acronym =             {{CDC}'91},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {1527-1528},
  year =                {1991},
  month =               dec,
}
[WH08] Libor Waszniowski and Zdeněk Hanzálek. Formal verification of multitasking applications based on timed automata model. Real-Time Systems 38(1):39-65. Kluwer Academic, January 2008. 
@article{rts38(1)-WH,
  author =              {Waszniowski, Libor and Hanz{\'a}lek, Zden{\v{e}}k},
  title =               {Formal verification of multitasking applications
                         based on timed automata model},
  publisher =           {Kluwer Academic},
  journal =             {Real-Time Systems},
  volume =              {38},
  number =              {1},
  pages =               {39-65},
  year =                {2008},
  month =               jan,
}
[WvdH+07] Dirk Walther, Wiebe van der Hoek, and Michael Wooldridge. Alternating-time Temporal Logic with Explicit Strategies. In TARK'07, pages 269-278. June 2007. 
@inproceedings{tark2007-WHW,
  author =              {Walther, Dirk and van der Hoek, Wiebe and
                         Wooldridge, Michael},
  title =               {Alternating-time Temporal Logic with Explicit
                         Strategies},
  editor =              {Samet, Dov},
  booktitle =           {{P}roceedings of the 11th {C}onference on
                         {T}heoretical {A}spects of {R}ationality and
                         {K}nowledge ({TARK}'07)},
  acronym =             {{TARK}'07},
  pages =               {269-278},
  year =                {2007},
  month =               jun,
  doi =                 {10.1145/1324249.1324285},
}
[WHY06] Farn Wang, Geng-Dian Huang, and Fang Yu. TCTL Inevitability Analysis of Dense-Time Systems: From Theory to Engineering. IEEE Transactions on Software Engineering 32(7):510-526. IEEE Comp. Soc. Press, July 2006. 
@article{tse32(7)-WHY,
  author =              {Wang, Farn and Huang, Geng-Dian and Yu, Fang},
  title =               {{TCTL} Inevitability Analysis of Dense-Time Systems:
                         From Theory to Engineering},
  publisher =           {IEEE Comp. Soc. Press},
  journal =             {IEEE Transactions on Software Engineering},
  volume =              {32},
  number =              {7},
  pages =               {510-526},
  year =                {2006},
  month =               jul,
}
[WHY11] Farn Wang, Chung-Hao Huang, and Fang Yu. A Temporal Logic for the Interaction of Strategies. In CONCUR'11, Lecture Notes in Computer Science 6901, pages 466-481. Springer-Verlag, September 2011. 
@inproceedings{concur2011-WHY,
  author =              {Wang, Farn and Huang, Chung-Hao and Yu, Fang},
  title =               {A~Temporal Logic for the Interaction of Strategies},
  editor =              {Katoen, Joost-Pieter and K{\"o}nig, Barbara},
  booktitle =           {{P}roceedings of the 22nd {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'11)},
  acronym =             {{CONCUR}'11},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6901},
  pages =               {466-481},
  year =                {2011},
  month =               sep,
}
[Wig92] Avi Wigderson. The Complexity of Graph Connectivity. In MFCS'92, Lecture Notes in Computer Science 629, pages 112-132. Springer-Verlag, August 1992. 
@inproceedings{mfcs1992-Wig,
  author =              {Wigderson, Avi},
  title =               {The Complexity of Graph Connectivity},
  editor =              {Havel, Ivan M. and Koubek, V{\'a}clav},
  booktitle =           {{P}roceedings of the 17th {I}nternational
                         {S}ymposium on {M}athematical {F}oundations of
                         {C}omputer {S}cience ({MFCS}'92)},
  acronym =             {{MFCS}'92},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {629},
  pages =               {112-132},
  year =                {1992},
  month =               aug,
}
[Wil94] Thomas Wilke. Specifying Timed State Sequence in Powerful Decidable Logics and Timed Automata (Extended Abstract). In FTRTFT'94, Lecture Notes in Computer Science 863, pages 694-715. Springer-Verlag, September 1994. 
@inproceedings{ftrtft1994-Wil,
  author =              {Wilke, Thomas},
  title =               {Specifying Timed State Sequence in Powerful
                         Decidable Logics and Timed Automata (Extended
                         Abstract)},
  editor =              {Langmaack, Hans and de Roever, Willem-Paul and
                         Vytopil, Jan},
  booktitle =           {{P}roceedings of the 3rd {F}ormal {T}echniques in
                         {R}eal-Time and {F}ault-Tolerant {S}ystems
                         ({FTRTFT}'94)},
  acronym =             {{FTRTFT}'94},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {863},
  pages =               {694-715},
  year =                {1994},
  month =               sep,
}
[Wil99] Thomas Wilke. CTL+ is exponentially more succinct than CTL. In FSTTCS'99, Lecture Notes in Computer Science 1738, pages 110-121. Springer-Verlag, December 1999. 
@inproceedings{fsttcs1999-Wil,
  author =              {Wilke, Thomas},
  title =               {{CTL}{\(^+\)} is exponentially more succinct
                         than~{CTL}},
  editor =              {Rangan, C. Pandu and Raman, Venkatesh and Ramanujam,
                         R.},
  booktitle =           {{P}roceedings of the 19th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'99)},
  acronym =             {{FSTTCS}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1738},
  pages =               {110-121},
  year =                {1999},
  month =               dec,
}
[Wil99] Thomas Wilke. Classifying Discrete Temporal Properties. In STACS'99, Lecture Notes in Computer Science 1563, pages 32-46. Springer-Verlag, March 1999. 
@inproceedings{stacs1999-Wil,
  author =              {Wilke, Thomas},
  title =               {Classifying Discrete Temporal Properties},
  editor =              {Meinel, {\relax Ch}ristoph and Tison, Sophie},
  booktitle =           {{P}roceedings of the 16th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'99)},
  acronym =             {{STACS}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1563},
  pages =               {32-46},
  year =                {1999},
  month =               mar,
}
[Wil01] Thomas Wilke. Alternating tree automata, parity games, and modal μ-calculus. Bulletin of the Belgian Mathematical Society – Simon Stevin 8(2):359-391. Belgian Mathematical Society, 2001. 
@article{bbms8(2)-Wil,
  author =              {Wilke, Thomas},
  title =               {Alternating tree automata, parity games, and modal
                         {{\(\mu\)}}-calculus},
  publisher =           {Belgian Mathematical Society},
  journal =             {Bulletin of the Belgian Mathematical Society~--
                         Simon Stevin},
  volume =              {8},
  number =              {2},
  pages =               {359-391},
  year =                {2001},
}
[Win04] Aaron Windsor. A Simple Proof that Finding a Macimal Independent Set in a Graph is in NC. Information Processing Letters 92(4):185-187. Elsevier, November 2004. 
@article{ipl92(4)-Win,
  author =              {Windsor, Aaron},
  title =               {A Simple Proof that Finding a Macimal Independent
                         Set in a Graph is in~{\(\mathcal{NC}\)}},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {92},
  number =              {4},
  pages =               {185-187},
  year =                {2004},
  month =               nov,
}
[WJ14] Weifeng Wang and Li Jiao. Trace Abstraction Refinement for Timed Automata. In ATVA'14, Lecture Notes in Computer Science 8837, pages 396-410. Springer-Verlag, November 2014. 
@inproceedings{atva2014-WJ,
  author =              {Wang, Weifeng and Jiao, Li},
  title =               {Trace Abstraction Refinement for Timed Automata},
  editor =              {Cassez, Franck and Raskin, Jean-Fran{\c c}ois},
  booktitle =           {{P}roceedings of the 12th {I}nternational
                         {S}ymposium on {A}utomated {T}echnology for
                         {V}erification and {A}nalysis ({ATVA}'14)},
  acronym =             {{ATVA}'14},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8837},
  pages =               {396-410},
  year =                {2014},
  month =               nov,
  doi =                 {10.1007/978-3-319-11936-6_28},
}
[WL69] Richard J. Waldinger and Richard C. T. Lee. PROW: a step towards automatic program writing. In IJCAI'69, pages 241-252. William Kaufmann Inc., May 1969. 
@inproceedings{ijcai1969-WL,
  author =              {Waldinger, Richard J. and Lee, Richard C. T.},
  title =               {{PROW}: a~step towards automatic program writing},
  editor =              {Walker, Donald E. and Norton, Lewis M.},
  booktitle =           {{P}roceedings of the 1st {I}nternational {J}oint
                         {C}onference on {A}rtificial {I}ntelligence
                         ({IJCAI}'69)},
  acronym =             {{IJCAI}'69},
  publisher =           {William Kaufmann Inc.},
  pages =               {241-252},
  year =                {1969},
  month =               may,
}
[WL90] Pierre Wolper and Vinciane Lovinfosse. Verifying Properties of Large Sets of Processes with Network Invariants. In CAV'89, Lecture Notes in Computer Science 407, pages 68-80. Springer-Verlag, 1990. 
@inproceedings{cav1989-WL,
  author =              {Wolper, Pierre and Lovinfosse, Vinciane},
  title =               {Verifying Properties of Large Sets of Processes with
                         Network Invariants},
  editor =              {Sifakis, Joseph},
  booktitle =           {{P}roceedings of the 1st {I}nternational {W}orkshop
                         on {A}utomatic {V}erification {M}ethods for {F}inite
                         {S}tate {S}ystems ({CAV}'89)},
  acronym =             {{CAV}'89},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {407},
  pages =               {68-80},
  year =                {1990},
  confyear =            {1989},
  confmonth =           {6},
}
[WLT11] Matthias Woehrle, Kai Lampka, and Lothar Thiele. Segmented State Space Traversal for Conformance Testing of Cyber-Physical Systems. In FORMATS'11, Lecture Notes in Computer Science 6919, pages 193-208. Springer-Verlag, September 2011. 
@inproceedings{formats2011-WLT,
  author =              {Woehrle, Matthias and Lampka, Kai and Thiele,
                         Lothar},
  title =               {Segmented State Space Traversal for Conformance
                         Testing of Cyber-Physical Systems},
  editor =              {Fahrenberg, Uli and Tripakis, Stavros},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'11)},
  acronym =             {{FORMATS}'11},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6919},
  pages =               {193-208},
  year =                {2011},
  month =               sep,
}
[WLW+06] Dirk Walther, Carsten Lutz, Frank Wolter, and Michael Wooldridge. ATL Satisfiability is Indeed EXPTIME-Complete. Journal of Logic and Computation 16(6):765-787. Oxford University Press, December 2006. 
@article{jlc16(6)-WLWW,
  author =              {Walther, Dirk and Lutz, Carsten and Wolter, Frank
                         and Wooldridge, Michael},
  title =               {{ATL} Satisfiability is Indeed {EXPTIME}-Complete},
  publisher =           {Oxford University Press},
  journal =             {Journal of Logic and Computation},
  volume =              {16},
  number =              {6},
  pages =               {765-787},
  year =                {2006},
  month =               dec,
  doi =                 {10.1093/logcom/exl009},
}
[WMR+23] Zijun Wu, Rolf H. Möhring, Chunying Ren, and Dachaun Xu. A convergence analysis of the price of anarchy in atomic congestion games. Mathematical Programming 199(1):937-993. May 2023. 
@article{mathprog199(1)-WMRX,
  author =              {Wu, Zijun and M{\"o}hring, Rolf H. and Ren, Chunying
                         and Xu, Dachaun},
  title =               {A~convergence analysis of the price of anarchy in
                         atomic congestion games},
  journal =             {Mathematical Programming},
  volume =              {199},
  number =              {1},
  pages =               {937-993},
  year =                {2023},
  month =               may,
  doi =                 {10.1007/s10107-022-01853-0},
}
[Wol83] Pierre Wolper. Temporal Logic Can Be More Expressive. Information and Control 56(1-2):72-99. Academic Press, 1983. 
@article{icont56(1-2)-Wol,
  author =              {Wolper, Pierre},
  title =               {Temporal Logic Can Be More Expressive},
  publisher =           {Academic Press},
  journal =             {Information and Control},
  volume =              {56},
  number =              {1-2},
  pages =               {72-99},
  year =                {1983},
}
[Wol00] Pierre Wolper. Constructing Automata from Temporal Logic Formulas: A Tutorial. In Lectures on Formal Methods and Performance Analysis – Revised Lectures of the 1st EEF/Euro Summer School on Trends in Computer Science, Lecture Notes in Computer Science 2090, pages 261-277. Springer-Verlag, July 2000. 
@inproceedings{eef2000-Wol,
  author =              {Wolper, Pierre},
  title =               {Constructing Automata from Temporal Logic Formulas:
                         A Tutorial},
  editor =              {Brinksma, Ed and Hermanns, Holger and Katoen,
                         Joost-Pieter},
  booktitle =           {{L}ectures on {F}ormal {M}ethods and {P}erformance
                         {A}nalysis~-- {R}evised {L}ectures of the 1st
                         {EEF}/{E}uro {S}ummer {S}chool on {T}rends in
                         {C}omputer {S}cience},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2090},
  pages =               {261-277},
  year =                {2000},
  month =               jul,
}
[Wol20] Petra Wolf. Synchronization under Dynamic Constraints. In FSTTCS'20, Leibniz International Proceedings in Informatics 182, pages 58:1-58:14. Leibniz-Zentrum für Informatik, December 2020. 
@inproceedings{fsttcs2020-Wol,
  author =              {Wolf, Petra},
  title =               {Synchronization under Dynamic Constraints},
  editor =              {Saxena, Nitin and Simon, Sunil},
  booktitle =           {{P}roceedings of the 40th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'20)},
  acronym =             {{FSTTCS}'20},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {182},
  pages =               {58:1-58:14},
  year =                {2020},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2020.58},
}
[Wra76] Celia Wrathall. Complete Sets and the Polynomial-Time Hierarchy. Theoretical Computer Science 3(1):23-33. Elsevier, 1976. 
@article{tcs3(1)-Wra,
  author =              {Wrathall, Celia},
  title =               {Complete Sets and the Polynomial-Time Hierarchy},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {3},
  number =              {1},
  pages =               {23-33},
  year =                {1976},
}
[WS07] Volker Weber and Thomas Schwentick. Dynamic Complexity Theory Revisited. Theory of Computing Systems 40(4):355-377. Springer-Verlag, June 2007. 
@article{tcsyst40(4)-WS,
  author =              {Weber, Volker and Schwentick, Thomas},
  title =               {Dynamic Complexity Theory Revisited},
  publisher =           {Springer-Verlag},
  journal =             {Theory of Computing Systems},
  volume =              {40},
  number =              {4},
  pages =               {355-377},
  year =                {2007},
  month =               jun,
}
[WSH15] Farn Wang, Sven Schewe, and Chung-Hao Huang. An extension of ATL with Strategy Interaction. ACM Transactions on Programming Languages and Systems 37(3). ACM Press, June 2015. 
@article{toplas37(3)-WSH,
  author =              {Wang, Farn and Schewe, Sven and Huang, Chung-Hao},
  title =               {An~extension of~{ATL} with Strategy Interaction},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Programming Languages and
                         Systems},
  volume =              {37},
  number =              {3},
  year =                {2015},
  month =               jun,
  doi =                 {10.1145/2734117},
}
[WVS83] Pierre Wolper, Moshe Y. Vardi, and A. Prasad Sistla. Reasoning about Infinite Computation Paths. In FOCS'83, pages 185-194. IEEE Comp. Soc. Press, November 1983. 
@inproceedings{focs1983-WVS,
  author =              {Wolper, Pierre and Vardi, Moshe Y. and Sistla, A.
                         Prasad},
  title =               {Reasoning about Infinite Computation Paths},
  booktitle =           {{P}roceedings of the 24th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'83)},
  acronym =             {{FOCS}'83},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {185-194},
  year =                {1983},
  month =               nov,
}
[WYY11] Farn Wang, Li-Wei Yao, and Ya-Lan Yang. Efficient verification of distributed real-time systems with broadcasting behaviors. Real-Time Systems 47(4):285-318. Kluwer Academic, July 2011. 
@article{rts47(4)-WYY,
  author =              {Wang, Farn and Yao, Li-Wei and Yang, Ya-Lan},
  title =               {Efficient verification of distributed real-time
                         systems with broadcasting behaviors},
  publisher =           {Kluwer Academic},
  journal =             {Real-Time Systems},
  volume =              {47},
  number =              {4},
  pages =               {285-318},
  year =                {2011},
  month =               jul,
}
Y
[Yan04] Mihalis Yannakakis. Testing, Optimization, and Games. In ICALP'04, Lecture Notes in Computer Science, pages 28-45. Springer-Verlag, 2004. 
@inproceedings{icalp2004-Yan,
  author =              {Yannakakis, Mihalis},
  title =               {Testing, Optimization, and Games},
  booktitle =           {{P}roceedings of the 31st {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'04)},
  acronym =             {{ICALP}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  pages =               {28-45},
  year =                {2004},
  doi =                 {10.1007/978-3-540-27836-8_6},
}
[Yap06] Chee Yap. Is it Really Zero?. KIAS Newsletter 33. 2006. 
@article{kias33-Yap,
  author =              {Yap, Chee},
  title =               {Is it Really Zero?},
  journal =             {KIAS Newsletter},
  volume =              {33},
  year =                {2006},
}
[Yi91] Wang Yi. CCS + Time = An Interleaving Model for Real Time Systems. In ICALP'91, Lecture Notes in Computer Science 510, pages 217-228. Springer-Verlag, July 1991. 
@inproceedings{icalp1991-Yi,
  author =              {Yi, Wang},
  title =               {{CCS} + Time = An~Interleaving Model for Real Time
                         Systems},
  editor =              {Albert, Javier Leach and Monien, Burkhard and
                         Rodr{\'\i}guez{-}Artalejo, Mario},
  booktitle =           {{P}roceedings of the 19th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'91)},
  acronym =             {{ICALP}'91},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {510},
  pages =               {217-228},
  year =                {1991},
  month =               jul,
}
[Yov97] Sergio Yovine. Kronos: A verification tool for real-time systems. International Journal on Software Tools for Technology Transfer 1(1-2):123-133. Springer-Verlag, October 1997. 
@article{sttt1(1-2)-Yov,
  author =              {Yovine, Sergio},
  title =               {Kronos: A verification tool for real-time systems},
  publisher =           {Springer-Verlag},
  journal =             {International Journal on Software Tools for
                         Technology Transfer},
  volume =              {1},
  number =              {1-2},
  pages =               {123-133},
  year =                {1997},
  month =               oct,
}
[YPD95] Wang Yi, Paul Pettersson, and Mats Daniels. Automatic verification of real-time communicating systems by constraint-solving. In FORTE'94, IFIP Conference Proceedings 6, pages 243-258. Chapman & Hall, 1995. 
@inproceedings{forte1994-YPD,
  author =              {Yi, Wang and Pettersson, Paul and Daniels, Mats},
  title =               {Automatic verification of real-time communicating
                         systems by constraint-solving},
  editor =              {Hogrefe, Dieter and Leue, Stefan},
  booktitle =           {{P}roceedings of the 7th {IFIP} {WG}6.1
                         {I}nternational {C}onference on {F}ormal
                         {D}escription {T}echniques ({FORTE}'94)},
  acronym =             {{FORTE}'94},
  publisher =           {Chapman \& Hall},
  series =              {IFIP Conference Proceedings},
  volume =              {6},
  pages =               {243-258},
  year =                {1995},
  confyear =            {1994},
  confmonth =           {10},
}
Z
[Zan12] Fabio Zanasi. Expressiveness of Monadic Second-Order Logics on Infinite Trees of Arbitrary Branching Degrees. Master's thesis, Amsterdam University, the Netherlands, August 2012. 
@mastersthesis{master-zanasi,
  author =              {Zanasi, Fabio},
  title =               {Expressiveness of Monadic Second-Order Logics on
                         Infinite Trees of Arbitrary Branching Degrees},
  year =                {2012},
  month =               aug,
  school =              {Amsterdam University, the~Netherlands},
  type =                {Master's thesis},
}
[Zeu15] Thomas Zeume. Small Dynamic Complexity Classes. PhD thesis, Dortmund University, Germany, May 2015. 
@phdthesis{phd-zeume,
  author =              {Zeume, Thomas},
  title =               {Small Dynamic Complexity Classes},
  year =                {2015},
  month =               may,
  school =              {Dortmund University, Germany},
  type =                {{PhD} thesis},
}
[Zie98] Wiesław Zielonka. Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees. Theoretical Computer Science 200(1-2):135-183. Elsevier, June 1998. 
@article{tcs200(1-2)-Zie,
  author =              {Zielonka, Wies{\l}aw},
  title =               {Infinite Games on Finitely Coloured Graphs with
                         Applications to Automata on Infinite Trees},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {200},
  number =              {1-2},
  pages =               {135-183},
  year =                {1998},
  month =               jun,
}
[ZL77] Jacob Ziv and Abraham Lempel. A Universal Algorithm for Sequential Data Compression. IEEE Transactions on Information Theory 23(3):337-343. IEEE Inf. Theory Soc., May 1977. 
@article{tit23(3)-ZL,
  author =              {Ziv, Jacob and Lempel, Abraham},
  title =               {A Universal Algorithm for Sequential Data
                         Compression},
  publisher =           {IEEE Inf. Theory Soc.},
  journal =             {IEEE Transactions on Information Theory},
  volume =              {23},
  number =              {3},
  pages =               {337-343},
  year =                {1977},
  month =               may,
}
[ZL13] Janan Zaytoon and Stéphane Lafortune. Overview of fault diagnosis methods for Discrete Event Systems. Annual Reviews in Control 37(2):308-320. Elsevier, 2013. 
@article{aric37(2)-ZL,
  author =              {Zaytoon, Janan and Lafortune, St{\'e}phane},
  title =               {Overview of fault diagnosis methods for Discrete
                         Event Systems},
  publisher =           {Elsevier},
  journal =             {Annual Reviews in Control},
  volume =              {37},
  number =              {2},
  pages =               {308-320},
  year =                {2013},
  doi =                 {10.1016/j.arcontrol.2013.09.009},
}
[ZP96] Uri Zwick and Mike Paterson. The Complexity of Mean Payoff Games on Graphs. Theoretical Computer Science 158(1-2):343-359. Elsevier, May 1996. 
@article{tcs158(1-2)-ZP,
  author =              {Zwick, Uri and Paterson, Mike},
  title =               {The Complexity of Mean Payoff Games on Graphs},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {158},
  number =              {1-2},
  pages =               {343-359},
  year =                {1996},
  month =               may,
  doi =                 {10.1016/0304-3975(95)00188-3},
}
[ZSS04] Shipei Zhang, Oleg Sokolsky, and Scott A. Smolka. On the Parallel Complexity of Model Checking in the Modal Mu-Calculus. In LICS'04, pages 154-163. IEEE Comp. Soc. Press, July 2004. 
@inproceedings{lics1994-ZSS,
  author =              {Zhang, Shipei and Sokolsky, Oleg and Smolka, Scott
                         A.},
  title =               {On the Parallel Complexity of Model Checking in the
                         Modal Mu-Calculus},
  booktitle =           {{P}roceedings of the 19th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'04)},
  acronym =             {{LICS}'04},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {154-163},
  year =                {2004},
  month =               jul,
}
[Zur05] Richard Zurawski. Embedded Systems Handbook. CRC Press, 2005. 
@book{ESH2005-zurawski,
  author =              {Zurawski, Richard},
  title =               {Embedded Systems Handbook},
  publisher =           {CRC Press},
  year =                {2005},
}
[ZYN03] Sarah Zennou, Manuel Yguel, and Peter Niebert. ELSE: A New Symbolic State Generator for Timed Automata. In FORMATS'03, Lecture Notes in Computer Science 2791, pages 273-280. Springer-Verlag, September 2003. 
@inproceedings{formats2003-ZYN,
  author =              {Zennou, Sarah and Yguel, Manuel and Niebert, Peter},
  title =               {{ELSE}: A~New Symbolic State Generator for Timed
                         Automata},
  editor =              {Larsen, Kim Guldstrand and Niebert, Peter},
  booktitle =           {{R}evised {P}apers of the 1st {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'03)},
  acronym =             {{FORMATS}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2791},
  pages =               {273-280},
  year =                {2003},
  month =               sep,
}
List of authors