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

Quantitative timed simulation functions and refinement metrics for real-time systems

Published: 08 April 2013 Publication History

Abstract

We introduce quantatitive timed refinement metrics and quantitative timed simulation functions, incorporating zenoness checks, for timed systems. These functions assign positive real numbers between zero and infinity which quantify the timing mismatches between two timed systems, amongst non-zeno runs. We quantify timing mismatches in three ways: (1) the maximum timing mismatch that can arise, (2) the "steady-state" maximum timing mismatches, where initial transient timing mismatches are ignored; and (3) the (long-run) average timing mismatches amongst two systems. These three kinds of mismatches constitute three important types of timing differences. Our event times are the global times, measured from the start of the system execution, not just the time durations of individual steps. We present algorithms over timed automata for computing the three quantitative simulation functions to within any desired degree of accuracy. In order to compute the values of the quantitative simulation functions, we use a game theoretic formulation. We introduce two new kinds of objectives for two player games on finite state game graphs: (1) eventual debit-sum level objectives, and (2) average debit-sum level objectives. We present algorithms for computing the optimal values for these objectives for player 1, and then use these algorithms to compute the values of the quantitative timed simulation functions.

References

[1]
R. Alur and D. L. Dill. A theory of timed automata. Theor. Comput. Sci., 126(2):183--235, 1994.
[2]
A. C. Antoulas, D. C. Sorensen, and S. Gugercin. A survey of model reduction methods for large-scale systems. Contemporary Mathematics, 280:193--219, 2001.
[3]
P. Bouyer, N. Markey, J. Olschewski, and M. Ummels. Measuring permissiveness in parity games: Mean-payoff parity games revisited. In ATVA, LNCS 6996, pages 135--149. 2011.
[4]
K. Cerans. Decidability of bisimulation equivalences for parallel timer processes. In CAV, LNCS 663, pages 302--315. 1992.
[5]
J. Chaloupka. Z-reachability problem for games on 2-dimensional vector addition systems with states is in P. In RP, pages 104--119, 2010.
[6]
K. Chatterjee and L. Doyen. Energy parity games. In ICALP, LNCS 6199, pages 599--610. Springer, 2010.
[7]
K. Chatterjee, L. Doyen, T.A. Henzinger, and J.-F. Raskin. Generalized mean-payoff and energy games. In FSTTCS, LIPIcs 8, pages 505--516. Schloss Dagstuhl - LZI, 2010.
[8]
K. Chatterjee, T.A. Henzinger, and M. Jurdzinski. Mean-payoff parity games. In LICS, pages 178--187. IEEE. 2005.
[9]
K. Chatterjee and V. S. Prabhu. Quantitative timed simulation functions and refinement metrics for timed systems (full version). CoRR, abs/1212.6556, 2012.
[10]
S. Chaudhuri, S. Gulwani, and R. Lublinerman. Continuity and robustness of programs. Commun. ACM, 55(8):107--115, 2012.
[11]
L. d. Alfaro, M. Faella, and M. Stoelinga. Linear and branching system metrics. IEEE Trans. Soft. Eng., 35:258--273, 2009.
[12]
J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Metrics for labelled markov processes. TCS, 318:323--354, 2004.
[13]
E.A. Emerson and C. Jutla. Tree automata, mu-calculus and determinacy. In FOCS'91, pages 368--377. IEEE, 1991.
[14]
A. Girard, A. A. Julius, and G. Pappas. Approximate simulation relations for hybrid systems. Discrete Event dynamic Systems, 18(2):163--179, 2008.
[15]
A. Girard, G. Pola, and P. Tabuada. Approximately bisimilar symbolic models for incrementally stable switched systems. Automatic Control, IEEE Transactions, 55:116--126, 2010.
[16]
T. A. Henzinger, R. Majumdar, and V. S. Prabhu. Quantifying similarities between timed systems. In FORMATS, LNCS 3829, pages 226--241. Springer, 2005.
[17]
J. Jacod and A. Shiryaev. Limit Theorems for Stochastic Processes. Springer, 2003.
[18]
G. Pola, P. Pepe, M. D. Di Benedetto, and P. Tabuada. Symbolic models for nonlinear time-delay systems using approximate bisimulations. Systems & Control Letters, 59(6):365--373, 2010.
[19]
J.D. Quesel, M. Franzle, and W. Damm. Crossing the bridge between similar games. In FORMATS 2011, LNCS 6919, pages 160--176, 2011.
[20]
F. v. Breugel, M. W. Mislove, J. Ouaknine, and J. Worrell. An intrinsic characterization of approximate probabilistic bisimilarity. In FoSSaCS, LNCS 2620, pages 200--215. 2003.
[21]
Y. Velner and A. Rabinovich. Church synthesis problem for noisy input. In FOSSACS, pages 275--289, 2011.

Cited By

View all
  • (2018)Average-energy gamesActa Informatica10.1007/s00236-016-0274-155:2(91-127)Online publication date: 1-Mar-2018
  • (2015)Average-energy gamesElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.193.1193(1-15)Online publication date: 23-Sep-2015
  • (2014)Edit distance for timed automataProceedings of the 17th international conference on Hybrid systems: computation and control10.1145/2562059.2562141(303-312)Online publication date: 15-Apr-2014

Index Terms

  1. Quantitative timed simulation functions and refinement metrics for real-time systems

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    HSCC '13: Proceedings of the 16th international conference on Hybrid systems: computation and control
    April 2013
    378 pages
    ISBN:9781450315678
    DOI:10.1145/2461328
    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

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 08 April 2013

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. approximation theories
    2. graph games
    3. quantitative simulation relations
    4. robustness
    5. timed automata

    Qualifiers

    • Research-article

    Conference

    HSCC '13
    Sponsor:
    HSCC '13: Computation and Control
    April 8 - 11, 2013
    Pennsylvania, Philadelphia, USA

    Acceptance Rates

    HSCC '13 Paper Acceptance Rate 40 of 86 submissions, 47%;
    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
    • (2018)Average-energy gamesActa Informatica10.1007/s00236-016-0274-155:2(91-127)Online publication date: 1-Mar-2018
    • (2015)Average-energy gamesElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.193.1193(1-15)Online publication date: 23-Sep-2015
    • (2014)Edit distance for timed automataProceedings of the 17th international conference on Hybrid systems: computation and control10.1145/2562059.2562141(303-312)Online publication date: 15-Apr-2014

    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