## A menagerie of non-finitely based process semantics over BPA*—from ready simulation to completed traces (1998)

Venue: | Mathematical Structures in Computer Science |

Citations: | 24 - 19 self |

### BibTeX

@INPROCEEDINGS{Aceto98amenagerie,

author = {Luca Aceto and Wan Fokkink and Anna Ingólfsdóttir},

title = {A menagerie of non-finitely based process semantics over BPA*—from ready simulation to completed traces},

booktitle = {Mathematical Structures in Computer Science},

year = {1998},

pages = {193--230}

}

### Years of Citing Articles

### OpenURL

### Abstract

Fokkink and Zantema ((1994) Computer Journal 37:259–267) have shown that bisimulation equivalence has a finite equational axiomatization over the language of Basic Process Algebra with the binary Kleene star operation (BPA ∗). In the light of this positive result on the mathematical tractability of bisimulation equivalence over BPA ∗ , a natural question to ask is whether any other (pre)congruence relation in van Glabbeek’s linear time/branching time spectrum is finitely (in)equationally axiomatizable over it. In this paper, we prove that, unlike bisimulation equivalence, none of the preorders and equivalences in van Glabbeek’s linear time/branching time spectrum, whose discriminating power lies in between that of ready simulation and that of completed traces, has a finite equational axiomatization. This we achieve by exhibiting a family of (in)equivalences that holds in ready simulation semantics, the finest semantics that we consider, whose instances cannot all be proven by means of any finite set of (in)equations

### Citations

1329 | A calculus of communicating systems - Milner - 1980 |

403 | Bisimulation through probabilistic testing - Larsen, Skou - 1991 |

393 | Algebraic Theory of Processes - Hennessy - 1988 |

376 | Representation of events in nerve nets and finite automata - Kleene - 1951 |

275 |
Regular Algebra and Finite Machines
- Conway
- 1971
(Show Context)
Citation Context ... of regular expressions cannot be axiomatized using a finite number of equations. The construction of our model relies heavily on the use of prime numbers, as do related arguments presented in, e.g., =-=[20, 26, 47, 64]-=-. Conway’s proof of the non-finite axiomatizability of equality of regular expressions is based upon an argument showing that no finite set of regular tautologies can prove all the instances of the af... |

194 |
Bisimulation can’t be traced
- Bloom, Istrail, et al.
- 1995
(Show Context)
Citation Context ...s R s ′ . Bisimulation equivalence [56, 50] relates two states in a labelled transition system precisely when they have the same branching structure. Simulation (see, e.g., [56]) and ready simulation =-=[14, 48]-=- relax this requirement to different degrees. The following notions, which are all based on decorated versions of traces, are induced by yet further ways of abstracting from the full branching structu... |

189 | Structured operational semantics and bisimulation as a congruence - Groote, Vaandrager - 1992 |

186 | A completeness theorem for Kleene algebras and the algebra of regular events - Kozen - 1994 |

159 | Formal verification of parallel programs - KELLER - 1976 |

96 |
Decidability of bisimulation equivalence for processes generating context-free languages
- Baeten, Bergstra, et al.
- 1993
(Show Context)
Citation Context ...equations a ω def = a · a ω b ω def = b · b ω have no completed trace, but disjoint sets of non-empty traces. However, if the labelled transition system under consideration is normed, in the sense of =-=[6]-=-, then the set of traces of every state s is obtained as the prefix closure of its set of completed traces. This is because every state in a normed transition system has at least one completed trace, ... |

61 | The Origin of Relation Algebras
- Maddux
- 1991
(Show Context)
Citation Context ... Conway and Redko for regular algebra. A related result, whose proof is based on an explicit reduction to the nonexistence of a finite equational axiomatization for regular languages, is presented in =-=[23]-=-. In op. cit. the authors show that the variety of inversion-free Kleene algebras is not finitely based, thus settling a problem posed by Jónsson in [42]. Our non-finite axiomatizability results apply... |

