scientific article; zbMATH DE number 7559474
From MaRDI portal
Publication:5089283
DOI10.4230/LIPIcs.CONCUR.2020.18MaRDI QIDQ5089283
Bas Luttik, Valentina Castiglioni, Luca Aceto, Anna Ingólfsdóttir, Mathias Ruggaard Pedersen
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Axiomatizing recursion-free, regular monitors ⋮ Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nested semantics over finite trees are equationally hard
- On finite alphabets and infinite bases
- Lifting non-finite axiomatizability results to extensions of process algebras
- Higher-level synchronising devices in Meije-SCCS
- Structured operational semantics and bisimulation as a congruence
- Unifying the Linear Time-Branching Time Spectrum of Process Semantics
- Process algebra for synchronous communication
- Algebraic laws for nondeterminism and concurrency
- Formal verification of parallel programs
- A finite equational base for CCS with left merge and communication merge
This page was built for publication: