A sufficient condition for the boundedness of matrix products accepted by an automaton

DOI10.1145/2728606.2728610zbMath1366.68151OpenAlexW2148894804MaRDI QIDQ2988915

Matthew Philippe, Raphaël M. Jungers

Publication date: 19 May 2017

Published in: Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2728606.2728610

zbMATH Keywords

stabilityboundednessdiscrete-time linear switching systemsconstrained switching sequences

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Robust stability (93D09) Algebraic systems of matrices (15A30)

Related Items (3)

Deciding the boundedness and dead-beat stability of constrained switching systems ⋮ Stability of discrete-time switching systems with constrained switching sequences ⋮ Linear switched dynamical systems on graphs

Cites Work

• On Fixed Points of Strictly Causal Functions
• Requirements for hybrid cosimulation standards
• THEORY OF QUANTIZED SYSTEMS: DEVS SIMULATION OF PERCEIVING AGENTS
• Hybrid Systems: Computation and Control
• Unnamed Item
• Unnamed Item

This page was built for publication: A sufficient condition for the boundedness of matrix products accepted by an automaton