The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems

DOI10.1016/j.entcs.2005.12.076zbMath1316.68082OpenAlexW2168928652MaRDI QIDQ5262950

Luca Aceto

Publication date: 10 July 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2005.12.076

zbMATH Keywords

process algebraequational logicbisimulationconcurrencyCCScommunication mergeHennessy's mergeleft merge

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 (1)

Shuffles and concatenations in the construction of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Free shuffle algebras in language varieties
• Modeling concurrency with partial orders
• The equational theory of pomsets
• Nonfinite axiomatizability of the equational theory of shuffle
• Axiomatizing shuffle and concatenation in languages
• CCS with Hennessy's merge has no finite-equational axiomatization
• Process algebra for synchronous communication
• Algebraic laws for nondeterminism and concurrency
• Axiomatising Finite Concurrent Processes
• Languages under concatenation and shuffling
• Varieties generated by languages with poset operations
• Nonfinite axiomatizability of shuffle inequalities

This page was built for publication: The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems