276 search results - page 7 / 56 » From Model-Checking to Temporal Logic Constraint Solving |
130
click to vote
CADE
2007
Springer
16 years 1 days ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
100
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
TOCL
2011
14 years 6 months ago
2011
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the s...
102
click to vote
CLIMA
2008
15 years 1 months ago
2008
Abstract. I present an overview of complexity results for model checking of temporal and strategic logics. Unfortunately, it is possible to manipulate the context so that different...
102
click to vote
RTSS
2005
IEEE
15 years 5 months ago
2005
IEEE
This paper presents a local algorithm for solving the universal parametric real-time model-checking problem. The problem may be phrased as follows: given a real-time system and te...