Theoretical Computer Science
Reachability analysis of dynamical systems having piecewise-constant derivatives
Theoretical Computer Science - Special issue on hybrid systems
What's decidable about hybrid automata?
Journal of Computer and System Sciences
Achilles and the tortoise climbing up the arithmetical hierarchy
Journal of Computer and System Sciences - Fourteenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Discrete-time control for rectangular hybrid automata
Theoretical Computer Science
Deciding stability and mortality of piecewise affine dynamical systems
Theoretical Computer Science
Hybrid Automata with Finite Bisimulatioins
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Integration Graphs: A Class of Decidable Hybrid Systems
Hybrid Systems
Robust Undecidability of Timed and Hybrid Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Decidability of Hybrid Systems with Rectangular Differential Inclusion
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Suspension Automata: A Decidable Class of Hybrid Automata
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Revisiting Digitization, Robustness, and Decidability for Timed Automata
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Complexity of stability and controllability of elementary hybrid systems
Automatica (Journal of IFAC)
Succinct discrete time approximations of distributed hybrid automata
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
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
Proceedings of the 14th international conference on Hybrid systems: computation and control
Rigorous discretization of hybrid systems using process calculi
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Behavioural approximations for restricted linear differential hybrid automata
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Modular discrete time approximations of distributed hybrid automata
Theoretical Computer Science
Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces
Science of Computer Programming
Undecidability of quantized state feedback control for discrete time linear hybrid systems
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Model-based synthesis of control software from system-level formal specifications
ACM Transactions on Software Engineering and Methodology (TOSEM)
| Hi-index | 0.00 |
We study the class of lazy linear hybrid automata with finite precision. The key features of this class are: The observation of the continuous state and the rate changes associated with mode switchings take place with bounded delays. The values of the continuous variables can be observed with only finite precision. The guards controlling the transitions of the automaton are finite conjunctions of arbitrary linear constraints. We show that the discrete time dynamics of this class of automata can be effectively analyzed without requiring resetting of the continuous variables during mode changes. In fact, our result holds for guard languages that go well beyond linear constraints.