Complete abstractions of dynamical systems by timed automata
From MaRDI portal
Publication:360650
DOI10.1016/J.NAHS.2012.05.003zbMATH Open1271.68146OpenAlexW2031364117MaRDI QIDQ360650FDOQ360650
Rafał Wisniewski, Christoffer Sloth
Publication date: 27 August 2013
Published in: Nonlinear Analysis. Hybrid Systems (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1751570X12000180
Recommendations
- Verification of continuous dynamical systems by timed automata
- Approximating Continuous Systems by Timed Automata
- Implicit semi-algebraic abstraction for polynomial dynamical systems
- Algorithms for exact and approximate linear abstractions of polynomial continuous systems
- Timed-automata abstraction of switched dynamical systems using control funnels
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (10)
- Abstraction Strategies for Computing Travelling or Looping Durations in Networks of Timed Automata
- Timed-Automata Abstraction of Switched Dynamical Systems Using Control Funnels
- Automatic Abstraction Refinement for Timed Automata
- Temporal logic model predictive control
- Better abstractions for timed automata
- Approximating Continuous Systems by Timed Automata
- Modelling and supervisory control of hybrid dynamical systems via fuzzy \(l\)-complete approximation approach
- Timed-automata abstraction of switched dynamical systems using control invariants
- Guaranteed cost \(H_\infty \) controller synthesis for switched systems defined on semi-algebraic sets
- Dynamical properties of timed automata
Uses Software
This page was built for publication: Complete abstractions of dynamical systems by timed automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360650)
