Algebraic Invariants for Linear Hybrid Automata

DOI10.4230/LIPICS.CONCUR.2020.32arXiv1902.10452MaRDI QIDQ6314711FDOQ6314711

Authors: Rupak Majumdar, Joël Ouaknine, Amaury Pouly, James Worrell 

Publication date: 27 February 2019

Abstract: We exhibit an algorithm to compute the strongest algebraic (or polynomial) invariants that hold at each location of a given unguarded 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.

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

This page was built for publication: Algebraic Invariants for Linear Hybrid Automata

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