Results 1  10
of
21
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 16 (6 self)
 Add to MetaCart
(Show Context)
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
Bialgebraic Methods and Modal Logic in Structural Operational Semantics
 Electronic Notes in Theoretical Computer Science
, 2007
"... Bialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal reasoning about wellbehaved structural operational semantics (SOS). An extension of algebraic and coalgebraic methods, it abstracts from concrete notions of syntax and system behaviour, thus treating various ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
(Show Context)
Bialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal reasoning about wellbehaved structural operational semantics (SOS). An extension of algebraic and coalgebraic methods, it abstracts from concrete notions of syntax and system behaviour, thus treating various kinds of operational descriptions in a uniform fashion. In this paper, bialgebraic semantics is combined with a coalgebraic approach to modal logic in a novel, general approach to proving the compositionality of process equivalences for languages defined by structural operational semantics. To prove compositionality, one provides a notion of behaviour for logical formulas, and defines an SOSlike specification of modal operators which reflects the original SOS specification of the language. This approach can be used to define SOS congruence formats as well as to prove compositionality for specific languages and equivalences. Key words: structural operational semantics, coalgebra, bialgebra, modal logic, congruence format 1
From Bialgebraic Semantics to Congruence Formats
 SOS 2004 PRELIMINARY VERSION
, 2004
"... A general and abstract framework to defining congruence formats for various process equivalences is presented. The framework extends bialgebraic techniques of Turi and Plotkin with an abstract coalgebraic approach to process equivalence, based on a notion of test suite. The resulting technique is il ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
A general and abstract framework to defining congruence formats for various process equivalences is presented. The framework extends bialgebraic techniques of Turi and Plotkin with an abstract coalgebraic approach to process equivalence, based on a notion of test suite. The resulting technique is illustrated on the example of completed trace equivalence. Rather than providing formal proofs, the paper is guiding the reader through the process of deriving a congruence format in the test suite approach.
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 8 (2 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.
Probabilistic Modal µCalculus with Independent Product
 In Foundations of Software Science and Computation Structures
, 2011
"... Vol. 8(4:18)2012, pp. 1–36 ..."
(Show Context)
Bialgebraic methods in structural operational semantics
 ENTCS
, 2007
"... Bialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal reasoning about wellbehaved structural operational specifications. An extension of algebraic and coalgebraic methods, it abstracts from concrete notions of syntax and system behaviour, thus treating various k ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
Bialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal reasoning about wellbehaved structural operational specifications. An extension of algebraic and coalgebraic methods, it abstracts from concrete notions of syntax and system behaviour, thus treating various kinds of operational descriptions in a uniform fashion. In this talk, the current state of the art in the area of bialgebraic semantics is presented, and its prospects for the future are sketched. In particular, a combination of basic bialgebraic techniques with a categorical approach to modal logic is described, as an abstract approach to proving compositionality by decomposing modal logics over structural operational specifications. Keywords:
Nature
, 1993
"... We present a format for the specification of probabilistic transition systems that guarantees that bisimulation equivalence is a congruence for any operator defined in this format. In this sense, the format is somehow comparable to the ntyft/ntyxt format in a nonprobabilistic setting. We also study ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
We present a format for the specification of probabilistic transition systems that guarantees that bisimulation equivalence is a congruence for any operator defined in this format. In this sense, the format is somehow comparable to the ntyft/ntyxt format in a nonprobabilistic setting. We also study the modular construction of probabilistic transition systems specifications and prove that some standard conservative extension theorems also hold in our setting. Finally, we show that the trace congruence for imagefinite processes induced by our format is precisely bisimulation on probabilistic systems. Note:
GSOS for probabilistic transition systems (Extended Abstract)
, 2002
"... We introduce probabilistic GSOS, an operator specification format for (reactive) probabilistic transition systems which arises as an adaptation of the known GSOS format for labelled (nondeterministic) transition systems. Like the standard one, the format is well behaved in the sense that on all mode ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
We introduce probabilistic GSOS, an operator specification format for (reactive) probabilistic transition systems which arises as an adaptation of the known GSOS format for labelled (nondeterministic) transition systems. Like the standard one, the format is well behaved in the sense that on all models bisimilarity is a congruence and the uptocontext proof principle is valid. Moreover, every specification has a final model which can be shown to offer unique solutions for guarded recursive equations. The format covers operator specifications from the literature, so that the wellbehavedness results given for those arise as instances of our general one.
A Proof System for Compositional Verification of Probabilistic Concurrent Processes
"... Abstract. We present a formal proof system for compositional verification of probabilistic concurrent processes. Processes are specified using an SOSstyle process algebra with probabilistic operators. Properties are expressed using a probabilistic modal µcalculus. And the proof system is formulate ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We present a formal proof system for compositional verification of probabilistic concurrent processes. Processes are specified using an SOSstyle process algebra with probabilistic operators. Properties are expressed using a probabilistic modal µcalculus. And the proof system is formulated as a sequent calculus in which sequents are given a quantitative interpretation. A key feature is that the probabilistic scenario is handled by introducing the notion of Markov proof, according to which proof trees contain probabilistic branches and are required to satisfy a condition formulated byinterpretingthemas Markov Decision Processes. We present simple but illustrative examples demonstrating the applicability of the approach to the compositional verification of infinite state processes. Our main result is the soundness of the proof system, which is proved by applying the coupling method from probability theory to the game semantics of the probabilistic modal µcalculus. 1
On the equivalence of game and denotational semantics for the probabilistic µcalculus
 in "Logical Methods in Computer Science
, 2012
"... Vol. 8 (2:07) 2012, pp. 1–21 ..."
(Show Context)