Sciweavers

104 search results - page 9 / 21
» On Reachability for Hybrid Automata over Bounded Time
Sort
View
LFCS
2007
Springer
14 years 1 months ago
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
Abstract. We consider weighted o-minimal hybrid systems, which extend classical o-minimal hybrid systems with cost functions. These cost functions are “observer variables” whic...
Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier
FOSSACS
2009
Springer
13 years 11 months ago
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
We study generalized fixed-point equations over idempotent semirings and provide an efficient algorithm for the detection whether a sequence of Kleene's iterations stabilizes ...
Morten Kühnrich, Stefan Schwoon, Jirí ...
HYBRID
2003
Springer
14 years 21 days ago
Reachability Analysis of Nonlinear Systems Using Conservative Approximation
Abstract. In this paper we present an approach to approximate reachability computation for nonlinear continuous systems. Rather than studying a complex nonlinear system ˙x = g(x),...
Eugene Asarin, Thao Dang, Antoine Girard
FORMATS
2004
Springer
14 years 27 days ago
Bounded Model Checking for Region Automata
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this reg...
Fang Yu, Bow-Yaw Wang, Yao-Wen Huang
HYBRID
2007
Springer
13 years 11 months ago
Safety Verification of an Aircraft Landing Protocol: A Refinement Approach
Abstract. In this paper, we propose a new approach for formal verification of hybrid systems. To do so, we present a new refinement proof technique, a weak refinement using step in...
Shinya Umeno, Nancy A. Lynch