DROPS

Document

DOI: 10.4230/LIPIcs.CONCUR.2025.35

From Bisimulation to Traces: The Impact of Parallel Composition on Finite Bases

Authors: Rowin Versteeg, Valentina Castiglioni, and Bas Luttik

Published in: LIPIcs, Volume 348, 36th International Conference on Concurrency Theory (CONCUR 2025)

Abstract

We consider process algebras with inaction, action prefix, non-deterministic choice and interleaving parallel composition modulo the behavioural equivalences in van Glabbeek’s linear time-branching time spectrum, and study the existence of finite bases (i.e., finite sound and complete axiomatisations) for these algebras. We prove that if the alphabet of actions is infinite and the behavioural equivalence is either simulation equivalence or trace equivalence, then a finite basis exists and is obtained by extending the known ground-complete axiomatisations for these behavioural equivalences. We prove that if the alphabet of actions is finite, then a finite basis does not exist for these equivalences. We also prove for all behavioural equivalences between ready simulation and completed traces there cannot exist a finite basis irrespective of the cardinality of the alphabet of actions (provided that it is non-empty). Finally, we prove that these results are maintained if the process algebra is extended with a constant for successful termination.

Cite as

Rowin Versteeg, Valentina Castiglioni, and Bas Luttik. From Bisimulation to Traces: The Impact of Parallel Composition on Finite Bases. In 36th International Conference on Concurrency Theory (CONCUR 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 348, pp. 35:1-35:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{versteeg_et_al:LIPIcs.CONCUR.2025.35,
  author =	{Versteeg, Rowin and Castiglioni, Valentina and Luttik, Bas},
  title =	{{From Bisimulation to Traces: The Impact of Parallel Composition on Finite Bases}},
  booktitle =	{36th International Conference on Concurrency Theory (CONCUR 2025)},
  pages =	{35:1--35:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-389-8},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{348},
  editor =	{Bouyer, Patricia and van de Pol, Jaco},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2025.35},
  URN =		{urn:nbn:de:0030-drops-239854},
  doi =		{10.4230/LIPIcs.CONCUR.2025.35},
  annote =	{Keywords: Equational basis, Parallel composition, Preorders, Equivalences, Linear time - branching time spectrum}
}

Search Results

Documents authored by Versteeg, Rowin

From Bisimulation to Traces: The Impact of Parallel Composition on Finite Bases

Abstract

Cite as

Thanks for your feedback!

Could not send message