Are two binary operators necessary to finitely axiomatise parallel composition?
From MaRDI portal
Cites work
- A calculus of communicating systems
- A finite equational base for CCS with left merge and communication merge
- Algebra of communicating processes with abstraction
- Algebraic laws for nondeterminism and concurrency
- Axiomatising Finite Concurrent Processes
- Bisimulation can't be traced
- CCS with Hennessy's merge has no finite-equational axiomatization
- Formal verification of parallel programs
- Higher-level synchronising devices in Meije-SCCS
- scientific article; zbMATH DE number 5604093 (Why is no real title available?)
- scientific article; zbMATH DE number 3654206 (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 177854 (Why is no real title available?)
- scientific article; zbMATH DE number 3894457 (Why is no real title available?)
- Process algebra for synchronous communication
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Structural operational semantics.
- Turning SOS rules into equations
Cited in
(2)
This page was built for publication: Are two binary operators necessary to finitely axiomatise parallel composition?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6839832)
