Reachability analysis of generalized polygonal hybrid systems

Authors:
Gerardo Schneider
Affiliations:
University of Oslo
Venue:
Proceedings of the 2008 ACM symposium on Applied computing
Year:
2008

Citing 7
Cited 1

Reachability analysis of dynamical systems having piecewise-constant derivatives

Theoretical Computer Science - Special issue on hybrid systems
Widening the Boundary between Decidable and Undecidable Hybrid Systems

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems

Hybrid Systems
Towards Computing Phase Portraits of Polygonal Differential Inclusions

HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
SPeeDI - A Verification Tool for Polygonal Hybrid Systems

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Algorithmic analysis of polygonal hybrid systems, part I: Reachability

Theoretical Computer Science
Refining the undecidability frontier of hybrid automata

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

Relaxing Goodness Is Still Good

Proceedings of the 5th international colloquium on Theoretical Aspects of Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A polygonal hybrid system (SPDIs) is a planar hybrid system, whose dynamics is defined by constant differential inclusions, for which the reachability problem is decidable. The decidability result is based, among other things, on the fact that a trajectory cannot enter and leave a given region through the same edge. SPDIs without such an assumption are called Generalized SPDIs (GSPDIs). In this paper we show that in general it is not possible to reduce GSPDI reachability to SPDI reachability. Furthermore, we provide a terminating algorithm implementing a semi-test for GSPDI reachability, based on that for SPDIs.