A syntactic commutativity format for SOS

DOI10.1016/J.IPL.2004.11.007zbMath1173.68561OpenAlexW2105133485WikidataQ57745762 ScholiaQ57745762MaRDI QIDQ835035

Jan Friso Groote, Mohammadreza Mousavi, Michel Reniers

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/3f8e3ec9-7a7c-461a-80b6-9eb412a75ad5

zbMATH Keywords

formal semanticscommutativitystructural operational semantics (SOS)standard SOS formats

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (8)

Proving the validity of equations in GSOS languages using rule-matching bisimilarity ⋮ On Rule Formats for Zero and Unit Elements ⋮ SOS formats and meta-theory: 20 years after ⋮ Rule formats for determinism and idempotence ⋮ SOS rule formats for idempotent terms and idempotent unary operators ⋮ A Rule Format for Associativity ⋮ Rule formats for distributivity ⋮ SOS rule formats for zero and unit elements

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transition system specifications with negative premises
• Structured operational semantics and bisimulation as a congruence
• Turning SOS rules into equations
• Finite axiom systems for testing preorder and De Simone process languages
• The meaning of negative premises in transition system specifications. II
• A structural approach to operational semantics
• \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
• The meaning of negative premises in transition system specifications

This page was built for publication: A syntactic commutativity format for SOS