Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Efficient Reachability Analysis of Hierarchical Reactive Machines
 

Summary: Efficient Reachability Analysis of Hierarchical
Reactive Machines
R. Alur, R. Grosu, and M. McDougall
Department of Computer and Information Science
University of Pennsylvania
Email: alur,grosu,mmcdouga@cis.upenn.edu
URL: www.cis.upenn.edu/~alur,grosu,mmcdouga
Abstract. Hierarchical state machines is a popular visual formalism
for software specifications. To apply automated analysis to such speci­
fications, 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 reachabil­
ity analysis. We report on an enumerative as well as a symbolic checker,
and case studies.
1 Introduction
Recent advances in formal verification have led to powerful design tools for hard­

  

Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania

 

Collections: Computer Technologies and Information Sciences