7778 search results - page 22 / 1556 » Designing Controllers for Reachability |
PLDI
2010
ACM
14 years 4 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
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...
FOSSACS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this work, we introduce the class of Interrupt Timed Automata (ITA), which are well suited to the description of multi-task systems with interruptions in a single proc...
MCSS
2006
Springer
13 years 7 months ago
2006
Springer
Abstract Limited capacity of communication channels has brought to the attention of many researchers the analysis of control systems subject to a quantized input set. In some funda...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract--This paper focuses on data structures for multicore reachability, which is a key component in model checking algorithms and other verification methods. A cornerstone of a...