STORMED Hybrid Systems

Authors:
Vladimeros Vladimerou;Pavithra Prabhakar;Mahesh Viswanathan;Geir Dullerud
Affiliations:
University of Illinois at Urbana-Champaign, Champaign, USA;University of Illinois at Urbana-Champaign, Champaign, USA;University of Illinois at Urbana-Champaign, Champaign, USA;University of Illinois at Urbana-Champaign, Champaign, USA
Venue:
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Year:
2008

Citing 10
Cited 7

A theory of timed automata

Theoretical Computer Science
The algorithmic analysis of hybrid systems

Theoretical Computer Science - Special issue on hybrid systems
Reachability analysis of dynamical systems having piecewise-constant derivatives

Theoretical Computer Science - Special issue on hybrid systems
What's decidable about hybrid automata?

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Deciding stability and mortality of piecewise affine dynamical systems

Theoretical Computer Science
Communication and Concurrency

Communication and Concurrency
Algorithmic analysis of polygonal hybrid systems, part I: Reachability

Theoretical Computer Science
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!

LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Reachability problems on extended o-minimal hybrid automata

FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Refining the undecidability frontier of hybrid automata

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science

Periodically Controlled Hybrid Systems

HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
STORMED Hybrid Games

HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Computing bounded ε-reach set with finite precision computations for a class of linear hybrid automata

Proceedings of the 14th international conference on Hybrid systems: computation and control
A dynamic algorithm for approximate flow computations

Proceedings of the 14th international conference on Hybrid systems: computation and control
Specifications for decidable hybrid games

Theoretical Computer Science
Verification of Periodically Controlled Hybrid Systems: Application to an Autonomous Vehicle

ACM Transactions on Embedded Computing Systems (TECS) - Special Section on CAPA'09, Special Section on WHS'09, and Special Section VCPSS' 09
A game-theoretic approach to fault diagnosis and identification of hybrid systems

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce STORMED hybrid systems, a decidable class of hybrid systems which is similar to o-minimal hybrid automata in that the continuous dynamics and constraints are described in an o-minimal theory. However, unlike o-minimal hybrid automata, the variables are not initialized in a memoryless fashion at discrete steps. STORMED hybrid systems require flows which are monotonic with respect to some vector in the continuous space and can be characterised as bounded-horizon systems in terms of their discrete transitions. We demonstrate that such systems admit a finite bisimulation, which can be effectively constructed provided the o-minimal theory used to describe the system is decidable. As a consequence, many verification problems for such systems have effective decision algorithms.