Simulation distances

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6269 LNCS, Issue , 2010, Pages 253-268

  Černý, Pavol ^a   Henzinger, Thomas A ^a   Radhakrishna, Arjun ^a  

^a INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

DEGREES OF FREEDOM; DISCRETE SYSTEMS; DISTANCE FUNCTIONS; DISTANCE MEASURE; ERROR CORRECTING CODE; FAIRNESS CONSTRAINTS; LIVENESS; PARALLEL COMPOSITION; POLYNOMIAL-TIME; PREORDERS; QUANTITATIVE MEASURES; QUANTITATIVE OBJECTIVES; QUANTITATIVE THEORY; SAFETY SPECIFICATIONS; SIMULATION GAMES; SIMULATION PREORDER; TRANSMISSION ERROR; TRIANGLE INEQUALITY;

ERROR DETECTION; POLYNOMIAL APPROXIMATION;

SPECIFICATIONS;

EID: 78249283527     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15375-4_18     Document Type: Conference Paper

References (20)

1. Alur, R., Henzinger, T., Kupferman, O., Vardi, M.: Alternating refinement relations. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 163-178. Springer, Heidelberg (1998)
2. Caspi, P., Benveniste, A.: Toward an approximation theory for computerised control. In: Sangiovanni-Vincentelli, A.L., Sifakis, J. (eds.) EMSOFT 2002. LNCS, vol. 2491, pp. 294-304. Springer, Heidelberg (2002)
3. Černý, P., Henzinger, T.A., Radhakrishna, A.: Simulation distances. Technical Report IST-2010-0003, IST Austria (June 2010)
4. Chatterjee, K., Doyen, L., Henzinger, T.: Quantitative languages. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol. 5213, pp. 385-400. Springer, Heidelberg (2008)
5. Chatterjee, K., Henzinger, T.A., Jurdzinski, M.: Mean-payoff parity games. In: LICS, pp. 178-187 (2005)
6. de Alfaro, L., Faella, M., Stoelinga, M.: Linear and branching system metrics. IEEE Trans. Software Eng. 35(2), 258-273 (2009)
7. de Alfaro, L., Henzinger, T., Majumdar, R.: Discounting the future in systems theory. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J.,Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 1022-1037. Springer, Heidelberg (2003)
8. de Alfaro, L., Majumdar, R., Raman, V., Stoelinga, M.: Game refinement relations and metrics. Logical Methods in Computer Science 4(3) (2008)
9. Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Metrics for labelled Markov processes. Theor. Comput. Sci. 318(3), 323-354 (2004)
10. Droste, M., Gastin, P.: Weighted automata and weighted logics. Theor. Comput. Sci. 380(1-2), 69-86 (2007)
11. Ehrenfeucht, A., Mycielski, J.: Positional strategies for mean payoff games. International Journal of Game Theory, 163-178 (1979)
12. Fenton, N.: Software Metrics: A Rigorous and Practical Approach, Revised (Paperback). Course Technology (1998)
13. Gurevich, Y., Harrington, L.: Trees, automata, and games. In: STOC, pp. 60-65 (1982)
14. Hamming, R.W.: Error detecting and error correcting codes. Bell System Tech. J. 29, 147-160 (1950)
15. Henzinger, T.A., Kupferman, O., Rajamani, S.K.: Fair simulation. Information and Computation, 273-287 (1997)
16. Lincke, R., Lundberg, J., Löwe, W.: Comparing software metrics tools. In: ISSTA, pp. 131-142 (2008)
17. Milner, R.: An algebraic definition of simulation between programs. In: IJCAI, pp. 481-489 (1971)
18. van Breugel, F.: An introduction to metric semantics: operational and denotational models for programming and specification languages. Theor. Comput. Sci. 258(1- 2), 1-98 (2001)
19. van Breugel, F., Worrell, J.: Approximating and computing behavioural distances in probabilistic transition systems. Theo. Comp. Sci. 360(1-3), 373-385 (2006)
20. Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theor. Comput. Sci. 158(1&2), 343-359 (1996)