Bounded nondeterminism and the approximation induction principle in process algebra
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Term-rewriting systems with rule priorities
Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
Well-founded semantics coincides with three-valued stable semantics
Fundamenta Informaticae
Termination, deadlock, and divergence
Journal of the ACM (JACM)
Structured operational semantics and bisimulation as a congruence
Information and Computation
Transition system specifications with negative premises
Theoretical Computer Science
Journal of the ACM (JACM)
A process algebra for timed systems
Information and Computation
Ntyft/ntyxt rules reduce to ntree rules
Information and Computation
The meaning of negative premises in transition system specifications
Journal of the ACM (JACM)
Operational semantics of rewriting with priorities
Theoretical Computer Science
Ordered SOS process languages for branching and Eager bisimulation
Information and Computation
Formats of Ordered SOS Rules with Silent Actions
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Priority Rewriting: Semantics, Confluence, and Conditional
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
A Congruence Rule Format with Universal Quantification
Electronic Notes in Theoretical Computer Science (ENTCS)
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Probabilistic congruence for semistochastic generative processes
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
PobSAM: Policy-based Managing of Actors in Self-Adaptive Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Rule formats for determinism and idempotence
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Rule formats for determinism and idempotence
Science of Computer Programming
Rule formats for distributivity
Theoretical Computer Science
Hi-index | 0.00 |
Structured Operational Semantics (SOS) is a popular method for defining semantics by means of transition rules. An important feature of SOS rules is negative premises, which are crucial in the definitions of such phenomena as priority mechanisms and time-outs. However, the inclusion of negative premises in SOS rules also introduces doubts as to the preferred meaning of SOS specifications. Orderings on SOS rules were proposed by Phillips and Ulidowski as an alternative to negative premises. Apart from the definition of the semantics of positive GSOS rules with orderings, the meaning of more general types of SOS rules with orderings has not been studied hitherto. This paper presents several candidates for the meaning of general SOS rules with orderings and discusses their conformance to our intuition for such rules. We take two general frameworks (rule formats) for SOS with negative premises and SOS with orderings, and present semantics-preserving translations between them with respect to our preferred notion of semantics. Thanks to our semantics-preserving translation, we take existing congruence meta-results for strong bisimilarity from the setting of SOS with negative premises into the setting of SOS with orderings. We further compare the expressiveness of rule formats for SOS with orderings and SOS with negative premises. The paper contains also many examples that illustrate the benefits of SOS with orderings and the properties of the presented definitions of meaning.