The quest for equational axiomatizations of parallel composition: status and open problems

DOI10.1016/J.ENTCS.2005.12.076MaRDI QIDQ5262950zbMATH OpenOpenAlexFDO

Authors 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

concurrencyprocess algebrabisimulationCCSequational logiccommunication 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)

Recommendations

• The Saga of the Axiomatization of Parallel Composition
• On “Axiomatising Finite Concurrent Processes”
• Processes, Terms and Cycles: Steps on the Road to Infinity
• On the axiomatizability of priority. II
• A language for the description of interacting parallel processes. II

Cites work

• scientific article; zbMATH DE number 1670866 (Why is no real title available?)
• scientific article; zbMATH DE number 5604093 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 48157 (Why is no real title available?)
• scientific article; zbMATH DE number 177854 (Why is no real title available?)
• scientific article; zbMATH DE number 1500658 (Why is no real title available?)
• Algebraic laws for nondeterminism and concurrency
• Axiomatising Finite Concurrent Processes
• Axiomatizing shuffle and concatenation in languages
• CCS with Hennessy's merge has no finite-equational axiomatization
• Free shuffle algebras in language varieties
• Languages under concatenation and shuffling
• Modeling concurrency with partial orders
• Nonfinite axiomatizability of shuffle inequalities
• Nonfinite axiomatizability of the equational theory of shuffle
• Process algebra for synchronous communication
• The equational theory of pomsets
• Varieties generated by languages with poset operations

Cited in

(8)

• scientific article; zbMATH DE number 7471704 (Why is no real title available?)
• The Saga of the Axiomatization of Parallel Composition
• scientific article; zbMATH DE number 1670866 (Why is no real title available?)
• scientific article; zbMATH DE number 7300359 (Why is no real title available?)
• scientific article; zbMATH DE number 7301731 (Why is no real title available?)
• Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction
• Shuffles and concatenations in the construction of graphs
• A sound and complete abstraction for reasoning about parallel prefix sums

This page was built for publication: The quest for equational axiomatizations of parallel composition: status and open problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262950)