License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CALCO.2019.11
URN: urn:nbn:de:0030-drops-114390
URL: https://drops.dagstuhl.de/opus/volltexte/2019/11439/
Go to the corresponding LIPIcs Volume Portal


Belder, Astrid ; Luttik, Bas ; Baeten, Jos

Sequencing and Intermediate Acceptance: Axiomatisation and Decidability of Bisimilarity

pdf-format:
LIPIcs-CALCO-2019-11.pdf (0.6 MB)


Abstract

The Theory of Sequential Processes includes deadlock, successful termination, action prefixing, alternative and sequential composition. Intermediate acceptance, which is important for the integration of classical automata theory, can be expressed through a combination of alternative composition and successful termination. Recently, it was argued that complications arising from the interplay between intermediate acceptance and sequential composition can be eliminated by replacing sequential composition by sequencing. In this paper we study the equational theory of the recursion-free fragment of the resulting process theory modulo bisimilarity, proving that it is not finitely based, but does afford a ground-complete axiomatisation if a unary auxiliary operator is added. Furthermore, we prove that bisimilarity is decidable for processes definable by means of a finite guarded recursive specification over the process theory.

BibTeX - Entry

@InProceedings{belder_et_al:LIPIcs:2019:11439,
  author =	{Astrid Belder and Bas Luttik and Jos Baeten},
  title =	{{Sequencing and Intermediate Acceptance: Axiomatisation and Decidability of Bisimilarity}},
  booktitle =	{8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)},
  pages =	{11:1--11:22},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-120-7},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{139},
  editor =	{Markus Roggenbach and Ana Sokolova},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/11439},
  URN =		{urn:nbn:de:0030-drops-114390},
  doi =		{10.4230/LIPIcs.CALCO.2019.11},
  annote =	{Keywords: Sequencing, Sequential composition, Bisimilarity, Axiomatisation, Decidability}
}

Keywords: Sequencing, Sequential composition, Bisimilarity, Axiomatisation, Decidability
Collection: 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)
Issue Date: 2019
Date of publication: 25.11.2019


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI