Titlebook: ;

得罪

FACT

Exploiting Over- and Under-Approximations for Infinite-State Counterpart Modelsewrite rules that allow an unbounded creation of items. For such systems, verification can become intractable, thus calling for the development of approximation techniques that may ease the verification at the cost of losing in preciseness and completeness. Both over- and under-approximations have b

narcissism

Pattern-Based Graph Abstractionimple graphs describing structures of interest that should be preserved by the abstraction. Patterns are collected into ., layered graphs that capture the hierarchical composition of smaller patterns into larger ones. Pattern graphs are then abstracted to a finite universe of . by collapsing equival

邪恶的你

Working-Memory

Parallelism and Concurrency of Stochastic Graph Transformationse described as semi-Markov processes with graphs as states and transformations as transitions. The operational semantics of such processes can be explored through stochastic simulation. In this paper, we develop the basic theory of stochastic graph transformation, including generalisations of the Pa

萤火虫

Refined Graph Rewriting in Span-Categories (SqPO). In this paper, we present a framework that generalises all three approaches. The central issue is a gluing construction, which is a generalisation of the construction introduced in [14]. It has pushout-like properties wrt. composition . decomposition, which allow to reestablish major parts

heterogeneous

协迫

Toward Bridging the Gap between Formal Foundations and Current Practice for Triple Graph Grammarsith their correspondences. The classical theoretical model of triple graphs is based on a morphism span from the correspondence component to the source and target components. In practice, this formalization often can not be used as for certain applications no proper morphisms between the corresponde

最高点

Graph Transformation with Focus on Incident Edgesode may be cloned together with either all its incident edges or with only its outgoing edges or with only its incoming edges or with none of its incident edges. We thus subsume previous works such as the sesqui-pushout, the heterogeneous pushout and the adaptive star grammars approaches. We first d

embolus

Rational Term Rewriting Revisited: Decidability and Confluencee number of different subterms. Motivated by computability theory, we show a number of decidability results related to the rewrite relation and prove an effective version of a confluence theorem for orthogonal systems.