Simulation is decidable for one-counter nets

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

Volumn 1466, Issue , 1998, Pages 253-268

  Abdulla, Parosh Aziz ^a   Čerans, Karlis ^b  

^a Dept of Computer Systems ^*  (Sweden)

^b UNIVERSITY OF LATVIA   (Latvia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTER AIDED SOFTWARE ENGINEERING; PETRI NETS;

FINITE STATE; NATURAL NUMBER; PUSH-DOWN AUTOMATA; SIMULATION PREORDER;

EQUIVALENCE CLASSES;

EID: 84883412785     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055627     Document Type: Conference Paper

References (14)

1. th IEEE Int. Symp. on Logic in Computer Science, pages 160-170, 1993.
2. J.CM. Baeten, J.A. Bergstra, and J.W. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. Journal of the ACM, (40):653-682, 1993.
3. S. Christensen, Y. Hirshfeld, and F. Moller. Bisimulation equivalence is decidable for basic parallel processes. In Proc. CONCUR '93, Theories of Concurrency: Unification and Extension, pages 143-157, 1993.
4. S. Christensen, H. Hüttel, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. In W. R. Cleaveland, editor, Proc. CONCUR '92, Theories of Concurrency: Unification and Extension, pages 138-147, 1992.
5. J. Esparza. Petri nets, commutative context-free grammers, and basic parallel processes. In Proc. Fundementals of Computation Theory, number 965 in Lecture Notes in Computer Science, pages 221-232, 1995.
6. J.F. Groote and H. Hüttel. Undecidable equivelences for basic process algebra. Information and Computation, 1994.
7. P. Jančar. Undecidability of bisimilarity for Petri nets and related problem. Theoretical Computer Science, (148):281-301, 1995.
8. P. Jančar. Bisimulation equivalence is decidable for one-counter processes. In Proc. ICALP '97, pages 549-559, 1997.
9. P. Jančar and J. Esparza. Deciding finiteness of petri nets up to bisimulation. In Proc. ICALP '96, number 1099 in Lecture Notes in Computer Science, pages 478-489, 1996.
10. th Int. Conf. on Concurrency Theory, pages 348-362, 1995.
11. Mats Kindahl. Results on decidability of simulation and bisimulation for lossy channel systems. Technical Report 91, Department of Computer Systems, Uppsala University, May 1997. Licentiate Thesis.
12. th Int. Conf. on Concurrency Theory, volume 962 of Lecture Notes in Computer Science, pages 1-11. Springer Verlag, 1995.
13. C. Stirling. Decidability of bisimulation equivalence for normed pushdown processes. In Proc. CONCUR '96, 7th Int. Conf. on Concurrency Theory, volume 1119 of Lecture Notes in Computer Science, pages 217-232. Springer Verlag, 1996.
14. W. Thomas. On the synthesis of strategies in infinite games. In STACS 95, volume 900 of Led. Notes in Comput. Sei., pages 1-13. Springer-Verlag, 1995.