MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Decorated Trace Semantics over BPA have no Finite Equational Axiomatization

Download:
Download as a PDF | Download as a PS
by Luca Aceto, Wan Fokkink
http://www.cs.auc.dk/~luca/conway.ps.gz
Add To MetaCart

Abstract:

Fokkink and Zantema 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 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 based on decorated traces can be finitely axiomatized. This we achieve by exhibiting a family of (in)equivalences that holds in ready trace semantics, the finest semantics that we consider, whose instances cannot all be proven by means of any finite set of (in)equations that is sound in completed trace semantics, which is the coarsest semantics based on decorated traces that is appropriate for the language BPA. To this end, for every finite collection of (in)equations that are sound in completed trace semantics, we build a model

Citations

54 Alg`ebre de processus et synchronisation – Austry, Boudol - 1984
42 Fixed point semantics in process algebras – Bergstra, Klop - 1982
22 Ready-trace semantics for concrete process algebra with the priority operator – Baeten, Bergstra, et al. - 1987
20 Process algebra with iteration – Bergstra, Bethke, et al. - 1993
17 A complete equational axiomatization for mpa with string iteration – Aceto, Groote - 1995
9 algebra with iteration and nesting – Process - 1994
8 olfsd' ottir, Axiomatizing prefix iteration with silent steps – Aceto, Fokkink, et al. - 1996
8 of communicating processes with abstraction, Theoretical Comput – Algebra - 1985
5 olfsd' ottir, A complete equational axiomatization for prefix iteration with silent steps, Research Report RS--95--5 – Aceto, Ing' - 1995