UNCOVER is a tool for high level verification of distributed or concurrent systems. It uses graphs and graph transformation rules to model these systems in a natural way. Errors in such a system are modelled by upward-closed sets for which two orders are provided, the subgraph and the minor ordering. We can then exploit the theory of well-structured transition systems to obtain exact or approxi...

The design of business or production systems frequently necessitates to simultaneously fulfill several logical and numerical constraints as requirements in order to deliver a functionally correct and optimal system. Such a problem can be typically formulated as a combined optimization and reachability analysis. In the current paper, we show how this problem can be formalized when the evolution ...

background: a highly efficient genetic transformation system is essential for a successful genetic manipulation of the african violet (saintpaulia ionantha wendl.).objectives: developing a particle bombardment-based genetic transformation system for the african violet.materials and methods: a local cultivar of the african violet from guilan province was used for transformation experiments. the ...

Implementing a graph programming system is not a straightforward task. The challenge not only lies in converting a graphical graph-based program into low-level machine code, but the code must correctly perform the complex and non-deterministic operation of graph transformation through graph rewriting rules. GP is a high-level graph programming language. Users of the GP system can write graph pr...

Cyber-physical systems achieve sophisticated system behavior exploring the tight interconnection of physical coupling present in classical engineering systems and information technology based coupling. A particular challenging case are systems where these cyber-physical systems are formed ad hoc according to the specific local topology, the available networking capabilities, and the goals and c...

Viatra2 (VIsual Automated model TRAnsformations) is a general-purpose model transformation engineering framework that aims at supporting the entire life-cycle, i.e. the specification, design, execution, validation and maintenance of transformations within and between various modeling languages and domains in the MDA. This paper reports on the current status of the tool and sketches some future ...

The unfolding semantics of graph transformation systems can represent a basis for their formal verification. For general, possibly infinite-state, graph transformation systems one can construct finite underand overapproximations of the (infinite) unfolding, with arbitrary accuracy. Such approximations can be used to check properties of a graph transformation system, like safety and liveness pro...

The project Safe Pointers by Graph Transformation at the University of York has developed a method for specifying the shape of pointer-data structures by graph reduction, and a static checking algorithm for proving the shape safety of graph transformation rules modelling operations on pointer structures. In this paper, we outline how to apply this approach to the C programming language. We exte...

a watching system in a graph $g=(v, e)$ is a set $w={omega_{1}, omega_{2}, cdots, omega_{k}}$, where $omega_{i}=(v_{i}, z_{i}), v_{i}in v$ and $z_{i}$ is a subset of closed neighborhood of $v_{i}$ such that the sets $l_{w}(v)={omega_{i}: vin omega_{i}}$ are non-empty and distinct, for any $vin v$. in this paper, we study the watching systems of line graph $k_{n}$ which is called triangular grap...