Efficient reachability analysis of hierarchical reactive machines (2000)
| Venue: | INTERNATIONAL CONFERENCE ON COMPUTER-AIDED VERIFICATION |
| Citations: | 22 - 5 self |
BibTeX
@INPROCEEDINGS{Alur00efficientreachability,
author = {R. Alur and R. Grosu and M. Mcdougall},
title = {Efficient reachability analysis of hierarchical reactive machines},
booktitle = {INTERNATIONAL CONFERENCE ON COMPUTER-AIDED VERIFICATION},
year = {2000},
pages = {280--295},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Hierarchical state machines is a popular visual formalism for software specifications. To apply automated analysis to such specifications, the traditional approach is to compile them to existing model checkers. Aimed at exploiting the modular structure more effectively, our approach is to develop algorithms that work directly on the hierarchical structure. First, we report on an implementation of a visual hierarchical language with modular features such as nested modes, variable scoping, mode reuse, exceptions, group transitions, and history. Then, we identify a variety of heuristics to exploit these modular features during reachability analysis. We report on an enumerative as well as a symbolic checker, and case studies.
