Results 1 
6 of
6
Structural Operational Semantics
 Handbook of Process Algebra
, 1999
"... Structural Operational Semantics (SOS) provides a framework to give an operational semantics to programming and specification languages, which, because of its intuitive appeal and flexibility, has found considerable application in the theory of concurrent processes. Even though SOS is widely use ..."
Abstract

Cited by 125 (19 self)
 Add to MetaCart
Structural Operational Semantics (SOS) provides a framework to give an operational semantics to programming and specification languages, which, because of its intuitive appeal and flexibility, has found considerable application in the theory of concurrent processes. Even though SOS is widely used in programming language semantics at large, some of its most interesting theoretical developments have taken place within concurrency theory. In particular, SOS has been successfully applied as a formal tool to establish results that hold for whole classes of process description languages. The concept of rule format has played a major role in the development of this general theory of process description languages, and several such formats have been proposed in the research literature. This chapter presents an exposition of existing rule formats, and of the rich body of results that are guaranteed to hold for any process description language whose SOS is within one of these formats. As far as possible, the theory is developed for SOS with features like predicates and negative premises.
A menagerie of nonfinitely based process semantics over BPA*—from ready simulation to completed traces
 Mathematical Structures in Computer Science
, 1998
"... Fokkink and Zantema ((1994) Computer Journal 37:259–267) have shown that bisimulation equivalence has a finite equational axiomatization over the language of Basic Process Algebra with the binary Kleene star operation (BPA ∗). In the light of this positive result on the mathematical tractability of ..."
Abstract

Cited by 24 (19 self)
 Add to MetaCart
Fokkink and Zantema ((1994) Computer Journal 37:259–267) have shown that bisimulation equivalence has a finite equational axiomatization over the language of Basic Process Algebra with the binary Kleene star operation (BPA ∗). In the light of this positive result on the mathematical tractability of bisimulation equivalence over BPA ∗ , a natural question to ask is whether any other (pre)congruence relation in van Glabbeek’s linear time/branching time spectrum is finitely (in)equationally axiomatizable over it. In this paper, we prove that, unlike bisimulation equivalence, none of the preorders and equivalences in van Glabbeek’s linear time/branching time spectrum, whose discriminating power lies in between that of ready simulation and that of completed traces, has a finite equational axiomatization. This we achieve by exhibiting a family of (in)equivalences that holds in ready simulation semantics, the finest semantics that we consider, whose instances cannot all be proven by means of any finite set of (in)equations
Equational axioms for probabilistic bisimilarity
 IN PROCEEDINGS OF 9TH AMAST, LECTURE NOTES IN COMPUTER SCIENCE
, 2002
"... This paper gives an equational axiomatization of probabilistic bisimulation equivalence for a class of finitestate agents previously studied by Stark and Smolka ((2000) Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 571595). The axiomatization is obtained by extending ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
This paper gives an equational axiomatization of probabilistic bisimulation equivalence for a class of finitestate agents previously studied by Stark and Smolka ((2000) Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 571595). The axiomatization is obtained by extending the general axioms of iteration theories (or iteration algebras), which characterize the equational properties of the fixed point operator on (#)continuous or monotonic functions, with three axiom schemas that express laws that are specific to probabilistic bisimilarity.
An Equational Axiomatization for MultiExit Iteration
 Information and Computation
, 1996
"... This paper presents an equational axiomatization of bisimulation equivalence over the language of Basic Process Algebra (BPA) with multiexit iteration. Multiexit iteration is a generalization of the standard binary Kleene star operation that allows for the specification of agents that, up to bis ..."
Abstract

Cited by 13 (8 self)
 Add to MetaCart
This paper presents an equational axiomatization of bisimulation equivalence over the language of Basic Process Algebra (BPA) with multiexit iteration. Multiexit iteration is a generalization of the standard binary Kleene star operation that allows for the specification of agents that, up to bisimulation equivalence, are solutions of systems of recursion equations of the form Xn = PnX 1 + Qn where n is a positive integer, and the P i and the Q i are process terms. The addition of multiexit iteration to BPA yields a more expressive language than that obtained by augmenting BPA with the standard binary Kleene star (BPA # ). As a consequence, the proof of completeness of the proposed equational axiomatization for this language, although standard in its general structure, is much more involved than that for BPA # . An expressiveness hierarchy for the family of kexit iteration operators proposed by Bergstra, Bethke and Ponse is also o#ered.
Conservative extension in structural operational semantics
 Bulletin of the European Association for Theoretical Computer Science
, 1999
"... An extension of a structural definition of an operational semantics is (operationally) conservative if it does not affect the semantics of terms over the original signature. We present a survey of syntactic formats that have been developed to guarantee that such an extension is conservative. We also ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
An extension of a structural definition of an operational semantics is (operationally) conservative if it does not affect the semantics of terms over the original signature. We present a survey of syntactic formats that have been developed to guarantee that such an extension is conservative. We also give an overview of properties, in the realm of equational specification and term rewriting, that can be derived from the fact that an extension of an operational semantics is conservative. 1
Conservative Extension in Structural Operational Semantics
 Bulletin of the European Association for Theoretical Computer Science
, 1999
"... Introduction Structural operational semantics (SOS) [44] provides a framework to give an operational semantics to programming and specification languages. In particular, because of its intuitive appeal and flexibility, SOS has found considerable application in the study of the semantics of concurre ..."
Abstract
 Add to MetaCart
Introduction Structural operational semantics (SOS) [44] provides a framework to give an operational semantics to programming and specification languages. In particular, because of its intuitive appeal and flexibility, SOS has found considerable application in the study of the semantics of concurrent processes. SOS generates a labelled transition system, whose states are the closed terms over an algebraic signature, and whose transitions are supplied with labels. The transitions between states are obtained inductively from a transition system specification (TSS), which consists of socalled transition rules of the form premises conclusion . A typical example of a transition rule is x a ! x 0 xky a ! x 0 ky stipulating that if t a ! t 0 holds for closed terms t and t