198 search results - page 30 / 40 » Reachability on prefix-recognizable graphs |
AIPS
1996
13 years 11 months ago
1996
An increasing number of planners can handle uncertainty in the domain or in action outcomes. However, less work has addressed building plans when the planner's world can chan...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
We are interested in verifying dynamic properties of finite state reactive systems under fairness assumptions by model checking. The systems we want to verify are specified throug...
DSS
2007
13 years 9 months ago
2007
: As supply chains become more dynamic it is important to be able to model them formally as business processes. In particular, there is a need for a sense and respond capability to...
HYBRID
2009
Springer
13 years 7 months ago
2009
Springer
We introduce STORMED hybrid games (SHG), a generalization of STORMED Hybrid Systems [21], which have natural specifications, allow rich continuous dynamics and admit various proper...
FOSSACS
2012
Springer
12 years 5 months ago
2012
Springer
We consider concurrent games played on graphs, in which each player has several qualitative (e.g. reachability or B¨uchi) objectives, and a preorder on these objectives (for insta...