
Parallelism Theorem and Derived Rules for Parallel Coherent Transformations
An Independent Parallelism Theorem is proven in the theory of adhesive H...
read it

A SetTheoretic Framework for Parallel Graph Rewriting
We tackle the problem of attributed graph transformations and propose a ...
read it

On Transitive Consistency for Linear Invertible Transformations between Euclidean Coordinate Systems
Transitive consistency is an intrinsic property for collections of linea...
read it

A Unified Framework of Elementary Geometric Transformation Representation
As an extension of projective homology, stereohomology is proposed via a...
read it

Task Graph Transformations for Latency Tolerance
The Integrative Model for Parallelism (IMP) derives a task graph from a ...
read it

Computational Aspects of the Mobius Transform
In this paper we associate with every (directed) graph G a transformatio...
read it

Allocations of Standby Redundancies to Coherent Systems with Dependent Components
In the context of industrial engineering, standby allocation strategy is...
read it
True Parallel Graph Transformations: an Algebraic Approach Based on Weak Spans
We address the problem of defining graph transformations by the simultaneous application of direct transformations even when these cannot be applied independently of each other. An algebraic approach is adopted, with production rules of the form LlK i I r R, called weak spans. A parallel coherent transformation is introduced and shown to be a conservative extension of the interleaving semantics of parallel independent direct transformations. A categorical construction of finitely attributed structures is proposed, in which parallel coherent transformations can be built in a natural way. These notions are introduced and illustrated on detailed examples.
READ FULL TEXT
Comments
There are no comments yet.