论文信息 - The Meaning of Ordered SOS

The Meaning of Ordered SOS

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.

Iain C. C. Phillips | Irek Ulidowski | Mohammad Reza Mousavi | Michel A. Reniers

[1] Jan Friso Groote,et al. The meaning of negative premises in transition system specifications , 1991, JACM.

[2] Rob J. van Glabbeek,et al. The meaning of negative premises in transition system specifications II , 1996, J. Log. Algebraic Methods Program..

[3] Jan Friso Groote,et al. Transition System Specifications with Negative Premises , 1993, Theor. Comput. Sci..

[4] Irek Ulidowski,et al. Ordered SOS process languages for branching and Eager bisimulation , 2002 .

[5] Matthew Hennessy,et al. A Process Algebra for Timed Systems , 1995, Inf. Comput..

[6] Jan A. Bergstra,et al. Term-Rewriting Systems with Rule Priorities , 1989, Theor. Comput. Sci..

[7] Rob J. van Glabbeek. The meaning of negative premises in transition system specifications II , 2004, J. Log. Algebraic Methods Program..

[8] Simone Tini,et al. Probabilistic Congruence for Semistochastic Generative Processes , 2005, FoSSaCS.

[9] Jan A. Bergstra,et al. Syntax and defining equations for an interrupt mechanism in process algebra , 1985 .

[10] Albert R. Meyer,et al. Bisimulation can't be traced , 1988, POPL '88.