493 research outputs found
LNCS
Despite researchers’ efforts in the last couple of decades, reachability analysis is still a challenging problem even for linear hybrid systems. Among the existing approaches, the most practical ones are mainly based on bounded-time reachable set over-approximations. For the purpose of unbounded-time analysis, one important strategy is to abstract the original system and find an invariant for the abstraction. In this paper, we propose an approach to constructing a new kind of abstraction called conic abstraction for affine hybrid systems, and to computing reachable sets based on this abstraction. The essential feature of a conic abstraction is that it partitions the state space of a system into a set of convex polyhedral cones which is derived from a uniform conic partition of the derivative space. Such a set of polyhedral cones is able to cut all trajectories of the system into almost straight segments so that every segment of a reach pipe in a polyhedral cone tends to be straight as well, and hence can be over-approximated tightly by polyhedra using similar techniques as HyTech or PHAVer. In particular, for diagonalizable affine systems, our approach can guarantee to find an invariant for unbounded reachable sets, which is beyond the capability of bounded-time reachability analysis tools. We implemented the approach in a tool and experiments on benchmarks show that our approach is more powerful than SpaceEx and PHAVer in dealing with diagonalizable systems
IST Austria Thesis
Hybrid automata combine finite automata and dynamical systems, and model the interaction of digital with physical systems. Formal analysis that can guarantee the safety of all behaviors or rigorously witness failures, while unsolvable in general, has been tackled algorithmically using, e.g., abstraction, bounded model-checking, assisted theorem proving.
Nevertheless, very few methods have addressed the time-unbounded reachability analysis of hybrid automata and, for current sound and automatic tools, scalability remains critical. We develop methods for the polyhedral abstraction of hybrid automata, which construct coarse overapproximations and tightens them incrementally, in a CEGAR fashion. We use template polyhedra, i.e., polyhedra whose facets are normal to a given set of directions.
While, previously, directions were given by the user, we introduce (1) the first method
for computing template directions from spurious counterexamples, so as to generalize and
eliminate them. The method applies naturally to convex hybrid automata, i.e., hybrid
automata with (possibly non-linear) convex constraints on derivatives only, while for linear
ODE requires further abstraction. Specifically, we introduce (2) the conic abstractions,
which, partitioning the state space into appropriate (possibly non-uniform) cones, divide
curvy trajectories into relatively straight sections, suitable for polyhedral abstractions.
Finally, we introduce (3) space-time interpolation, which, combining interval arithmetic
and template refinement, computes appropriate (possibly non-uniform) time partitioning
and template directions along spurious trajectories, so as to eliminate them.
We obtain sound and automatic methods for the reachability analysis over dense
and unbounded time of convex hybrid automata and hybrid automata with linear ODE.
We build prototype tools and compare—favorably—our methods against the respective
state-of-the-art tools, on several benchmarks
Traffic Abstractions of Nonlinear Homogeneous Event-Triggered Control Systems
In previous work, linear time-invariant event-triggered control (ETC) systems
were abstracted to finite-state systems that capture the original systems'
sampling behaviour. It was shown that these abstractions can be employed for
scheduling of communication traffic in networks of ETC loops. In this paper, we
extend this framework to the class of nonlinear homogeneous systems, however
adopting a different approach in a number of steps. Finally, we discuss how the
proposed methodology could be extended to general nonlinear systems
Traffic Abstractions of Nonlinear Homogeneous Event-Triggered Control Systems
In previous work, linear time-invariant event-triggered control (ETC) systems
were abstracted to finite-state systems that capture the original systems'
sampling behaviour. It was shown that these abstractions can be employed for
scheduling of communication traffic in networks of ETC loops. In this paper, we
extend this framework to the class of nonlinear homogeneous systems, however
adopting a different approach in a number of steps. Finally, we discuss how the
proposed methodology could be extended to general nonlinear systems
Abstracting the Traffic of Nonlinear Event-Triggered Control Systems
Scheduling communication traffic in networks of event-triggered control (ETC)
systems is challenging, as their sampling times are unknown, hindering
application of ETC in networks. In previous work, finite-state abstractions
were created, capturing the sampling behaviour of LTI ETC systems with
quadratic triggering functions. Offering an infinite-horizon look to all
sampling patterns of an ETC system, such abstractions can be used for
scheduling of ETC traffic. Here we significantly extend this framework, by
abstracting perturbed uncertain nonlinear ETC systems with general triggering
functions. To construct an ETC system's abstraction: a) the state space is
partitioned into regions, b) for each region an interval is determined,
containing all intersampling times of points in the region, and c) the
abstraction's transitions are determined through reachability analysis. To
determine intervals and transitions, we devise algorithms based on reachability
analysis. For partitioning, we propose an approach based on isochronous
manifolds, resulting into tighter intervals and providing control over them,
thus containing the abstraction's non-determinism. Simulations showcase our
developments
LNCS
Template polyhedra generalize intervals and octagons to polyhedra whose facets are orthogonal to a given set of arbitrary directions. They have been employed in the abstract interpretation of programs and, with particular success, in the reachability analysis of hybrid automata. While previously, the choice of directions has been left to the user or a heuristic, we present a method for the automatic discovery of directions that generalize and eliminate spurious counterexamples. We show that for the class of convex hybrid automata, i.e., hybrid automata with (possibly nonlinear) convex constraints on derivatives, such directions always exist and can be found using convex optimization. We embed our method inside a CEGAR loop, thus enabling the time-unbounded reachability analysis of an important and richer class of hybrid automata than was previously possible. We evaluate our method on several benchmarks, demonstrating also its superior efficiency for the special case of linear hybrid automata
- …