On the decidability of non-interleaving process equivalences

Fundamenta Informaticae

Volumn 30, Issue 1, 1997, Pages 11-30

  Kiehn, Astrid ^a   Hennessy, Matthew ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

Decidability; Non interleaving semantics; Observation equivalence; Process algebra

Indexed keywords

ALGEBRA; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL LINGUISTICS; DECISION THEORY; MATHEMATICAL OPERATORS; PARALLEL PROCESSING SYSTEMS;

BASIC PARALLEL PROCESSES (BPP); PROCESS ALGEBRA;

EQUIVALENCE CLASSES;

EID: 0031118665     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1997-30102     Document Type: Article

References (24)

1. L. Aceto and M. Hennessy. Towards action refinement in process algebra. Information and Computation, 103(2):204-269, 1993.
2. G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. A theory of processes with localities. In Proceedings of CONCUR 92, number 630 in Lecture Notes in Computer Science, 1992.
3. G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. Observing localities. Theoretical Computer Science, (114):31-61, 1993.
4. I. Castellani and M. Hennessy. Distributed bisimulations. Report 5/87, University of Sussex, 1987. Also in JACM 1989.
5. S. Christensen, Y. Hirshfeld, and F. Moller. Bisimulation equivalence is decidable for all basic parallel processes. In E. Best, editor, Proceedings of CONCUR 93, number 715 in Lecture Notes in Computer Science, pages 143-157. Springer-Verlag, 1993.
6. S. Christensen, Y. Hirshfeld, and F. Moller. Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes. In E. Best, editor, Proceedings of LICS 93. IEEE Computer society Press, 1993.
7. S. Christensen. Distributed bisimilarity is decidable for a class of infinite-state systems. In Proceedings of CONCUR 92, number 630 in Lecture Notes in Computer Science. Springer-Verlag, 1992.
8. S. Christensen. Decidability and Decomposition in Process Algebras. Ph.d. thesis, University of Edinburgh, 1993.
9. S. Christensen, H. Hüttel, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. In Proceedings of CONCUR 92, number 630 in Lecture Notes in Computer Science, pages 138-147. Springer-Verlag, 1992.
10. th International Symposium on Protocol Specification, Testing and Verification, North Holland, 1989.
11. P. Darondeau and P. Degano. Causal trees. In Proceedings of ICALP 89, number 372 in Lecture Notes in Computer Science, pages 234-248, 1989.
12. P. Darondeau and P. Degano. Causal trees, interleaving + causality. In I. Guessarian, editor, Semantics of Systems of Concurrent Processes, number 469 in Lecture Notes in Computer Science, pages 239-255, 1990.
13. L. E. Dickson. Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. American Journal of Mathematics, 35:413-422, 1913.
14. P. Degano, R. De Nicola, and U. Montanari. Partial ordering descriptions and observations of nondeterministic concurrent processes. In Proceedings REX School/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, number 354 in Lecture Notes in Computer Science, pages 438-466, 1989.
15. U. Goltz. On representing CCS programs by finite Petri nets. In M. P. Chytil et al., editor, Prooceedings of MFCS 88, number 324 in Lecture Notes in Computer Science, pages 339-350. Springer-Verlag, 1988.
16. A. Kiehn and M. Hennessy. On the decidability of non-interleaving process equivalences. Number 836 in Lecture Notes in Computer Science, pages 18-33. Springer-Verlag, 1994.
17. A. Kiehn. Comparing locality and causality based equivalences. Acta Informatica, 31:697-718, 1994.
18. M. Lothaire. Combinatorics on Words. Addison-Wesley Publishing Company, 1983.
19. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
20. R. De Simone and D. Vergamimi. Aboard auto. Report RT111, INRIA, 1989.
21. D.A. Taubner. Finite Representations of CCS and TCSP Programs by Automata and Petri nets. Number 369 in Lecture Notes in Computer Science. Springer-Verlag, 1989.
22. R.J. van Glabbeek and F.W. Vaandrager. Petri net models for algebraic theories of concurrency. In J.W. de Bakker, A.J. Nijman, and P.C. Treleaven, editors, Prooceedings PARLE conference, number 259 in Lecture Notes in Computer Science, pages 224-242. Springer-Verlag, 1987.
23. R. Valk and M. Jantzen. The residue of vector sets wit applications to decidability problems in Petri nets. Acta Informatica, (21):643-674, 1985.
24. W. Vogler. Modular Construction and Partial Order Semantics of Petri nets. Number 625 in Lecture Notes in Computer Science. Springer-Verlag, 1992.