This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
18th IEEE Real-Time Systems Symposium (RTSS '97)
On-the-fly symbolic model checking for real-time systems
San Francisco, CA
December 03-December 05
ISBN: 0-8186-8268-X
A. Bouajjani, VERIMAG, Gieres, France
S. Tripakis, VERIMAG, Gieres, France
S. Yovine, VERIMAG, Gieres, France
This paper presents an on-the-fly and symbolic algorithm for checking whether a timed automaton satisfies a formula of a timed temporal logic which is more expressive than TCTL. The algorithm is on-the-fly in the sense that the state-space is generated dynamically and only the minimal amount of information required by the verification procedure is stored in memory. The algorithm is symbolic in the sense that it manipulates sets of states, instead of states, which are represented as boolean combinations of linear inequalities of clocks. We show how a prototype implementation of our algorithm has improved the performances of the tool KRONOS for the verification of the FDDI protocol.
Index Terms:
temporal logic; on-the-fly symbolic model checking; real-time systems; timed automaton; timed temporal logic; boolean combinations; linear inequalities; FDDI protocol verification
Citation:
A. Bouajjani, S. Tripakis, S. Yovine, "On-the-fly symbolic model checking for real-time systems," rtss, pp.25, 18th IEEE Real-Time Systems Symposium (RTSS '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.