Axiomatizations for the perpetual loop in process Algebra

Wan Fokkink

Axiomatizations for the perpetual loop in process Algebra

^*Corresponding author for this work

Research output: Chapter in Book / Report / Conference proceeding › Conference contribution › Academic › peer-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 x^w, 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 language	English
Title of host publication	Automata, Languages and Programming - 24th International Colloquium, ICALP 1997, Proceedings
Editors	Pierpaolo Degano, Roberto Gorrieri, Alberto Marchetti-Spaccamela
Publisher	Springer - Verlag
Pages	571-581
Number of pages	11
ISBN (Print)	3540631658, 9783540631651
Publication status	Published - 1 Jan 1997
Event	24th International Colloquium on Automata, Languages and Programming, ICALP 1997 - Bologna, Italy Duration: 7 Jul 1997 → 11 Jul 1997

Publication series

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

Conference

Conference	24th International Colloquium on Automata, Languages and Programming, ICALP 1997
Country/Territory	Italy
City	Bologna
Period	7/07/97 → 11/07/97

Persistent URL (handle)

Persistent link

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.

Fokkink, Wan. / Axiomatizations for the perpetual loop in process Algebra. Automata, Languages and Programming - 24th International Colloquium, ICALP 1997, Proceedings. editor / Pierpaolo Degano ; Roberto Gorrieri ; Alberto Marchetti-Spaccamela. Springer - Verlag, 1997. pp. 571-581 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{748d37a1bd6a45e797659ea76d48dea6,

title = "Axiomatizations for the perpetual loop in process Algebra",

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{\textquoteright}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.",

author = "Wan Fokkink",

year = "1997",

month = jan,

day = "1",

language = "English",

isbn = "3540631658",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer - Verlag",

pages = "571--581",

editor = "Pierpaolo Degano and Roberto Gorrieri and Alberto Marchetti-Spaccamela",

booktitle = "Automata, Languages and Programming - 24th International Colloquium, ICALP 1997, Proceedings",

note = "24th International Colloquium on Automata, Languages and Programming, ICALP 1997 ; Conference date: 07-07-1997 Through 11-07-1997",

}

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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1256, Springer - Verlag, pp. 571-581, 24th International Colloquium on Automata, Languages and Programming, ICALP 1997, Bologna, Italy, 7/07/97.

Axiomatizations for the perpetual loop in process Algebra. / Fokkink, Wan.
Automata, Languages and Programming - 24th International Colloquium, ICALP 1997, Proceedings. ed. / Pierpaolo Degano; Roberto Gorrieri; Alberto Marchetti-Spaccamela. Springer - Verlag, 1997. p. 571-581 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1256).

Research output: Chapter in Book / Report / Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Axiomatizations for the perpetual loop in process Algebra

AU - Fokkink, Wan

PY - 1997/1/1

Y1 - 1997/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84951205573&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84951205573&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84951205573

SN - 3540631658

SN - 9783540631651

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 571

EP - 581

BT - Automata, Languages and Programming - 24th International Colloquium, ICALP 1997, Proceedings

A2 - Degano, Pierpaolo

A2 - Gorrieri, Roberto

A2 - Marchetti-Spaccamela, Alberto

PB - Springer - Verlag

T2 - 24th International Colloquium on Automata, Languages and Programming, ICALP 1997

Y2 - 7 July 1997 through 11 July 1997

ER -

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

Axiomatizations for the perpetual loop in process Algebra

Abstract

Publication series

Conference

Persistent URL (handle)

Other files and links

Fingerprint

Cite this