{"main_file_link":[{"url":"http://arxiv.org/abs/1212.6556","open_access":"1"}],"title":"Quantitative timed simulation functions and refinement metrics for real-time systems","quality_controlled":"1","scopus_import":1,"oa_version":"Preprint","publist_id":"3982","intvolume":"         1","language":[{"iso":"eng"}],"ec_funded":1,"year":"2013","publisher":"Springer","day":"01","date_published":"2013-04-01T00:00:00Z","doi":"10.1145/2461328.2461370","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Vinayak","full_name":"Prabhu, Vinayak","last_name":"Prabhu"}],"conference":{"name":"HSCC: Hybrid Systems - Computation and Control","location":"Philadelphia, PA USA","start_date":"2013-04-08","end_date":"2013-04-11"},"_id":"2819","publication_status":"published","publication":"Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control","abstract":[{"text":"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 &quot;steady-state&quot; 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. ","lang":"eng"}],"volume":1,"date_updated":"2021-01-12T06:59:56Z","type":"conference","page":"273 - 282","status":"public","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa":1,"acknowledgement":"This work has been financially supported in part by the European Commission FP7-ICT Cognitive Systems, Interaction, and Robotics under the contract # 270180 (NOP-TILUS); by Fundacao para Ciencia e Tecnologia under project PTDC/EEA-CRO/104901/2008 (Modeling and control of Networked vehicle systems in persistent autonomous operations); by Austrian Science Fund (FWF) Grant No P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification; FWF NFN Grant No S11407-N23 (RiSE); ERC Start grant (279307: Graph Games); and the Microsoft faculty fellows award","department":[{"_id":"KrCh"}],"citation":{"ieee":"K. Chatterjee and V. Prabhu, “Quantitative timed simulation functions and refinement metrics for real-time systems,” in <i>Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control</i>, Philadelphia, PA USA, 2013, vol. 1, pp. 273–282.","mla":"Chatterjee, Krishnendu, and Vinayak Prabhu. “Quantitative Timed Simulation Functions and Refinement Metrics for Real-Time Systems.” <i>Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control</i>, vol. 1, Springer, 2013, pp. 273–82, doi:<a href=\"https://doi.org/10.1145/2461328.2461370\">10.1145/2461328.2461370</a>.","ama":"Chatterjee K, Prabhu V. Quantitative timed simulation functions and refinement metrics for real-time systems. In: <i>Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control</i>. Vol 1. Springer; 2013:273-282. doi:<a href=\"https://doi.org/10.1145/2461328.2461370\">10.1145/2461328.2461370</a>","short":"K. Chatterjee, V. Prabhu, in:, Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, Springer, 2013, pp. 273–282.","apa":"Chatterjee, K., &#38; Prabhu, V. (2013). Quantitative timed simulation functions and refinement metrics for real-time systems. In <i>Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control</i> (Vol. 1, pp. 273–282). Philadelphia, PA USA: Springer. <a href=\"https://doi.org/10.1145/2461328.2461370\">https://doi.org/10.1145/2461328.2461370</a>","ista":"Chatterjee K, Prabhu V. 2013. Quantitative timed simulation functions and refinement metrics for real-time systems. Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control vol. 1, 273–282.","chicago":"Chatterjee, Krishnendu, and Vinayak Prabhu. “Quantitative Timed Simulation Functions and Refinement Metrics for Real-Time Systems.” In <i>Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control</i>, 1:273–82. Springer, 2013. <a href=\"https://doi.org/10.1145/2461328.2461370\">https://doi.org/10.1145/2461328.2461370</a>."},"date_created":"2018-12-11T11:59:46Z","month":"04"}