Compositional verification of reactive systems specified by graph transformation
A loose semantics for graph transformation rules which has been developed recently is used in this paper for the compositional verification of specifications. The main conceptual tool here is the notion of view, that is, an incomplete specification describing only a certain aspect of the overall sys...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buchkapitel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | A loose semantics for graph transformation rules which has been developed recently is used in this paper for the compositional verification of specifications. The main conceptual tool here is the notion of view, that is, an incomplete specification describing only a certain aspect of the overall system. A view anticipates the (potential) behavior of the complete system by its loose semantics. This ensures that properties of the view are inherited by the complete system.
Based on this result one may verify temporal properties by decomposing a specification into several views, analyzing them separately, and deriving the desired property from properties shown for the views. |
---|---|
ISSN: | 0302-9743 1611-3349 |
DOI: | 10.1007/BFb0053588 |