---
res:
bibo_abstract:
- "\r\nWe introduce quantitative timed refinement and timed simulation (directed)
metrics, incorporating zenoness checks, for timed systems. These metrics assign
positive real numbers which quantify the timing mismatches between two timed systems,
amongst non-zeno runs. We quantify timing mismatches in three ways: (1) the maximal
timing mismatch that can arise, (2) the “steady-state” maximal 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 distances to within any desired degree of accuracy.
In order to compute the values of the quantitative simulation distances, 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 in graph games, and then use these algorithms
to compute the values of the timed simulation distances over timed automata.\r\n@eng"
bibo_authorlist:
- foaf_Person:
foaf_givenName: Krishnendu
foaf_name: Chatterjee, Krishnendu
foaf_surname: Chatterjee
foaf_workInfoHomepage: http://www.librecat.org/personId=2E5DCA20-F248-11E8-B48F-1D18A9856A87
orcid: 0000-0002-4561-241X
- foaf_Person:
foaf_givenName: Vinayak
foaf_name: Prabhu, Vinayak
foaf_surname: Prabhu
bibo_doi: 10.1109/TAC.2015.2404612
bibo_issue: '9'
bibo_volume: 60
dct_date: 2015^xs_gYear
dct_language: eng
dct_publisher: IEEE@
dct_title: Quantitative temporal simulation and refinement distances for timed systems@
...