Results 1  10
of
13
Towards a Mathematical Operational Semantics
 In Proc. 12 th LICS Conf
, 1997
"... We present a categorical theory of `wellbehaved' operational semantics which aims at complementing the established theory of domains and denotational semantics to form a coherent whole. It is shown that, if the operational rules of a programming language can be modelled as a natural transformation ..."
Abstract

Cited by 134 (9 self)
 Add to MetaCart
We present a categorical theory of `wellbehaved' operational semantics which aims at complementing the established theory of domains and denotational semantics to form a coherent whole. It is shown that, if the operational rules of a programming language can be modelled as a natural transformation of a suitable general form, depending on functorial notions of syntax and behaviour, then one gets both an operational model and a canonical, internally fully abstract denotational model for free; moreover, both models satisfy the operational rules. The theory is based on distributive laws and bialgebras; it specialises to the known classes of wellbehaved rules for structural operational semantics, such as GSOS.
A Congruence Theorem for Structured Operational Semantics With Predicates
, 1993
"... . We proposed a syntactical format, the path format, for structured operational semantics in which predicates may occur. We proved that strong bisimulation is a congruence for all the operators that can be defined within the path format. To show that this format is useful we provided many examples t ..."
Abstract

Cited by 108 (5 self)
 Add to MetaCart
. We proposed a syntactical format, the path format, for structured operational semantics in which predicates may occur. We proved that strong bisimulation is a congruence for all the operators that can be defined within the path format. To show that this format is useful we provided many examples that we took from the literature about CCS, CSP, and ACP; they do satisfy the path format but no formats proposed by others. The examples include concepts like termination, convergence, divergence, weak bisimulation, a zero object, side conditions, functions, real time, discrete time, sequencing, negative premises, negative conclusions, and priorities (or a combination of these notions). Key Words & Phrases: structured operational semantics, term deduction system, transition system specification, structured state system, labelled transition system, strong bisimulation, congruence theorem, predicate. 1980 Mathematics Subject Classification (1985 Revision): 68Q05, 68Q55. CR Categories: D.3.1...
Ntyft/ntyxt rules reduce to ntree rules
 Information and Computation
, 1996
"... Groote and Vaandrager introduced the tyft/tyxt format for Transition System Specifications (TSSs), and established that for each TSS in this format that is wellfounded, the bisimulation equivalence it induces is a congruence. In this paper, we construct for each TSS in tyft/tyxt format an equivalen ..."
Abstract

Cited by 54 (18 self)
 Add to MetaCart
Groote and Vaandrager introduced the tyft/tyxt format for Transition System Specifications (TSSs), and established that for each TSS in this format that is wellfounded, the bisimulation equivalence it induces is a congruence. In this paper, we construct for each TSS in tyft/tyxt format an equivalent TSS that consists of tree rules only. As a corollary we can give an affirmative answer to an open question, namely whether the wellfoundedness condition in the congruence theorem for tyft/tyxt can be dropped. These results extend to tyft/tyxt with negative premises and predicates. 1
A complete equational axiomatization for prefix iteration
 Information Processing Letters
, 1994
"... Prefix iteration a∗x is added to Minimal Process Algebra (MPAδ), which is a subalgebra of BPAδ equivalent to Milner’s basic CCS. We present a finite equational axiomatization for MPA ∗ δ, and prove that this axiomatization is complete with respect to strong bisimulation equivalence. To obtain this r ..."
Abstract

Cited by 21 (7 self)
 Add to MetaCart
Prefix iteration a∗x is added to Minimal Process Algebra (MPAδ), which is a subalgebra of BPAδ equivalent to Milner’s basic CCS. We present a finite equational axiomatization for MPA ∗ δ, and prove that this axiomatization is complete with respect to strong bisimulation equivalence. To obtain this result, we set up a term rewriting system, based on the axioms, and show that bisimilar terms have the same normal form. 1
Full Abstraction in Structural Operational Semantics (Extended Abstract)
 Proceedings 3rd Conference on Algebraic Methodology and Software Technology (AMAST'93), Enschede, Workshops in Computing
, 1993
"... ion in Structural Operational Semantics (extended abstract) Rob van Glabbeek Computer Science Department, Stanford University Stanford, CA 94305, USA rvg@cs.stanford.edu Abstract This paper explores the connection between semantic equivalences for concrete sequential processes, represented by m ..."
Abstract

Cited by 19 (3 self)
 Add to MetaCart
ion in Structural Operational Semantics (extended abstract) Rob van Glabbeek Computer Science Department, Stanford University Stanford, CA 94305, USA rvg@cs.stanford.edu Abstract This paper explores the connection between semantic equivalences for concrete sequential processes, represented by means of transition systems, and formats of transition system specifications using Plotkin's structural approach. For several equivalences in the linear time  branching time spectrum a format is given, as general as possible, such that this equivalence is a congruence for all operators specifiable in that format. And for several formats it is determined what is the coarsest congruence with respect to all operators in this format that is finer than partial or completed trace equivalence. 1 Preorders and equivalences on labelled transition systems Definition 1 A labelled transition system (LTS) is a pair (IP; \Gamma!) with IP a set (of processes) and \Gamma!` IP \Theta A \Theta IP for A a se...
Axiomatising STBisimulation Equivalence
 in Proc. of the IFIP Working Conf. on Programming Concepts, Methods and Calculi (PROCOMET '94
, 1994
"... s are available from the same host in the directory /pub/TR/UBLCS/ABSTRACTS in plain text format. All local authors can be reached via email at the address lastname@cs.unibo.it. UBLCS Technical Report Series 9315 Data Algorithm: A Numerical Method to Extract Shape Information from Gray Scale Ima ..."
Abstract

Cited by 12 (7 self)
 Add to MetaCart
s are available from the same host in the directory /pub/TR/UBLCS/ABSTRACTS in plain text format. All local authors can be reached via email at the address lastname@cs.unibo.it. UBLCS Technical Report Series 9315 Data Algorithm: A Numerical Method to Extract Shape Information from Gray Scale Images, R. Davoli, F. Tamburini, June 1993. 9316 Towards Performance Evaluation in Process Algebras, R. Gorrieri, M. Roccetti, July 1993. 9317 Split and ST Bisimulation Semantics, R. Gorrieri, C. Laneve, July 1993. 9318 Multilanguage Interoperability, G. Attardi, M. Gaspari, July 1993. 9319 HERMES: an Expert System for the Prognosis of Hepatic Diseases, I. Bonf a, C. Maioli, F. Sarti, G.L. Milandri, P.R. Dal Monte, September 1993. 9320 An Information Flow Security Property for CCS, R. Focardi, R. Gorrieri, October 1993. 9321 A Classification of Security Properties, R. Focardi, R. Gorrieri, October 1993. 9322 Real Time Systems: A Tutorial, F. Panzieri, R. Davoli, October 1993. 9323 A Sca...
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
General structural operational semantics through categorical logic (Extended Abstract)
, 2008
"... Certain principles are fundamental to operational semantics, regardless of the languages or idioms involved. Such principles include rulebased definitions and proof techniques for congruence results. We formulate these principles in the general context of categorical logic. From this general formul ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
Certain principles are fundamental to operational semantics, regardless of the languages or idioms involved. Such principles include rulebased definitions and proof techniques for congruence results. We formulate these principles in the general context of categorical logic. From this general formulation we recover precise results for particular language idioms by interpreting the logic in particular categories. For instance, results for firstorder calculi, such as CCS, arise from considering the general results in the category of sets. Results for languages involving substitution and name generation, such as the πcalculus, arise from considering the general results in categories of sheaves and group actions. As an extended example, we develop a tyft/tyxtlike rule format for open bisimulation in the πcalculus.
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.
Reniers. Timed process algebra (with a focus on explicit termination and relativetiming
 Proceedings of the International School on Formal Methods for the Design of RealTime Systems (SFMRT’04), volume 3185 of Lecture Notes in Computer Science
, 2004
"... Abstract. We treat theory and application of timed process algebra. We focus on a variant that uses explicit termination and action prefixing. This variant has some advantages over other variants. We concentrate on relative timing, but the treatment of absolute timing is similar. We treat both discr ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. We treat theory and application of timed process algebra. We focus on a variant that uses explicit termination and action prefixing. This variant has some advantages over other variants. We concentrate on relative timing, but the treatment of absolute timing is similar. We treat both discrete and dense timing. We build up the theory incrementally. The different algebras are interrelated by embeddings and conservative extensions. As an example, we consider the PAR communication protocol. 1