A taxonomy of infinite state processes

Electronic Notes in Theoretical Computer Science

Volumn 18, Issue , 1998, Pages 3-22

  Moller, Faron ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

BASIC PROCESS ALGEBRA (BPA); BISIMULATIONS; GREIBACH NORMAL FORM (GNF); REWRITE TRANSITION SYSTEM;

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PETRI NETS; PROBLEM SOLVING; RANDOM PROCESSES;

CONTEXT FREE GRAMMARS;

EID: 18944366857     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80246-4     Document Type: Conference Paper

References (48)

1. J.C.M. Baeten, J.A. Bergstra and J.W. Klop (1987). Decidability of bisimulation equivalence for processes generating context-free languages. Proceedings of PARLE'87, Lecture Notes in Computer Science 259:94-113.
2. Baeten, J.A. Bergstra J.C.M., Klop J.W.. Decidability of bisimulation equivalence for processes generating context-free languages. Journal of the A CM. 40:1993;653-682
3. Bar-Hillel, M. Perles Y., Shamir E.. On formal properties of simple phrase structure grammars. Zeitschrift für Phonetik, Sprachwissenschaft, und Kommunikationsforschung. 14:1961;143-177
4. Bergstra J.A., Klop J.W.. Algebra of Communicating Processes with Abstraction. Theoretical Computer Science. 37:1985;77-121
5. O. Burkart, D. Caucal and B. Steffen (1995). An elementary decision procedure for arbitrary context-free processes. Proceedings of MFCS'95. Lecture Notes in Computer Science 969:423-433.
6. O. Burkart and Javier Esparza (1997). More infinite results. Proceedings of Infinity'97. Electronic Notes in Theoretical Computer Science 5.
7. Caucal D.. Graphes canoniques des graphes algebriques. Informatique Théorique et Applications (RAIRO). 24:(4):1990;339-352
8. Caucal D.. On the regular structure of prefix rewriting. Journal of Theoretical Computer Science. 106:1992;61-86
9. Caucal D.. A fast algorithm to decide on the equivalence of stateless DPDA. Informatique Théorique et Applications (RAIRO). 27:(1):1993;23-48
10. S. Christensen (1993). Decidability and Decomposition in Process Algebras. Ph.D. Thesis ECS-LFCS-93-278, Department of Computer Science, University of Edinburgh.
11. S. Christensen, Y. Hirshfeld and F. Moller (1993). Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes. Proceedings of LICS'93:386-396.
12. S. Christensen, Y. Hirshfeld and F. Moller (1993). Bisimulation equivalence is decidable for basic parallel processes. Proceedings of CONCUR'93, Lecture Notes in Computer Science 715:143-157.
13. S. Christensen, H. Hüttel and C. Stirling (1992). Bisimulation equivalence is decidable for all context-free processes. Proceedings of CONCUR'92, Lecture Notes in Computer Science 630:138-147.
14. Christensen S., Hüttel H., Stirling C.. Bisimulation equivalence is decidable for all context-free processes. Information and Computation. 121:(2):1995;143-148
15. R.J. van Glabbeek (1990). The linear time-branching time spectrum. Proceedings of CONCUR'90, Lecture Notes in Computer Science 458:278-297.
16. Groote J.F.. A short proof of the decidability of bisimulation for normed BPA processes. Information Processing Letters. 42:1991;167-171
17. Groote J.F., Hüttel H. Undecidable equivalences for basic process algebra. Information and Computation. 115:(2):1994;353-371
18. Dickson L.E.. Finiteness of the odd perfect and primitive abundant numbers with distinct factors. American Journal of Mathematics. 35:1913;413-422
19. Y. Hirshfeld (1993). Petri Nets and the Equivalence Problem. Proceedings of CSL'93, Lecture Notes in Computer Science 832:165-174.
20. Y. Hirshfeld (1998). Unpublished.
21. Y. Hirshfeld, M. Jerrum and F. Moller (1994). A polynomial-time algorithm for deciding equivalence of normed context-free processes. Proceedings of FOCS'94:623-631.
22. Hirshfeld Y., Jerrum M., Moller F.. A polynomial algorithm for deciding bisimilarity of normed context-free processes. Theoretical Computer Science. 158:1996;143-159
23. Hirshfeld Y., Jerrum M., Moller F.. A polynomial algorithm for deciding bisimulation equivalence of normed basic parallel processes. Mathematical Structures in Computer Science. 6:1996;251-259
24. Y. Hirshfeld and F. Moller (1994). A fast algorithm for deciding bisimilarity of normed context-free processes. Proceedings of CONCUR'94, Lecture Notes in Computer Science 836:48-63.
25. H. Hüttel (1993). Undecidable equivalences for basic parallel processes. Proceedings of FSTTCS'93, Lecture Notes in Computer Science.
26. H. Hüttel and C. Stirling (1991). Actions speak louder than words: proving bisimilarity for context-free processes. Proceedings of LICS'91:376-386.
27. 2. Theoretical Computer Science. 123:1994;183-197
28. P. JanČar (1993). Decidability questions for bisimilarity of Petri nets and some related problems. Proceedings of STACS'94, Lecture Notes in Computer Science 775:581-592.
29. JanČar P.. Undecidability of bisimilarity for Petri nets and related problems. Theoretical Computer Science. 148:1995;281-301
30. P. JanČar and J. Esparza (1996). Deciding finiteness of Petri nets up to bisimulation. Proceedings of ICALP'96, Lecture Notes in Computer Science 1099:478-489.
31. P. JanČar, J. Esparza and F. Moller (1998). Petri nets and regular processes. Submitted.
32. P. JanČar and F. Moller (1995). Checking regular properties of Petri nets. Proceedings of CONCUR'95, Lecture Notes in Computer Science 962:348-362.
33. Kanellakis P.C., Smolka S.A. CCS expressions, finite-state processes and three problems of equivalence. Information and Computation. 86:1990;43-68
34. A. Korenjak and J. Hopcroft (1966). Simple deterministic languages. Proceedings of 7th IEEE Switching and Automata Theory conference:36-46.
35. Milner R. A Calculus of Communicating Systems. Lecture Notes in Computer Science. 92:1980
36. R. Milner (1989). Communication and Concurrency. Prentice-Hall.
37. Milner R., Moller F.. Unique decomposition of processes. Bulletin of the European Association for Theoretical Computer Science. 41:1990;226-232
38. Milner R., Moller F.. Unique decomposition of processes. Theoretical Computer Science. 107:1993;357-363
39. F. Moller (1996). Infinite results. Proceedings of CONCUR'96, Lecture Notes in Computer Science 1119:195-216.
40. Moore E.F. Gedanken experiments on sequential machines. Automata studies. 1956;129-153
41. Paige R., Tarjan R.E. Three partition refinement algorithms. SIAM Journal on Computing. 16:1987;937-989
42. Park D.M.R.. Concurrency and automata on infinite sequences. Lecture Notes in Computer Science. 104:1981;168-183
43. J.L. Peterson (1981). Petri Net Theory and the Modelling of Systems. Prentice-Hall.
44. G. Sénizergues (1997). The Equivalence Problem for Deterministic Pushdown Automata is Decidable. Proceedings of ICALP'97, Lecture Notes in Computer Science 1256:671-681.
45. G. Sénizergues (1997). L(A)=L(B)? Technical Report, LaBRI, Université Bordeaux I, report nr.1161-97.
46. C. Stirling (1995). Local model checking games. Proceedings of CONCUR'95, Lecture Notes in Computer Science 962:1-11.
47. C. Stirling (1996). Decidability of bisimulation equivalence for normed pushdown processes. Proceedings of CONCUR'96, Lecture Notes in Computer Science 1119:217-232.
48. Valk R., Vidal-Naquet G.. Petri nets and regular languages. Journal of Computer and System Sciences. 23:(3):1981;299-325