14th International Symposium on Temporal Representation and Reasoning (TIME'07) Alicante, Spain June 28-June 30 ISBN: 0-7695-2836-8
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TIME.2007.52
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. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||