(Enter summary)
Abstract: We study equational axiomatizations of bisimulation equivalence for the language
obtained by extending Milner's basic CCS with string iteration. String iteration is a
variation on the original binary version of the Kleene star operation p
q obtained by
restricting the first argument to be a non-empty sequence of atomic actions. We show
that, for every positive integer k, bisimulation equivalence over the set of processes
in this language with loops of length at most k is finitely... (Update)
Context of citations to this paper: More
.... The research literature on process theory has recently witnessed a resurgence of interest in Kleene star like operations [6, 11, 9, 19, 8, 3, 10, 1, 2]. In [8] treebased models for theories involving Kleene s star operation [15] are studied. 6] investigates the...
.... shown by Sewell [20] On the other hand, there are extensions of action prefix iteration that still have finite axiomatizations, see e.g. [1, 15]. We can look at the combination of prefix iteration and renaming. Here, the axioms we have are definitely not complete, we need the...
Cited by: More
From Ready Simulation Semantics to Completed Tracs - Fokkink, Ingólfsdóttir (1996)
(Correct)
Axiomatizing Prefix Iteration with Silent Steps - Wan Fokkink Rob (1996)
(Correct)
An Equational Axiomatization for Multi-Exit Iteration - Aceto, Fokkink (1996)
(Correct)
Similar documents (at the sentence level):
38.9%: A Complete Equational Axiomatization for MPA with String.. - Aceto, Groote (1997)
(Correct)
Active bibliography (related documents): More All
1.1: A Complete Equational Axiomatization for Prefix.. - Aceto.. (1995)
(Correct)
0.6: A Menagerie of Non-Finitely Based Process.. - Aceto, Fokkink.. (1996)
(Correct)
0.6: Decorated Trace Semantics over BPA have no Finite.. - Aceto, Fokkink..
(Correct)
Similar documents based on text: More All
1.4: A Fully Abstract Denotional Model . . . - Ingolfsdottir, al.
(Correct)
1.3: 2-Nested Simulation is not Finitely Equationally.. - Aceto, Fokkink.. (2000)
(Correct)
1.2: A Communication Complexity Proof that Symmetric Functions.. - Brodal, Husfeldt (1996)
(Correct)
Related documents from co-citation: More All
7: Representation of Events in Nerve Nets and Finite Automata (context) - Kleene - 1956
7: Basic process algebra with iteration: completeness of its equational axioms
- Fokkink, Zantema - 1994
7: Bisimulation is not finitely (context) - Sewell - 1994
BibTeX entry: (Update)
L. Aceto and J.F. Groote. A complete equational axiomatization for MPA with string iteration. Report RS-95-28, BRICS, Aalborg University, 1995. Available via ftp at brics.aau.dk in the directory pub/BRICS/RS/95/28. http://citeseer.ist.psu.edu/article/aceto95complete.html More
@incollection{ aceto97complete,
author = "Luca Aceto and Jan Friso Groote",
title = "A complete equational axiomatization for {MPA} with string iteration",
booktitle = "169",
month = "30",
publisher = "Centrum voor Wiskunde en Informatica (CWI)",
address = "ISSN 1386-369X",
pages = "30",
year = "1997",
url = "citeseer.ist.psu.edu/article/aceto95complete.html" }
Citations (may not include all citations):
2732
Communicating Sequential Processes (context) - Hoare
906
A structural approach to operational semantics
- Plotkin - 1981
502
Concurrency and automata on infinite sequences (context) - Park - 1981
447
Prentice-Hall International (context) - Concurrency
266
Cambridge Tracts in Theoretical Computer Science (context) - Baeten, Weijland et al. - 1990
192
Representation of events in nerve nets and finite automata (context) - Kleene - 1956
182
Structured operational semantics and bisimulation as a congr.. (context) - Groote, Vaandrager - 1992
113
Decidability of bisimulation equivalence for processes gener.. (context) - Baeten, Bergstra et al. - 1993
102
Formal verification of parallel programs (context) - Keller - 1976
100
Digital Equipment Corporation (context) - Lamport, write et al. - 1993
98
An introduction to the theory of numbers (context) - Niven, Zuckerman - 1960
81
The linear time -- branching time spectrum (context) - van Glabbeek - 1990
64
Calculi for synchrony and asynchrony (context) - Milner - 1983
36
Basic process algebra with iteration: Completeness of its eq..
- Fokkink, Zantema - 1994
28
ebre de processus et synchronisations (context) - Austry, Boudol
27
Fixed point semantics (context) - Bergstra, Klop - 1982
27
Bisimulation is not finitely (context) - Sewell
21
A term model for synchronous processes (context) - Hennessy - 1981
20
A complete equational axiomatization for prefix iteration
- Fokkink - 1994
18
Realization of events by logical nets (context) - Copi, Elgot et al. - 1958
9
Fully abstract models for nondeterministic Kleene algebras (context) - Corradini, De Nicola et al. - 1995
9
A complete equational axiomatization for prefix iteration wi..
- Aceto, Ing'olfsd'ottir - 1995
9
Computer Journal (context) - with, nesting - 1994
8
System Sci (context) - inference, for et al. - 1984
7
Process algebra with combinators
- Bergstra, Bethke et al. - 1993
4
A completeness theorem for nondeterministic Kleene algebras (context) - De Nicola, Labella - 1994
4
Extending process algebra with the empty process ffl (context) - Koymans, Vrancken - 1985
2
observation equivalence = trace equivalence (context) - Engelfriet
2
Unpublished manuscript (context) - equational, BPAffi et al. - 1995
1
Logic Group Preprint Series (context) - axiomatization, iteration et al. - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.brics.dk/RS/95/Ref/BRICS-RS-95-Ref/): More
MONA: Monadic Second-Order Logic in Practice - Henriksen, Jensen.. (1995)
(Correct)
Compositional Model Checking of Real Time Systems - Laroussinie, al. (1995)
(Correct)
A Semantic Theory for Value-Passing Processes Late.. -.. (1995)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC