Fixpoint logic, games, and relations of consequence

ion in Parameterised Boolean Equation Systems

[1]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[2]  Marcin Jurdzinski,et al.  Small Progress Measures for Solving Parity Games , 2000, STACS.

[3]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[4]  Editors , 1986, Brain Research Bulletin.

[5]  Simona Orzan,et al.  Invariants for Parameterised Boolean Equation Systems , 2008, Theor. Comput. Sci..

[6]  Thomas Wilke,et al.  Simulation Relations for Alternating Parity Automata and Parity Games , 2006, Developments in Language Theory.

[7]  Jja Jeroen Keiren,et al.  Advanced reduction techniques for model checking , 2013 .

[8]  Sven Schewe,et al.  An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games , 2008, CSL.

[9]  Orna Kupferman,et al.  On the Complexity of Parity Word Automata , 2001, FoSSaCS.

[10]  Robert McNaughton,et al.  Infinite Games Played on Finite Graphs , 1993, Ann. Pure Appl. Logic.

[11]  Jan Friso Groote,et al.  Model-checking processes with data , 2005, Sci. Comput. Program..

[12]  Orna Grumberg,et al.  3-Valued Abstraction: More Precision at Less Cost , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[13]  Dexter Kozen,et al.  Results on the Propositional µ-Calculus , 1982, ICALP.

[14]  Radu Mateescu,et al.  Local Model-Checking of an Alternation-Free Value-Based Modal Mu-Calculus , 1998 .

[15]  K. Deimling.  Fixed Point Theory , 2008 .

[16]  Stephan Kreutzer,et al.  Graph operations on parity games and polynomial-time algorithms , 2016, Theor. Comput. Sci..

[17]  Perdita Stevens.  Abstract Games for Infinite State Processes , 1998, CONCUR.

[18]  Peter Lammich,et al.  Tree Automata , 2009, Arch. Formal Proofs.

[19]  Cliff B. Jones,et al.  Programming Languages and Their Definition , 1984, Lecture Notes in Computer Science.

[20]  Hartmut Klauck,et al.  Algorithms for Parity Games , 2001, Automata, Logics, and Infinite Games.

[21]  Simona Orzan,et al.  Static Analysis Techniques for Parameterised Boolean Equation Systems , 2009, TACAS.

[22]  Harald Fecher,et al.  Comparing disjunctive modal transition systems with an one-selecting variant , 2008, J. Log. Algebraic Methods Program..

[23]  Kedar S. Namjoshi,et al.  The existence of finite abstractions for branching time model checking , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[24]  Perdita Stevens,et al.  Practical Model-Checking Using Games , 1998, TACAS.

[25]  Radu Mateescu,et al.  A Model Checking Language for Concurrent Value-Passing Systems , 2008, FM.

[26]  E. Allen Emerson,et al.  An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus , 1989, Inf. Comput..

[27]  Tim A. C. Willemse,et al.  Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems , 2011, Inf. Comput..

[28]  Kim G. Larsen,et al.  Equation solving using modal transition systems , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[29]  Oliver Friedmann,et al.  Solving Parity Games in Practice , 2009, ATVA.

[30]  Radu Mateescu,et al.  A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems , 2003, TACAS.

[31]  Patrick Cousot,et al.  Partial Completeness of Abstract Fixpoint Checking , 2000, SARA.

[32]  Thomas A. Henzinger,et al.  Alternating Refinement Relations , 1998, CONCUR.

[33]  Sjoerd Cranen,et al.  A Cure for Stuttering Parity Games , 2012, ICTAC.

[34]  Radu Mateescu,et al.  CADP 2006: A Toolbox for the Construction and Analysis of Distributed Processes , 2007, CAV.

[35]  J. Keiren,et al.  An experimental study of algorithms and optimisations for parity games, with an application to , 2009 .

[36]  A. Prasad Sistla,et al.  On model checking for the µ-calculus and its fragments , 2001, Theor. Comput. Sci..

[37]  Kedar S. Namjoshi,et al.  Automata as Abstractions , 2005, VMCAI.

[38]  Edmund M. Clarke,et al.  Model checking and abstraction , 1994, TOPL.

[39]  Misa Keinänen.  Techniques for solving Boolean equation systems , 2006 .

[40]  Christian Kissig,et al.  Complementation of Coalgebra Automata , 2009, CALCO.

[41]  A. Prasad Sistla,et al.  On Model-Checking for Fragments of µ-Calculus , 1993, CAV.

