Abstract. Adaptive star grammars generalize well-known graph grammar formalisms based on hyperedge and node replacement while retaining, e.g., parseability and the commutativity an...
Functional graph grammars are finite devices which generate the class of regular automata. We recall the notion of synchronization by grammars, and for any given grammar we consid...
We deal with mechanical documentation in software development tools. First, we review tabular forms for program specification and their formal syntax by an attribute edNCE graph ...
We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infi...
We generalize the unfolding semantics, previously developed for concrete formalisms such as Petri nets and graph grammars, to the setting of (single pushout) rewriting over adhesiv...
Paolo Baldan, Andrea Corradini, Tobias Heindel, Ba...