ParaPlan: a tool for parallel reachability analysis of planar polygonal differential inclusion systems
From MaRDI portal
Publication:3384178
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Ordinary differential inclusions (34A60) Specification and verification (program logics, model checking, etc.) (68Q60) Attainable sets, reachability (93B03) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Recommendations
- A Compositional Algorithm for Parallel Model Checking of Polygonal Hybrid Systems
- Algorithmic analysis of polygonal hybrid systems. II: Phase portrait and tools
- Reachability analysis of non-linear planar autonomous systems
- Reachability Analysis Using Polygonal Projections
- scientific article; zbMATH DE number 1905117
Cites work
- scientific article; zbMATH DE number 1794363 (Why is no real title available?)
- scientific article; zbMATH DE number 1905117 (Why is no real title available?)
- A Compositional Algorithm for Parallel Model Checking of Polygonal Hybrid Systems
- Algorithmic analysis of polygonal hybrid systems. I: Reachability
- Algorithmic analysis of polygonal hybrid systems. II: Phase portrait and tools
- Enumeration of the Elementary Circuits of a Directed Graph
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- KeYmaera: A Hybrid Theorem Prover for Hybrid Systems (System Description)
- Reachability analysis of dynamical systems having piecewise-constant derivatives
- Relaxing Goodness Is Still Good
- What's decidable about hybrid automata?
Cited in
(2)
This page was built for publication: ParaPlan: a tool for parallel reachability analysis of planar polygonal differential inclusion systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384178)
