Verification on Infinite Structures

Abstract In this chapter, we present a hierarchy of infinite-state systems based on the primitive operations of sequential and parallel composition; the hierarchy includes a variety of commonly-studied classes of systems such as context-free and pushdown automata, and Petri net processes. We then examine the equivalence and regularity checking problems for these classes, with special emphasis on bisimulation equivalence, stressing the structural techniques which have been devised for solving these problems. Finally, we explore the model checking problem over these classes with respect to various linear- and branching-time temporal logics.

[1]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

[2]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[3]  Unique decomposition of processes , 1990, Bull. EATCS.

[4]  Faron Moller,et al.  A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes , 1994, Mathematical Structures in Computer Science.

[5]  Jan Friso Groote,et al.  A Short Proof of the Decidability of Bisimulation for Normed BPA-Processes , 1992, Inf. Process. Lett..

[6]  Ahmed Bouajjani,et al.  Verification of Nonregular Temporal Properties for Context-Free Processes , 1994, CONCUR.

[7]  Faron Moller,et al.  Infinite Results , 1996, CONCUR.

[8]  Didier Caucal.  A Fast Algorithm to Decide on the Equivalence of Stateless DPDA , 1993, RAIRO Theor. Informatics Appl..

[9]  Javier Esparza,et al.  On the Model Checking Problem for Branching Time Logics and Basic Parallel Processes , 1995, CAV.

[10]  Faron Moller,et al.  Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[11]  M. Rabin.  Decidability of second-order theories and automata on infinite trees. , 1969 .

[12]  Dirk Taubner,et al.  Finite Representations of CCS and TCSP Programs by Automata and Petri Nets , 1989, Lecture Notes in Computer Science.

[13]  Rance Cleaveland,et al.  Faster Model Checking for the Modal Mu-Calculus , 1992, CAV.

[14]  David J. Goodman,et al.  Personal Communications , 1994, Mobile Communications.

[15]  Yves-Marie Quemener,et al.  Model-checking of infinite graphs defined by graph grammars , 1996, INFINITY.

[16]  J. R. Büchi.  Regular Canonical Systems , 1964 .

[17]  David E. Muller,et al.  The Theory of Ends, Pushdown Automata, and Second-Order Logic , 1985, Theor. Comput. Sci..

[18]  Jitka StříAbrná.  Hardness results for weak bisimilarity of simple process algebras , 1998 .

[19]  Antonín Kucera,et al.  Simulation Preorder on Simple Process Algebras , 1999, ICALP.

[20]  Chin-Laung Lei,et al.  Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract) , 1986, LICS.

[21]  Antonín Kucera,et al.  Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time , 1999, CONCUR.

[22]  Jai Srinivasan,et al.  Branching time temporal logic , 1988, REX Workshop.

[23]  Yoram Hishfeld.  Petri Nets and the Equivalence Problem , 1993 .

[24]  Hans Hüttel,et al.  Actions speak louder than words: proving bisimilarity for context-free processes , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[25]  Hsu-Chun Yen,et al.  A Unified Approach for Deciding the Existence of Certain Petri Net Paths , 1992, Inf. Comput..

[26]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[27]  Lu Tian,et al.  On Deciding Readiness and Failure Equivalences for Processes , 1995, Inf. Comput..

[28]  Hans Hüttel,et al.  Undecidable equivalences for basic parallel processes , 1994, Inf. Comput..

[29]  Amir Pnueli,et al.  Checking that finite state concurrent programs satisfy their linear specification , 1985, POPL.

[30]  Pierre Wolper,et al.  Automata theoretic techniques for modal logics of programs: (Extended abstract) , 1984, STOC '84.

[31]  Edward F. Moore,et al.  Gedanken-Experiments on Sequential Machines , 1956 .

[32]  Richard Mayr.  Strict Lower Bounds for Model Checking BPA , 1998, Electron. Notes Theor. Comput. Sci..

[33]  Rance Cleaveland,et al.  Computing Behavioural Relations, Logically , 1991, ICALP.

[34]  Géraud Sénizergues,et al.  Decidability of bisimulation equivalence for equational graphs of finite out-degree , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[35]  Richard Mayr,et al.  Deciding Bisimulation-Like Equivalences with Finite-State Processes , 1998, ICALP.

[36]  Moshe Y. Vardi.  Alternating Automata and Program Verification , 1995, Computer Science Today.

[37]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[38]  J. R. Büchi.  On a Decision Method in Restricted Second Order Arithmetic , 1990 .

[39]  L. Rédei,et al.  The theory of finitely generated commutative semigroups , 1965 .

