5216 search results - page 149 / 1044 » Planning as Model Checking |
116
click to vote
CAV
1998
Springer
15 years 5 months ago
1998
Springer
bstract description of state machines (ASMs), in which data and data operations are d using abstract sort and uninterpreted function symbols. ASMs are suitable for describing Regis...
129
click to vote
RTSS
1997
IEEE
15 years 5 months ago
1997
IEEE
This paper presents an on-the-fly and symbolic algorithm for checking whether a timed automaton satisfies a formula of a timed temporal logic which is more expressive than TCTL....
126
click to vote
FORMATS
2006
Springer
15 years 4 months ago
2006
Springer
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic ...
114
click to vote
SPIN
2010
Springer
14 years 11 months ago
2010
Springer
In this paper, we propose the nevertrace claim, which is a new construct for specifying the correctness properties that either finite or infinite execution traces (i.e., sequence...
116
click to vote
ICFEM
2009
Springer
14 years 10 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...