Abstract
Graph-interpreted temporal logic is an extension of propositional temporal logic for specifying graph transition systems (i.e., transition systems whose states are graphs). Recently, this logic has been used for the specification and compositional verification of safety and liveness properties of rule-based graph transformation systems. However, no calculus or decision procedure for this logic has been provided, which is the purpose of this paper.
First we show that any sound and complete deduction calculus for propositional temporal logic is also sound and complete when interpreted on graph transition systems, that is, they have the same discriminating power like general transition systems. Then, structural properties of the state graphs are expressed by graphical constraints which interpret the propositional variables in the temporal formulas. For any such interpretation we construct a graph transition system which is typical and fully abstract. Typical here means that the constructed system satisfies a temporal formula if and only if the formula is true for all transition systems with this interpretation. By fully abstract we mean that any two states of the system that can not be distinguished by graphical constraints are equal. Thus, for a finite set of constraints we end up with a finite state transition system which is suitable for model checking.
Research partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) through the Technical University of Berlin and the University of Pisa.
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
Claßen, I., Gogolla, M., Löwe, M.: Dynamics in information systems: Specification, construction, and correctness. Technical Report 96–01, Technische Universität Berlin (1996)
Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., Löwe, M.: Algebraic approaches to graph transformation, Part I: Basic concepts and double pushout approach. In: Rozenberg [15], pp. 163–245
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 [15], pp. 247–312
Ehrig, H., Pfender, M., Schneider, H.J.: Graph grammars: an algebraic approach. In: 14th Annual IEEE Symposium on Switching and Automata Theory, pp. 167–180. IEEE, Los Alamitos (1973)
Gadducci, F., Heckel, R., Koch, M.: Model checking graph-interpreted temporal formulas. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol. 1764. Springer, Heidelberg (2000)
The Object Management Group. OMG UML Specification, V. 1.3 (1999)
Heckel, R.: Compositional verification of reactive systems specified by graph transformation. In: Fundamental Approaches to Software Engineering. LNCS, vol. 1382, pp. 138–153. Springer, Heidelberg (1998)
Heckel, R.: Open Graph Transformation Systems: A New Approach to the Compositional Modelling of Concurrent and Reactive Systems. PhD thesis, TU Berlin (1998)
Heckel, R., Corradini, A., Ehrig, H.: Horizontal and vertical structuring of typed graph transformation systems. Math. Struc. in Comp. Science 6(6), 613–648 (1996); Also Tech. Rep. 96-22, TU Berlin
Heckel, R., Ehrig, H., Wolter, U., Corradini, A.: Integrating the specification techniques of graph transformation and temporal logic. In: Privara, I., Ružička, P. (eds.) MFCS 1997. LNCS, vol. 1295, pp. 219–228. Springer, Heidelberg (1997)
Heckel, R., Wagner, A.: Ensuring consistency of conditional graph grammars – a constructive approach. In: Proc. of SEGRAGRA 1995 ”Graph Rewriting and Computation”, Electronic Notes of TCS, vol. 2 (1995), http://www.elsevier.nl/locate/entcs/volume2.html
Koch, M.: Modellierung und Nachweis der Konsistenz von verteilten Transaktionsmodellen für Datenbanksysteme mit algebraischen Graphgrammatiken. Technical Report 96-36, TU Berlin, Master’s thesis (1996)
Koch, M.: Integration of Graph Transformation and Temporal Logic for the Specification of Distributed Systems. PhD thesis, TU Berlin (1999)
Rasmussen, G., Henderson-Sellers, B., Low, G.C.: An object-oriented analysis and design notation for distributed systems. Object Currents 1(10) (1996)
Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations. World Scientific, Singapore (1997)
Rumbaugh, J., Blaha, M., Premerlani, W., Eddy, E., Lorenson, W.: Object-Oriented Modeling and Design. Prentice Hall International, Englewood Cliffs (1991)
Stirling, C.: Modal and temporal logics. In: Background: Computational structures. Handbook of Logic in Computer Science, vol. 2, pp. 477–563. Clarendon Press, Oxford (1992)
van Benthem, J.: Correspondence theory. In: Gabbay, D., Günther, F. (eds.) Handbook of Philosophical Logic, vol. II, pp. 167–248. Reidel, Dordrechtz (1984)
Wagner, A.: A Formal Object Specification Technique Using Rule-Based Transformation of Partial Algebras. PhD thesis, TU Berlin (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gadducci, F., Heckel, R., Koch, M. (2000). A Fully Abstract Model for Graph-Interpreted Temporal Logic. In: Ehrig, H., Engels, G., Kreowski, HJ., Rozenberg, G. (eds) Theory and Application of Graph Transformations. TAGT 1998. Lecture Notes in Computer Science, vol 1764. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46464-8_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-46464-8_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67203-6
Online ISBN: 978-3-540-46464-8
eBook Packages: Springer Book Archive