DMCA
Symbolic Model Checking for Real-time Systems (1992)
Cached
Download Links
- [www-cad.eecs.berkeley.edu]
- [www-cad.eecs.berkeley.edu]
- CiteULike
- DBLP
Other Repositories/Bibliography
| Venue: | INFORMATION AND COMPUTATION |
| Citations: | 578 - 50 self |
BibTeX
@ARTICLE{Henzinger92symbolicmodel,
author = {Thomas A. Henzinger and Xavier Nicollin and Joseph Sifakis and Sergio Yovine},
title = {Symbolic Model Checking for Real-time Systems},
journal = {INFORMATION AND COMPUTATION},
year = {1992},
volume = {111},
pages = {394--406}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We describe finite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space. For this purpose, we introduce a -calculus on computation trees over real-numbered time. Unfortunately, many standard program properties, such as response for all nonzeno execution sequences (during which time diverges), cannot be characterized by fixpoints: we show that the expressiveness of the timed -calculus is incomparable to the expressiveness of timed CTL. Fortunately, this result does not impair the symbolic verification of "implementable" real-time programs---those whose safety...
Keyphrases
symbolic model checking real-time system real-valued clock real-numbered time symbolic verification state space time diverges finite automaton guarded-command language computation tree clock variable branching-time specification finite-state program state predicate implementable real-time program timed ctl real-time program many standard program property nonzeno execution sequence timed calculus
