The meaning of ordered SOS

Authors:
MohammadReza Mousavi;Iain Phillips;Michel A. Reniers;Irek Ulidowski
Affiliations:
Eindhoven University of Technology, Eindhoven, The Netherlands;Imperial College, London, United Kingdom;Eindhoven University of Technology, Eindhoven, The Netherlands;University of Leicester, Leicester, United Kingdom
Venue:
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Year:
2006

Citing 7
Cited 3

Term-rewriting systems with rule priorities

Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
Transition system specifications with negative premises

Theoretical Computer Science
Bisimulation can't be traced

Journal of the ACM (JACM)
A process algebra for timed systems

Information and Computation
The meaning of negative premises in transition system specifications

Journal of the ACM (JACM)
Ordered SOS process languages for branching and Eager bisimulation

Information and Computation
Probabilistic congruence for semistochastic generative processes

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures

SOS formats and meta-theory: 20 years after

Theoretical Computer Science
A Congruence Rule Format with Universal Quantification

Electronic Notes in Theoretical Computer Science (ENTCS)
Semantics and expressiveness of ordered SOS

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Structured Operational Semantics (SOS) is a popular method for defining semantics by means of deduction rules. An important feature of deduction rules, or simply SOS rules, are negative premises, which are crucial in the definitions of such phenomena as priority mechanisms and time-outs. Orderings on SOS rules were proposed by Phillips and Ulidowski as an alternative to negative premises. The meaning of general types of SOS rules with orderings has not been studied hitherto. This paper presents satisfactory ways of giving a meaning to general SOS rules with orderings. We also give semantics-preserving transformations between the two paradigms, namely, SOS with negative premises and SOS with orderings.