Applying the graph minor theorem to the verification of graph transformation systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5123 LNCS, Issue , 2008, Pages 214-226

  Joshi, Salil ^a   König, Barbara ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^b UNIVERSITY OF DUISBURG ESSEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTER AIDED ANALYSIS; FINITE AUTOMATA; GRAPH THEORY;

BACKWARD ANALYSIS; COMPUTER AIDED VERIFICATION; COVERING PROBLEMS; EXPLICIT CONSTRUCTIONS; GRAPH TRANSFORMATION SYSTEMS; INTERNATIONAL CONFERENCES; LEADER ELECTION; PUSH-OUT; STRUCTURED TRANSITION SYSTEMS; WELL-STRUCTURED TRANSITION SYSTEMS;

COMPUTATIONAL GEOMETRY;

EID: 48949093711     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70545-1_21     Document Type: Conference Paper

References (9)

1. Abdulla, P.A., Jonsson, B., Kindahl, M., Peled, D.: A general approach to partial order reductions in symbolic verification. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, pp. 379-390. Springer, Heidelberg (1998)
2. Baldan, P., Corradini, A., König, B.: A static analysis technique for graph transformation systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 381-395. Springer, Heidelberg (2001)
3. Ehrig, H., Heckel, R., Korff, M., Löwe, M., Ribeiro, L., Wagner, A., Corradini, A.: Algebraic approaches to graph transformation - part II: Single pushout approach and comparison with double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, ch. 4, vol. 1: Foundations, World Scientific, Singapore (1997)
4. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theoretical Computer Science 256(1-2), 63-92 (2001)
5. Löwe, M.: Algebraic approach to single-pushout graph transformation. Theoretical Computer Science 109, 181-224 (1993)
6. Rensink, A., Distefano, D.: Abstract graph transformation. In: Proc. of SVV 2005 (3rd International Workshop on Software Verification and Validation). ENTCS, vol. 157.1, pp. 39-59 (2005)
7. Robertson, N., Seymour, P.: Graph minors. XX. Wagner's conjecture. Journal of Combinatorial Theory, Series B 92(2), 325-357 (2004)
8. Robertson, N., Seymour, P.: Graph minors. XXIII. Nash-Williams' immersion conjecture (2006) (submitted for publication), http://www.math.princeton.edu/ ~pds/papers/GM23/GM23.pdf
9. Saksena, M., Wibling, O., Jonsson, B.: Graph grammar modeling and verification of ad hoc routing protocols. In: Proc. of TACAS 2008. LNCS, vol. 4963, pp. 18-32. Springer, Heidelberg (2008)