Conference item
Algebraic invariants for linear hybrid automata
- Abstract:
- We exhibit an algorithm to compute the strongest algebraic (or polynomial) invariants that hold at each location of a given guard-free linear hybrid automaton (i.e., a hybrid automaton having only unguarded transitions, all of whose assignments are given by affine expressions, and all of whose continuous dynamics are given by linear differential equations). Our main tool is a control-theoretic result of independent interest: given such a linear hybrid automaton, we show how to discretise the continuous dynamics in such a way that the resulting automaton has precisely the same algebraic invariants.
- Publication status:
- Published
- Peer review status:
- Reviewed (other)
Actions
Access Document
- Files:
-
-
(Preview, Version of record, 568.1KB, Terms of use)
-
- Publisher copy:
- 10.4230/LIPIcs.CONCUR.2020.32
Authors
- Publisher:
- Leibniz International Proceedings in Informatics
- Journal:
- 31st International Conference on Concurrency Theory More from this journal
- Pages:
- 32:1-32:17
- Article number:
- 32
- Publication date:
- 2020-08-26
- Acceptance date:
- 2020-06-28
- Event title:
- 31st International Conference on Concurrency Theory
- DOI:
- Language:
-
English
- Keywords:
- Pubs id:
-
1115282
- Local pid:
-
pubs:1115282
- Deposit date:
-
2020-07-01
Terms of use
- Copyright holder:
- Majumdar et al.
- Copyright date:
- 2020
- Rights statement:
- © Rupak Majumdar, Joël Ouaknine, Amaury Pouly, and James Worrell; licensed under Creative Commons License CC-BY
- Licence:
- CC Attribution (CC BY)
If you are the owner of this record, you can report an update to it here: Report update to this record