This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
10th Annual IEEE Symposium on Logic in Computer Science (LICS'95)
Efficient On-the-Fly Model Checking for CTL
San Diego, California
June 26-June 29
ISBN: 0-8186-7050-6
Girish Bhat, Department of Computer Science, North Carolina State University, Raleigh, NC
Rance Cleaveland, Department of Computer Science, North Carolina State University, Raleigh, NC
Orna Grumberg, Department of Computer Science, The Technion, Haifa, ISRAEL
This paper gives an on-the-fly algorithm for determining whether a finite-state system satisfies a formula in the temporal logic CTL*. The time complexity of our algorithm matches that of the best existing ``global algorithm'' for model checking in this logic, and it performs as well as the best known global algorithms for the sublogics CTL and LTL. In contrast with these approaches, however, our routine constructs the state space of the system under consideration in a need-driven fashion and will therefore perform better in practice.
Index Terms:
Model checking, temporal logic, program verification, formal methods
Citation:
Girish Bhat, Rance Cleaveland, Orna Grumberg, "Efficient On-the-Fly Model Checking for CTL," lics, pp.388, 10th Annual IEEE Symposium on Logic in Computer Science (LICS'95), 1995
Usage of this product signifies your acceptance of the Terms of Use.