Symbolic model checking for rectangular hybrid systems

DOI10.1007/3-540-46419-0_11MaRDI QIDQ4518893zbMATH OpenFDO

Authors Rupak Majumdar, Thomas A. Henzinger

Publication date 3 December 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46419-0_11

zbMATH Keywords

HYTECHinfinite-state transition systemsymbolic model-checking procedures

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Controllability, observability, and system structure (93B99)

Recommendations

• What's decidable about hybrid automata?
• Formal Modeling and Analysis of Timed Systems
• Symbolic Algorithm Analysis of Rectangular Hybrid Systems
• Discrete-time control for rectangular hybrid automata
• scientific article; zbMATH DE number 1263213

Cited in

(16)

• Straightening out rectangular differential inclusions
• Positive loop-closed automata: A decidable class of hybrid systems
• Approximate equivalence of the hybrid automata with Taylor theory
• Taylor approximation for hybrid systems
• Monotonic hybrid systems
• Hybrid automata-based CEGAR for rectangular hybrid systems
• Automated Reasoning for Hybrid Systems — Two Case Studies —
• Symbolic Algorithm Analysis of Rectangular Hybrid Systems
• Rectangular hybrid games
• Improving HyLTL model checking of hybrid systems
• Hybrid Systems: Computation and Control
• Relaxing Goodness Is Still Good
• Computer Aided Verification
• Formal Modeling and Analysis of Timed Systems
• State equivalences for rectangular hybrid automata
• Hybrid automata-based CEGAR for rectangular hybrid systems

This page was built for publication: Symbolic model checking for rectangular hybrid systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4518893)