Some undecidable properties of SOS specifications
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1033559 (Why is no real title available?)
- A congruence rule format for name-passing process calculi
- A structural approach to operational semantics
- Bialgebras for structural operational semantics: an introduction
- Bisimulation can't be traced
- Distributive laws and decidable properties of SOS specifications
- Rooted branching bisimulation as a congruence
- SOS formats and meta-theory: 20 years after
- Structural operational semantics.
- 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
(4)
This page was built for publication: Some undecidable properties of SOS specifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q511941)