2407 search results - page 153 / 482 » A Tool for Abstraction in Model Checking |
192
Voted
ICRA
2005
IEEE
16 years 16 days ago
2005
IEEE
— In this paper, we consider the problem of robot motion planning in order to satisfy formulas expressible in temporal logics. Temporal logics naturally express traditional robot...
168
Voted
ATVA
2005
Springer
16 years 15 days ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
165
Voted
CAV
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Any formalmethodor tool is almostcertainlymoreoftenapplied in situationswheretheoutcomeis failure(acounterexample)rather than success (a correctness proof). We present a ...
180
Voted
CONCUR
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. We present an in-depth discussion of the relationships between synchrony and asynchrony. Simple models of both paradigms are presented, and we state theorems which guaran...
190
click to vote
KI
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Several options are available to relate agent logics to computational agent systems. Among others, one can try to find useful executable fragments of an agent logic or us...