| タイトル | Controlling state explosion during automatic verification of delay-insensitive and delay-constrained VLSI systems using the POM verifier |
| 本文（外部サイト） | http://hdl.handle.net/2060/19940013892 |
| 著者（英） | Jensen, L.; Probst, D. |
| 著者所属（英） | Concordia Univ. |
| 発行日 | 1991-01-01 |
| 言語 | eng |
| 内容記述 | Delay-insensitive VLSI systems have a certain appeal on the ground due to difficulties with clocks; they are even more attractive in space. We answer the question, is it possible to control state explosion arising from various sources during automatic verification (model checking) of delay-insensitive systems? State explosion due to concurrency is handled by introducing a partial-order representation for systems, and defining system correctness as a simple relation between two partial orders on the same set of system events (a graph problem). State explosion due to nondeterminism (chiefly arbitration) is handled when the system to be verified has a clean, finite recurrence structure. Backwards branching is a further optimization. The heart of this approach is the ability, during model checking, to discover a compact finite presentation of the verified system without prior composition of system components. The fully-implemented POM verification system has polynomial space and time performance on traditional asynchronous-circuit benchmarks that are exponential in space and time for other verification systems. We also sketch the generalization of this approach to handle delay-constrained VLSI systems. |
| NASA分類 | ELECTRONICS AND ELECTRICAL ENGINEERING |
| レポートNO | 94N18365 |
| 権利 | No Copyright |
|
