Equivalence-Checking with Infinite-State Systems: Techniques and Results

The paper presents an overview of techniques and results for equivalence-checking with infinite-state systems. The selection of presented techniques reflects the authors' view on recent development in the area; the overview of existing results should be up-to-date (as of August 2002).

[1]  Antonín Kucera,et al.  Effective decomposability of sequential behaviours , 2000, Theor. Comput. Sci..

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

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

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

[5]  Javier Esparza,et al.  Deciding Finiteness of Petri Nets Up To Bisimulation , 1996, ICALP.

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

[7]  Faron Moller,et al.  Verification on Infinite Structures , 2001, Handbook of Process Algebra.

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

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

[10]  Ivana Cerná,et al.  Comparing expressibility of normed BPA and normed BPP processes , 1999, Acta Informatica.

[11]  Antonín Kucera,et al.  Why Is Simulation Harder than Bisimulation? , 2002, CONCUR.

[12]  Jirí Srba.  Undecidability of Weak Bisimilarity for PA-Processes , 2002, Developments in Language Theory.

[13]  Colin Stirling,et al.  Modal and temporal logics , 1993, LICS 1993.

[14]  Antonín Kucera,et al.  Regularity is Decidable for Normed PA Processes in Polynomial Time , 1996, FSTTCS.

[15]  Igor Walukiewicz.  Model Checking CTL Properties of Pushdown Systems , 2000, FSTTCS.

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

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

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

[19]  Colin Stirling,et al.  Modal and Temporal Properties of Processes , 2001, Texts in Computer Science.

[20]  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).

[21]  Jan A. Bergstra,et al.  On the Consistency of Koomen's Fair Abstraction Rule , 1987, Theor. Comput. Sci..

[22]  Davide Sangiorgi,et al.  On the Proof Method for Bisimulation (Extended Abstract) , 1995, MFCS.

[23]  J. Blanco.  Normed BPP and BPA , 1995 .

[24]  Jirí Srba,et al.  Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard , 2002, STACS.

[25]  Philippe Schnoebelen.  Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems , 2001, TACS.

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

[27]  Bernhard Steffen,et al.  Characteristic Formulae for Processes with Divergence , 1994, Inf. Comput..

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

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

[30]  Wolfgang Thomas,et al.  On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science , 1993, TAPSOFT.

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

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

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

[34]  Hans Hüttel,et al.  Actions Speak Louder Than Words: Proving Bisimilarity for Context-Free Processes , 1998, J. Log. Comput..

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

[36]  Jirí Srba.  Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard , 2002, ICALP.

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

[38]  Igor Walukiewicz.  Pushdown Processes: Games and Model-Checking , 2001, Inf. Comput..

[39]  Emily P. Friedman.  The Inclusion Problem for Simple Languages , 1976, Theor. Comput. Sci..

[40]  Antonín Kucera,et al.  On Simulation-Checking with Sequential Systems , 2000, ASIAN.

[41]  Antonín Kucera,et al.  Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time , 2002, Theor. Comput. Sci..

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

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

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

[45]  Antonín Kucera,et al.  Efficient Verification Algorithms for One-Counter Processes , 2000, ICALP.

[46]  Antonín Kucera,et al.  Simulation Preorder over Simple Process Algebras , 2002, Inf. Comput..

[47]  Jirí Srba.  Complexity Of Weak Bisimilarity And Regularity For Bpa And Bpp , 2003, Math. Struct. Comput. Sci..

[48]  Antonín Kucera,et al.  On the Complexity of Semantic Equivalences for Pushdown Automata and BPA , 2002, MFCS.

[49]  Petr Jancar.  High Undecidability of Weak Bisimilarity for Petri Nets , 1995, TAPSOFT.

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

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

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

[53]  Jirí Srba,et al.  Undecidability of Weak Bisimilarity for Pushdown Processes , 2002, CONCUR.

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

[55]  Petr Jancar,et al.  Decidability of Bisimilarity for One-Counter Processes , 2000, Inf. Comput..

[56]  Antonín Kucera,et al.  Deciding bisimulation-like equivalences with finite-state processes , 2001, Theor. Comput. Sci..

[57]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[58]  Colin Stirling,et al.  Deciding DPDA Equivalence Is Primitive Recursive , 2002, ICALP.

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

[60]  Javier Esparza.  Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes , 1995, FCT.

[61]  Yoram Hirshfeld,et al.  Bisimulation trees and the decidability of weak bisimulations , 1996, INFINITY.

[62]  Parosh Aziz Abdulla,et al.  Decidability of Simulation and Bisimulation between Lossy Channel Systems and Finite State Systems (Extended Abstract) , 1995, CONCUR.

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

[64]  Richard Mayr.  Decidability of model checking with the temporal logic EF , 2001, Theor. Comput. Sci..

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

[66]  Parosh Aziz Abdulla,et al.  General decidability theorems for infinite-state systems , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[67]  Antonín Kucera,et al.  Bisimilarity of processes with finite-state systems , 1997, INFINITY.

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

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

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

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

[72]  Faron Moller,et al.  Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds , 2002, FoSSaCS.

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

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

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

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

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