University of Minnesota
Software Engineering Center
/

You are here

Completeness and Consistency in Hierarchical State-Based Requirements.

Date of Publication: 
June 1996
Associated Research Groups: 
Abstract: 
This paper describes methods for automatically analyzing formal, state-based requirements specifications for some aspects of completeness and consistency. The approach uses a low-level functional formalism, simplifying the analysis process. State-space explosion problems are eliminated by applying the analysis at a high level of abstraction; i.e., instead of generating a reachability graph for analysis, the analysis is performed directly on the model. The method scales up to large systems by decomposing the specification into smaller, analyzable parts and then using functional compositional rules to ensure that verified properties hold for the entire specification. The analysis algorithms and tools have been validated on TCAS II, a complex, airborne, collision-avoidance system required on all commercial aircraft with more than 30 passengers that fly in U.S. airspace.
Venue: 
IEEE Transactions on Software Engineering, Vol. SE-22, No. 6, pp. 363--377 (June 1996)
bibtex: 
@Article{Heimdahl96:analysis, author = {Mats P. E. Heimdahl and Nancy G. Leveson}, title = {Completeness and Consistency in Hierarchical State-Base Requirements}, journal = {IEEE Transactions on Software Engineering}, year = {1996}, volume = {22}, number = {6}, month = {June}, pages = {363-377} }