On rule formats for zero and unit elements
DOI10.1016/J.ENTCS.2010.08.009zbMATH Open1342.68189OpenAlexW2126737785WikidataQ57745631 ScholiaQ57745631MaRDI QIDQ3178250FDOQ3178250
Author name not available (Why is that?)
Publication date: 8 July 2016
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2010.08.009
Recommendations
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- A structural approach to operational semantics
- Structural operational semantics.
- Algebraic laws for nondeterminism and concurrency
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bisimulation can't be traced
- SOS formats and meta-theory: 20 years after
- Communicating sequential processes
- Process algebra with timing
- Title not available (Why is that?)
- Rule Formats for Determinism and Idempotence
- A Rule Format for Unit Elements
- A Rule Format for Associativity
- A syntactic commutativity format for SOS
- On Rule Formats for Zero and Unit Elements
- Title not available (Why is that?)
- Preferential choice and coordination conditions
Cited In (4)
This page was built for publication: On rule formats for zero and unit elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3178250)