499 search results - page 13 / 100 » LTL satisfiability checking |
89
Voted
ICPADS
2010
IEEE
14 years 11 months ago
2010
IEEE
CORR
2009
Springer
14 years 11 months ago
2009
Springer
140
Voted
MEMICS
2010
14 years 8 months ago
2010
103
click to vote
ATVA
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. It is well known that modelchecking and satisfiability of Linear Temporal Logic (LTL) are Pspace-complete. Wolper showed that with grammar operators, this result can be e...