research-article

Automatic Synthesis of Switching Controllers for Linear Hybrid Systems: Reachability Control

Authors:

Massimo Benerecetti,

Marco FaellaAuthors Info & Claims

ACM Transactions on Embedded Computing Systems (TECS), Volume 16, Issue 4

Article No.: 104, Pages 1 - 27

https://doi.org/10.1145/3047500

Published: 11 May 2017 Publication History

Abstract

We consider the problem of computing the controllable region of a Linear Hybrid Automaton with controllable and uncontrollable transitions, w.r.t. a reachability objective. We provide an algorithm for the finite-horizon version of the problem, based on computing the set of states that must reach a given non-convex polyhedron while avoiding another one, subject to a polyhedral constraint on the slope of the trajectory. Experimental results are presented, based on an implementation of the proposed algorithm on top of the tool SpaceEx.

References

[1]

R. Alur, T. A. Henzinger, and P.-H. Ho. 1996. Automatic symbolic verification of embedded systems. IEEE Trans. Softw. Eng. 22 (1996), 181--201.

Digital Library

[2]

E. Asarin, O. Bournez, T. Dang, O. Maler, and A. Pnueli. 2000. Effective synthesis of switching controllers for linear systems. Proc. IEEE 88, 7 (2000), 1011--1025.

[3]

R. Bagnara, P. M. Hill, and E. Zaffanella. 2008. The parma polyhedra library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Sci. Comput. Program. 72, 1--2 (2008), 3--21.

Digital Library

[4]

A. Balluchi, L. Benvenuti, T. Villa, H. Wong-Toi, and A. Sangiovanni-Vincentelli. 2003. Controller synthesis for hybrid systems with a lower bound on event separation. Int. J. Control 76, 12 (2003), 1171--1200.

[5]

M. Benerecetti and M. Faella. 2013. Tracking differentiable trajectories across polyhedra boundaries. In Proceedings of the 16th International Conference on Hybrid Systems Computation and Control (HSCC’13). ACM, 193--202.

Digital Library

[6]

M. Benerecetti, M. Faella, and S. Minopoli. 2011a. Revisiting synthesis of switching controllers for linear hybrid systems. In Proceedings of the 50th IEEE Conference on Decision and Control. IEEE.

[7]

M. Benerecetti, M. Faella, and S. Minopoli. 2011b. Towards efficient exact synthesis for linear hybrid systems. In Proceedings of the 2nd International Symposium on Games, Automata, Logics, and Formal Verification (GandALF’11) (Electron. Proc. Theoret. Comput. Sci.), Vol. 54.

[8]

M. Benerecetti, M. Faella, and S. Minopoli. 2012. Reachability games for linear hybrid systems. In Proceedings of the 15th International Conference of Hybrid Systems Computation and Control (HSCC’12). ACM, 65--74.

Digital Library

[9]

M. Benerecetti, M. Faella, and S. Minopoli. 2013. Automatic synthesis of switching controllers for linear hybrid systems: Safety control. Theoret. Comput. Sci. 493 (2013), 116--138.

Digital Library

[10]

P. Bouyer, T. Brihaye, and F. Chevalier. 2010. O-minimal hybrid reachability games. Logic. Methods Comput. Sci. 6 (2010).

[11]

N. V. Chernikova. 1968. Algorithm for discovering the set of all the solutions of a linear programming problem. U.S.S.R. Comput. Math. Math. Phys. 8, 6 (1968), 282--293.

[12]

L. de Alfaro, M. Faella, T. A. Henzinger, R. Majumdar, and M. Stoelinga. 2003. The element of surprise in timed games. In Proceedings of the 14th International Conference on Concurrency Theory (CONCUR’03) (Lect. Notes Comput. Sci.), Vol. 2761. Springer, 144--158.

[13]

L. de Alfaro, T. A. Henzinger, and R. Majumdar. 2001. Symbolic algorithms for infinite-state games. In Proceedings of the 12th International Conference on Concurrency Theory (CONCUR’01). (Lect. Notes Comput. Sci.). Springer.

[14]

G. Frehse, C. Le Guernic, A. Donzé, S. Cotton, R. Ray, O. Lebeltel, R. Ripado, A. Girard, T. Dang, and O. Maler. 2011. SpaceEx: Scalable verification of hybrid systems. In Proceedings of the 23rd Conference on Computer Aided Verification (CAV’11). 379--395.

[15]

L. C. G. J. M. Habets, P. J. Collins, and J. H. van Schuppen. 2006. Reachability and control synthesis for piecewise-affine hybrid systems on simplices. IEEE Trans. on Automatic Control 51, 6 (2006), 938--948.

[16]

T. A. Henzinger. 1996. The theory of hybrid automata. In Proceedings of the 11th IEEE Symposium on Logic in Computer Science. 278--292.

[17]

T. A. Henzinger, B. Horowitz, and R. Majumdar. 1999. Rectangular hybrid games. In Proceedings of the 10th International Conference on Concurrency Theory (CONCUR’99) (Lect. Notes Comput. Sci.), Vol. 1664. Springer, 320--335.

[18]

T. A. Henzinger, P. W. Kopke, A. Puri, and P. Varaiya. 1995. What’s decidable about hybrid automata? In Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC’95). ACM, 373--382.

Digital Library

[19]

