skip to main content
10.1145/1967701.1967734acmconferencesArticle/Chapter ViewAbstractPublication PagescpsweekConference Proceedingsconference-collections
research-article

Synthesis of memory-efficient "real-time" controllers for safety objectives

Published: 12 April 2011 Publication History

Abstract

We study synthesis of controllers for real-time systems, where the objective is to stay in a given safe set. The problem is solved by obtaining winning strategies in the setting of concurrent two-player timed automaton games with safety objectives. To prevent a player from winning by blocking time, we restrict each player to strategies that ensure that the player cannot be responsible for causing a zeno run. We construct winning strategies for the controller which require access only to (1) the system clocks (thus, controllers which require their own internal infinitely precise clocks are not necessary), and (2) a linear (in the number of clocks) number of memory bits. Precisely, we show that for safety objectives, a memory of size (3 •|C| + lg(|C|+1)) bits suffices for winning controller strategies, where C is the set of clocks of the timed automaton game, significantly improving the previous known exponential bound. We also settle the open question of whether winning region controller strategies require memory for safety objectives by showing with an example the necessity of memory for region strategies to win for safety objectives.

References

[1]
R. Alur and D. L. Dill. A theory of timed automata. Theor. Comput. Sci., 126(2):183--235, 1994.
[2]
R. Alur and T. A. Henzinger. Modularity for timed and hybrid systems. In CONCUR 97, LNCS 1243, pages 74--88. Springer, 1997.
[3]
E. Asarin and O. Maler. As soon as possible: Time optimal control for timed automata. In HSCC 99, LNCS 1569, pages 19--30. Springer, 1999.
[4]
P. Bouyer, E. Brinksma, and K. G. Larsen. Staying alive as cheaply as possible. In HSCC 04, LNCS 2993, pages 203--218. Springer, 2004.
[5]
P. Bouyer, D. D'Souza, P. Madhusudan, and A. Petit. Timed control with partial observability. In CAV 03, LNCS 2725, pages 180--192. Springer, 2003.
[6]
F. Cassez, A. David, E. Fleury, K. G. Larsen, and D. Lime. Efficient on-the-fly algorithms for the analysis of timed games. In CONCUR 05, pages 66--80. Springer, 2005.
[7]
K. Chatterjee, T. A. Henzinger, and V. S. Prabhu. Trading infinite memory for uniform randomness in timed games. In HSCC 08, LNCS 4981. Springer, 2008.
[8]
K. Chatterjee and V. S. Prabhu. Synthesis of memory-efficient real-time controllers for safety objectives. CoRR, abs/1101.5842, 2011.
[9]
L. de Alfaro, M. Faella, T A. Henzinger, R. Majumdar, and M. Stoelinga. The element of surprise in timed games. In CONCUR 03, LNCS 2761, pages 144--158. Springer, 2003.
[10]
D. D'Souza and P. Madhusudan. Timed control synthesis for external specifications. In STACS 02, LNCS 2285, pages 571--582. Springer, 2002.
[11]
S. Dziembowski, M. Jurdzińnski, and I. Walukiewicz. How much memory is needed to win infinite games? In LICS 97, pages 99--110. IEEE Computer Society, 1997.
[12]
T. A. Henzinger and P. W. Kopke. Discrete-time control for rectangular hybrid automata. Theoretical Computer Science, 221:369--392, 1999.
[13]
T. A. Henzinger and V. S. Prabhu. Timed alternating-time temporal logic. In FORMATS 06, LNCS 4202, pages 1--17. Springer, 2006.
[14]
A. Pnueli, E. Asarin, O. Maler, and J. Sifakis. Controller synthesis for timed automata. In Proc. System Structure and Control. Elsevier, 1998.
[15]
R. Segala, R. Gawlick, J.F. Søgaard-Andersen, and N. A. Lynch. Liveness in timed and untimed systems. Inf. Comput., 141(2):119--171, 1998.
[16]
W. Thomas. Languages, automata, and logic. In Handbook of Formal Languages, volume 3, Beyond Words, chapter 7, pages 389--455. Springer, 1997.

Cited By

View all
  • (2017)Language Inclusion Checking of Timed Automata with Non-ZenonessIEEE Transactions on Software Engineering10.1109/TSE.2017.265377843:11(995-1008)Online publication date: 1-Nov-2017
  • (2015)A Systematic Study on Explicit-State Non-Zenoness Checking for Timed AutomataIEEE Transactions on Software Engineering10.1109/TSE.2014.235989341:1(3-18)Online publication date: 1-Jan-2015
  • (2013)Improving Model Checking Stateful Timed CSP with non-Zenoness through Clock-Symmetry ReductionFormal Methods and Software Engineering10.1007/978-3-642-41202-8_13(182-198)Online publication date: 2013
  • Show More Cited By

Index Terms

  1. Synthesis of memory-efficient "real-time" controllers for safety objectives

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    HSCC '11: Proceedings of the 14th international conference on Hybrid systems: computation and control
    April 2011
    330 pages
    ISBN:9781450306294
    DOI:10.1145/1967701
    • General Chair:
    • Marco Caccamo,
    • Program Chairs:
    • Emilio Frazzoli,
    • Radu Grosu
    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 ACM 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]

    Sponsors

    In-Cooperation

    • IEEE

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 12 April 2011

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. control
    2. safety objectives
    3. timed automata
    4. timed games

    Qualifiers

    • Research-article

    Conference

    HSCC '11
    Sponsor:
    HSCC '11: Hybrid Systems: Computation and Control
    April 12 - 14, 2011
    IL, Chicago, USA

    Acceptance Rates

    Overall Acceptance Rate 153 of 373 submissions, 41%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 18 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2017)Language Inclusion Checking of Timed Automata with Non-ZenonessIEEE Transactions on Software Engineering10.1109/TSE.2017.265377843:11(995-1008)Online publication date: 1-Nov-2017
    • (2015)A Systematic Study on Explicit-State Non-Zenoness Checking for Timed AutomataIEEE Transactions on Software Engineering10.1109/TSE.2014.235989341:1(3-18)Online publication date: 1-Jan-2015
    • (2013)Improving Model Checking Stateful Timed CSP with non-Zenoness through Clock-Symmetry ReductionFormal Methods and Software Engineering10.1007/978-3-642-41202-8_13(182-198)Online publication date: 2013
    • (2013)PyEcdar: Towards Open Source Implementation for Timed SystemsAutomated Technology for Verification and Analysis10.1007/978-3-319-02444-8_35(460-463)Online publication date: 2013

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media