Results 1  10
of
45
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 36 (18 self)
 Add to MetaCart
(Show Context)
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.
Matching of Bigraphs
 PREPRINT OF GTVC 2006
, 2006
"... We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way for a provably correct matching algorithm, as needed for an implementation of bigraphical reactive systems. ..."
Abstract

Cited by 23 (12 self)
 Add to MetaCart
(Show Context)
We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way for a provably correct matching algorithm, as needed for an implementation of bigraphical reactive systems.
Reactive Systems, Barbed Semantics, and the Mobile Ambients
"... Reactive systems, proposed by Leifer and Milner, represent a metaframework aimed at deriving behavioral congruences for those specification formalisms whose operational semantics is provided by rewriting rules. Despite its applicability, reactive systems suffered so far from two main drawbacks. Fir ..."
Abstract

Cited by 22 (6 self)
 Add to MetaCart
(Show Context)
Reactive systems, proposed by Leifer and Milner, represent a metaframework aimed at deriving behavioral congruences for those specification formalisms whose operational semantics is provided by rewriting rules. Despite its applicability, reactive systems suffered so far from two main drawbacks. First of all, no technique was found for recovering a set of inference rules, e.g. in the socalled SOS style, for describing the distilled observational semantics. Most importantly, the efforts focussed on strong bisimilarity, tackling neither weak nor barbed semantics. Our paper addresses both issues, instantiating them on a calculus whose semantics is still in a flux: Cardelli and Gordon’s mobile ambients. While the solution to the first issue is tailored over our case study, we provide a general framework for recasting (weak) barbed equivalence in the reactive systems formalism. Moreover, we prove that our proposal captures the behavioural semantics for mobile ambients proposed by Rathke and Sobociński and by Merro and Zappa Nardelli.
Process Bisimulation via a Graphical Encoding
 IN: ICGT ‘06. VOLUME 4178 OF LNCS
, 2006
"... The paper presents a case study on the synthesis of labelled transition systems (ltss) for process calculi, choosing as testbed Milner’s Calculus of Communicating System (ccs). The proposal is based on a graphical encoding: each ccs process is mapped into a graph equipped with suitable interfaces, s ..."
Abstract

Cited by 20 (12 self)
 Add to MetaCart
(Show Context)
The paper presents a case study on the synthesis of labelled transition systems (ltss) for process calculi, choosing as testbed Milner’s Calculus of Communicating System (ccs). The proposal is based on a graphical encoding: each ccs process is mapped into a graph equipped with suitable interfaces, such that the denotation is fully abstract with respect to the usual structural congruence. Graphs with interfaces are amenable to the synthesis mechanism based on borrowed contexts (bcs), proposed by Ehrig and König (which are an instance of relative pushouts, originally introduced by Milner and Leifer). The bc mechanism allows the effective construction of an lts that has graphs with interfaces as both states and labels, and such that the associated bisimilarity is automatically a congruence. Our paper focuses on the analysis of the lts distilled by exploiting the encoding of ccs processes: besides offering some technical contributions towards the simplification of the bc mechanism, the key result of our work is the proof that the bisimilarity on processes obtained via bcs coincides with the standard strong bisimilarity for ccs.
Labels from Reductions: Towards a General Theory
 In Algebra and Coalgebra in Computer Science, Calco ’05, volume 3629 of LNCS
, 2005
"... Abstract. We consider open terms and parametric rules in the context of the systematic derivation of labelled transitions from reduction systems. ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
Abstract. We consider open terms and parametric rules in the context of the systematic derivation of labelled transitions from reduction systems.
Reactive systems over directed bigraphs
 Proc. CONCUR 2007, Lecture Notes in Computer Science 4703 (2007
, 2007
"... Abstract. We study the construction of labelled transition systems from reactive systems defined over directed bigraphs, a computational metamodel which subsumes other variants of bigraphs. First we consider wide transition systems whose labels are all those generated by the IPO construction; the c ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
(Show Context)
Abstract. We study the construction of labelled transition systems from reactive systems defined over directed bigraphs, a computational metamodel which subsumes other variants of bigraphs. First we consider wide transition systems whose labels are all those generated by the IPO construction; the corresponding bisimulation is always a congruence. Then, we show that these LTSs can be simplified further by restricting to a subclass of labels, which can be characterized syntactically. We apply this theory to the Fusion calculus: we give an encoding of Fusion in directed bigraphs, and describe its simplified wide transition system and corresponding bisimulation. 1
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 13 (10 self)
 Add to MetaCart
(Show Context)
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.
A Behavioural Congruence for Web services
 In Arbab, F., Sarjani, M., eds.: Fundamentals of Software Engineering, LNCS (To appear
, 2007
"... Abstract. Web services are emerging as a promising technology for the development of next generation distributed heterogeneous software systems. We define a new behavioural equivalence for Web services, based on bisimilarity and inspired by recent advances in the theory of reactive systems. The prop ..."
Abstract

Cited by 13 (6 self)
 Add to MetaCart
(Show Context)
Abstract. Web services are emerging as a promising technology for the development of next generation distributed heterogeneous software systems. We define a new behavioural equivalence for Web services, based on bisimilarity and inspired by recent advances in the theory of reactive systems. The proposed equivalence is compositional and decidable, and it provides a firm ground for enhanced behaviouraware discovery and for a sound incremental development of services and service compositions. 1
Composition and decomposition of DPO transformations with borrowed contexts
, 2006
"... Doublepushout (DPO) transformations with borrowed context extend the standard DPO approach by allowing part of the graph needed in a transformation to be borrowed from the environment. The bisimilarity based on the observation of borrowed contexts is a congruence, thus facilitating system analysis ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
(Show Context)
Doublepushout (DPO) transformations with borrowed context extend the standard DPO approach by allowing part of the graph needed in a transformation to be borrowed from the environment. The bisimilarity based on the observation of borrowed contexts is a congruence, thus facilitating system analysis. In this paper, focusing on the situation in which the states of a global system are built out of local components, we show that DPO transformations with borrowed context defined on a global system state can be decomposed into corresponding transformations on the local states and vice versa. Such composition and decomposition theorems, developed in the framework of adhesive categories, can be seen as a first step towards an inductive definition, in sos style, of the labelled transition system associated to a graph transformation system. As a special case we show how an ordinary DPO transformation on a global system state can be decomposed into local DPO transformations with borrowed context using the same production.