Rule formats for distributivity
From MaRDI portal
Publication:1758150
DOI10.1016/J.TCS.2012.07.036zbMath1279.68180OpenAlexW2047981584WikidataQ57745574 ScholiaQ57745574MaRDI QIDQ1758150
Publication date: 8 November 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.07.036
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A syntactic commutativity format for SOS
- Bisimilarity is not finitely based over BPA with interrupt
- SOS formats and meta-theory: 20 years after
- Semantics and expressiveness of ordered SOS
- Algebra of communicating processes with abstraction
- Higher-level synchronising devices in Meije-SCCS
- Global renaming operators in concrete process algebra
- Turning SOS rules into equations
- The algebra of timed processes, ATP: Theory and application
- CCS with Hennessy's merge has no finite-equational axiomatization
- A structural approach to operational semantics
- Rule Formats for Distributivity
- On Rule Formats for Zero and Unit Elements
- Rule Formats for Determinism and Idempotence
- A Rule Format for Unit Elements
- A Rule Format for Associativity
- Process algebra for synchronous communication
- Communicating sequential processes
- Bisimulation can't be traced
- A finite equational base for CCS with left merge and communication merge
- Processes, Terms and Cycles: Steps on the Road to Infinity
This page was built for publication: Rule formats for distributivity