Loading...
Loading...

Go to the content (press return)

Redundancy and subsumption in high-level replacement systems

Author
Hans-Joerg, K.; Valiente, G.
Type of activity
Journal article
Journal
Lecture notes in computer science
Date of publication
2000-09
Volume
1764
Number
1
First page
215
Last page
227
DOI
https://doi.org/10.1007/978-3-540-46464-8_15 Open in new window
URL
https://link.springer.com/chapter/10.1007/978-3-540-46464-8_15 Open in new window
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 l...
Group of research
ALBCOM - Algorithms, Computational Biology, Complexity and Formal Methods

Participants