Results 1  10
of
11
SOS formats and metatheory: 20 years after
, 2007
"... In 1981 Structural Operational Semantics (SOS) was introduced as a systematic way to define operational semantics of programming languages by a set of rules of a certain shape [G.D. Plotkin, A structural approach to operational semantics, Technical ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
In 1981 Structural Operational Semantics (SOS) was introduced as a systematic way to define operational semantics of programming languages by a set of rules of a certain shape [G.D. Plotkin, A structural approach to operational semantics, Technical
A Hierarchy of SOS Rule Formats
, 2005
"... In 1981 Structural Operational Semantics (SOS) was introduced as a systematic way to define operational semantics of programming languages by a set of rules of a certain shape [62]. Subsequently, the format of SOS rules became the object of study. Using socalled Transition System Specifications (TS ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
In 1981 Structural Operational Semantics (SOS) was introduced as a systematic way to define operational semantics of programming languages by a set of rules of a certain shape [62]. Subsequently, the format of SOS rules became the object of study. Using socalled Transition System Specifications (TSS’s) several authors syntactically restricted the format of rules and showed several useful properties about the semantics induced by any TSS adhering to the format. This has resulted in a line of research proposing several syntactical rule formats and associated metatheorems. Properties that are guaranteed by such rule formats range from welldefinedness of the operational semantics and compositionality of behavioral equivalences to security and probabilityrelated issues. In this paper, we provide an initial hierarchy of SOS rules formats and metatheorems formulated around them.
Rule formats for compositional noninterference properties
 THE JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING
, 2004
"... ..."
On Cool Congruence Formats for Weak Bisimulations
, 2005
"... In TCS 146, Bard Bloom presented rule formats for four main notions of bisimulation with silent moves. He proved that weak bisimulation equivalence is a congruence for any process algebra defined by WB cool rules, and established similar results for rooted weak bisimulation (Milner’s “observational ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
In TCS 146, Bard Bloom presented rule formats for four main notions of bisimulation with silent moves. He proved that weak bisimulation equivalence is a congruence for any process algebra defined by WB cool rules, and established similar results for rooted weak bisimulation (Milner’s “observational congruence”), branching bisimulation and rooted branching bisimulation. This study reformulates Bloom’s results in a more accessible form and contributes analogues for (rooted) ηbisimulation and (rooted) delay bisimulation. Moreover, finite equational axiomatisations of rooted weak bisimulation equivalence are provided that are sound and complete for finite processes in any RWB cool process algebra. These require the introduction of auxiliary operators with lookahead, and an extension of Bloom’s formats for this type of operator with lookahead. Finally, a challenge is presented for which Bloom’s formats fall short and further improvement is called for.
Structural operational semantics and bounded nondeterminism
 Acta Informatica
, 2003
"... Abstract. We present a rule format for structural operational semantics to guarantee that the associated labelled transition system is bounded nondeterministic. 1 ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. We present a rule format for structural operational semantics to guarantee that the associated labelled transition system is bounded nondeterministic. 1
Ordered SOS Process Languages for Branching and Eager Bisimulations
 INFORMATION AND COMPUTATION
, 2002
"... We present a general and uniform method for defining structural operational semantics (SOS) of process operators by traditional Plotkinstyle transition rules equipped with orderings. This new feature allows one to control the order of application of rules when deriving transitions of process terms. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We present a general and uniform method for defining structural operational semantics (SOS) of process operators by traditional Plotkinstyle transition rules equipped with orderings. This new feature allows one to control the order of application of rules when deriving transitions of process terms. Our method is powerful enough to deal with rules with negative premises and copying. We show that rules with orderings, called ordered SOS rules, have the same expressive power as GSOS rules. We identify several classes of process languages with operators defined by rules with and without orderings in the setting with silent actions and divergence. We prove that branching bisimulation and eager bisimulation relations are preserved by all operators in process languages in the relevant classes.
Operational semantics for Petri net components
, 2007
"... We propose a calculus for marked labelled nets (components), with places and transitions as atoms and merge, addition, fusion and relabelling as operators. The operators are defined using graphbased transformations; each net can be represented by a term. Next, we define both a step semantics for ne ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We propose a calculus for marked labelled nets (components), with places and transitions as atoms and merge, addition, fusion and relabelling as operators. The operators are defined using graphbased transformations; each net can be represented by a term. Next, we define both a step semantics for nets and a Plotkinstyle SOS semantics for net terms and show their equivalence. In the semantics, both stateoriented and eventoriented properties of components can be expressed. We give a few rules for reducing components to smaller equivalent ones.
Wind: Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
 Proc. Int. Symp. on Formal Methods for Components and Objects, Lecture Notes in Computer Science 4111
, 2005
"... Abstract. We present a method for decomposing modal formulas for processes with the internal action τ. To decide whether a process algebra term satisfies a modal formula, one can check whether its subterms satisfy formulas that are obtained by decomposing the original formula. The decomposition uses ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. We present a method for decomposing modal formulas for processes with the internal action τ. To decide whether a process algebra term satisfies a modal formula, one can check whether its subterms satisfy formulas that are obtained by decomposing the original formula. The decomposition uses the structural operational semantics that underlies the process algebra. We use this decomposition method to derive congruence formats for two weak and rooted weak semantics: branching and ηbisimilarity. 1
A Rule Format for Rooted Branching
"... Abstract. SOS rule formats are sets of syntactical constraints over SOS transition rules ensuring semantical properties of the derived LTS. Given a rule format, our proposal is to try to relax the constraints imposed by the format on each single transition rule at the price of introducing some reaso ..."
Abstract
 Add to MetaCart
Abstract. SOS rule formats are sets of syntactical constraints over SOS transition rules ensuring semantical properties of the derived LTS. Given a rule format, our proposal is to try to relax the constraints imposed by the format on each single transition rule at the price of introducing some reasonable constraint on the form of the whole set of rules, obtaining a new format ensuring the same semantical property and being less demanding than the original one. We demonstrate that this can be done by applying such an idea to a well established rule format ensuring the property of congruence for the rooted branching bisimulation equivalence. 1