✦ LIBER ✦

On the expressivity and complexity of quantitative branching-time temporal logics

✍ Scribed by F. Laroussinie; Ph. Schnoebelen; M. Turuani

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 347 KB
Volume: 297
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00644-8

No coin nor oath required. For personal study only.

✦ Synopsis

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 for the largest logic we consider, while the introduction of freeze quantiÿers leads to a complexity blow-up.

📜 SIMILAR VOLUMES

The computational complexity of satisfia

The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic

✍ Cheng-Chia Chen; I-Peng Lin 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 627 KB

On the expressive power of temporal logi

On the expressive power of temporal logic for infinite words

✍ Joëlle Cohen-Chesnot 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 744 KB

The complexity of the temporal logic wit

The complexity of the temporal logic with “until” over general linear time

✍ M. Reynolds 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 350 KB

It is shown that the decision problem for the temporal logic with the strict until operator over general linear time is PSPACE-complete. This shows that it is no harder to reason with arbitrary linear orderings than with discrete linear time temporal logics. New techniques are used to give a PSPACE

The state complexity of ∑ ∗ $̄L and its

The state complexity of ∑ ∗ $̄L and its connection with temporal logic

✍ Jean-Camille Birget 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 363 KB

Temporal inference of workflow systems b

Temporal inference of workflow systems based on time petri nets: Quantitative and qualitative analysis

✍ Chuang Lin; Yang Qu 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB

Recently, a significant body of research has been dedicated to the analysis and verification of workflows without taking into account the temporal dimension of activities involved. Workflow also has a strong temporal aspect: activity sequencing, deadlines, routing conditions, and scheduling all invo

On the metric complexity of continuous-t

On the metric complexity of continuous-time systems

✍ Le Yi Wang; Lin Lin 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 531 KB

In this paper, metric complexities of certain classes of continuous-time systems are studied, using the time-domain sampling approach and the concepts of Kolmogorov, Gel'fand and sampling n-widths for certain classes of Sobolev space. A sampling theorem is obtained which extends Shannon's sampling t