[42]  Oliver Friedmann,et al.  Recursive algorithm for parity games requires exponential time , 2011, RAIRO Theor. Informatics Appl..

[43]  Tim A. C. Willemse,et al.  Consistent Correlations for Parameterised Boolean Equation Systems with Applications in Correctness Proofs for Manipulations , 2010, CONCUR.

[44]  D. Sangiorgi.  Introduction to Bisimulation and Coinduction , 2011 .

[45]  Igor Walukiewicz,et al.  Pushdown Processes: Games and Model-Checking , 1996, Inf. Comput..

[46]  Arvind Gupta,et al.  Two results in negation-free logic , 1993 .

[47]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[48]  Wieslaw Zielonka,et al.  Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees , 1998, Theor. Comput. Sci..

[49]  María-del-Mar Gallardo,et al.  Implementing Influence Analysis Using Parameterised Boolean Equation Systems , 2006, Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (isola 2006).

[50]  Igor Walukiewicz,et al.  Games for synthesis of controllers with partial observation , 2003, Theor. Comput. Sci..

[51]  Dietmar Berwanger,et al.  Fixed-Point Logics and Solitaire Games , 2004, Theory of Computing Systems.

[52]  Kousha Etessami,et al.  Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata , 2001, ICALP.

[53]  Tim A. C. Willemse,et al.  Consistent Consequence for Boolean Equation Systems , 2012, SOFSEM.

[54]  Jaco van de Pol,et al.  An abstract interpretation toolkit for μCRL , 2005, Formal Methods Syst. Des..

[55]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[56]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum II , 1993, CONCUR.

[57]  Bas Luttik,et al.  Proof Graphs for Parameterised Boolean Equation Systems , 2013, CONCUR.

[58]  Jan Friso Groote,et al.  A Sub-quadratic Algorithm for Conjunctive and Disjunctive Boolean Equation Systems , 2005, ICTAC.

[59]  Sharon Shoham,et al.  Local abstraction–refinement for the μ-calculus , 2011, International Journal on Software Tools for Technology Transfer.

[60]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[61]  Sven Schewe.  Solving Parity Games in Big Steps , 2007, FSTTCS.

[62]  Anuj Dawar,et al.  The Descriptive Complexity of Parity Games , 2008, CSL.

[63]  Huimin Lin,et al.  Symbolic Transition Graph with Assignment , 1996, CONCUR.

[64]  Erik P. de Vink,et al.  An Overview of the mCRL2 Toolset and Its Recent Advances , 2013, TACAS.

[65]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[66]  Uri Zwick,et al.  A deterministic subexponential algorithm for solving parity games , 2006, SODA '06.

[67]  Angelika Mader,et al.  Verification of modal properties using Boolean equation systems , 1997 .

[68]  Marcin Jurdzinski,et al.  A Discrete Strategy Improvement Algorithm for Solving Parity Games , 2000, CAV.

[69]  Sjoerd Cranen,et al.  Stuttering Mostly Speeds Up Solving Parity Games , 2011, NASA Formal Methods.

[70]  Jan Friso Groote,et al.  Parameterised boolean equation systems , 2005, Theor. Comput. Sci..

[71]  Jan Friso Groote,et al.  Verification of Temporal Properties of Processes in a Setting with Data , 1998, AMAST.

[72]  Colin Stirling,et al.  Modal Mu-Calculi , 2001 .

[73]  Rance Cleaveland,et al.  Fast Generic Model-Checking for Data-Based Systems , 2005, FORTE.

[74]  Paul Crubillé,et al.  A Linear Algorithm to Solve Fixed-Point Equations on Transition Systems , 1988, Inf. Process. Lett..

[75]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[76]  Tim A. C. Willemse,et al.  Expressiveness and Completeness in Abstraction , 2012, EXPRESS/SOS.

[77]  Dennis Dams,et al.  Abstract interpretation and partition refinement for model checking , 1996 .

[78]  Radha Jagadeesan,et al.  Three-valued abstractions of games: uncertainty, but with precision , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[79]  John Fearnley,et al.  Non-oblivious Strategy Improvement , 2010, LPAR.

[80]  Radha Jagadeesan,et al.  Abstraction-Based Model Checking Using Modal Transition Systems , 2001, CONCUR.

[81]  Jaco van de Pol,et al.  Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems , 2007, CONCUR.

[82]  Kedar S. Namjoshi.  Abstraction for Branching Time Properties , 2003, CAV.