Results 1  10
of
25
Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting
, 2004
"... Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the DPO (doublepushout) approach to graph rewriting. Unlike in previous approaches, we consider graphs as objects, instead of arrows, ..."
Abstract

Cited by 62 (11 self)
 Add to MetaCart
Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the DPO (doublepushout) approach to graph rewriting. Unlike in previous approaches, we consider graphs as objects, instead of arrows, of the category under consideration. This allows us to present a very simple way of deriving labelled transitions (called rewriting steps with borrowed context) which smoothly integrates with the DPO approach, has a very constructive nature and requires only a minimum of category theory. The core part of this paper is the proof sketch that the bisimilarity based on rewriting with borrowed contexts is a congruence relation.
Reactive Systems over Cospans
, 2005
"... The theory of reactive systems, introduced by Leifer and Milner and previously extended by the authors, allows the derivation of wellbehaved labelled transition systems (LTS) for semantic models with an underlying reduction semantics. The derivation procedure requires the presence of certain colimi ..."
Abstract

Cited by 36 (2 self)
 Add to MetaCart
The theory of reactive systems, introduced by Leifer and Milner and previously extended by the authors, allows the derivation of wellbehaved labelled transition systems (LTS) for semantic models with an underlying reduction semantics. The derivation procedure requires the presence of certain colimits (or, more usually and generally, bicolimits) which need to be constructed separately within each model. In this paper, we o#er a general construction of such bicolimits in a class of bicategories of cospans. The construction sheds light on as well as extends Ehrig and Konig's rewriting via borrowed contexts and opens the way to a unified treatment of several applications.
Deriving Bisimulation Congruences using 2categories
, 2003
"... We introduce Grelativepushouts (GRPO) which are a 2categorical generalisation of relativepushouts (RPO). They are suitable for deriving labelled transition systems (LTS) for process calculi where terms are viewed modulo structural congruence. We develop their basic properties and show that bisim ..."
Abstract

Cited by 29 (10 self)
 Add to MetaCart
We introduce Grelativepushouts (GRPO) which are a 2categorical generalisation of relativepushouts (RPO). They are suitable for deriving labelled transition systems (LTS) for process calculi where terms are viewed modulo structural congruence. We develop their basic properties and show that bisimulation on the LTS derived via GRPOs is a congruence, provided that su#ciently many GRPOs exist. The theory is applied to a simple subset of CCS and the resulting LTS is compared to one derived using a procedure proposed by Sewell.
Bigraphical Reactive Systems: Basic Theory
 PROCEEDINGS OF THE INTERNATIONAL CONFERENCE OF MATHEMATICIANS
, 2001
"... A notion of bigraph is proposed as the basis for a model of mobile interaction. A bigraph consists of two independent structures: a topograph representing locality and a monograph representing connectivity. Bigraphs are equipped with reaction rules to form bigraphical reactive systems (BRSs), which ..."
Abstract

Cited by 25 (6 self)
 Add to MetaCart
A notion of bigraph is proposed as the basis for a model of mobile interaction. A bigraph consists of two independent structures: a topograph representing locality and a monograph representing connectivity. Bigraphs are equipped with reaction rules to form bigraphical reactive systems (BRSs), which include versions of the calculus and the ambient calculus. Bigraphs are shown to be a special case of a more abstract notion, wide reactive systems (WRSs), not assuming any particular graphical or other structure but equipped with a notion of width, which expresses that agents, contexts and reactions may all be widely distributed entities. A behavioural theory is established for WRSs using the categorical notion of relative pushout; it allows labelled transition systems to be derived uniformly, in such a way that familiar behavioural preorders and equivalences, in particular bisimilarity, are congruential under certain conditions. Then the theory of bigraphs is developed, and they are shown to meet these conditions. It is shown that, using certain functors, other WRSs which meet the conditions may also be derived; these may, for example, be forms of BRS with additional structure. Simple examples of bigraphical systems are discussed; the theory is developed in a number of ways in preparation for deeper application studies.
A BiCategorical Axiomatisation of Concurrent Graph Rewriting
, 1999
"... In this paper the concurrent semantics of doublepushout (DPO) graph rewriting, which is classically defined in terms of shiftequivalence classes of graph derivations, is axiomatised via the construction of a free monoidal bicategory. In contrast to a previous attempt based on 2categories, the us ..."
Abstract

Cited by 18 (10 self)
 Add to MetaCart
In this paper the concurrent semantics of doublepushout (DPO) graph rewriting, which is classically defined in terms of shiftequivalence classes of graph derivations, is axiomatised via the construction of a free monoidal bicategory. In contrast to a previous attempt based on 2categories, the use of bicategories allows to define rewriting on concrete graphs. Thus, the problem of composition of isomorphism classes of rewriting sequences is avoided. Moreover, as a first step towards the recovery of the full expressive power of the formalism via a purely algebraic description, the concept of disconnected rules is introduced, i.e., rules whose interface graphs are made of disconnected nodes and edges only. It is proved that, under reasonable assumptions, rewriting via disconnected rules enjoys similar concurrency properties like in the classical approach.
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 17 (11 self)
 Add to MetaCart
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.
Axioms for Contextual Net Processes
 In Automata, Languages and Programming, volume 1443 of LNCS
, 1998
"... . In the classical theory of Petri nets, a process is an operational description of the behaviour of a net, which takes into account the causal links between transitions in a sequence of firing steps. In the categorical framework developed in [19, 11], processes of a P/T net are modeled as arrows of ..."
Abstract

Cited by 14 (9 self)
 Add to MetaCart
. In the classical theory of Petri nets, a process is an operational description of the behaviour of a net, which takes into account the causal links between transitions in a sequence of firing steps. In the categorical framework developed in [19, 11], processes of a P/T net are modeled as arrows of a suitable monoidal category: In this paper we lay the basis of a similar characterization for contextual P/T nets, that is, P/T nets extended with read arcs, which allows a transition to check for the presence of a token in a place, without consuming it. 1 Introduction Petri nets [24] are probably the best studied and most used model for concurrent systems: Their range of applications covers a wide spectrum, from their use as a specification tool to their analysis as a suitable semantical domain. A recent extension to the classical model concerns a class of nets where transitions are able to check for the presence of a token in a place without actually consuming it. While the possibility ...
Normal Forms for Partitions and Relations
 Recent Trends in Algebraic Development Techniques, volume 1589 of Lect. Notes in Comp. Science
, 1999
"... Recently there has been a growing interest towards algebraic structures that are able to express formalisms different from the standard, treelike presentation of terms. Many of these approaches reveal a specific interest towards their application in the "distributed and concurrent systems" field, b ..."
Abstract

Cited by 14 (11 self)
 Add to MetaCart
Recently there has been a growing interest towards algebraic structures that are able to express formalisms different from the standard, treelike presentation of terms. Many of these approaches reveal a specific interest towards their application in the "distributed and concurrent systems" field, but an exhaustive comparison between them is difficult because their presentations can be quite dissimilar. This work is a first step towards a unified view, which is able to recast all those formalisms into a more general one, where they can be easily compared. We introduce a general schema for describing a characteristic normal form for many algebraic formalisms, and show that those normal forms can be thought of as arrows of suitable concrete monoidal categories.
Deriving Bisimulation Congruences: A 2categorical Approach
 In FOSSACS ’03, volume 2620 of LNCS
, 2002
"... We introduce Grelativepushouts (GRPO) which are a 2categorical generalisation of relativepushouts (RPO). They are suitable for deriving labelled transition systems (LTS) for process calculi where terms are viewed modulo structural congruence. We develop their basic properties and show that bisim ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
We introduce Grelativepushouts (GRPO) which are a 2categorical generalisation of relativepushouts (RPO). They are suitable for deriving labelled transition systems (LTS) for process calculi where terms are viewed modulo structural congruence. We develop their basic properties and show that bisimulation on the LTS derived via GRPOs is a congruence, provided that suciently many GRPOs exist. The theory is applied to a simple subset of CCS and the resulting LTS is compared to one derived using a procedure proposed by Sewell.
Observational Equivalence for Synchronized Graph Rewriting with Mobility
, 2001
"... We introduce a notion of bisimulation for graph rewriting systems, allowing us to prove observational equivalence for dynamically evolving graphs and networks. We use the framework of synchronized graph rewriting with mobility which we describe in two different, but operationally equivalent ways: on ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
We introduce a notion of bisimulation for graph rewriting systems, allowing us to prove observational equivalence for dynamically evolving graphs and networks. We use the framework of synchronized graph rewriting with mobility which we describe in two different, but operationally equivalent ways: on graphs defined as syntactic judgements and by using tile logic. One of the main results of the paper says that bisimilarity for synchronized graph rewriting is a congruence whenever the rewriting rules satisfy the basic source property. Furthermore we introduce an upto technique simplifying bisimilarity proofs and use it in an example to show the equivalence of a communication network and its specification.