1895 search results - page 89 / 379 » Using ATL for Checking Models |
164
click to vote
HYBRID
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...
141
click to vote
ICSOC
2003
Springer
15 years 10 months ago
2003
Springer
Converting a conventional contract into an electronic equivalent is not trivial. The difficulties are caused by the ambiguities that the original human-oriented text is likely to c...
138
click to vote
TACAS
1997
Springer
15 years 9 months ago
1997
Springer
Abstract. We have argued previously that the e ectiveness of a veri cation system derives not only from the power of its individual features for expression and deduction, but from ...
132
click to vote
IJCAI
2001
15 years 6 months ago
2001
Recent research has addressed the problem of planning in non-deterministic domains. Classical planning has also been extended to the case of goals that can express temporal proper...
122
Voted
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We consider the problem of bounded model checking (BMC) for linear temporal logic (LTL). We present several efficient encodings that have size linear in the bound. Furthe...