Abstract
Practical real-time model checking suffers from the state-explosion problem: the size of the state space grows exponentially with many system parameters: number of clocks, size of constants, number of system components. To cope with state explosion, we propose to use abstractions reducing the state-space while preserving reachability properties. Four exact, plus one safe abstractions are defined. In the main abstraction (simulation) a concrete state is mapped to a symbolic abstract state (a set of concrete states). The other four abstractions are defined on top of the simulation one. They can be computed on-the-fly in a completely orthogonal manner and thus can be combined to yield better reductions. A prototype implementation in the tool Kronos has permitted to verify two benchmark examples with a significant scale-up in size.
Cite
CITATION STYLE
Daws, C., & Tripakis, S. (1998). Model checking of real-time reachability properties using abstractions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1384, pp. 313–329). Springer Verlag. https://doi.org/10.1007/bfb0054180
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.