On finite representations of infinite-state behaviours

Information Processing Letters

Volumn 70, Issue 1, 1999, Pages 23-30

  Kučera, Antonín ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

VAN GLABBEEK'S HIERARCHY;

FINITE AUTOMATA;

EID: 0033574358     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(99)00029-0     Document Type: Article

References (20)

1. J.C.M. Baeten, J.A. Bergstra, J.W. Klop, Decidability of bisimulation equivalence for processes generating context-free languages, J. ACM 40 (1993) 653-682.
2. J.C.M. Baeten, W.P. Weijland, Process Algebra, Cambridge Tracts in Theoret. Comput. Sci., No. 18, Cambridge University Press, Cambridge, 1990.
3. D.J.B. Bosscher, W.O.D. Griffionen, Regularity for a large class of context-free processes is decidable, in: Proc. ICALP'96, Lecture Notes in Computer Sci., Vol. 1099, Springer, Berlin, 1996, pp. 182-192.
4. O. Burkart, D. Caucal, B. Steffen, Bisimulation collapse and the process taxonomy, in: Proc. CONCUR'96, Lecture Notes in Computer Sci., Vol. 1119, Springer, Berlin, 1996, pp. 247-262.
5. I. Černá, M. Křetínský, A. Kučera, Bisimilarity is decidable in the union of normed BPA and normed BPP processes, Electron. Notes in Theoret. Comput. Sci. 5 (1997).
6. S. Christensen, Decidability and decomposition in process algebras, Ph.D. Thesis, The University of Edinburgh, 1993.
7. Y. Hirshfeld, M. Jerrum, F. Moller, A polynomial algorithm for deciding bisimilarity of normed context-free processes, Theoret. Comput. Sci. 158 (1996) 143-159.
8. Y. Hirshfeld, M. Jerrum, F. Moller, A polynomial algorithm for deciding bisimulation equivalence of normed basic parallel processes, Math. Structures Comput. Sci. 6 (1996) 251-259.
9. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979.
10. P. Jančar, Bisimulation equivalence is decidable for one-counter processes, in: Proc. ICALP'97, Lecture Notes in Computer Sci., Vol. 1256, Springer, Berlin, 1997, pp. 549-559.
11. P. Jančar, J. Esparza, Deciding finiteness of Petri nets up to bisimilarity, in: Proc. ICALP'96, Lecture Notes in Computer Sci., Vol. 1099, Springer, Berlin, 1996, pp. 478-489.
12. A. Kučera, Regularity is decidable for normed PA processes in polynomial time, in: Proc. FST&TCS'96, Lecture Notes in Computer Sci., Vol. 1180, Springer, Berlin, 1996, pp. 111-122.
13. A. Kučera, How to parallelize sequential processes, in: Proc. CONCUR'97, Lecture Notes in Computer Sci., Vol. 1243, Springer, Berlin, 1997, pp. 302-316.
14. S. Mauw, H. Mulder, Regularity of BPA-systems is decidable, in: Proc. CONCUR'94, Lecture Notes in Computer Sci., Vol. 836, Springer, Berlin, 1994, pp. 34-47.
15. R. Milner, Communication and Concurrency, Prentice-Hall, Englewood Cliffs, NJ, 1989.
16. J.L. Peterson, Petri Net Theory and the Modelling of Systems, Prentice-Hall, Englewood Cliffs, NJ, 1981.
17. W. Reisig, Petri Nets - An Introduction, Springer, Berlin, 1985.
18. C. Stirling, Decidability of bisimulation equivalence for normed pushdown processes, in: Proc. CONCUR'96, Lecture Notes in Computer Sci., Vol. 1119, Springer, Berlin, 1996, pp. 217-232.
19. R.J. van Glabbeek, The linear time - branching time spectrum, in: Proc. CONCUR'90, Lecture Notes in Computer Sci., Vol. 458, Springer, Berlin, 1990, pp. 278-297.
20. R.J. van Glabbeek, W.P. Weijland, Branching time and abstraction in bisimulation semantics, Inform. Process. 89 (1989) 613-618.