 |
|
|||
| Authors: | Kai Lampka |
| Group: | Computer Engineering |
| Type: | Techreport |
| Title: | Symbolic Reachability Graph Generation for High-level Models based on Synthesized Operators |
| Year: | 2009 |
| Month: | August |
| Pub-Key: | Lam09a |
| Keywords: | Binary Decision Diagrams and their algorithms, verification of systems |
| Rep Nbr: | 307 |
| Abstract: | This paper introduces a new technique for generating Binary Decision Diagrams (BDDs) representing high-level model's underlying state/transition systems. The obtained decision diagram may serve as input for various analysis methods such as symbolic (probabilistic) model checking and/or Markovian performance and reliability analysis. As usual the proposed technique makes use of partitioned symbolic reachability analysis. However, contrary to existing techniques it neither relies on pregenerated symbolic representations of transition relations, nor does it make use of standard BDD-manipulating algorithms. Instead, symbolic reachability analysis is carried out by means of customized BDD-algorithms directly synthesized from high-level models to be analyzed. Overall the presented approach yields the core of a new tool bench for the symbolic analysis of state-based system descriptions. The tool bench is implemented on top of the Eclipse Modeling Framework and exploits Java Emitter Templates for code synthesis. Standard benchmark models show that for generating high-level models underlying state/transition systems significant improvements with respect to CPU time and memory consumption can be realized, ultimately allowing the verification of larger and much more complex systems. |
| Location: | Gloriastr. 35, 8092 Zuerich |
| Resources: | [BibTeX] [Paper as PDF] |
