Roadmap of Infinite Results

This paper provides a comprehensive summary of equivalence checking results for infinite-state systems. References to the relevant papers will be updated continuously according to the development in the area. The most recent version of this document is available from the web-page http://www.brics.dk/~srba/roadmap.

[1]  Richard Mayr,et al.  Process rewrite systems , 1999, EXPRESS.

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

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

[4]  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..

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

[6]  Géraud Sénizergues,et al.  L(A) = L(B)? Decidability Results from Complete Formal Systems , 2002, ICALP.

[7]  P. Jančar,et al.  Bisimilarity on normed Basic Parallel Processes can be decided in time O ( n 3 ) , 2004 .

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

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

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

[11]  Géraud Sénizergues,et al.  L(A)=L(B)? A simplified decidability proof , 2002, Theor. Comput. Sci..

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

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

[14]  José L. Balcázar,et al.  Deciding Bisimilarity is P-Complete , 1992, Formal Aspects Comput..

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

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

[17]  Vojtech Rehák,et al.  On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit , 2003, INFINITY.

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

[19]  M. Rusinowitch,et al.  Reachability is decidable for ground AC Rewrite systems , 1998 .

[20]  Zdenek Sawa,et al.  Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time , 2004, INFINITY.

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

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

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

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

[25]  J. Richard Büchi.  Regular canonical systems , 1964 .

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

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

[28]  Colin Stirling,et al.  Decidability of bisimulation equivalence for normed pushdown processes , 1998, SIGA.

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

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

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

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

[33]  Jirí Srba.  Complexity of Weak Bisimilarity and Regularity for BPA and BPP , 2000, EXPRESS.

[34]  Robert E. Tarjan,et al.  Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[35]  Géraud Sénizergues,et al.  L(A) = L(B) ? decidability results from complete formal systems , 2001 .

[36]  Charles Rackoff,et al.  The Covering and Boundedness Problems for Vector Addition Systems , 1978, Theor. Comput. Sci..

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

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

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

[40]  Jitka Stríbrná.  Hardness results for weak bisimilarity of simple process algebras , 1998, Electron. Notes Theor. Comput. Sci..

[41]  Scott A. Smolka,et al.  CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.

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

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

[44]  Vojtech Rehák,et al.  Extended Process Rewrite Systems: Expressiveness and Reachability , 2004, CONCUR.

[45]  Petr Jancar,et al.  Strong bisimilarity on basic parallel processes in PSPACE-complete , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[46]  Antonín Kucera,et al.  Regularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial Time , 1996, SOFSEM.

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