SOS rule formats for zero and unit elements

DOI10.1016/j.tcs.2011.01.024zbMath1216.68152OpenAlexW2063085985WikidataQ57745599 ScholiaQ57745599MaRDI QIDQ549170

Yong-Cai Geng, Sumit K. Garg

Publication date: 7 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.01.024

zbMATH Keywords

bisimilarityrule formatsstructural operational semantics (SOS)unit elementszero elements

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

SOS rule formats for idempotent terms and idempotent unary operators

Cites Work

• A syntactic commutativity format for SOS
• Preferential choice and coordination conditions
• SOS formats and meta-theory: 20 years after
• Global renaming operators in concrete process algebra
• Process algebra with propositional signals
• Process algebra with timing
• Axiomatizing GSOS with termination
• A structural approach to operational semantics
• Discrete time process algebra
• 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
• Algebraic laws for nondeterminism and concurrency
• Communicating sequential processes
• Bisimulation can't be traced
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: SOS rule formats for zero and unit elements