A syntactic commutativity format for SOS
From MaRDI portal
Publication:835035
DOI10.1016/J.IPL.2004.11.007zbMATH Open1173.68561OpenAlexW2105133485WikidataQ57745762 ScholiaQ57745762MaRDI QIDQ835035FDOQ835035
Jan Friso Groote, Mohammadreza Mousavi, Michel A. 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
Recommendations
Cites Work
- Structured operational semantics and bisimulation as a congruence
- A structural approach to operational semantics
- Structural operational semantics.
- Title not available (Why is that?)
- \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
- The meaning of negative premises in transition system specifications. II
- The meaning of negative premises in transition system specifications
- Transition system specifications with negative premises
- Turning SOS rules into equations
- Title not available (Why is that?)
- Finite axiom systems for testing preorder and De Simone process languages
- Title not available (Why is that?)
Cited In (8)
- Proving the validity of equations in GSOS languages using rule-matching bisimilarity
- SOS rule formats for zero and unit elements
- SOS formats and meta-theory: 20 years after
- Rule formats for determinism and idempotence
- Rule formats for distributivity
- SOS rule formats for idempotent terms and idempotent unary operators
- On Rule Formats for Zero and Unit Elements
- A Rule Format for Associativity
This page was built for publication: A syntactic commutativity format for SOS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835035)
