loading...
Model Checking Branching Time Logics
Alicante, Spain June 28-June 30
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TIME.2007.5214th International Symposium on Tempo ...
 This Article 
 
PURCHASE ARTICLE: $0
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ph. Schnoebelen, LSV, ENS Cachan & CNRS, France
Branching-time logics are temporal logics that allow quantification over possible futures [3, 4]. Such logics have been considered very early by the automated verification community because efficient model-checking algorithms for logics like CTL could be easily implemented and were used successfully [1].
Citation:
Ph. Schnoebelen, "Model Checking Branching Time Logics," time, pp.5, 14th International Symposium on Temporal Representation and Reasoning (TIME'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.