A unified rule format for bounded nondeterminism in SOS with terms as labels

DOI10.1016/j.jlamp.2017.03.002zbMath1373.68285OpenAlexW2595581340MaRDI QIDQ2403821

Álvaro García-Pérez, Luca Aceto, I. Fábregas, Anna Ingólfsdóttir

Publication date: 12 September 2017

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2017.03.002

zbMATH Keywords

structural operational semanticslabelled transition systemsrule formatsbounded nondeterminism

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) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Coverability Synthesis in Parametric Petri Nets

Cites Work

• A characterization of finitary bisimulation
• Transition system specifications with negative premises
• SOS formats and meta-theory: 20 years after
• Higher-level synchronising devices in Meije-SCCS
• Structured operational semantics and bisimulation as a congruence
• Structural operational semantics and bounded nondeterminism
• A structural approach to operational semantics
• Nominal unification
• A domain equation for bisimulation
• Rule Formats for Bounded Nondeterminism in Structural Operational Semantics
• Nominal SOS
• Countable nondeterminism and random assignment
• Algebraic laws for nondeterminism and concurrency
• Formal verification of parallel programs
• The well-founded semantics for general logic programs
• Bisimulation can't be traced
• CONCUR 2005 – Concurrency Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item