Efficient Verification of a Class of Linear Hybrid Automata Using Linear Programming

Authors:
Li Xuandong;Pei Yu;Zhao Jianhua;Li Yong;Zheng Tao;Zheng Guoliang
Affiliations:
-;-;-;-;-;-
Venue:
CHARME '01 Proceedings of the 11th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Year:
2001

Citing 9
Cited 0

The algorithmic analysis of hybrid systems

Theoretical Computer Science - Special issue on hybrid systems
What's decidable about hybrid automata?

Journal of Computer and System Sciences
Checking Hybrid Automata for Linear Duration Invariants

ASIAN '97 Proceedings of the Third Asian Computing Science Conference on Advances in Computing Science
Symbolic Model Checking for Rectangular Hybrid Systems

TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Linear Duration Invariants

ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
Integration Graphs: A Class of Decidable Hybrid Systems

Hybrid Systems
Hybrid Regular Expressions

HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
HYTECH: A Model Checker for Hybrid Systems

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
The theory of hybrid automata

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we show that for a class of linear hybrid automata called zero loop-closed automata, the satisfaction problem for linear duration properties can be solved efficiently by linear programming. We give an algorithm based on depth-first search method to solve the problem by traversing all the simple paths (with no repeated node occurrence) in an automaton and checking their corresponding sequences of locations for a given linear duration property.