499 search results - page 5 / 100 » LTL satisfiability checking |
TACAS
2007
Springer
14 years 3 months ago
2007
Springer
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
FOSSACS
2007
Springer
14 years 1 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
ICALP
2000
Springer
14 years 1 months ago
2000
Springer
Abstract A new unfolding approach to LTL model checking is presented, in which the model checking problem can be solved by direct inspection of a certain finite prefix. The techniq...
TPHOL
2005
IEEE
14 years 3 months ago
2005
IEEE
Using the HOL theorem prover, we proved the correctness of a translation from a subset of Accellera’s property specification language PSL to linear temporal logic LTL. Moreover,...
ECAI
2008
Springer
13 years 11 months ago
2008
Springer
Recent contributions to advancing planning from the classical model to more realistic problems include using temporal logic such as LTL to express desired properties of a solution ...