scientific article; zbMATH DE number 7559474

DOI10.4230/LIPICS.CONCUR.2020.18MaRDI QIDQ5089283FDOQ5089283

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

Publication date: 18 July 2022

Title of this publication is not available (Why is that?)

zbMATH Keywords

axiomatisationparallel compositionlinear time-branching time spectrum

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Title not available (Why is that?)
• Axiomatizing recursion-free, regular monitors
• Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction

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)