Abstract
Graph transformation units are rule-based devices to model graph algorithms, graph processes, and the dynamics of systems the states of which are represented by graphs. Given a graph, various rules are applicable at various matches in general, but not any choice leads to a proper result so that one faces the problem of nondeterminism. As countermeasure, graph transformation units provide the generic concept of control conditions which allow one to cut down the nondeterminism and to choose the proper rule applications out of all possible ones. In this paper, we propose an alternative approach. For a special type of graph transformation units including the solution of many NP-complete and NP-hard problems, the successful derivations from initial to terminal graphs are described by propositional formulas. In this way, it becomes possible to use a SAT solver to find out whether there is a successful derivation for some initial graph or not and how it is built up in the positive case.
The first two authors would like to acknowledge that their research is partially supported by the Collaborative Research Centre 637 (Autonomous Cooperating Logistic Processes: A Paradigm Shift and Its Limitations) funded by the German Research Foundation (DFG).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Biere, A., Cimatti, A., Clarke, E., Fujita, M., Zhu, Y.: Symbolic model checking using SAT procedures instead of BDDs. In: Design Automation Conf., pp. 317–320 (1999)
Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press, Amsterdam (2009)
Carnegie Mellon University, Graph Coloring Instances, http://mat.gsia.cmu.edu/COLOR/instances.html:
Cook, S.A.: The complexity of theorem-proving procedures. In: Proc. Third ACM Symposium on Theory of Computing, pp. 151–158 (1971)
Corradini, A., Ehrig, H., Heckel, R., Löwe, M., Montanari, U., Rossi, F.: Algebraic approaches to graph transformation part I: Basic concepts and double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation. Foundations, vol. 1, pp. 163–245. World Scientific, Singapore (1997)
Eén, N., Sörensson, N.: An extensible SAT solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)
Ehrig, H., Ehrig, K., Prange, U., Taentzer, G. (eds.): Fundamentals of Algebraic Graph Transformation. Springer, Heidelberg (2006)
Ganai, M., Gupta, A.: SAT-Based Scalable Formal Verification Solutions. Series on Integrated Circuits and Systems. Springer, Heidelberg (2007)
Hölscher, K., Klempien-Hinrichs, R., Knirsch, P.: Undecidable control conditions in graph transformation units. Electronic Notes in Theoretical Computer Science 195, 95–111 (2008)
Kreowski, H.-J., Kuske, S.: Graph transformation units with interleaving semantics. Formal Aspects of Computing 11(6), 690–723 (1999)
Kreowski, H.-J., Kuske, S., Rozenberg, G.: Graph transformation units – an overview. In: Degano, P., De Nicola, R., Meseguer, J. (eds.) Concurrency, Graphs and Models. LNCS, vol. 5065, pp. 57–75. Springer, Heidelberg (2008)
Kuske, S.: More about control conditions for transformation units. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol. 1764, pp. 323–337. Springer, Heidelberg (2000)
Litovski, I., Métivier, Y., Sopena, É.: Graph relabelling systems and distributed algorithms. In: Ehrig, H., Kreowski, H.-J., Montanari, U., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation. Concurrency, Parallelism, and Distribution, vol. 3, pp. 1–56. World Scientific, Singapore (1999)
Marques-Silva, J., Lynce, I.: Towards robust CNF encodings of cardinality constraints. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 483–497. Springer, Heidelberg (2007)
Soeken, M., Wille, R., Kuhlmann, M., Gogolla, M., Drechsler, R.: Verifying UML/OCL models using Boolean satisfiability. In: Design, Automation and Test in Europe, pp. 1341–1344 (2010)
Tseitin, G.: On the complexity of derivation in propositional calculus. In: Studies in Constructive Mathematics and Mathematical Logic, Part 2, pp. 115–125 (1968); Reprinted in: Siekmann, J., Wrightson, G. (eds.): Automation of Reasoning, vol. 2, pp. 466–483. Springer, Berlin (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kreowski, HJ., Kuske, S., Wille, R. (2010). Graph Transformation Units Guided by a SAT Solver. In: Ehrig, H., Rensink, A., Rozenberg, G., Schürr, A. (eds) Graph Transformations. ICGT 2010. Lecture Notes in Computer Science, vol 6372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15928-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-15928-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15927-5
Online ISBN: 978-3-642-15928-2
eBook Packages: Computer ScienceComputer Science (R0)