51 |
Algèbre de processus et synchronisations
- AUSTRY, BOUDOL
- 1984
(Show Context)
Citation Context ...s of reactive systems, i.e., systems that compute by reacting to stimuli from their environment. As such systems tend to be non-terminating, all process algebraic specification formalisms (cf., e.g., =-=[5, 41, 52, 8]-=-) include facilities for the specification and analysis of infinite behaviours. The description of such behaviours has been traditionally achieved in process theory by means of systems of recursion eq... |

42 |
Fixed point semantics in process algebras
- Bergstra, Klop
- 1982
(Show Context)
Citation Context ...equalities involving infinite processes have been studied in the literature. (Cf., e.g., rules like unique fixed-point induction in its various flavours [52, 8], the approximation induction principle =-=[11]-=- and ω-induction [39].) An alternative, purely algebraic, way of introducing infinite behaviours in process algebras is to augment them with variations on the Kleene star operation familiar from the t... |

34 | A complete system of B-rational identities - Krob - 1991 |

33 | Basic process algebra with iteration: Completeness of its equational axioms - Fokkink, Zantema |

29 | Axiomatizing prefix iteration with silent steps
- Aceto, Fokkink, et al.
- 1996
(Show Context)
Citation Context ...c to (finitely) axiomatize behavioural equivalences over languages incorporating variations on the Kleene star operation. (Examples of contributions along this line of research may be found in, e.g., =-=[32, 64, 29, 3, 4, 30, 31, 33, 1]-=-.) A notable positive result in this direction was obtained by Fokkink and Zantema, who showed in [32] that the finite equational axiom system for the language BPA∗ proposed in [10] is indeed complete... |

26 |
Varieties of ordered algebras
- Bloom
- 1976
(Show Context)
Citation Context ...at is, for P, Q ∈ (BPA ∗ (Act)), T(BPA ∗ (Act))/ �ℵ |= P = Q ⇔ (for all closed substitutions σ : P σ �ℵ Qσ) . Each of these algebras has, in fact, the structure of an ordered algebra, in the sense of =-=[15, 39]-=-, and, for P, Q ∈ (BPA ∗ (Act)), T(BPA ∗ (Act))/ �ℵ |= P ≤ Q ⇔ (for all closed substitutions σ : P σ ⊏ ∼ℵ Qσ) . In both cases, we say that the relevant equation (resp. inequation) is valid, or sound, ... |

21 | A complete equational axiomatization for prefix iteration - Fokkink - 1994 |

18 | Process algebra with iteration
- BERGSTRA, BETHKE, et al.
- 1993
(Show Context)
Citation Context ...algebraic, way of introducing infinite behaviours in process algebras is to augment them with variations on the Kleene star operation familiar from the theory of regular algebra—cf., e.g., the papers =-=[32, 9, 10, 29, 24, 22]-=-. Some of these studies, notably [10], have investigated the expressive power of variations on standard process description languages in which infinite behaviours are defined by means of Kleene’s star... |

16 |
Equational axioms for regular sets
- Bloom, Ésik
- 1993
(Show Context)
Citation Context ...finite equational axiomatization over iteration theories, i.e., relative to the general set of identities for fixed-point operations. This result, together with the completeness theorems presented in =-=[16, 18]-=-, seems to indicate that the deep reason underlying all the aforementioned non-finite axiomatizability results, as well as those presented in this paper, is that the general equational theory of fixed... |

13 | A complete equational axiomatization for MPA with string iteration
- Aceto, Groote
- 1995
(Show Context)
Citation Context ...ained by adding the stopped process δ to the signature of BPA ∗ . (A discussion of the completeness result by Fokkink and Zantema vis-à-vis Sewell’s non-finite axiomatizability result may be found in =-=[2]-=-.) In the light of Fokkink and Zantema’s positive result on the mathematical tractability of bisimulation equivalence over BPA ∗ , a natural question to ask is whether any other (pre)congruence relati... |

