Refinements of behavioural abstractions for the supervisory control of hybrid systems

A common approach to controller synthesis for hybrid systems is to first establish a discrete-event abstraction and then to use methods from supervisory control theory to synthesise a controller. In this paper, we consider behavioural abstractions of hybrid systems with a prescribed discrete-event input/output interface. We discuss a family of abstractions based on so called experiments which consist of samples from the external behaviour of the hybrid system. The special feature of our setting is that the accuracy of the abstraction can be carefully adapted to suit the particular control problem at hand. Technically, this is implemented as an iteration in which we alternate trial control synthesis with abstraction refinement. While localising refinement to where it is intuitively needed, we can still formally establish that the overall iteration will solve the control problem, provided that an abstraction-based solution exists at all.

[1]  Nicolas Halbwachs,et al.  Verification of Real-Time Systems using Linear Relation Analysis , 1997, Formal Methods Syst. Des..

[2]  Paulo Tabuada,et al.  Symbolic Models for Nonlinear Control Systems: Alternating Approximate Bisimulations , 2007, SIAM J. Control. Optim..

[3]  Jörg Raisch,et al.  Supervisory Control of Hybrid Systems Under Partial Observation Based on $l$-Complete Approximations , 2015, IEEE Transactions on Automatic Control.

[4]  Paulo Tabuada,et al.  Comparing asynchronous l-complete approximations and quotient based abstractions , 2015, 2015 54th IEEE Conference on Decision and Control (CDC).

[5]  J. Zaytoon.  Workshop on discrete event systems (WODES' 04) , 2005, IEEE Control Systems.

[6]  Gunther Reissig,et al.  Computing Abstractions of Nonlinear Systems , 2009, IEEE Transactions on Automatic Control.

[7]  O. Ucan,et al.  Geometric augmented product codes , 2006 .

[8]  Thomas Brihaye,et al.  On O-Minimal Hybrid Systems , 2004, HSCC.

[9]  Stacey L. Mascia.  The Sopranos Gary R. Edgerton. Detroit, MI: Wayne State University Press, 2013. , 2013 .

[10]  Thomas A. Henzinger,et al.  Beyond HYTECH: Hybrid Systems Analysis Using Interval Numerical Methods , 2000, HSCC.

[11]  Paulo Tabuada,et al.  Verification and Control of Hybrid Systems - A Symbolic Approach , 2009 .

[12]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[13]  Manuel Mazo,et al.  Symbolic Models for Nonlinear Control Systems Without Stability Assumptions , 2010, IEEE Transactions on Automatic Control.

[14]  Jana Kosecka,et al.  Control of Discrete Event Systems , 1992 .

[15]  Joël Ouaknine,et al.  Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems , 2003, Int. J. Found. Comput. Sci..

[16]  Jörg Raisch,et al.  Supervisory control of hybrid systems within a behavioural framework , 1999 .

[17]  J. G. Thistle,et al.  Control of Infinite Behavior of Finite Automata , 1994 .

[18]  O. Stursberg,et al.  Computing Reachable Sets of Hybrid Systems Using a Combination of Zonotopes and Polytopes , 2010 .

[19]  Jörg Raisch,et al.  Learning by doing: systematic abstraction refinement for hybrid control synthesis , 2006 .

[20]  Zhiwu Li,et al.  ON SUPERVISORY CONTROL OF A CLASS OF DISCRETE EVENT SYSTEMS , 2006 .

[21]  Olaf Stursberg,et al.  Supervisory control of hybrid systems based on model abstraction and guided search , 2006 .

[22]  Panos J. Antsaklis,et al.  Interface and Controller Design for Hybrid Control Systems , 1994, Hybrid Systems.

[23]  George J. Pappas,et al.  Discrete abstractions of hybrid systems , 2000, Proceedings of the IEEE.

[24]  Paulo Tabuada,et al.  Verification and Control of Hybrid Systems , 2009 .

[25]  Oded Maler,et al.  Reachability Analysis via Face Lifting , 1998, HSCC.

[26]  W. M. Wonham,et al.  Supervision of Infinite Behavior of Discrete-Event Systems , 1994 .

[27]  Jörg Raisch,et al.  Discrete Supervisory Control of Hybrid Systems Based on l-Complete Approximations , 2002, Discret. Event Dyn. Syst..

[28]  Jörg Raisch,et al.  Abstraction based supervisory controller synthesis for high order monotone continuous systems , 2002 .

[29]  Thomas Moor,et al.  Deterministic Finite-Automata Abstractions of Time-Variant Sequential Behaviours , 2018 .

[30]  Gunther Reissig,et al.  Feedback Refinement Relations for the Synthesis of Symbolic Controllers , 2015, IEEE Transactions on Automatic Control.

[31]  Alexandre M. Bayen,et al.  A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games , 2005, IEEE Transactions on Automatic Control.

[32]  Goran Frehse,et al.  PHAVer: algorithmic verification of hybrid systems past HyTech , 2005, International Journal on Software Tools for Technology Transfer.

[33]  Roberto Bagnara,et al.  The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems , 2006, Sci. Comput. Program..

[34]  J. Willems.  Paradigms and puzzles in the theory of dynamical systems , 1991 .

[35]  Jörg Raisch,et al.  Local Refinement of l-complete Approximations for Supervisory Control of Hybrid Systems , 2018 .

[36]  Calin Belta,et al.  Finite bisimulations for switched linear systems , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[37]  B. Krogh,et al.  Computing polyhedral approximations to flow pipes for dynamic systems , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

[38]  Thomas A. Henzinger,et al.  Automatic symbolic verification of embedded systems , 1993, 1993 Proceedings Real-Time Systems Symposium.

[39]  Jun Liu,et al.  Finite abstractions with robustness margins for temporal logic-based control synthesis , 2016 .

[40]  Anne-Kathrin Schmuck,et al.  Asynchronous $l$-Complete Approximations , 2014, ArXiv.

[41]  René Boel,et al.  Discrete event dynamic systems: Theory and applications. , 2002 .