2009/12/11 by Pedro Pablo Pérez Velasco, Pedro Pablo Perez Velasco, Velasco, Pedro Pablo Perez
Biochemistry, Genetics and Molecular Biology · Computer Science · #DNA and Biological Computing #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Formal Methods in Verification #Model-Driven Software Engineering Techniques #cs.DM
paper · pdf · doi:10.48550/arxiv.0912.2160
25 pages, 11 figures
arxiv created 2009/12/11 · openalex publication_date 2009/12/11 · arxiv updated 2010/01/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In the Matrix approach to graph transformation we represent simple digraphs and rules with Boolean matrices and vectors, and the rewriting is expressed using Boolean operations only. In previous works, we developed analysis techniques enabling the study of the applicability of rule sequences, their independence, stated reachability and the minimal digraph able to fire a sequence. In [20], graph constraints and application conditions (so-called restrictions) have been studied in detail. In the present contribution we tackle the problem of translating post-conditions into pre-conditions and vice versa. Moreover, we shall see that application conditions can be moved along productions inside a sequence (restriction delocalization). As a practical-theoretical application we show how application conditions allow us to perform multidigraph rewriting (as opposed to simple digraph rewriting) using Matrix Graph Grammars