Abstract
Mimer proposed an axiomatizatkm for the Kleene star in basic process algebra, in the presence of deadlock and empty process, modulo bisimulation equivalence. In this paper, Milner’s axioms are adapted to no-exit iteration xw, which executes x infinitely many times in a row, and it is shown that this axio-matization is complete for no-exit iteration in basic process algebra with deadlock and empty process, modulo bisimulation.
Cite
CITATION STYLE
Fokkink, W. (1997). Axiomatizations for the perpetual loop in process Algebra. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1256, pp. 571–581). Springer Verlag. https://doi.org/10.1007/3-540-63165-8_212
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
