Semantics and expressiveness of ordered SOS

DOI10.1016/J.IC.2007.11.008MaRDI QIDQ1012119zbMATH OpenOpenAlexWikidataFDO

Authors J. Martínez

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

zbMATH Keywords

Structured Operational Semantics

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)

Recommendations

• The Meaning of Ordered SOS
• Ordered SOS process languages for branching and eager bisimulations
• SOS formats and meta-theory: 20 years after
• A hierarchy of SOS rule formats
• Structural operational semantics with first-order logic

Cites work

• scientific article; zbMATH DE number 4160107 (Why is no real title available?)
• scientific article; zbMATH DE number 3990852 (Why is no real title available?)
• scientific article; zbMATH DE number 4001464 (Why is no real title available?)
• A congruence rule format with universal quantification
• A process algebra for timed systems
• A structural approach to operational semantics
• Bisimulation can't be traced
• Foundations of Software Science and Computational Structures
• Higher-level synchronising devices in Meije-SCCS
• Operational semantics of rewriting with priorities
• Ordered SOS process languages for branching and eager bisimulations
• Priority rewriting: Semantics, confluence, and conditionals
• Structural operational semantics with first-order logic
• Structural operational semantics.
• Structured operational semantics and bisimulation as a congruence
• Term-rewriting systems with rule priorities
• Termination, deadlock, and divergence
• The Meaning of Ordered SOS
• The meaning of negative premises in transition system specifications
• The meaning of negative premises in transition system specifications. II
• Transition system specifications with negative premises
• \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules

Cited in

(18)

• Rule formats for distributivity
• scientific article; zbMATH DE number 2102773 (Why is no real title available?)
• The Meaning of Ordered SOS
• Rule formats for determinism and idempotence
• Semantics of MML query -- ordering
• Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
• A hierarchy of SOS rule formats
• A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway
• A generalization of ordered-pair semantics
• Modular semantics for transition system specifications with negative premises
• Interpreting knowledge-based programs
• scientific article; zbMATH DE number 7440178 (Why is no real title available?)
• Partial order semantics and read arcs
• CONCUR 2005 – Concurrency Theory
• Ordered SOS process languages for branching and eager bisimulations
• A semantic approach to order-sorted rewriting
• Structural operational semantics with first-order logic
• Expressiveness of component-based frameworks: a study of the expressiveness of BIP

This page was built for publication: Semantics and expressiveness of ordered SOS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1012119)