Results 1 
6 of
6
Saturated semantics for reactive systems
 LOGIC IN COMPUTER SCIENCE
, 2006
"... The semantics of process calculi has traditionally been specified by labelled transition systems (LTS), but with the development of name calculi it turned out that reaction rules (i.e., unlabelled transition rules) are often more natural. This leads to the question of how behavioural equivalences (b ..."
Abstract

Cited by 27 (15 self)
 Add to MetaCart
The semantics of process calculi has traditionally been specified by labelled transition systems (LTS), but with the development of name calculi it turned out that reaction rules (i.e., unlabelled transition rules) are often more natural. This leads to the question of how behavioural equivalences (bisimilarity, trace equivalence, etc.) defined for LTS can be transferred to unlabelled transition systems. Recently, in order to answer this question, several proposals have been made with the aim of automatically deriving an LTS from reaction rules in such a way that the resulting equivalences are congruences. Furthermore these equivalences should agree with the intended semantics, whenever one exists. In this paper we propose saturated semantics, based on a weaker notion of observation and orthogonal to all the previous proposals, and we demonstrate the appropriateness of our semantics by means of two examples: logic programming and a subset of the open πcalculus. Indeed, we prove that our equivalences are congruences and that they coincide with logical equivalence and open bisimilarity respectively, while equivalences studied in previous works are strictly finer.
Abstract Semantics by Observable Contexts
, 2008
"... The operational behavior of interactive systems is usually given in terms of transition systems labeled with actions, which, when visible, represent both observations and interactions with the external world. The abstract semantics is given in terms of behavioral equivalences, which depend on the ac ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
The operational behavior of interactive systems is usually given in terms of transition systems labeled with actions, which, when visible, represent both observations and interactions with the external world. The abstract semantics is given in terms of behavioral equivalences, which depend on the action labels and on the amount of branching structure considered. Behavioural equivalences are often congruences with respect to the operations of the language, and this property expresses the compositionality of the abstract semantics. A simpler approach, inspired by classical formalisms like λcalculus, Petri nets, term and graph rewriting, and pioneered by the Chemical Abstract Machine [1], defines operational semantics by means of structural axioms and reaction rules. Process calculi representing complex systems, in particular those able to generate and communicate names, are often defined in this way, since structural axioms give a clear idea of the intended structure of the states while reaction rules, which are often nonconditional, give a direct account of the possible steps. Transitions caused by reaction rules, however, are not labeled, since
Logical Specification of Operational Semantics
 IN CSL'99, PROC. CONF. ON COMPUTER SCIENCE LOGIC, VOLUME 1683 OF LNCS
, 1999
"... Various logicbased frameworks have been proposed for specifying the operational semantics of programming languages and concurrent systems, including inference systems in the styles advocated by Plotkin and by Kahn, Horn logic, equational specifications, reduction systems for evaluation contexts ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Various logicbased frameworks have been proposed for specifying the operational semantics of programming languages and concurrent systems, including inference systems in the styles advocated by Plotkin and by Kahn, Horn logic, equational specifications, reduction systems for evaluation contexts, rewriting logic, and tile logic. We consider
Deriving Labels and Bisimilarity for Concurrent Constraint Programming
, 2010
"... Abstract. Concurrent constraint programming (ccp) is a wellestablished model for concurrency that builds upon operational and algebraic notions from process calculi and firstorder logic. Bisimilarity is one of the central reasoning techniques in concurrency. The standard definition of bisimilarity ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Abstract. Concurrent constraint programming (ccp) is a wellestablished model for concurrency that builds upon operational and algebraic notions from process calculi and firstorder logic. Bisimilarity is one of the central reasoning techniques in concurrency. The standard definition of bisimilarity, however, is not completely satisfactory for ccp since it yields an equivalence that is too fine grained. By building upon recent foundational investigations, we introduce a labelled w.r.t. the typical observational equivalence in ccp. This way we provide ccp with a new proof technique for ccp coherent with existing ones.
Reactive Systems, (Semi)Saturated Semantics and Coalgebras on Presheaves
, 2009
"... The semantics of process calculi has traditionally been specified by labelled transition systems (ltss), but with the development of name calculi it turned out that reaction rules (i.e., unlabelled transition rules) are often more natural. This leads to the question of how behavioural equivalences ( ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The semantics of process calculi has traditionally been specified by labelled transition systems (ltss), but with the development of name calculi it turned out that reaction rules (i.e., unlabelled transition rules) are often more natural. This leads to the question of how behavioural equivalences (bisimilarity, trace equivalence, etc.) defined for lts can be transferred to unlabelled transition systems. Recently, in order to answer this question, several proposals have been made with the aim of automatically deriving an lts from reaction rules in such a way that the resulting equivalences are congruences. Furthermore these equivalences should agree with the standard semantics, whenever one exists. In this paper we propose saturated semantics, based on a weaker notion of observation and orthogonal to all the previous proposals, and we demonstrate the appropriateness of our semantics by means of two examples: logic programming and open Petri nets. We also show that saturated semantics can be efficiently characterized through the so called semisaturated games. Finally, we provide coalgebraic models relying on presheaves.