12 |
A complete system of identities for one-letter rational expressions with multiplicities in the tropical semiring, Theoretical Comput
- Bonnier-Rigny, Krob
- 1994
(Show Context)
Citation Context ...so [20, Chapter 33s4]). (Variations on the aforementioned results of Redko’s that apply to regular expressions over a singleton alphabet with multiplicities over the tropical semiring may be found in =-=[19]-=-.) The construction of a complete equational axiomatization for regular expressions over an arbitrary alphabet was addressed by Conway in his seminal monograph [20]. Ibidem Conway proposed three conje... |

11 | Realization of events by logical nets - Copi, Elgot, et al. - 1958 |

9 |
A completeness theorem for nondeterministic Kleene algebras
- Nicola, Labella
- 1994
(Show Context)
Citation Context ...algebraic, way of introducing infinite behaviours in process algebras is to augment them with variations on the Kleene star operation familiar from the theory of regular algebra—cf., e.g., the papers =-=[32, 9, 10, 29, 24, 22]-=-. Some of these studies, notably [10], have investigated the expressive power of variations on standard process description languages in which infinite behaviours are defined by means of Kleene’s star... |

7 |
An equational axiomatization of observation congruence for prefix iteration
- Aceto, Ingólfsdóttir
- 1996
(Show Context)
Citation Context ...c to (finitely) axiomatize behavioural equivalences over languages incorporating variations on the Kleene star operation. (Examples of contributions along this line of research may be found in, e.g., =-=[32, 64, 29, 3, 4, 30, 31, 33, 1]-=-.) A notable positive result in this direction was obtained by Fokkink and Zantema, who showed in [32] that the finite equational axiom system for the language BPA∗ proposed in [10] is indeed complete... |

7 |
Fully abstract models for nondeterministic Kleene algebras (extended abstract
- Corradini, Nicola, et al.
- 1995
(Show Context)
Citation Context ...algebraic, way of introducing infinite behaviours in process algebras is to augment them with variations on the Kleene star operation familiar from the theory of regular algebra—cf., e.g., the papers =-=[32, 9, 10, 29, 24, 22]-=-. Some of these studies, notably [10], have investigated the expressive power of variations on standard process description languages in which infinite behaviours are defined by means of Kleene’s star... |

6 |
algebra with iteration and nesting
- Process
- 1994
(Show Context)
Citation Context |

6 | olfsd' ottir, Axiomatizing prefix iteration with silent steps - Aceto, Fokkink, et al. - 1996 |

5 |
of communicating processes with abstraction, Theoretical Comput
- Algebra
- 1985
(Show Context)
Citation Context ... system described by the recursion equation (1) can alternatively 2sbe denoted by the term (send · receive) ∗fail, and, as shown in [10], any regular process can be specified in the axiom system ACPτ =-=[12]-=- with Kleene star using handshake communication. (Interestingly, as already noted by Milner in [51, Sect. 6], not every process defined using finite-state systems of recursion equations can be describ... |

4 | Comparative Concurrency Semantics and Refinement of Actions - Glabbeek - 1990 |

2 |
An equational axiomatization for multi-exit iteration, Research Report RS-96-22
- Aceto, Fokkink
- 1996
(Show Context)
Citation Context ...c to (finitely) axiomatize behavioural equivalences over languages incorporating variations on the Kleene star operation. (Examples of contributions along this line of research may be found in, e.g., =-=[32, 64, 29, 3, 4, 30, 31, 33, 1]-=-.) A notable positive result in this direction was obtained by Fokkink and Zantema, who showed in [32] that the finite equational axiom system for the language BPA∗ proposed in [10] is indeed complete... |

2 | olfsd' ottir, An equational axiomatization of observation congruence for prefix iteration - Aceto, Ing' - 1996 |

2 | Independence of the equational axioms for iteration theories - unknown authors - 1988 |

2 | axioms for iteration - Group - 1999 |

1 | olfsd' ottir, Axio34 matizing prefix iteration with silent steps - Aceto, Glabbeek, et al. - 1996 |

1 | c and R. Madar' asz, On Kleene algebras - Crvenkovi' - 1993 |

1 | Specifications, programs and implementations - Hoare - 1982 |

1 | onsson, The theory of binary relations - J' - 1988 |