Syllabus – Hybrid Systems
Hybrid Systems
- Discrete Event Systems and Petri Nets
- Introduction to Discrete Event Systems
- Petri Nets (PNs): PN Graphs; PN Marking; PN dynamics.
- Special classes of PNs: Event Graphs and State Machines.
- Analysis of Petri Net Models: PN Properties and the Coverability Tree.
- Control of Petri Net Models: state-based control for the ideal case and for unobservable/uncontrollable transitions.
- Timed Petri Nets: timing mechanisms and timed event graphs.
- Max Plus Algebra
- Introductory Example
- Max-plus algebra as an idempotent semiring
- Max-plus algebra and precedence graph properties
- Linear equations in max-plus
- The max-plus eigenvalue problem
- Industrial example: the control of high-throughput-screening
(HTS) plants
- Finite State Machines and Regular Languages
- Supervisory Control Theory
- Modelling the plant
- Formal specifications
- Minimal restrictive control
- Controller realisation
- Comparing Finite State Machines and Petri Nets
- Introduction to Hybrid Systems
- Hybrid Automata
- Abstraction-based Control of Hybrid Systems
- Important abstraction properties
- l-complete approximation
- Handling complexity
- Optimal Trajectories for Hybrid Automata
- Stability of Switched Systems
- Stability concepts
- Stability under arbitrary switching
- Stability under state-dependent switching