Behavioural approximations for restricted linear differential hybrid automata

Authors:
Manindra Agrawal;Frank Stephan;P. S. Thiagarajan;Shaofa Yang
Affiliations:
Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India;School of Computing and Department of Mathematics, National University of Singapore (NUS), Singapore;School of Computing, National University of Singapore, Singapore;School of Computing, National University of Singapore, Singapore
Venue:
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Year:
2006

Citing 8
Cited 4

What's decidable about hybrid automata?

Journal of Computer and System Sciences
Symbolic Reachability Computation for Families of Linear Vector Fields

Journal of Symbolic Computation
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
State Equivalences for Rectangular Hybrid Automata

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Integration Graphs: A Class of Decidable Hybrid Systems

Hybrid Systems
Robust Timed Automata

HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
The theory of hybrid automata

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
The discrete time behavior of lazy linear hybrid automata

HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control

Discrete Semantics for Hybrid Automata

Discrete Event Dynamic Systems
Symbolic reachability analysis of lazy linear hybrid automata

FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Engineering the development of embedded systems

Formal methods and hybrid real-time systems
Model-based synthesis of control software from system-level formal specifications

ACM Transactions on Software Engineering and Methodology (TOSEM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show the regularity of the discrete time behaviour of hybrid automata in which the rates of continuous variables are governed by linear differential operators in a diagonal form and in which the values of the continuous variables can be observed only with finite precision. We do not demand resetting of the values of the continuous variables during mode changes. We can cope with polynomial guards and we can tolerate bounded delays both in sampling the values of the continuous variables and in effecting changes in their rates required by mode switchings. We also show that if the rates are governed by diagonalizable linear differential operators with rational eigenvalues and there is no delay in effecting rate changes, the discrete time behaviour of the hybrid automaton is recursive. However, the control state reachability problem in this setting is undecidable.