445 search results - page 19 / 89 » Model Checking Quantitative Linear Time Logic |
98
Voted
STACS
2001
Springer
15 years 4 months ago
2001
Springer
Using an automata-theoretic approach, we investigate the decidability of liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on ...
IFM
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We present a framework for model checking concurrent software systems which incorporates both states and events. Contrary to other state/event approaches, our work also i...
105
click to vote
QEST
2008
IEEE
15 years 6 months ago
2008
IEEE
We present a new version of PROBDIVINE – a parallel tool for verification of probabilistic systems against properties formulated in linear temporal logic. Unlike the previous r...
95
Voted
IFIP
2004
Springer
15 years 5 months ago
2004
Springer
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...
ICALP
2003
Springer
15 years 4 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...