524 search results - page 22 / 105 » Temporal reachability graphs |
SEFM
2005
IEEE
15 years 5 months ago
2005
IEEE
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...
EPIA
2001
Springer
15 years 4 months ago
2001
Springer
Dealing with temporality on actions presents an important challenge to AI planning. Unlike Graphplan-based planners which alternate levels of propositions and actions in a regular ...
182
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Due to rapid growth of the Internet technology and new scientific/technological advances, the number of applications that model data as graphs increases, because graphs have high e...
TACAS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Time Petri Nets (TPN) and Timed Automata (TA) are widely-used formalisms for the modeling and analysis of timed systems. A recently-developed approach for the analysis of...
103
click to vote
CAV
2010
Springer
14 years 9 months ago
2010
Springer
We describe Breach, a Matlab toolbox providing a coherent set of simulation-based techniques aimed at the analysis of deterministic models of hybrid dynamical systems. The primary ...