Polarized Process Algebra and Program Equivalence
The basic polarized process algebra is completed yielding as a projective limit a cpo which also comprises infinite processes. It is shown that this model serves in a natural way as a semantics for several program algebras. In particular, the fully abstract model of the program algebra axioms of  is considered which results by working modulo behavioral congruence. This algebra is extended with a new basic instruction, named ‘entry instruction’ and denoted with ‘@’. Addition of @ allows many more equations and conditional equations to be stated. It becomes possible to find an axiomatization of program inequality. Technically this axiomatization is an infinite final algebra specification using conditional equations and auxiliary objects.
KeywordsInduction Hypothesis Canonical Form Basic Instruction Program Equivalence Process Algebra
Unable to display preview. Download preview PDF.
- 5.I. Bethke. Completion of equational specifications. In Terese, editors, Term Rewriting Systems, Cambridge Tracts in Theoretical Computer Science 55, pages 260–300, Cambridge University Press, 2003.Google Scholar
- 8.W.J. Fokkink. Axiomatizations for the perpetual loop in process algebra. In P. Degano, R. Gorrieri, and A. Machetti-Spaccamela, editors, Proceedings of the 24-th ICALP, ICALP’97, Lecture Notes in Comp. Sci. 1256, pages 571–581. Springer Berlin, 1997.Google Scholar
- 11.V. Stoltenberg-Hansen, I. Lindström, and E.R. Griffor. Mathematical Theory of Domains, Cambridge Tracts in Theoretical Computer Science 22, Cambridge University Press, 1994.Google Scholar