Results 1 
5 of
5
Subobject Transformation Systems
, 2008
"... Subobject transformation systems (STS) are proposed as a novel formal framework for the analysis of derivations of transformation systems based on the algebraic, doublepushout (DPO) approach. They can be considered as a simplified variant of DPO rewriting, acting in the distributive lattice of subo ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Subobject transformation systems (STS) are proposed as a novel formal framework for the analysis of derivations of transformation systems based on the algebraic, doublepushout (DPO) approach. They can be considered as a simplified variant of DPO rewriting, acting in the distributive lattice of subobjects of a given object of an adhesive category. This setting allows a direct analysis of all possible notions of dependency between any two productions without requiring an explicit match. In particular, several equivalent characterizations of independence of productions are proposed, as well as a local Church–Rosser theorem in the setting of STS. Finally, we show how any derivation tree in an ordinary DPO grammar leads to an STS via a suitable construction and show that relational reasoning in the resulting STS is sound and complete with respect to the independence in the original derivation tree.
Selfassembling trees
 SOS 2006
, 2006
"... RCCS is a variant of Milner's CCS where processes are allowed a controlled form of backtracking. It turns out that the RCCS reinterpretation of a CCS process is equivalent, in the sense of weak bisimilarity, to its causal transition system in CCS. This can be used to develop an efficient method for ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
RCCS is a variant of Milner's CCS where processes are allowed a controlled form of backtracking. It turns out that the RCCS reinterpretation of a CCS process is equivalent, in the sense of weak bisimilarity, to its causal transition system in CCS. This can be used to develop an efficient method for designing distributed algorithms, which we illustrate here by deriving a distributed algorithm for assembling trees. This requires solving a highly distributed consensus, and a comparison with a traditional CCSbased solution shows that the code we obtain is shorter, easier to understand, and easier to prove correct by hand, or even to verify.
M.: Computational selfassembly
"... The object of this paper is to appreciate the computational limits inherent in the combinatorics of an applied concurrent (aka agentbased) language κ. That language is primarily meant as a visual and concise notation for biological signalling pathways. Descriptions in κ, when enriched with suitable ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The object of this paper is to appreciate the computational limits inherent in the combinatorics of an applied concurrent (aka agentbased) language κ. That language is primarily meant as a visual and concise notation for biological signalling pathways. Descriptions in κ, when enriched with suitable kinetic information, generate simulations as continuous time Markov chains. However, κ can be studied independently of the intended application, in a purely computational fashion, and this is what we are doing here. Specifically, we define a compilation of κ into a language where interactions can involve at most two agents at a time. That compilation is generic, the blow up in the number of rules is linear in the total rule set size, and the methodology used in deriving the compilation relies on an implicit causality analysis. The correctness proof is given in details, and correctness is spelt out in terms of the existence of a specific weak bisimulation. To compensate for the binary restriction, one allows components to create unique identifiers (aka names). An interesting byproduct of the analysis is that when using acyclic rules, one sees that name creation is not needed, and κ can be fully reduced to binary form. 1
Philosopher
"... We present an application of the framework developed in [1] to the theory of graph transformation systems. Here we say “graph ” to mean an object of an arbitrary category with pushouts along monos where the local ChurchRosser theorem holds. An example is an adhesive category [6]. In order to establ ..."
Abstract
 Add to MetaCart
We present an application of the framework developed in [1] to the theory of graph transformation systems. Here we say “graph ” to mean an object of an arbitrary category with pushouts along monos where the local ChurchRosser theorem holds. An example is an adhesive category [6]. In order to establish the basic concepts we shall consider a concrete example, working in the category C of directed graphs whose vertices are tagged with the elements of a set; the presheaf topos C = Set ·→·⇔ ·. The edges of such graphs Philosopher fork eating thinking Table fork Fig. 1. Type graph T. will represent physical proximity of entities represented by the vertices. The elements with which vertices may be tagged represent the internal state of the entities. Let T be the graph illustrated in Fig 1. Then C/T is the adhesive category [6] of graphs typed over T.
ProjectTeam Moscova Mobility, Security, Concurrency, Verification and Analysis
"... d' ctivity eport 2006 Table of contents ..."