524 search results - page 54 / 105 » Temporal reachability graphs |
CIE
2008
Springer
13 years 12 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
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 10 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...
IPL
2010
13 years 8 months ago
2010
Control dependence forms the basis for many program analyses, such as program slicing. Recent work on control dependence analysis has led to new definitions of dependence that cat...