scientific article; zbMATH DE number 1538038

zbMATH Open0960.68117MaRDI QIDQ4518893FDOQ4518893

Authors: Rupak Majumdar, Thomas A. Henzinger 

Publication date: 3 December 2000

Title of this publication is not available (Why is that?)

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

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) Controllability, observability, and system structure (93B99) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (14)

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

This page was built for publication:

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