Abstract
System verification in the broadest sense deals with those semantic properties that can be decided or deduced by analyzing a syntactical description of the system. Hence, one may consider the notions of redundancy and subsumption in this context as they are known from the area of rule-based systems. A rule is redundant if it can be removed without affecting the semantics of the system; it is subsumed by another rule if each application of the former one can be replaced by an application of the latter one with the same effect. In this paper, redundancy and subsumption are carried over from rule-based systems to high-level replacement systems, which in turn generalize graph and hypergraph grammars. The main results presented in this paper are a characterization of subsumption and a sufficient condition for redundancy, which involves composite productions.
Partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) and by the ESPRIT WorkingG roup APPLIGRAPH (Applications of Graph Transformation) through the University of Bremen and by the Spanish DGES project PB96-0191-C02-02 and CICYT project TIC98-0949-C02-01 HEMOSS.
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
Bollobás, B.: Graph Theory: An Introductory Course. Springer, Heidelberg (1979)
Buntine, W.: Generalized subsumption and its applications to induction and redundancy. Artificial Intelligence 36(2), 149–176 (1988)
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: Foundations of Rozenberg [10], ch. 3, vol. 1, pp. 163–245 (1997)
Ehrig, H., Habel, A., Kreowski, H.-J., Parisi-Presicce, F.: Parallelism and concurrency in high-level replacement systems. Mathematical Structures in Computer Science 1, 361–404 (1991)
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: Foundations of Rozenberg [10], ch. 4, vol. 1, pp. 247–312 (1997)
Ehrig, H., Löwe, M.: Categorical principles, techniques and results for high-level replacement systems in computer science. Applied Categorical Structures 1, 21–50 (1993)
Grosse-Rhode, M.: Algebra transformation systems and their composition. Lecture Notes in Computer Science 1382, 107–122 (1998)
Große-Rhode, M., Parisi-Presicce, F., Simeoni, M.: Spatial and temporal refinement of typed graph transformation systems. In: Brim, L., Gruska, J., Zlatuška, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 553–561. Springer, Heidelberg (1998)
Parisi-Presicce, F.: Transformations of graph grammars. In: Cuny, J.E., Ehrig, H., Engels, G., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol. 1073, pp. 428–442. Springer, Heidelberg (1996)
Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation: Foundations, vol. 1. World Scientific, Singapore (1997)
Tepandi, J.: Comparison of expert system verification criteria: Redundancy. In: Ayel, M., Laurent, J.-P. (eds.) Validation, Verification and Test of Knowledge-Based Systems, ch. 4, pp. 49–62. John Wiley & Sons, Chichester (1991)
Valiente, G.: Verification of knowledge base redundancy and subsumption using graph transformations. Int. Journal of Expert Systems 6(3), 341–355 (1993)
Valiente, G.: Knowledge Base Verification using Algebraic Graph Transformations. PhD thesis, University of the Balearic Islands (1994)
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
Kreowski, HJ., Valiente, G. (2000). Redundancy and Subsumption in High-Level Replacement Systems. 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_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-46464-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67203-6
Online ISBN: 978-3-540-46464-8
eBook Packages: Springer Book Archive