Expressiveness modulo bisimilarity of regular expressions with parallel composition

DOI10.1017/S0960129514000309zbMath1362.68198arXiv1011.6429MaRDI QIDQ2971071

Tim M. Müller, Bas Luttik, Paul van Tilburg, Jos C. M. Baeten

Publication date: 4 April 2017

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1011.6429

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (7)

Pushdown Automata and Context-Free Grammars in Bisimulation Semantics ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Natural projection as partial model checking ⋮ Unnamed Item ⋮ Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity ⋮ Unnamed Item

Cites Work

• Unnamed Item
• A complete inference system for a class of regular behaviours
• The algebra of communicating processes with empty process
• Towards a unified approach to encodability and separation results for process calculi
• Process algebra for synchronous communication
• Branching time and abstraction in bisimulation semantics

This page was built for publication: Expressiveness modulo bisimilarity of regular expressions with parallel composition