[40]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[41]  Robert W. Floyd,et al.  Assigning Meanings to Programs , 1993 .

[42]  Faron Moller,et al.  Checking Regular Properties of Petri Nets , 1995, CONCUR.

[43]  Petr Jancar,et al.  Decidability Questions for Bismilarity of Petri Nets and Some Related Problems , 1994, STACS.

[44]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[45]  Didier Caucal,et al.  On the Regular Structure of Prefix Rewriting , 1990, Theor. Comput. Sci..

[46]  Ahmed Bouajjani,et al.  Constrained Properties, Semilinear Systems, and Petri Nets , 1996, CONCUR.

[47]  Petr Jancar.  Undecidability of Bisimilarity for Petri Nets and Some Related Problems , 1995, Theor. Comput. Sci..

[48]  Lu Tian,et al.  Deciding Bisimilarity of Normed Context-Free Processes is in Sigma^p_2 , 1994, Theor. Comput. Sci..

[49]  Javier Esparza,et al.  Efficient Algorithms for Model Checking Pushdown Systems , 2000, CAV.

[50]  Mordechai Ben-Ari,et al.  The temporal logic of branching time , 1981, POPL '81.

[51]  Bernhard Steffen,et al.  Composition, Decomposition and Model Checking of Pushdown Processes , 1995, Nord. J. Comput..

[52]  Donald E. Knuth,et al.  Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[53]  John E. Hopcroft,et al.  Simple Deterministic Languages , 1966, SWAT.

[54]  Didier Caucal,et al.  Graphes canoniques de graphes algébriques , 1990, RAIRO Theor. Informatics Appl..

[55]  Javier Esparza,et al.  On the Decidability of Model Checking for Several µ-calculi and Petri Nets , 1994, CAAP.

[56]  Petr Jancar,et al.  Bisimulation Equivalence is Decidable for One-Counter Processes , 1997, ICALP.

[57]  Ernst W. Mayr.  An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

[58]  Leslie Lamport,et al.  Verification and Specifications of Concurrent Programs , 1993, REX School/Symposium.

[59]  Philippe Schnoebelen,et al.  The regular viewpoint on PA-processes , 1998, Theor. Comput. Sci..

[60]  Colin Stirling,et al.  Decidability of DPDA equivalence , 2001, Theor. Comput. Sci..

[61]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[62]  Richard Mayr.  On the Complexity of Bisimulation Problems for Basic Parallel Processes , 2000, ICALP.

[63]  Michel Hack,et al.  Decidability Questions for Petri Nets , 1975, Outstanding Dissertations in the Computer Sciences.

[64]  Bernhard Steffen,et al.  An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes , 1995, MFCS.

[65]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum I , 2001, Handbook of Process Algebra.

[66]  Bernhard Steffen,et al.  Bisimulation Collapse and the Process Taxonomy , 1996, CONCUR.

[67]  Wolfgang Thomas,et al.  A Combinatorial Approach to the Theory of omega-Automata , 1981, Inf. Control..

[68]  Javier Esparza,et al.  Decidability of model checking for infinite-state concurrent systems , 1997, Acta Informatica.

[69]  Faron Moller,et al.  A Taxonomy of Infinite State Processes , 1998, MFCS Workshop on Concurrency.

[70]  L. Dickson.  Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .

[71]  Bernhard Steffen,et al.  Constraint-Based Inter-Procedural Analysis of Parallel Programs , 2000, Nord. J. Comput..

[72]  Olaf Burkart,et al.  Automatic Verification of Sequential Infinite-State Processes , 1998, Lecture Notes in Computer Science.

[73]  Faron Moller,et al.  Simulation Problems for One-Counter Machines , 1999, SOFSEM.

[74]  Faron Moller,et al.  Simulation and Bisimulation over One-Counter Processes , 2000, STACS.

[75]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[76]  Damian Niwinski.  On Fixed-Point Clones (Extended Abstract) , 1986, ICALP.

[77]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[78]  Damian Niwinski,et al.  Fixed Point Characterization of Infinite Behavior of Finite-State Systems , 1997, Theor. Comput. Sci..

[79]  Didier Caucal,et al.  On infinite transition graphs having a decidable monadic theory , 1996, Theor. Comput. Sci..

[80]  Géraud Sénizergues,et al.  The Equivalence Problem for Deterministic Pushdown Automata is Decidable , 1997, ICALP.

[81]  Hardi Hungar,et al.  Local Model-Checking for Context-Free Processes , 1993, Nord. J. Comput..

[82]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[83]  Bernhard Steffen,et al.  Model Checking for Context-Free Processes , 1992, CONCUR.

