Simulation preorder on simple process algebras

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1644 LNCS, Issue , 1999, Pages 503-512

  Kučera, Antonín ^a   Mayr, Richard ^b  

^a MASARYK UNIVERSITY   (Czech Republic)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY;

BISIMULATIONS; FINITE STATE PROCESS; INFINITE STATE; INFINITE STATE SYSTEMS; PROCESS ALGEBRAS; PUSHDOWN PROCESS; SIMULATION PREORDER; TRACE EQUIVALENCE;

EQUIVALENCE CLASSES;

EID: 84887498707     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_47     Document Type: Conference Paper

References (19)

1. P.A. Abdulla and K. Čerans. Simulation is decidable for one-counter nets. In Proceedings of CONCUR'98, volume 1466 of LNCS, pages 253-268. Springer-Verlag, 1998.
2. J.C.M. Baeten and W.P. Weijland. Process Algebra. Number 18 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.
3. O. Burkart, D. Caucal, and B. Steffen. Bisimulation collapse and the process taxonomy. In Proceedings of CONCUR'96, volume 1119 of LNCS, pages 247-262. Springer-Verlag, 1996.
4. D. Caucal. On the regular structure of prefix rewriting. Theoretical Computer Science, 106:61-86, 1992.
5. S. Christensen, Y. Hirshfeld, and F. Moller. Bisimulation is decidable for all basic parallel processes. In Proceedings of CONCUR'93, volume 715 of LNCS, pages 143-157. Springer- Verlag, 1993.
6. S. Christensen, H. Hüttel, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. Information and Computation, 121:143-148, 1995.
7. J.F. Groote and H. Hüttel. Undecidable equivalences for basic process algebra. Information and Computation, 115(2):353-371, 1994.
8. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
9. H. Hüttel. Undecidable equivalences for basic parallel processes. In Proceedings of TACS'94, volume 789 of LNCS, pages 454-464. Springer-Verlag, 1994.
10. P. Jančar and J. Esparza. Deciding finiteness of Petri nets up to bisimilarity. In Proceedings of ICALP'96, volume 1099 of LNCS, pages 478-489. Springer-Verlag, 1996.
11. P. Jančar, A. Kučera, and R. Mayr. Deciding bisimulation-like equivalences with finite-state processes. In Proceedings of ICALP'98, volume 1443 of LNCS, pages 200-211. Springer- Verlag, 1998.
12. P. Jančar and F. Moller. Checking regular properties of Petri nets. In Proceedings of CONCUR'95, volume 962 of LNCS, pages 348-362. Springer-Verlag, 1995.
13. A. Kučera. Regularity is decidable for normed PA processes in polynomial time. In Proceedings of FST&TCS'96, volume 1180 of LNCS, pages 111-122. Springer-Verlag, 1996.
14. A. Kučera and R. Mayr. Weak bisimilarity with infinite-state systems can be decided in polynomial time. Technical report TUM-I9830, Institut für Informatik, TU-München, 1998.
15. A. Kučera and R. Mayr. Simulation preorder on simple process algebras. Technical report TUM-I9902, Institut für Informatik, TU-München, 1999.
16. R. Mayr. Process rewrite systems. Information and Computation. To appear.
17. M.L. Minsky. Computation: Finite and Infinite Machines. Prentice-Hall, 1967.
18. D.E. Muller and P.E. Schupp. The theory of ends, pushdown automata, and second order logic. Theoretical Computer Science, 37(1):51-75, 1985.
19. R.J. van Glabbeek. The linear time-branching time spectrum. In Proceedings of CONCUR' 90, volume 458 of LNCS, pages 278-297. Springer-Verlag, 1990.