Computing approximating automata for a class of linear hybrid systems

DOI10.1007/3-540-49163-5_2MaRDI QIDQ4246810zbMATH OpenFDO

Authors Alongkrit Chutinan, Bruce H. Krogh

Publication date 12 January 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-49163-5_2

zbMATH Keywords

approximating automatahybrid systemsmapping of continuous trajectoriesverification

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30) Discrete event control/observation systems (93C65)

Review text

This paper develops the foundation for constructing approximating automata automatically for hybrid systems in which the continuous dynamics are defined by convex polytopes in the vector space of the derivatives of the continuous state trajectories. The mapping of continuous-state trajectories are used in the construction algorithm that gives a complete set of computations for generating approximating automata for a particular class of hybrid systems characterized by linear constraints on the derivative of the continuous state vector. The authors give an example which illustrates the use of approximating automata for verification and compares the approach to fixed-point computations used in verification tools for hybrid systems. For the entire collection see [Zbl 0909.00062].

Recommendations

• scientific article; zbMATH DE number 1429791
• Hybrid Systems: Computation and Control
• Reachability for Linear Hybrid Automata Using Iterative Relaxation Abstraction
• Reachability and optimal control for linear hybrid automata: a quantifier elimination approach
• Cyclic linear differential automata: A simple class of hybrid dynamical systems
• From finite automata toward hybrid systems (Extended abstract)
• Efficient verification of a class of linear hybrid automata using linear programming
• Hybrid Systems: Computation and Control
• scientific article; zbMATH DE number 2085340
• Computing bounded ε-reach set with finite precision computations for a class of linear hybrid automata

Cited in

(13)

• Polyhedral flows in hybrid automata
• Approximate equivalence of the hybrid automata with Taylor theory
• Taylor approximation for hybrid systems
• Computing bounded ε-reach set with finite precision computations for a class of linear hybrid automata
• Approximating Continuous Systems by Timed Automata
• Discrete Dynamics of Two-Dimensional Nonlinear Hybrid Automata
• Polyhedral flows in hybrid automata
• Task-system analysis using slope-parametric hybrid automata
• The Discrete Time Behaviour of Restricted Linear Hybrid Automata
• scientific article; zbMATH DE number 1429791 (Why is no real title available?)
• A New Technique for Translating Discrete Hybrid Automata into Piecewise Affine Systems
• Reachability computation for polynomial dynamical systems
• Symbolic analysis of linear hybrid automata -- 25 years later

This page was built for publication: Computing approximating automata for a class of linear hybrid systems

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