Positive loop-closed automata: A decidable class of hybrid systems

DOI10.1016/S1567-8326(02)00024-3zbMath1008.68070MaRDI QIDQ1858439

Xuandong Li, Tao Zheng, Yong Li, Yu Pei, Guoliang Zheng, Jian-hua Zhao

Publication date: 13 February 2003

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

zbMATH Keywords

hybrid automatamodel checkinglinear duration propertiesreal-time and hybrid systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Towards an Efficient Path-Oriented Tool for Bounded Reachability Analysis of Linear Hybrid Systems using Linear Programming

Uses Software

• HyTech

Cites Work

• The algorithmic analysis of hybrid systems
• A calculus of durations
• What's decidable about hybrid automata?
• A theory of timed automata
• Formal techniques in real-time and fault-tolerant systems. 3rd international symposium organized jointly with the working group provably correct systems -- ProCoS, Lübeck, Germany, September 19--23, 1994. Proceedings
• Decidable integration graphs.
• HyTech: A model checker for hybrid systems
• Algorithmic analysis of nonlinear hybrid systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Positive loop-closed automata: A decidable class of hybrid systems