A Congruence Rule Format with Universal Quantification

DOI10.1016/j.entcs.2007.08.019zbMath1278.68144OpenAlexW2097488274WikidataQ57745705 ScholiaQ57745705MaRDI QIDQ2871833

No author found.

Publication date: 10 January 2014

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.2007.08.019

zbMATH Keywords

bisimulationcongruenceuniversal quantificationstructural operational semantics (SOS)SOS rule formats

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 (2)

Structural Operational Semantics with First-Order Logic ⋮ Semantics and expressiveness of ordered SOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transition system specifications with negative premises
• SOS formats and meta-theory: 20 years after
• Structured operational semantics and bisimulation as a congruence
• Operational semantics of rewriting with priorities
• Ordered SOS process languages for branching and eager bisimulations
• The origins of structural operational semantics
• The meaning of negative premises in transition system specifications. II
• Termination, deadlock, and divergence
• The meaning of negative premises in transition system specifications

This page was built for publication: A Congruence Rule Format with Universal Quantification