H.J. Sander Bruggink. Towards a systematic method for proving termination of graph transformation systems. In Proceedings of GT-VC '07, 2007. |
|
Andrea Corradini, Fabio Gadducci, Wolfram Kahl, and Barbara König. Inequational deduction as term graph rewriting. In Proc. of TERMGRAPH '02 (International Workshop on Term Graph Rewriting), volume 72.1 of ENTCS, pages 31–44. Elsevier, 2007. |
|
Arend Rensink, Reiko Heckel, and Barbara König, editors. Proc. of GT-VC '06 (Graph Transformation for Verification and Concurrency), volume 175.4 of ENTCS. Elsevier, 2007. |
|
Barbara König. Graph transformation systems, Petri nets and semilinear sets: Checking for the absence of forbidden paths in graphs. In Proc. of PNGT '06 (Workshop on Petri Nets and Graph Transformation), volume 2 of Electronic Communications of the EASST, 2007. |
|
Paolo Baldan, Andrea Corradini, Barbara König, and Alberto Lluch Lafuente. A temporal graph logic for verification of graph transformation systems. In Proc. of WADT '06 (Workshop on Algebraic Development Techniques), pages 1–20. Springer, 2007. LNCS 4409. |
|
Guilherme Rangel, Barbara König, and Hartmut Ehrig. Bisimulation verification for the DPO approach with borrowed contexts. In Proc. of GT-VMT '07 (Workshop on Graph Transformation and Visual Modeling Techniques), volume 6 of Electronic Communications of the EASST, 2007. |
|
Barbara König and Vitali Kozioura. Incremental construction of coverability graphs. Information Processing Letters, 103(5):203–209, 2007. |
|
Paolo Baldan, Andrea Corradini, Hartmut Ehrig, Reiko Heckel, and Barbara König. Bisimilarity and behaviour-preserving reconfigurations of open Petri nets. In Proc. of CALCO '07 (Algebra and Coalgebra in Computer Science), pages 126–142. Springer, 2007. LNCS 4624. |
|
Paolo Baldan, Andrea Corradini, Barbara König, and Stefan Schwoon. McMillan's complete prefix for contextual nets. In Proc. of UFO '07 (Workshop on unfolding and partial order techniques), 2007. |
|
Barbara König. Deriving bisimulation congruences with borrowed contexts (invited talk). In Proc. of CALCO '07 (Algebra and Coalgebra in Computer Science), pages 36–39. Springer, 2007. LNCS 4624. |
|