scientific article; zbMATH DE number 7471704
From MaRDI portal
Publication:5028469
Bas Luttik, Luca Aceto, Valentina Castiglioni, Anna Ingólfsdóttir, Mathias Ruggaard Pedersen
Publication date: 9 February 2022
Full work available at URL: https://arxiv.org/abs/2102.11166
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uses Software
Cites Work
- Unnamed Item
- 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
- A structural approach to operational semantics
- 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
- Bisimulation can't be traced
- A finite equational base for CCS with left merge and communication merge
This page was built for publication:
