Results 1 
5 of
5
Deriving Bisimulation Congruences for Reactive Systems
 In Proc. of CONCUR 2000, 2000. LNCS 1877
, 2000
"... . The dynamics of reactive systems, e.g. CCS, has often been de ned using a labelled transition system (LTS). More recently it has become natural in de ning dynamics to use reaction rules  i.e. unlabelled transition rules  together with a structural congruence. But LTSs lead more naturally to beha ..."
Abstract

Cited by 117 (14 self)
 Add to MetaCart
. The dynamics of reactive systems, e.g. CCS, has often been de ned using a labelled transition system (LTS). More recently it has become natural in de ning dynamics to use reaction rules  i.e. unlabelled transition rules  together with a structural congruence. But LTSs lead more naturally to behavioural equivalences. So one would like to derive from reaction rules a suitable LTS. This paper shows how to derive an LTS for a wide range of reactive systems. A label for an agent a is de ned to be any context F which intuitively is just large enough so that the agent Fa (\a in context F ") is able to perform a reaction. The key contribution of this paper is a precise de nition of \just large enough", in terms of the categorical notion of relative pushout (RPO), which ensures that bisimilarity is a congruence when sucient RPOs exist. Two examples  a simpli ed form of action calculi and termrewriting  are given, for which it is shown that su cient RPOs indeed exist. The thrust of thi...
From Action Calculi to Linear Logic
, 1998
"... . Milner introduced action calculi as a framework for investigating models of interactive behaviour. We present a typetheoretic account of action calculi using the propositionsastypes paradigm; the type theory has a sound and complete interpretation in Power's categorical models. We go on to ..."
Abstract

Cited by 19 (7 self)
 Add to MetaCart
. Milner introduced action calculi as a framework for investigating models of interactive behaviour. We present a typetheoretic account of action calculi using the propositionsastypes paradigm; the type theory has a sound and complete interpretation in Power's categorical models. We go on to give a sound translation of our type theory in the (type theory of) intuitionistic linear logic, corresponding to the relation between Benton's models of linear logic and models of action calculi. The conservativity of the syntactic translation is proved by a modelembedding construction using the Yoneda lemma. Finally, we briefly discuss how these techniques can also be used to give conservative translations between various extensions of action calculi. 1 Introduction Action calculi arose directly from the ßcalculus [MPW92]. They were introduced by Milner [Mil96], to provide a uniform notation for capturing many calculi of interaction such as the ßcalculus, the calculus, models of distribut...
Graphical Presentations of Interactive Systems
, 1999
"... this paper consist of directed graphs containing nodes, denoted by K; L; M , and wires connecting the nodes. For the moment, a node K looks like K k l where the number of wires going in and out of K depends on the specification of K given by a signature. The signature K = (P; K) consists of a set P ..."
Abstract
 Add to MetaCart
this paper consist of directed graphs containing nodes, denoted by K; L; M , and wires connecting the nodes. For the moment, a node K looks like K k l where the number of wires going in and out of K depends on the specification of K given by a signature. The signature K = (P; K) consists of a set P of basic types, called prime arities and denoted by p; q; r; : : : , and a set
Analysis and Verification of Systems with Dynamically Evolving Structure
"... This thesis is concerned with verification and analysis techniques for software systems characterized by dynamically evolving structure, such as dynamic creation and deletion of objects, mobility and variable topology. Examples for such systems are pointer structures, objectbased systems and commun ..."
Abstract
 Add to MetaCart
This thesis is concerned with verification and analysis techniques for software systems characterized by dynamically evolving structure, such as dynamic creation and deletion of objects, mobility and variable topology. Examples for such systems are pointer structures, objectbased systems and communication protocols in which the number of participants is not constant. The approach taken here is based on graph transformation systems, an intuitive and—at the same time—powerful formalism for the modelling of distributed and mobile systems. So far there exists comparatively little research concerning the verification of graph rewriting. We will—in the first part of this thesis—introduce graph transformations and give an overview of existing analysis and verification methods, with a focus on the verification of systems with dynamically evolving structure. Then we will describe three original lines of research: behavioural equivalences, type systems and approximation by Petri nets, all of them concerned with the analysis of