Some undecidable properties of SOS specifications

DOI10.1016/j.jlamp.2016.08.005zbMath1359.68196OpenAlexW2513038717MaRDI QIDQ511941

Bartek Klin, Beata Nachyła

Publication date: 22 February 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.2016.08.005

zbMATH Keywords

structural operational semanticsstable modelcomplete ntyft/ntyxtnegative premisessupported model

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

Logical characterisations, rule formats and compositionality for input-output conformance simulation ⋮ Logical Characterisations and Compositionality of Input-Output Conformance Simulation ⋮ Unnamed Item ⋮ Distributive laws for monotone specifications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bialgebras for structural operational semantics: an introduction
• Transition system specifications with negative premises
• SOS formats and meta-theory: 20 years after
• A congruence rule format for name-passing process calculi
• The meaning of negative premises in transition system specifications. II
• A structural approach to operational semantics
• \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
• Rooted branching bisimulation as a congruence
• Bisimulation can't be traced
• The meaning of negative premises in transition system specifications
• The Meaning of Ordered SOS

This page was built for publication: Some undecidable properties of SOS specifications