We investigate extensions of CTL allowing to express quantitative requirements about an abstract notion of time in a simple discrete-time framework, and study the expressive power of several relevant logics. When only subscripted modalities are used, polynomial-time model checking is possible even
β¦ LIBER β¦
The temporal logic of branching time
β Scribed by Mordechai Ben-Ari; Amir Pnueli; Zohar Manna
- Publisher
- Springer-Verlag
- Year
- 1983
- Tongue
- English
- Weight
- 948 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0001-5903
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On the expressivity and complexity of qu
β
F. Laroussinie; Ph. Schnoebelen; M. Turuani
π
Article
π
2003
π
Elsevier Science
π
English
β 347 KB
Dynamic epistemic logic with branching t
β
Tomohiro Hoshi; Audrey Yap
π
Article
π
2009
π
Springer Netherlands
π
English
β 442 KB
Prediction in Branching Time Logic
β
Giacomo Bonanno
π
Article
π
2001
π
John Wiley and Sons
π
English
β 168 KB
Axiomatization of βPeirceanβ branching-t
β
Alberto Zanardo
π
Article
π
1990
π
Springer Netherlands
π
English
β 716 KB
Investigations on Fragments of First Ord
β
Franco Montagna; G. Michele Pinna; B. P. Tiezzi
π
Article
π
2002
π
John Wiley and Sons
π
English
β 195 KB
Time-extraction for temporal logic-logic
β
Takashi Hattori
π
Article
π
1994
π
Elsevier Science
π
English
β 783 KB
Temporal logic is useful to describe a variety of computer systems such as operating systems and real-time process control systems, where explicit treatment of time plays an essential role. In the logic, the notion of time is represented by a sequence of states at each point in time, which is called