Semantics and expressiveness of ordered SOS
From MaRDI portal
Publication:1012119
DOI10.1016/j.ic.2007.11.008zbMath1165.68045OpenAlexW2152688610WikidataQ57745681 ScholiaQ57745681MaRDI QIDQ1012119
Publication date: 14 April 2009
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2007.11.008
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway ⋮ Rule formats for determinism and idempotence ⋮ Unnamed Item ⋮ Expressiveness of component-based frameworks: a study of the expressiveness of BIP ⋮ Rule formats for distributivity ⋮ Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Transition system specifications with negative premises
- Higher-level synchronising devices in Meije-SCCS
- Structured operational semantics and bisimulation as a congruence
- Term-rewriting systems with rule priorities
- Operational semantics of rewriting with priorities
- Ordered SOS process languages for branching and eager bisimulations
- The meaning of negative premises in transition system specifications. II
- A structural approach to operational semantics
- A process algebra for timed systems
- \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
- Structural Operational Semantics with First-Order Logic
- A Congruence Rule Format with Universal Quantification
- Termination, deadlock, and divergence
- Bisimulation can't be traced
- The meaning of negative premises in transition system specifications
- Priority rewriting: Semantics, confluence, and conditionals
- The Meaning of Ordered SOS
- Foundations of Software Science and Computational Structures
