Theoretical Computer Science
Computer graphics (2nd ed. in C): principles and practice
Computer graphics (2nd ed. in C): principles and practice
What's decidable about hybrid automata?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Symbolic Reachability Computation for Families of Linear Vector Fields
Journal of Symbolic Computation
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
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
Reachability Analysis of Planar Multi-limear Systems
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Algorithmic analysis of polygonal hybrid systems, part I: Reachability
Theoretical Computer Science
Algorithmic analysis of polygonal hybrid systems, Part II: Phase portrait and tools
Theoretical Computer Science
Relaxing Goodness Is Still Good
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
GSPeeDI --- A Verification Tool for Generalized Polygonal Hybrid Systems
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Computation and visualisation of phase portraits for model checking SPDIs
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
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 |
The reachability problem as well as the computation of the phase portrait for the class of planar hybrid systems defined by constant differential inclusions (SPDI), has been shown to be decidable. The existing reachability algorithm is based on the exploitation of topological properties of the plane which are used to accelerate certain kind of cycles. The complexity of the algorithm makes the analysis of large systems generally unfeasible. In this paper we present a compositional parallel algorithm for reachability analysis of SPDIs. The parallelization is based on the qualitative information obtained from the phase portrait of an SPDI, in particular the controllability kernel.