Regularity for a large class of context-free processes is decidable

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

Volumn 1099, Issue , 1996, Pages 182-193

  Bosscher, D J B ^a   Griffioen, W O D ^a,b  

^a CWI   (Netherlands)

^b RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY;

CONTEXT-FREE PROCESS; MODULO BISIMULATION; NUMBER OF STATE; UPPER BOUND;

CONTEXT FREE LANGUAGES;

EID: 33646302339     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61440-0_127     Document Type: Conference Paper

References (14)

1. J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. On the consistency of Koomen's fair abstraction rule. Theoretical Computer Science, 51(1/2):129-176, 1987.
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(3):653-682, 1993.
3. O. Burkart, D. Caucal, and B. Steffen. An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes. In MFCS '95, volume 969 of Lecture Notes in Computer Science, pages 423-433. Springer-Verlag, 1995.
4. V. Bar-Hillel. Language and Information. Series in Logic. Addison-Wesley, 1964.
5. D.J.B. Bosscher and A. Ponse. Translating a Process Algebra with Symbolic Data Values to Linear Format. In Uffe H. Engberg, Kim G. Larsen, and Arne Skou, editors, Proceedings of the Workshop on Tools and Algorithms for the Construction and the Analysis of Systems, volume NS-95-2 of BRICS Notes Series, pages 119-130, 1995.
6. J.CM. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.
7. S. Christensen, H. Hüttel, and C. Stirling. Bisimulation is Decidable for all Context-free Processes. In W.R. Cleaveland, editor, Proceedings of CONCUR 92, volume 630 of Lecture Notes in Computer Science, pages 138-147. Springer-Verlag, 1992.
8. Y. Hirshfeld and F. Moller. Deciding Equivalences in Simple Process Algebras. In A. Ponse, M. de Rijke, and Y. Venema, editors, Modal Logic and Process Algebra, volume 53 of CSLI Lecture Notes, pages 151-169. CSLI Publications, Stanford, 1995.
9. Y. Hirshfeld and F. Moller. Decidability Results in Automata and Process Theory. In Logics for Concurrency: Automata vs Structure, Springer Lecture Notes in Computer Science, 1996. To appear. Previously presented as lecture notes at the VIII-th Banff Higher Order Workshop "Theories of Concurrency: Structure vs Automata " in 1994.
10. Uno Holmer. Translating Static CCS Agents into Regular Form. PMG report 51, Department of Computer Science, Chalmers University of Technology and the University of Göteborg, 1989.
11. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.
12. A. Krucera. Deciding Regularity in Process Algebras. Technical Report RS-95-52, BRICS (Basic Research in Computer Science, Centre of the Danish National Research Foundation), 1995.
13. S. Mauw and H. Mulder. Regularity of BPA-Systems is Decidable. In Bengt Jonsson and Joachim Parrow, editors, CONCUR'94: Concurrency Theory, volume 836 of Lecture Notes in Computer Science, pages 34-47. Springer-Verlag, 1994.
14. E.L. Post. A variant of a recursively unsolvable problem. Bulletin of the American Mathematical Society, 52:264-268, 1946.