Abstract
Fokkink ((1994) Inf. Process. Lett. 52: 333–337) has recently proposed a complete equational axiomatization of strong bisimulation equivalence for MPA *δ (Aτ), i.e., the language obtained by extending Milner's basic CCS with prefix iteration. Prefix iteration is a variation on the original binary version of the Kleene star operation p * q obtained by restricting the first argument to be an atomic action. In this paper, we extend Fokkink's results to a setting with the unobservable action τ by giving a complete equational axiomatization of Milner's observation congruence over MPA *δ (Aτ). The axiomatization is obtained by extending Fokkink's axiom system with two of Milner's standard τ-laws, and three equations that describe the interplay between the silent nature of τ and prefix iteration. Using a technique due to Groote, we also show that the resulting axiomatization is ω-complete, i.e., complete for equality of open terms.
On leave from the School of Cognitive and Computing Sciences, University of Sussex, Brighton BN1 9QH, UK. Partially supported by HCM project Express.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
L. Aceto, W. Fokkink, R. van Glabbeek, and A. Ingólfsdóttir, Axiomatizing prefix iteration with silent steps, Research Report RS-95-56, BRICS (Basic Research in Computer Science, Centre of the Danish National Research Foundation), Department of Mathematics and Computer Science, Aalborg University, November 1995. To appear in Information and Computation. Available by anonymous ftp at the address ftp.brics.aau.dk in the directory pub/BRICS/RS/95/56.
L. Aceto and A. Ingólfsdóttir, A complete equational axiomatization for prefix iteration with silent steps, Research Report RS-95-5, BRICS (Basic Research in Computer Science, Centre of the Danish National Research Foundation), Department of Mathematics and Computer Science, Aalborg University, Jan. 1995. Available by anonymous ftp at the address ftp.brics.aau.dk in the directory pub/BRICS/RS/95/5.
J. Bergstra, I. Bethke, and A. Ponse, Process algebra with iteration and nesting, Computer Journal, 37 (1994), pp. 243–258.
J. Bergstra and J. Klop, Process algebra for synchronous communication, Information and Computation, 60 (1984), pp. 109–137.
F. Corradini, R. De Nicola, and A. Labella, Fully abstract models for nondeterministic Kleene algebras (extended abstract), in Proceedings CONCUR 94, Philadelphia, PA, USA, I. Lee and S. Smolka, eds., vol. 962 of Lecture Notes in Computer Science, Springer-Verlag, 1995, pp. 130–144.
R. De Nicola and A. Labella, A completeness theorem for nondeterministic Kleene algebras, in Proceedings of MFCS '94, vol. 841 of Lecture Notes in Computer Science, Springer-Verlag, 1994.
W. Fokkink, A complete equational axiomatization for prefix iteration, Inf. Process. Lett., 52 (1994), pp. 333–337.
-, A complete axiomatization for prefix iteration in branching bisimulation, Logic Group Preprint Series 126, Dept. of Philosophy, Utrecht University, Jan. 1995. To appear in Fundamenta Informaticae. Available by anonymous ftp from phil.ruu.nl as logic/PREPRINTS/preprint126.ps.
-, On the completeness of the equations for the Kleene star in bisimulation, 1996. In this volume. A full version of the paper is available by anonymous ftp from phil.ruu.nl as logic/PREPRINTS/preprint141.ps.
W. Fokkink and H. Zantema, Basic process algebra with iteration: Completeness of its equational axioms, Computer Journal, 37 (1994), pp. 259–267.
J.F. Groote, A new strategy for proving ω-completeness with applications in process algebra, in Proceedings CONCUR 90, Amsterdam, J. Baeten and J. Klop, eds., vol. 458 of Lecture Notes in Computer Science, Springer-Verlag, 1990, pp. 314–331.
M. Hennessy, A term model for synchronous processes, Information and Control, 51 (1981), pp. 58–75.
S. Kleene, Representation of events in nerve nets and finite automata, in Automata Studies, C. Shannon and J. McCarthy, eds., Princeton University Press, 1956, pp. 3–41.
L. Lamport, How to write a proof, Research Report 94, Digital Equipment Corporation, Systems Research Center, Feb. 1993.
R. Milner, Communication and Concurrency, Prentice-Hall International, Englewood Cliffs, 1989.
D. Park, Concurrency and automata on infinite sequences, in 5th GI Conference, Karlsruhe, Germany, P. Deussen, ed., vol. 104 of Lecture Notes in Computer Science, Springer-Verlag, 1981, pp. 167–183.
G. Plotkin, A structural approach to operational semantics, Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
P. Sewell, Bisimulation is not finitely (first order) equationally axiomatisable, in Proceedings 9th Annual Symposium on Logic in Computer Science, Paris, France, IEEE Computer Society Press, 1994, pp. 62–70.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aceto, L., Ingólfsdóttir, A. (1996). An equational axiomatization of observation congruence for prefix iteration. In: Wirsing, M., Nivat, M. (eds) Algebraic Methodology and Software Technology. AMAST 1996. Lecture Notes in Computer Science, vol 1101. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014316
Download citation
DOI: https://doi.org/10.1007/BFb0014316
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61463-0
Online ISBN: 978-3-540-68595-1
eBook Packages: Springer Book Archive