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},
}
[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,
}
[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.},
}
[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,
}
[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,
}
[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,
}
[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},
}
[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,
}
[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},
}
[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,
}
[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,
}
[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},
}
[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,
}
[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{ 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},
}