Issue No.02 - February (2001 vol.27)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.908961
<p><b>Abstract</b>—Symbolic model checking based on binary decision diagrams is a powerful formal verification technique for reactive systems. In this paper, we present various optimizations for improving the time and space efficiency of symbolic model checking for systems specified as statecharts. We used these techniques in our analyses of the models of a collision avoidance system and a fault-tolerant electrical power distribution (EPD) system, both used on commercial aircraft. The techniques together reduce the time and space requirements by orders of magnitude, making feasible some analysis that was previously intractable. We also elaborate on the results of verifying the EPD model. The analysis disclosed subtle modeling and logical flaws not found by simulation.</p>
Formal verification, symbolic model checking, binary decision diagrams, requirements specifications, statecharts, RSML, TCAS II, partitioned transition relation, automatic abstraction, fault tolerance, avionic systems.
Richard J. Anderson, Paul Beame, David H. Jones, David Notkin, William Chan, "Optimizing Symbolic Model Checking for Statecharts", IEEE Transactions on Software Engineering, vol.27, no. 2, pp. 170-190, February 2001, doi:10.1109/32.908961