26 search results - page 2 / 6 » Improved Approximate Reachability Using Auxiliary State Vari... |
FM
2001
Springer
13 years 12 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
ASPDAC
2007
ACM
13 years 11 months ago
2007
ACM
In today's designs, when functional verification fails, engineers perform debugging using the provided error traces. Reducing the length of error traces can help the debugging...
VMCAI
2007
Springer
14 years 1 months ago
2007
Springer
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
UAI
1998
13 years 8 months ago
1998
Recent research in decision theoretic planning has focussedon making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structur...
HYBRID
2010
Springer
14 years 2 months ago
2010
Springer
This paper is concerned with reachable set computation for non-linear systems using hybridization. The essence of hybridization is to approximate a non-linear vector field by a s...