402 search results - page 22 / 81 » Model Checking Quantified Computation Tree Logic |
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
CONCUR
2004
Springer
14 years 3 months ago
2004
Springer
In this paper, we study the complexity of model-checking formulas of three important real-time logics (MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of rest...
ICALP
2003
Springer
14 years 3 months ago
2003
Springer
A special class of oracle circuits with tree-vector form is introduced. It is shown that they can be evaluated in deterministic polynomial-time with a polylog number of adaptive qu...
TACAS
2004
Springer
14 years 3 months ago
2004
Springer
Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the analysis of stochastic systems, or systems with imprecise formal models, tempor...
AAAI
1997
13 years 11 months ago
1997
This paper describes an approach for representing and manipulating sequences in description logics (DLs). The key idea is to represent sequences using sux trees, then represent t...