Abstract

This paper presents a general method for computing quantitative information about finite-state real-time sys-tems. We have developed algorithms that compute exact bounds on the delay between two speci$ed events and on the number of occurrences of an event in a given inter-val. This technique allows us to determine performance measures such as schedulability response time, and system load. Our algorithms produce more detailed information than traditional methods. This information leads to a better understanding of system behavior in addition to determin-ing its correctness. The algorithms presented in this paper are efficiently implemented using binary decision diagrams and have been incorporated into the SA4V symbolic model checker. Using this method, we have verified a model of an aircraft control system with lOI states. The results obtained demonstrate that our method can be successfully applied in the verification of real-time system designs.

Citations

2605	Graph-based algorithms for Boolean function manipulation - Bryant - 1986
1085	Automatic verification of finite-state concurrent systems using temporal logic specifications - Clarke, Emerson, et al. - 1986
464	Symbolic model checking: An approach to the state explosion problem - Mcmillan - 1992
371	Automata for modeling real-time systems - Alur, Dill - 1990
339	D.: Model-checking for real-time systems - Alur, Courcourbetis, et al. - 1990
319	Symbolic model checking: 10 states and beyond - Burch, Clarke, et al. - 1990
110	Quantitative temporal reasoning - Emerson, Mok, et al.
53	Rate monotonic analysis for real-time systems - Sha, Klein, et al. - 1991
45	Logics and models of real-time: a survey - Alur, Henzinger - 1992
30	Real-time symbolic model checking for discrete time models - Campos, Clarke - 1993