An ω-Complete equational specification of interleaving

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

Volumn 1853, Issue , 2000, Pages 729-743

  Fokkink, W J ^a   Luttik, S P ^a,b  

^a CWI   (Netherlands)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

EQUATIONAL SPECIFICATIONS; PARALLEL COMPOSITION; PROCESS THEORY;

SPECIFICATIONS;

EID: 84974625258     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_61     Document Type: Conference Paper

References (14)

1. Aceto, L. and Hennessy, M. (1993). Towards action-refinement in process algebras. Information and Computation, 103(2), 204-269.
2. Baeten, J. C. M. and Weijland, W. P. (1990). Process Algebra. Number 18 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press.
3. Bergstra, J. A. and Klop, J. W. (1984). Process algebra for synchronous communication. Information and Control, 60(1-3), 109-137.
4. Castellani, I. and Hennessy, M. (1989). Distributed bisimulations. Journal of the ACM, 36(4), 887-911.
5. Groote, J. F. (1990). A new strategy for proving ω-completeness applied to process algebra. In J. Baeten and J. Klop, editors, Proceedings of CONCUR'90, volume 458 of LNCS, pages 314-331, Amsterdam. Springer-Verlag.
6. Heering, J. (1986). Partial evaluation and ω-completeness of algebraic specifications. Theoretical Computer Science, 43, 149-167.
7. Hennessy, M. (1988). Axiomatising finite concurrent processes. SIAM Journal of Computing, 17(5), 997-1017.
8. Hirshfeld, Y. and Jerrum, M. (1998). Bisimulation equivalence is decidable for normed process algebra. LFCS Report ECS-LFCS-98-386, University of Edinburgh.
9. Hirshfeld, Y. and Jerrum, M. (1999). Bisimulation equivalence is decidable for normed process algebra. In J. Wiedermann, P. van Emde Boas, and M. Nielsen, editors, Proceedings of ICALP'99, volume 1644 of LNCS, pages 412-421, Prague. Springer.
10. Lazrek, A., Lescanne, P., and Thiel, J.-J. (1990). Tools for proving inductive equalities, relative completeness, and ω-completeness. Information and Computation, 84(1), 47-70.
11. Milner, R. (1989). Communication and Concurrency. Prentice-Hall International, Englewood Cliffs.
12. Milner, R. and Moller, F. (1993). Unique decomposition of processes. Theoretical Computer Science, 107, 357-363.
13. Moller, F. (1989). Axioms for Concurrency. Ph.D. thesis, University of Edinburgh.
14. Moller, F. (1990). The importance of the left merge operator in process algebras. In M. Paterson, editor, Proceedings of ICALP'90, volume 443 of LNCS, pages 752-764, Warwick. Springer.