276 search results - page 28 / 56 » From Model-Checking to Temporal Logic Constraint Solving |
110
click to vote
STACS
2001
Springer
15 years 5 months ago
2001
Springer
Using an automata-theoretic approach, we investigate the decidability of liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on ...
126
click to vote
TIME
2002
IEEE
15 years 6 months ago
2002
IEEE
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
109
click to vote
FMCAD
2008
Springer
15 years 2 months ago
2008
Springer
The semantics of temporal logic is usually defined with respect to a word representing a computation path over a set of atomic propositions. A temporal logic formula does not contr...
107
click to vote
AGI
2008
15 years 2 months ago
2008
Inhabiting the complex and dynamic environments of modern computer games with autonomous agents capable of intelligent timely behaviour is a significant research challenge. We illu...
108
click to vote
ESOP
2003
Springer
15 years 6 months ago
2003
Springer
In complex systems, like robot plants, applications are built on top of a set of components, or devices. Each of them has particular individual constraints, and there are also log...