| Abstract |
|
This paper deals with a branching time temporal query language called Min-max CTL which is similar in syntax to the popular temporal logic, CTL [7]. Min-max CTL can express timing queries on a timed model, whereas CTL is used for untimed systems. Interesting timing queries involving a combination of min and max can be expressed in Min-max CTL. While model checking using most timed temporal logics is PSPACE complete or harder [3, 2], it is shown in [10] that many practical timing queries, where we are interested in the worst case or best case timings, can be answered in polynomial time by querying the system using Min-max CTL. In this paper the syntax of Min-max CTL is extended to increase the expressive power of Min-max CTL.
|
 Additional Information
|
Citation:
Jatindra Kumar Deka,
"Reasoning about Extremal Properties of Events,"
time-ictl,
p. 26,
10th International Symposium on Temporal Representation and Reasoning and Fourth International Conference on Temporal Logic,
2003
|
