@inproceedings{7b300747d7324d2e876404abe3b51847,
title = "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.",
keywords = "Algebraic invariants, Hybrid automata",
author = "Rupak Majumdar and Jo{\"e}l Ouaknine and Amaury Pouly and James Worrell",
note = "Publisher Copyright: {\textcopyright} Rupak Majumdar, Jo{\"e}l Ouaknine, Amaury Pouly, and James Worrell; licensed under Creative Commons License CC-BY 31st International Conference on Concurrency Theory (CONCUR 2020).; 31st International Conference on Concurrency Theory, CONCUR 2020 ; Conference date: 01-09-2020 Through 04-09-2020",
year = "2020",
month = aug,
day = "1",
doi = "10.4230/LIPIcs.CONCUR.2020.32",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
pages = "321--3217",
editor = "Igor Konnov and Laura Kovacs",
booktitle = "31st International Conference on Concurrency Theory, CONCUR 2020",
}