T. A. Henzinger, P. W. Kopke, A. Puri, and P. Varaiya. 1998. What’s decidable about hybrid automata? J. Comput. Syst. Sci. 57, 1 (1998), 94--124.

Digital Library

[20]

Z. Lin and M. E. Broucke. 2006. Resolving control to facet problems for affine hypersurface systems on simplices. In 45th IEEE Conference on Decision and Control. 2625--2630.

[21]

J. Lygeros, C. Tomlin, and S. Sastry. 1999. Controllers for reachability specifications for hybrid systems. Automatica 35, 3 (1999), 349--370.

Digital Library

[22]

O. Maler. 2002. Control from computer science. Ann. Rev. Control 26, 2 (2002), 175--187.

[23]

O. Maler, A. Pnueli, and J. Sifakis. 1995. On the synthesis of discrete controllers for timed systems. In Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science (Lect. Notes Comput. Sci.), Vol. 900. Springer.

[24]

M. L. Minsky. 1967. Computation: Finite and Infinite Machines. Prentice-Hall, Inc., Upper Saddle River, NJ.

Digital Library

[25]

P. J. Ramadge and W. M. Wonham. 1987. Supervisory control of a class of discrete-event processes. SIAM J. Contr. Optim. 25 (1987), 206--230.

Digital Library

[26]

A. Schrijver. 1986. Theory of Linear and Integer Programming. John Wiley and Sons.

Digital Library

[27]

C. J. Tomlin, J. Lygeros, and S. Shankar Sastry. 2000. A game theoretic approach to controller design for hybrid systems. Proc. IEEE 88, 7 (2000), 949--970.

[28]

H. Le Verge. 1992. A Note on Chernikova’s Algorithm. Technical Report 635. IRISA, Rennes.

[29]

H. Wong-Toi. 1997. The synthesis of controllers for linear hybrid automata. In Proceedings of the 36th IEEE Conference on Decision and Control. IEEE. 4607--4612.

Cited By

Lin HAntsaklis PLin HAntsaklis P(2021)Formal SynthesisHybrid Dynamical Systems10.1007/978-3-030-78731-8_6(315-400)Online publication date: 18-Nov-2021
https://doi.org/10.1007/978-3-030-78731-8_6
Ehlers R(2018)On Improving the Efficiency of Game Solving for Hybrid System Control2018 IEEE Conference on Decision and Control (CDC)10.1109/CDC.2018.8619643(2426-2432)Online publication date: Dec-2018
https://doi.org/10.1109/CDC.2018.8619643
Benerecetti MFaella M(2017)Tracking smooth trajectories in linear hybrid systemsInformation and Computation10.1016/j.ic.2017.10.004257(114-138)Online publication date: Dec-2017
https://doi.org/10.1016/j.ic.2017.10.004

Index Terms

Automatic Synthesis of Switching Controllers for Linear Hybrid Systems: Reachability Control
1. Computing methodologies
  1. Artificial intelligence
    1. Control methods
      1. Computational control theory
2. Theory of computation
  1. Models of computation
    1. Timed and hybrid models

Recommendations

Automatic synthesis of switching controllers for linear hybrid systems: Safety control

In this paper we study the problem of automatically generating switching controllers for the class of Linear Hybrid Automata, with respect to safety objectives. While the same problem has been already considered in the literature, no sound and complete ...
Reachability games for linear hybrid systems
HSCC '12: Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control

We consider the problem of computing the controllable region of a Linear Hybrid Automaton with controllable and uncontrollable transitions, w.r.t. a reachability objective. We provide a semi-algorithm for the problem, by proposing the first algorithm in ...
A framework for the automatic synthesis of hybrid fuzzy/numerical controllers

In this paper, a framework for the automatic synthesis of hybrid fuzzy/numerical controllers is proposed. The methodology is based on model checking and on a very precise analysis of a system. This allows one to synthesize optimal numerical controllers ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Embedded Computing Systems

ACM Transactions on Embedded Computing Systems Volume 16, Issue 4

Special Issue on Secure and Fault-Tolerant Embedded Computing and Regular Papers

November 2017

614 pages

ISSN:1539-9087

EISSN:1558-3465

DOI:10.1145/3092956

Editor:
Sandeep K. Shukla
Indian Institute of Technology, India

Issue’s Table of Contents

Copyright © 2017 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Journal Family

ACM Journals for the Design of Smart and Connected Systems

Publication History

Published: 11 May 2017

Accepted: 01 January 2017

Revised: 01 November 2016

Received: 01 May 2014

Published in TECS Volume 16, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Istituto Nazionale di Alta Matematica “F. Severi” (INdAM)

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
106
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)1

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Lin HAntsaklis PLin HAntsaklis P(2021)Formal SynthesisHybrid Dynamical Systems10.1007/978-3-030-78731-8_6(315-400)Online publication date: 18-Nov-2021
https://doi.org/10.1007/978-3-030-78731-8_6
Ehlers R(2018)On Improving the Efficiency of Game Solving for Hybrid System Control2018 IEEE Conference on Decision and Control (CDC)10.1109/CDC.2018.8619643(2426-2432)Online publication date: Dec-2018
https://doi.org/10.1109/CDC.2018.8619643
Benerecetti MFaella M(2017)Tracking smooth trajectories in linear hybrid systemsInformation and Computation10.1016/j.ic.2017.10.004257(114-138)Online publication date: Dec-2017
https://doi.org/10.1016/j.ic.2017.10.004

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents