Algorithmic analysis of polygonal hybrid systems. I: Reachability

DOI10.1016/J.TCS.2007.03.055zbMath1121.68071OpenAlexW2155815558MaRDI QIDQ2373713

Eugene Asarin, Gerardo Schneider, Sergio Yovine

Publication date: 16 July 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.03.055

zbMATH Keywords

verificationdifferential inclusionshybrid systemsreachability analysisdecision algorithm

Mathematics Subject Classification ID

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)

Related Items (14)

On the decidability and complexity of problems for restricted hierarchical hybrid systems ⋮ Computational techniques for reachability analysis of Max-Plus-Linear systems ⋮ Deciding Concurrent Planar Monotonic Linear Hybrid Systems ⋮ Mortality and Edge-to-Edge Reachability are Decidable on Surfaces ⋮ STORMED Hybrid Systems ⋮ Unnamed Item ⋮ Interrupt timed automata: verification and expressiveness ⋮ Results and perspectives on fault tolerant control for a class of hybrid systems ⋮ Algorithmic analysis of polygonal hybrid systems. II: Phase portrait and tools ⋮ Qualitative fault tolerance analysis for a class of hybrid systems ⋮ A decidable class of planar linear hybrid systems ⋮ A survey of challenges for runtime verification from advanced application domains (beyond software) ⋮ Interrupt Timed Automata ⋮ Relaxing Goodness Is Still Good

Uses Software

• HyTech
• Charon
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The algorithmic analysis of hybrid systems
• Hybrid systems
• Hybrid systems V. 5th international Hybrid systems workshop held in Notre Dame, IN, USA, September 11--13, 1997. Proceedings
• Hybrid systems: computation and control. 2nd international workshop, HSCC '99. Berg en Dal, the Netherlands, March 29--31, 1999. Proceedings
• A theory of timed automata
• Reachability analysis of dynamical systems having piecewise-constant derivatives
• Hybrid systems: computation and control. 5th international workshop, HSCC 2002, Stanford, CA, USA, March 25--27, 2002. Proceedings
• Hybrid systems: computation and control. 4th international workshop, HSCC 2001, Rome, Italy, March 28--30, 2001. Proceedings
• HyTech: A model checker for hybrid systems
• Hybrid systems II. 2nd workshop, Mathematical Sciences Institute (MSI), Cornell University, Ithaka, NY, USA, October 28--30, 1994. Proceedings.
• Hybrid systems: computation and control. 3rd international workshop, HSCC 2000, Pittsburgh, PA, USA, March 23--25, 2000. Proceedings
• Static Analysis for State-Space Reduction of Polygonal Hybrid Systems
• A Compositional Algorithm for Parallel Model Checking of Polygonal Hybrid Systems
• Reachability Analysis Using Polygonal Projections
• Conflict resolution for air traffic management: a study in multiagent hybrid systems
• Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
• On some relations between dynamical systems and transition systems
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Computer Aided Verification
• Verification, Model Checking, and Abstract Interpretation
• Symbolic reachability computation for families of linear vector fields

This page was built for publication: Algorithmic analysis of polygonal hybrid systems. I: Reachability