A complete equational axiomatization for MPA with string iteration

Theoretical Computer Science

Volumn 211, Issue 1-2, 1999, Pages 339-374

  Aceto, Luca ^a   Groote, Jan Friso ^b  

^a AALBORG UNIVERSITY   (Denmark)

^b CWI   (Netherlands)

Author keywords

Bisimulation equivalence; Equational logic; Kleene star; Minimal process algebra; String iteration

Indexed keywords

EID: 0002794431     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00182-5     Document Type: Article

References (35)

1. L. Aceto, W.J. Fokkink, An equational axiomatization for multi-exit iteration, Research Report RS-96-22, BRICS (Basic Research in Computer Science, Centre of the Danish National Research Foundation), Department of Computer Science, Aalborg University, June 1996, p. 30. To appear in Inform. and Comput. Available by anonymous ftp at the address ftp.brics.aau.dk in the directory pub/BRICS/RS/96/22.
2. L. Aceto, W.J. Fokkink, A. Ingólfsdóttir, A menagerie of non-finitely based process semantics over BPA*: from ready simulation to completed traces, Research Report RS-96-23, BRICS (Basic Research in Computer Science, Centre of the Danish National Research Foundation), Department of Computer Science, Aalborg University, July 1996. To appear in Math. Struct. Comput. Sci. Available by anonymous ftp at the address ftp.brics.aau.dk in the directory pub/BRICS/RS/96/23.
3. L. Aceto, W.J. Fokkink, R. van Glabbeek, A. Ingólfsdóttir, Axiomatizing prefix iteration with silent steps. Inform. and Comput. 127 (1996) 26-40.
4. L. Aceto, A. Ingólfsdóttir, An equational axiomatization of observation congruence for prefix iteration, in: Algebraic Methodology and Software Technology: 5th Internat. Conf., AMAST '96, Munich, Germany, M. Wirsing, M. Nivat, (Eds), Lecture Notes in Computer Science, vol. 1101, Springer, Berlin, 1996, pp. 195-209. Full version available as BRICS Report RS-95-5, January 1995.
5. D. Austry, G. Boudol, Algèbre de processus et synchronisations, Theoret. Comput. Sci. 30 (1984) 91-131.
6. J. Baeten, J. Bergstra, J. Klop, Decidability of bisimulation equivalence for processes generating context-free languages, J. Assoc. Comput. Mach. 40 (1993) 653-682.
7. J. Baeten, W. Weijland, Process Algebra, Cambridge Tracts in Theoretical Computer Science, vol. 18, Cambridge University Press, Cambridge, 1990.
8. J. Bergstra, I. Bethke, A. Ponse, Process algebra with iteration. Report CS-R9314, Programming Research Group, University of Amsterdam, 1993. Available by anonymous ftp at the address fwi.uva.nl as file pub/programming-research/reports/1993/P9314.ps.Z.
9. J. Bergstra, I. Bethke, A. Ponse, Process algebra with iteration and nesting, Comput. J. 37 (1994) 243-258.
10. J. Bergstra, J. Klop, Fixed point semantics in process algebras, Report IW 206, Mathematisch Centrum, Amsterdam, 1982.
11. I. Copi, C. Elgot, J. Wright, Realization of events by logical nets, J. Assoc. Comput. Mach. 5 (1958) 181-196.
12. F. Corradini, R. De Nicola, A. Labella, Fully abstract models for nondeterministic Kleene algebras (extended abstract), in: I. Lee, S. Smolka, (Eds.), Proc. CONCUR 94, Philadelphia, PA, USA, of Lecture Notes in Computer Science, vol. 962, Springer, Berlin, 1995, pp. 130-144.
13. R. De Nicola, A. Labella, A completeness theorem for nondeterministic Kleene algebras, in: Proc. MFCS '94, Lecture Notes in Computer Science, vol. 841, Springer, Berlin, 1994, pp. 536-545.
14. J. Engelfriet, Determinacy → (observation equivalence = trace equivalence), Theoret. Comput. Sci. 36 (1985) 21-25.
15. W.J. Fokkink, A complete equational axiomatization for prefix iteration, Inform. Process. Lett. 52 (1994) 333-337.
16. W.J. Fokkink, A complete axiomatization for prefix iteration in branching bisimulation, Fund. Informa. 26 (1996) 103-113.
17. W.J. Fokkink, Axiomatizations for the perpetual loop in process algebra, 1997, Proc. 24th Internat. Colloquium on Automata, Languages and Programming (ICALP '97), Lecture Notes in Computer Science, Springer, Berlin, to appear.
18. W. J. Fokkink, H. Zantema, Basic process algebra with iteration: Completeness of its equational axioms, Comput. J. 37 (1994) pp. 259-267.
19. W.J. Fokkink, H. Zantema, Termination modulo equations by abstract commutation with an application to iteration, Theoret. Comput. Sci. 177 (1997) 407-423.
20. R.J.v. Glabbeck, The linear time-branching time spectrum, in: J. Baeten, J. Klop (Eds.), Proc. CONCUR 90, Amsterdam, of Lecture Notes in Computer Science, vol. 458, Springer, Berlin, 1990, pp. 278-297.
21. J.F. Groote, F. Vaandrager, Structured operational semantics and bisimulation as a congruence, Inform. and Comput. 100 (1992) 202-260.
22. M. Hennessy, A term model for synchronous processes, Inform, and Control 51 (1981) 58-75.
23. M. Hennessy, Algebraic Theory of Processes, MIT Press, Cambridge, MA, 1988.
24. C. Hoare, Communicating Sequential Processes, Prentice-Hall, Englewood Cliffs, NJ, 1985.
25. R. Keller, Formal verification of parallel programs, Comm. ACM 19 (1976) 371-384.
26. S. Kleene, Representation of events in nerve nets and finite automata, in: C. Shannon, J. McCarthy (Eds.), Automata Studies, Princeton University Press, Princeton, NJ, 1956, pp. 3-41.
27. C. Koymans, J. Vrancken, Extending process algebra with the empty process ε, Logic Group Preprint Series Nr. 1, CIF, State University of Utrecht, 1985.
28. L. Lamport, How to write a proof, Research Report 94, Digital Equipment Corporation, Systems Research Center, 1993.
29. M. Lothaire. Combinatorics on Words, in: Gian-Carlo Rota (Ed.), Encyclopedia of Mathematics and its Applications, vol. 17, Addison-Wesley, Reading, MA, 1983.
30. R. Milner, Calculi for synchrony and asynchrony, Theoret. Comput. Sci. 25 (1983) 267-310.
31. R. Milner, A complete inference system for a class of regular behaviours, J. Comput. System Sci. 28 (1984) 439-466.
32. R. Milner, Communication and Concurrency, Prentice-Hall, Englewood Cliffs, NJ, 1989.
33. D. Park, Concurrency and automata on infinite sequences, in: 5th GI Conf., Karlsruhe, Germany, P. Deussen, (Ed)., Lecture Notes in Computer Science, vol. 104, Springer, Berlin, 1981, pp. 167-183.
34. G. Plotkin, A structural approach to operational semantics, Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
35. P.M. Sewell, Bisimulation is not finitely (first order) equationally axiomatisable, in: Proc. 9th Annual Symp. on Logic in Computer Science., Paris, France, IEEE Computer Soc. Press, Silver Spring, MD, 1994, pp. 62-70.