909 search results - page 23 / 182 » Temporal Logic Case Study |
LICS
2006
IEEE
14 years 2 months ago
2006
IEEE
We motivate and study a generic relaxation of correctness of reactive and concurrent systems with respect to a temporal specification. We define a system to be fairly correct if...
LPAR
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in t...
KBSE
2003
IEEE
14 years 2 months ago
2003
IEEE
Automating software evolution requires both identifying precisely the affected program points and selecting the appropriate modification at each point. This task is particularly ...
AI
2000
Springer
13 years 8 months ago
2000
Springer
Over the years increasingly sophisticated planning algorithms have been developed. These have made for more efficient planners, but unfortunately these planners still suffer from ...
IJCAI
2001
13 years 10 months ago
2001
In the last decade, there has been several studies on the computational complexity of planning. These studies normally assume that the goal of planning is to make a certain fluent...