[84]  Julian C. Bradfield.  The Modal µ-Calculus Alternation Hierarchy is Strict , 1998, Theor. Comput. Sci..

[85]  Javier Esparza,et al.  More infinite results , 2001, INFINITY.

[86]  Zakaria Bouziane,et al.  A primitive recursive algorithm for the general Petri net reachability problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[87]  Colin Stirling.  Decidability of Bisimulation Equivalence for Normed Pushdown Processes , 1998, Theor. Comput. Sci..

[88]  Géraud Sénizergues,et al.  L(a) = L(b)? , 1997, INFINITY.

[89]  Robin Milner,et al.  A Complete Inference System for a Class of Regular Behaviours , 1984, J. Comput. Syst. Sci..

[90]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[91]  Thomas A. Henzinger,et al.  Real-time system = discrete system + clock variables , 1994, International Journal on Software Tools for Technology Transfer.

[92]  Jan A. Bergstra,et al.  Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages , 1987, PARLE.

[93]  Faron Moller,et al.  Petri Nets and Regular Processes , 1999, J. Comput. Syst. Sci..

[94]  Leslie G. Valiant,et al.  Deterministic One-Counter Automata , 1975, J. Comput. Syst. Sci..

[95]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[96]  Richard Mayr.  Model Checking PA-Processes , 1997, CONCUR.

[97]  Javier Esparza,et al.  Decidability and Complexity of Petri Net Problems - An Introduction , 1996, Petri Nets.

[98]  Richard Mayr.  Weak Bisimulation and Model Checking for Basic Parallel Processes , 1996, FSTTCS.

[99]  Bernhard Steffen,et al.  Model Checking the Full Modal Mu-Calculus for Infinite Sequential Processes , 1997, ICALP.

[100]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[101]  Moshe Y. Vardi.  A temporal fixpoint calculus , 1988, POPL '88.

[102]  Hardi Hungar.  Model Checking and Higher-Order Recursion , 1999, MFCS.

[103]  Jan A. Bergstra,et al.  Decidability of bisimulation equivalence for process generating context-free languages , 1987, JACM.

[104]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

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

[106]  Parosh Aziz Abdulla,et al.  Simulation Is Decidable for One-Counter Nets (Extended Abstract) , 1998, CONCUR.

[107]  Mark Jerrum,et al.  Bisimulation Equivanlence Is Decidable for Normed Process Algebra , 1999 .

[108]  I. Walukiewicz.  Pushdown Processes: Games and Model Checking , 1996 .

[109]  Didier Caucal,et al.  On the transition graphs of automata and grammars , 1990, WG.

[110]  Peter Habermehl.  On the Complexity of the Linear-Time mu -calculus for Petri-Nets , 1997, ICATPN.

[111]  Javier Esparza,et al.  Reachability Analysis of Pushdown Automata: Application to Model-Checking , 1997, CONCUR.

[112]  Faron Moller,et al.  A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes , 1994, Theor. Comput. Sci..

[113]  Faron Moller,et al.  A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes , 1994, CONCUR.

[114]  Faron Moller,et al.  Bisimulation Equivalence is Decidable for Basic Parallel Processes , 1993, CONCUR.

[115]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[116]  Bruno Courcelle,et al.  Graph Rewriting: An Algebraic and Logic Approach , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[117]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[118]  Rance Cleaveland,et al.  Equivalence and Preorder Checking for Finite-State Systems , 2001, Handbook of Process Algebra.

[119]  Hardi Hungar,et al.  Local Model Checking for Parallel Compositions of Context-Free Processes , 1994, CONCUR.

[120]  Søren Christensen.  Decidability and decomposition in process algebras , 1993 .

[121]  Jan Friso Groote,et al.  Undecidable Equivalences for Basic Process Algebra , 1994, Inf. Comput..

[122]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[123]  Olaf Burkart.  Model checking rationally restricted right closures of recognizable graphs , 1997, INFINITY.

[124]  Colin Stirling,et al.  Modal Logics and mu-Calculi: An Introduction , 2001, Handbook of Process Algebra.

[125]  Richard Mayr.  On the Complexity of Bisimulation Problems for Pushdown Automata , 2000, IFIP TCS.

[126]  Hardi Hungar,et al.  Model Checking of macro Processes , 1994, CAV.

[127]  Julian Bradfield.  Verifying Temporal Properties of Systems , 1992, Progress in Theoretical Computer Science.

[128]  Arto Salomaa,et al.  Two Complete Axiom Systems for the Algebra of Regular Events , 1966, JACM.

[129]  Søren Christensen,et al.  Bisimulation Equivalence is Decidable for all Context-Free Processes , 2022 .