Regularity is decidable for normed PA processes in polynomial time

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

Volumn 1180, Issue , 1996, Pages 111-122

  Kučera, Antonín ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; SOFTWARE ENGINEERING;

BISIMULATION EQUIVALENCES; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS;

COMPUTABILITY AND DECIDABILITY;

EID: 84947916996     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62034-6_42     Document Type: Conference Paper

References (17)

1. J. C. M. Baeten, J. A. Bergstra, and J. W. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. In Proceedings of PARLE 87, volume 259 of LNCS, pages 93-114. Springer-Verlag, 1987.
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. A. Bouajjani, R. Echahed, and P. Habermehl. Verifying infinite state processes with sequential and parallel composition. In Proceedings of POPL 95, pages 95-106. ACM Press, 1995.
4. 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.
5. D. Caucal. Graphes canoniques de graphes algebriques. Rapport de Recherche 872, INRIA, 1988.
6. 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.
7. S. Christensen, H. Hüttel, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. In Proceedings of CONCUR 92, volume 630 of LNCS, pages 138-147. Springer-Verlag, 1992.
8. J. Esparza and P. Jančar. Deciding finiteness of Petri nets up to bisimilarity. In Proceedings of ICALP 96, volume 1099 of LNCS, pages 478-489. Springer-Verlag, 1996.
9. J. F. Groote. A short proof of the decidability of bisimulation for normed BPA processes. Information Processing Letters, 42:167-171, 1991.
10. H. Hüttel and C. Stirling. Actions speak louder than words: Proving bisimilarity for context-free processes. In Proceedings of LICS 91, pages 376-386. IEEE Computer Society Press, 1991.
11. P. Jančar. Decidability questions for bisimilarity of Petri nets and some related problems. In Proceedings of STACS 94, volume 775 of LNCS, pages 581-592. Springer-Verlag, 1994.
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. Deciding regularity in process algebras. BRICS Report Series RS-9552, Department of Computer Science, University of Aarhus, October 1995.
14. A. Kučera. Regularity is decidable for normed PA processes in polynomial time. Technical report, Faculty of Informatics, Masaryk University, 1996.
15. S. Mauw and H. Mulder. Regularity of BPA-systems is decidable. In Proceedings of CONCUR 94, volume 836 of LNCS, pages 34-47. Springer-Verlag, 1994.
16. R. Milner. Communication and Concurrency. Prentice-Hall International, 1989.
17. th GI Conference, volume 104 of LNCS, pages 167-183. Springer-Verlag, 1981.