Results 1  10
of
14
From Bialgebraic Semantics to Congruence Formats
, 2005
"... A general and abstract framework to defining congruence formats for various process equivalences 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, th ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
A general and abstract framework to defining congruence formats for various process equivalences 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.
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 10 (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 finite basis for failure semantics
 In Proceedings 32nd Colloquium on Automata, Languages and Programming (ICALP’05), Lisbon, LNCS 3580
, 2005
"... Abstract. We present a finite ωcomplete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite alphabet. This solves an open question by Groote [12]. 1 ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
Abstract. We present a finite ωcomplete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite alphabet. This solves an open question by Groote [12]. 1
Syntactic formats for free: An abstract approach to process equivalence
 in: Proc. CONCUR 2003, LNCS 2761 (2003
, 2003
"... Abstract. A framework of Plotkin and Turi’s, originally aimed at providing an abstract notion of bisimulation, is modified to cover other operational equivalences and preorders. Combined with bialgebraic methods, it yields a technique for the derivation of syntactic formats for transition system spe ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
Abstract. A framework of Plotkin and Turi’s, originally aimed at providing an abstract notion of bisimulation, is modified to cover other operational equivalences and preorders. Combined with bialgebraic methods, it yields a technique for the derivation of syntactic formats for transition system specifications which guarantee that various operational preorders are precongruences. The technique is applied to the trace preorder, the completed trace preorder and the failures preorder. In the latter two cases, new syntactic formats guaranteeing precongruence properties are introduced. 1
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 8 (3 self)
 Add to MetaCart
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
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.
On the expressiveness of CSP
"... We define “CSPlike ” operational semantics in the context of LTS’s: a severely restricted mode of describing operators which can express every operator of Hoare’s CSP. Furthermore we show that every operator with CSPlike operational semantics can be simulated in CSP with the addition of an excepti ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We define “CSPlike ” operational semantics in the context of LTS’s: a severely restricted mode of describing operators which can express every operator of Hoare’s CSP. Furthermore we show that every operator with CSPlike operational semantics can be simulated in CSP with the addition of an exceptionthrowing operator P ΘA Q in which any occurrence of an event a ∈ A within P hands control to Q. Thus any language, all of whose operators are CSPlike, has a semantics over each of the behavioural models of CSP and a natural theory of refinement. This demonstrates that the extended CSP is a natural language to compile other notations into. We explore the range of possibilities for CSPlike languages, which include the πcalculus as demonstrated in a separate paper [18]. 1
Compositional Reasoning for MultiModal Logics ⋆
"... Abstract. We provide decomposition and quotienting results for multimodal logic with respect to a composition operator, traditionally used for epistemic models, due to van Eijck et al. (Journal of Applied NonClassical Logics 21(3–4):397–425, 2011), that involves sets of atomic propositions and valu ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We provide decomposition and quotienting results for multimodal logic with respect to a composition operator, traditionally used for epistemic models, due to van Eijck et al. (Journal of Applied NonClassical Logics 21(3–4):397–425, 2011), that involves sets of atomic propositions and valuation functions from Kripke models. While the composition operator was originally defined only for epistemic S5 n models, our results apply to the composition of any pair of Kripke models. In particular, our quotienting result extends a specific result in the above mentioned paper by van Eijck et al. for the composition of epistemic models with disjoint sets of atomic propositions to compositions of any two Kripke models regardless of their sets of atomic propositions. We also explore the complexity of the formulas we construct in our decomposition result. 1
Decompositional reasoning about the history of parallel processes
, 2010
"... Abstract. This paper presents a decomposition technique for HennessyMilner logic with past and its extension with recursively defined formulae. In order to highlight the main ideas and technical tools, processes are described using a subset of CCS with parallel composition, nondeterministic choice, ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. This paper presents a decomposition technique for HennessyMilner logic with past and its extension with recursively defined formulae. In order to highlight the main ideas and technical tools, processes are described using a subset of CCS with parallel composition, nondeterministic choice, action prefixing and the inaction constant. The study focuses on developing decompositional reasoning techniques for parallel contexts in that language. 1