Metrics for Action-labelled Quantitative Transition Systems

Electronic Notes in Theoretical Computer Science

Volumn 153, Issue 2 SPEC. ISS., 2006, Pages 79-96

  Deng, Yuxin ^a   Chothia, Tom ^b   Palamidessi, Catuscia ^b   Pang, Jun ^b  

^a UNIVERSITÉ PARIS DESCARTES   (France)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

bisimulations; metrics; processes; quantitative; Transition systems

Indexed keywords

AUTOMATA THEORY; COMPUTER SCIENCE; INFORMATION TECHNOLOGY; METRIC SYSTEM; PROBABILITY;

BISIMULATIONS; SINGLE STATE-METRIC CORRESPONDS; STATE-METRICS; TRANSITION SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33646391523     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.10.033     Document Type: Article

References (30)

1. Baier C., and Hermanns H. Weak bisimulation for fully probabilistic processes. Proceedings of the 9th International Conference on Computer Aided Verification. Lecture Notes in Computer Science volume 1254 (1997), Springer-Verlag 119-130
2. L. Chen. Timed processes: Models, axioms and decidability. Technical Report ECS-LFCS-93-271, LFCS, University of Edinburgh, 1993
3. de Alfaro L., Faella M., and Stoelinga M.I.A. Linear and branching metrics for quantitative transition systems. Proceedings of the 31st International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science volume 3142 (2004), Springer-Verlag 97-109
4. de Vink E.P., and Rutten J.J.M.M. Bisimulation for probabilistic transition systems: A coalgebraic approach. Theoretical Computer Science 221 1/2 (1999) 271-293
5. J.I. den Hartog. Probabilistic Extensions of Semantical Models. PhD thesis, Free University Amsterdam, 2002
6. Deng Y., and Palamidessi C. Axiomatizations for probabilistic finite-state behaviors'. Proceedings of the 8th International Conference on Foundations of Software Science and Computation Structures. Lecture Notes in Computer Science volume 3441 (2005), Springer 110-124
7. Desharnais J., Jagadeesan R., Gupta V., and Panangaden P. The metric analogue of weak bisimulation for probabilistic processes. Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002), IEEE Computer Society 413-422
8. Desharnais J., Jagadeesan R., Gupta V., and Panangaden P. Metrics for labelled Markov processes. Theoretical Computer Science 318 3 (2004) 323-354 An early version of this paper appeared in the proceedings of CONCUR'99
9. Eilenberg S. Automata, Languages, and Machines (1974), Academic Press
10. A. Giacalone, C.-C. Jou, and S.A. Smolka. Algebraic reasoning for probabilistic concurrent systems. In Proceedings of IFIP WG 2.2/2.3 Working Conference on Programming Concepts and Methods, pages 453-459, 1990
11. Herescu O.M., and Palamidessi C. Probabilistic asynchronous π-calculus. Proceedings of the 3rd International Conference Foundations of Software Science and Computation Structures. Lecture Notes in Computer Science volume 1784 (2000), Springer-Verlag 146-160
12. Hutchinson J.E. Fractals and self-similarity. Indiana University Mathematics Journal 30 (1981) 713-747
13. Kantorovich L. On the transfer of masses (in Russian). Doklady Akademii Nauk 5 1 (1942) 1-4 Translated in
14. Kantorovich L. On the transfer of masses (in Russian). Management Science 5 1 (1958) 1-4
15. Kwiatkowska M.Z., and Norman G.J. Probabilistic metric semantics for a simple language with recursion. Proceedings of 21st International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science volume 1113 (1996), Springer-Verlag 419-430
16. Larsen K.G., and Skou A. Bisimulation through probabilistic testing. Information and Computation 94 1 (1991) 1-28
17. Milner R. Communication and Concurrency (1989), Prentice-Hall
18. Mohri M. Edit-distance of weighted automata: General definitions and algorithms. International Journal of Foundations of Computer Science 14 6 (2003) 957-982
19. G.J. Norman. Metric Semantics for Reactive Probabilistic Systems. PhD thesis, University of Birmingham, 1997
20. Philippou A., Lee I., and Sokolsky O. Weak bisimulation for probabilistic systems. Proceedings of the 11th International Conference on Concurrency Theory. Lecture Notes in Computer Science volume 1877 (2000), Springer-Verlag 334-349
21. R. Segala. Modeling and verification of randomized distributed real-time systems. Technical Report MIT/LCS/TR-676, PhD thesis, Massachusetts Institute of Technology, 1995
22. Sokolova A., and de Vink E. Probabilistic automata: system types, parallel composition and comparison. Validation of Stochastic Systems: A Guide to Current Research. Lecture Notes in Computer Science volume 2925 (2004), Springer-Verlag 1-43
23. Tarski A. A lattice-theoretical fixed point theorem and its applications. Pacific Journal of Mathematics 5 (1955) 285-309
24. van Breugel F., and Worrell J. An algorithm for quantitative verification of probabilistic transition systems. Proceedings of the 12th International Conference on Concurrency Theory. Lecture Notes in Computer Science volume 2154 (2001), Springer-Verlag 336-350
25. van Breugel F., and Worrell J. Towards quantitative verification of probabilistic transition systems. Proceedings of the 28th International Colloquium Automata, Languages and Programming. Lecture Notes in Computer Science volume 2076 (2001), Springer-Verlag 421-432
26. van Breugel F., and Worrell J. A behavioural pseudometric for probabilistic transition systems. Theoretical Computer Science 331 1 (2005) 115-142
27. van Glabbeek R.J., Smolka S.A., and Steffen B. Reactive, generative, and stratified models of probabilistic processes. Information and Computation 121 1 (1995) 59-80
28. Vaserstein L. Markov processes over denumerable products of spaces, describing large systems of automata. Problems in Information Transmission 5 3 (1969) 47-52
29. Wang Y. CCS + time = an interleaving model for real time systems. Proceedings of the 18th Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science volume 510 (1991), Springer-Verlag 217-228
30. Ying M. Bisimulation indexes and their applications. Theoretical Computer Science 275 1/2 (2002) 1-68