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

Luca Aceto, Wan Fokkink, Anna Ingolfsdottir

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

Fokkink and Zantema (Fokkink and Zantema 1994) 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, 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 (which is the finest semantics that we consider) and whose instances cannot all be proved by means of any finite set of (in)equations that is sound in completed trace semantics (which is the coarsest semantics 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 in which some of the (in)equivalences of the family under consideration fail. The construction of the model mimics the one used by Conway (Conway 1971, p. 105) in his proof of a result, originally due to Redko, to the effect that infinitely many equations are needed to axiomatize equality of regular expressions. Our non-finite axiomatizability results apply to the language BPA* over an arbitrary non-empty set of actions. In particular, we show that completed trace equivalence is not finitely based over BPA* even when the set of actions is a singleton. Our proof of this result may be adapted to the standard language of regular expressions to yield a solution to an open problem posed by Salomaa (Salomaa 1969, p. 143). Another semantics that is usually considered in process theory is trace semantics. Trace semantics is, in general, not preserved by sequential composition, and is therefore inappropriate for the language BPA*. We show that, if the set of actions is a singleton, trace equivalence and preorder are preserved by all the operators in the signature of BPA*, and coincide with simulation equivalence and preorder, respectively. In that case, unlike all the other semantics considered in this paper, trace semantics have finite, complete equational axiomatizations over closed terms.

Original languageEnglish
Pages (from-to)193-230
Number of pages38
JournalMathematical Structures in Computer Science
Volume8
Issue number3
DOIs
Publication statusPublished - 1 Jan 1998

Fingerprint

Semantics
Trace
Equivalence
Simulation
Preorder
Bisimulation
Axiomatization
Regular Expressions
Branching
Linear Time
Acoustic waves
Star Operation
Basic Algebra
Congruence Relation
Process Algebra
Tractability
Algebra
Stars
Finite Set
Open Problems

Cite this

@article{80d8a2658a474d8a9e16a2f64e47eb81,
title = "A menagerie of non-finitely based process semantics over BPA* — from ready simulation to completed traces",
abstract = "Fokkink and Zantema (Fokkink and Zantema 1994) 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, 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 (which is the finest semantics that we consider) and whose instances cannot all be proved by means of any finite set of (in)equations that is sound in completed trace semantics (which is the coarsest semantics 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 in which some of the (in)equivalences of the family under consideration fail. The construction of the model mimics the one used by Conway (Conway 1971, p. 105) in his proof of a result, originally due to Redko, to the effect that infinitely many equations are needed to axiomatize equality of regular expressions. Our non-finite axiomatizability results apply to the language BPA* over an arbitrary non-empty set of actions. In particular, we show that completed trace equivalence is not finitely based over BPA* even when the set of actions is a singleton. Our proof of this result may be adapted to the standard language of regular expressions to yield a solution to an open problem posed by Salomaa (Salomaa 1969, p. 143). Another semantics that is usually considered in process theory is trace semantics. Trace semantics is, in general, not preserved by sequential composition, and is therefore inappropriate for the language BPA*. We show that, if the set of actions is a singleton, trace equivalence and preorder are preserved by all the operators in the signature of BPA*, and coincide with simulation equivalence and preorder, respectively. In that case, unlike all the other semantics considered in this paper, trace semantics have finite, complete equational axiomatizations over closed terms.",
author = "Luca Aceto and Wan Fokkink and Anna Ingolfsdottir",
year = "1998",
month = "1",
day = "1",
doi = "10.1017/S0960129597002491",
language = "English",
volume = "8",
pages = "193--230",
journal = "Mathematical Structures in Computer Science (MSCS)",
issn = "0960-1295",
publisher = "Cambridge University Press",
number = "3",

}

A menagerie of non-finitely based process semantics over BPA* — from ready simulation to completed traces. / Aceto, Luca; Fokkink, Wan; Ingolfsdottir, Anna.

In: Mathematical Structures in Computer Science, Vol. 8, No. 3, 01.01.1998, p. 193-230.

Research output: Contribution to JournalArticleAcademicpeer-review

TY - JOUR

T1 - A menagerie of non-finitely based process semantics over BPA* — from ready simulation to completed traces

AU - Aceto, Luca

AU - Fokkink, Wan

AU - Ingolfsdottir, Anna

PY - 1998/1/1

Y1 - 1998/1/1

N2 - Fokkink and Zantema (Fokkink and Zantema 1994) 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, 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 (which is the finest semantics that we consider) and whose instances cannot all be proved by means of any finite set of (in)equations that is sound in completed trace semantics (which is the coarsest semantics 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 in which some of the (in)equivalences of the family under consideration fail. The construction of the model mimics the one used by Conway (Conway 1971, p. 105) in his proof of a result, originally due to Redko, to the effect that infinitely many equations are needed to axiomatize equality of regular expressions. Our non-finite axiomatizability results apply to the language BPA* over an arbitrary non-empty set of actions. In particular, we show that completed trace equivalence is not finitely based over BPA* even when the set of actions is a singleton. Our proof of this result may be adapted to the standard language of regular expressions to yield a solution to an open problem posed by Salomaa (Salomaa 1969, p. 143). Another semantics that is usually considered in process theory is trace semantics. Trace semantics is, in general, not preserved by sequential composition, and is therefore inappropriate for the language BPA*. We show that, if the set of actions is a singleton, trace equivalence and preorder are preserved by all the operators in the signature of BPA*, and coincide with simulation equivalence and preorder, respectively. In that case, unlike all the other semantics considered in this paper, trace semantics have finite, complete equational axiomatizations over closed terms.

AB - Fokkink and Zantema (Fokkink and Zantema 1994) 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, 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 (which is the finest semantics that we consider) and whose instances cannot all be proved by means of any finite set of (in)equations that is sound in completed trace semantics (which is the coarsest semantics 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 in which some of the (in)equivalences of the family under consideration fail. The construction of the model mimics the one used by Conway (Conway 1971, p. 105) in his proof of a result, originally due to Redko, to the effect that infinitely many equations are needed to axiomatize equality of regular expressions. Our non-finite axiomatizability results apply to the language BPA* over an arbitrary non-empty set of actions. In particular, we show that completed trace equivalence is not finitely based over BPA* even when the set of actions is a singleton. Our proof of this result may be adapted to the standard language of regular expressions to yield a solution to an open problem posed by Salomaa (Salomaa 1969, p. 143). Another semantics that is usually considered in process theory is trace semantics. Trace semantics is, in general, not preserved by sequential composition, and is therefore inappropriate for the language BPA*. We show that, if the set of actions is a singleton, trace equivalence and preorder are preserved by all the operators in the signature of BPA*, and coincide with simulation equivalence and preorder, respectively. In that case, unlike all the other semantics considered in this paper, trace semantics have finite, complete equational axiomatizations over closed terms.

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

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

U2 - 10.1017/S0960129597002491

DO - 10.1017/S0960129597002491

M3 - Article

VL - 8

SP - 193

EP - 230

JO - Mathematical Structures in Computer Science (MSCS)

JF - Mathematical Structures in Computer Science (MSCS)

SN - 0960-1295

IS - 3

ER -