scientific article; zbMATH DE number 7559474

DOI10.4230/LIPICS.CONCUR.2020.18MaRDI QIDQ5089283zbMATH OpenFDO

Authors Luca Aceto, Valentina Castiglioni, Anna Ingolfsdottir, Bas Luttik, Mathias Ruggaard Pedersen

Publication date 18 July 2022

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2020.18

zbMATH Keywords

axiomatisationlinear time-branching time spectrumparallel composition

Mathematics Subject Classification ID

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

Cites work

• A finite equational base for CCS with left merge and communication merge
• Algebraic laws for nondeterminism and concurrency
• Formal verification of parallel programs
• Handbook of process algebra
• Higher-level synchronising devices in Meije-SCCS
• scientific article; zbMATH DE number 1670866 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 177854 (Why is no real title available?)
• scientific article; zbMATH DE number 2038703 (Why is no real title available?)
• Lifting non-finite axiomatizability results to extensions of process algebras
• Nested semantics over finite trees are equationally hard
• On finite alphabets and infinite bases
• Process algebra for synchronous communication
• Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
• Structured operational semantics and bisimulation as a congruence
• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
• Unifying the linear time-branching time spectrum of process semantics

Cited in

(6)

• Axiomatizing recursion-free, regular monitors
• scientific article; zbMATH DE number 7471704 (Why is no real title available?)
• Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction
• Non finite axiomatisability of weak bisimulation-based congruences
• Axiomatising weak bisimulation congruences over CCS with left merge and communication merge
• From bisimulation to traces: the impact of parallel composition on finite bases

This page was built for publication:

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