Axiomatizations for the perpetual loop in process Algebra

Wan Fokkink*

*Corresponding author for this work

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

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.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 24th International Colloquium, ICALP 1997, Proceedings
EditorsPierpaolo Degano, Roberto Gorrieri, Alberto Marchetti-Spaccamela
PublisherSpringer - Verlag
Pages571-581
Number of pages11
ISBN (Print)3540631658, 9783540631651
Publication statusPublished - 1 Jan 1997
Event24th International Colloquium on Automata, Languages and Programming, ICALP 1997 - Bologna, Italy
Duration: 7 Jul 199711 Jul 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1256
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference24th International Colloquium on Automata, Languages and Programming, ICALP 1997
CountryItaly
CityBologna
Period7/07/9711/07/97

    Fingerprint

Cite this

Fokkink, W. (1997). Axiomatizations for the perpetual loop in process Algebra. In P. Degano, R. Gorrieri, & A. Marchetti-Spaccamela (Eds.), Automata, Languages and Programming - 24th International Colloquium, ICALP 1997, Proceedings (pp. 571-581). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1256). Springer - Verlag.