---
res:
bibo_abstract:
- We define quantitative similarity functions between timed transition systems that
measure the degree of closeness of two systems as a real, in contrast to the traditional
boolean yes/no approach to timed simulation and language inclusion. Two systems
are close if for each timed trace of one system, there exists a corresponding
timed trace in the other system with the same sequence of events and closely corresponding
event timings. We show that timed CTL is robust with respect to our quantitative
version of bisimilarity, in particular, if a system satisfies a formula, then
every close system satisfies a close formula. We also define a discounted version
of CTL over timed systems, which assigns to every CTL formula a real value that
is obtained by discounting real time. We prove the robustness of discounted CTL
by establishing that close states in the bisimilarity metric have close values
for all discounted CTL formulas.@eng
bibo_authorlist:
- foaf_Person:
foaf_givenName: Thomas A
foaf_name: Thomas Henzinger
foaf_surname: Henzinger
foaf_workInfoHomepage: http://www.librecat.org/personId=40876CD8-F248-11E8-B48F-1D18A9856A87
orcid: 0000−0002−2985−7724
- foaf_Person:
foaf_givenName: Ritankar
foaf_name: Majumdar, Ritankar S
foaf_surname: Majumdar
- foaf_Person:
foaf_givenName: Vinayak
foaf_name: Prabhu, Vinayak S
foaf_surname: Prabhu
bibo_doi: 10.1007/11603009_18
bibo_volume: 3829
dct_date: 2005^xs_gYear
dct_publisher: Springer@
dct_title: Quantifying similarities between timed systems@
...