Symbolic Model Checking for Rectangular Hybrid Systems
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Widening the Boundary between Decidable and Undecidable Hybrid Systems
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
On the Decidability of the Reachability Problem for Planar Differential Inclusions
HSCC '01 Proceedings of the 4th 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
Reachability Analysis of Planar Multi-limear Systems
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Algorithmic analysis of polygonal hybrid systems, part I: Reachability
Theoretical Computer Science
Reachability analysis of generalized polygonal hybrid systems
Proceedings of the 2008 ACM symposium on Applied computing
Reachability analysis of multi-affine systems
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Static analysis for state-space reduction of polygonal hybrid systems
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
A compositional algorithm for parallel model checking of polygonal hybrid systems
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Refining the undecidability frontier of hybrid automata
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
GSPeeDI --- A Verification Tool for Generalized Polygonal Hybrid Systems
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Reachability analysis of non-linear planar autonomous systems
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
| Hi-index | 0.00 |
Polygonal hybrid systems (SPDIs) are planar hybrid systems, whose dynamics are defined in terms of constant differential inclusions, one for each of a number of polygonal regions partitioning the plane. The reachability problem for SPDIs is known to be decidable, but depends on the goodnessassumption -- which states that the dynamics do not allow a trajectory to both enter and leave a region through the same edge. In this paper we extend the decidability result to generalised SPDIs(GSPDI), SPDIs not satisfying the goodness assumption, and give an algorithmic solution to decide reachability of such systems.