Computable processes and bisimulation equivalence

Formal Aspects of Computing

Volumn 8, Issue 6, 1996, Pages 648-678

  Ponse, Alban ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

ACP; Bisimulation equivalence; regular process; Computability; Labelled transition system; Process algebra; CRL

Indexed keywords

EID: 0000939304     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01213493     Document Type: Article

References (37)

1. Austry, D. and Boudol, G.: Algèbre de processus et synchronisations. Theoretical Computer Science, 30(1):91-131, 1984.
2. Baeten, J.C.M. and Bergstra, J.A.: Process algebra with signals and conditions. In M. Broy, editor. Programming and Mathematical Methods, Proceedings Summer School Marktoberdorf 1991, pages 273-323. Springer-Verlag, 1992. NATO ASI Series F88.
3. Baeten, J.C.M., Bergstra, J.A. and Klop, J.W.: On the consistency of Koomen's fair abstraction rule. Theoretical Computer Science, 51(1/2):129-176, 1987.
4. Bergstra, J.A : 1991. Personal Communications.
5. Bezem, M.A. and Groote, J.F.: Invariants in process algebra with data. In [JoP94], pages 401-416, 1994.
6. Bosscher, D.J.B. and Griffioen, W.O.D.: Regularity for a class of context-free processes is decidable. In proceedings of ICALP'96, to appear.
7. Bergstra, J.A. and Klop, J.W.: Process algebra for synchronous communication. Information and Computation, 60(1/3):109-137, 1984.
8. Bergstra, J.A. and Klop, J.W.: Algebra of communicating processes with abstraction. Theoretical Computer Science, 37(1):77-121, 1985.
9. Baeten, J.C.M. and Verhoef, C.: Concrete process algebra. In S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, Volume IV, Syntactical Methods, pages 149-268. Oxford University Press, 1995.
10. Baeten, J.C.M. and Weijland, W.P.: Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.
11. [CCI87] CCITT Working Party X/1. Recommendation 2.100 (SDL), 1987.
12. Darondeau, Ph.: Concurrency and computability. In I. Guessarian, editor, Semantics of Systems of Concurrent Processes, Proceedings LITP Spring School on Theoretical Computer Science, La Roche Posay, France, LNCS 469, pages 223-238. Springer-Verlag, 1990.
13. Darondeau, Ph.: Recursive graphs are not stable under maximal reduction. Bulletin of the European Association for Theoretical Computer Science, 44:186-189, 1991.
14. Davis, M.: Computability and Unsolvability. Dover Publications, Inc., 1982.
15. van Glabbeek, R.J.: On the expressiveness of ACP (extended abstract). In [PVV95], pages 188-217, 1995.
16. Groote, J.F. and Ponse, A.: The syntax and semantics of μCRL. Report CS-R9076, CWI, Amsterdam, 1990.
17. rd Workshop on Concurrency and Compositionality. Goslar, GMD-Studien Nr. 191, pages 125-130. Universität Hildesheim, 1991.
18. Groote, J F. and Ponse, A.: Proof theory for μCRL. Report CS-R9138, CWI, 1991.
19. Groote, J.F. and Ponse, A.: Proof theory for μCRL: a language for processes with data. In D.J. Andrews, J.F. Groote, and C.A. Middelburg, editors, Proceedings of the International Workshop on Semantics of Specification Languages, pages 232-251. Workshops in Computing, Springer-Verlag, 1994.
20. Groote, J.F. and Ponse, A.: The syntax and semantics of μCRL. In [PVV95], pages 26-62, 1995. (Appeared earlier as [GrP90].)
21. Groote, J.F. and Vaandrager, F.W.: Structured operational semantics and bisimulation as a congruence. Information and Computation, 100(2):202-260, 1992.
22. Hoare, C.A.R., Hayes, I.J., Jifeng, He., Morgan, C.C., Roscoe, A.W., Sanders, J.W., Sorensen, I.H., Spivev, J.M. and Sufrin, B.A.: Laws of programming. Communications of the ACM, 30(8):672-686, August 1987.
23. Hopcroft, J.E. and Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.
24. ISO. Information processing systems - open systems interconnection - LOTOS - a formal description technique based on the temporal ordering of observational behaviour ISO/TC97/SC21/N DIS8807, 1987.
25. Jonsson, B. and Parrow, J.: editors, Proceedings CONCUR 94, Uppsala, Sweden, LNCS 836. Springer-Verlag, 1994.
26. Kleene, S.C.: Introduction to Meta Mathematics. North-Holland, 1952.
27. Milner, R.: Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267-310, 1983.
28. Milner, R.: Communication and Concurrency. Prentice-Hall International, Englewood Cliffs, 1989.
29. Mauw, S. and Mulder, H.: Regularity of BPA-systems is decidable. In [JoP94], pages 34-47, 1994.
30. Mauw, S. and Veltink, G.J.: A process specification formalism. Fundamenta Informaticae, XIII:85-139, 1990.
31. Mauw, S. and Veltink, GJ.: editors, Algebraic Specification of Communication Protocols. Cambridge Tracts in Theoretical Computer Science 36. Cambridge University Press, 1993.
32. th GI Conference, LNCS 104, pages 167-183. Springer-Verlag, 1981.
33. Plotkin, G.D.: A structural approach to operational semantics. Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
34. Ponse, A., Verhoef, C. and van Vlijmen, S.F.M.: editors, Algebra of Communicating Processes, Utrecht 1994. "Workshops in Computing, Springer-Verlag, 1995.
35. Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill Book Co., 1967.
36. de Simone, R.: Higher-level synchronising devices in MEUE-SCCS. Theoretical Computer Science, 37:245-267, 1985.
37. Vaandrager, F.W.: Expressiveness results for process algebras. In J.W. de Bakker, W.P. de Roever, and G. Rozenberg, editors. Proceedings REX Workshop on Semantics: Foundations and Applications, Beekbergen, The Netherlands, June 1992, LNCS 666, pages 609-638. Springer-Verlag, 1993.