References

  1. Luca de Alfaro, Marco Faella & Mariëlle Stoelinga (2009): Linear and Branching System Metrics. IEEE Trans. Software Eng. 35(2), pp. 258–273, doi:10.1109/TSE.2008.106.
  2. Luca de Alfaro, Rupak Majumdar, Vishwanath Raman & Mariëlle Stoelinga (2008): Game Refinement Relations and Metrics. Logical Methods in Computer Science 4(3), doi:10.2168/LMCS-4(3:7)2008.
  3. Giorgio Bacci, Giovanni Bacci, Kim G. Larsen & Radu Mardare (2015): Converging from Branching to Linear Metrics on Markov Chains. In: Proceedings of ICTAC 2015, pp. 349–367, doi:10.1007/978-3-319-25150-9_21.
  4. Marco Bernardo, Rocco De Nicola & Michele Loreti (2014): Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes. Logical Methods in Computer Science 10(1), doi:10.2168/LMCS-10(1:16)2014.
  5. Bard Bloom, Wan J. Fokkink & Robert J. van Glabbeek (2004): Precongruence formats for decorated trace semantics. ACM Trans. Comput. Log. 5(1), pp. 26–78, doi:10.1145/963927.963929.
  6. Franck van Breugel (2005): A Behavioural Pseudometric for Metric Labelled Transition Systems. In: Proceedings of CONCUR 2005, pp. 141–155, doi:10.1007/11539452_14.
  7. Franck van Breugel & James Worrell (2001): Towards Quantitative Verification of Probabilistic Transition Systems. In: Proceedings of ICALP, pp. 421–432, doi:10.1007/3-540-48224-5_35.
  8. Franck van Breugel & James Worrell (2005): A behavioural pseudometric for probabilistic transition systems. Theor. Comput. Sci. 331(1), pp. 115–142, doi:10.1016/j.tcs.2004.09.035.
  9. Valentina Castiglioni, Daniel Gebler & Simone Tini (2016): Logical Characterization of Bisimulation Metrics. In: Proceedings of QAPL 2016, EPTCS 227, pp. 44–62, doi:10.4204/EPTCS.227.4.
  10. Valentina Castiglioni, Daniel Gebler & Simone Tini (2016): Modal Decomposition on Nondeterministic Probabilistic Processes. In: Proc. CONCUR 2016, LIPIcs 59. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 36:1–36:15, doi:10.4230/LIPIcs.CONCUR.2016.36.
  11. Przemyslaw Daca, Thomas A. Henzinger, Jan Kretínský & Tatjana Petrov (2016): Linear Distances between Markov Chains. In: Proceedings of CONCUR 2016, pp. 20:1–20:15, doi:10.4230/LIPIcs.CONCUR.2016.20.
  12. Yuxin Deng, Tom Chothia, Catuscia Palamidessi & Jun Pang (2006): Metrics for Action-labelled Quantitative Transition Systems. Electronic Notes in Theoretical Computer Science 153(2), pp. 79–96, doi:10.1016/j.entcs.2005.10.033.
  13. Yuxin Deng & Wenjie Du (2011): Logical, Metric, and Algorithmic Characterisations of Probabilistic Bisimulation. CoRR abs/1103.4577. Available at http://arxiv.org/abs/1103.4577.
  14. Josee Desharnais, Vineet Gupta, Radha Jagadeesan & Prakash Panangaden (2004): Metrics for labelled Markov processes. Theoretical Computer Science 318(3), pp. 323–354, doi:10.1016/j.tcs.2003.09.013.
  15. Josée Desharnais, Radha Jagadeesan, Vineet Gupta & Prakash Panangaden (2002): The Metric Analogue of Weak Bisimulation for Probabilistic Processes. In: Proc. LICS 2002, pp. 413–422, doi:10.1109/LICS.2002.1029849.
  16. Wenjie Du, Yuxin Deng & Daniel Gebler (2016): Behavioural Pseudometrics for Nondeterministic Probabilistic Systems. In: Proceedings of SETTA 2016, pp. 67–84, doi:10.1007/978-3-319-47677-3_5.
  17. Daniel Gebler & Simone Tini (2015): SOS Specifications of Probabilistic Systems by Uniformly Continuous Operators. In: Proc. CONCUR 2015, pp. 155–168, doi:10.4230/LIPIcs.CONCUR.2015.155.
  18. Alessandro Giacalone, Chi-Chang Jou & Scott A. Smolka (1990): Algebraic Reasoning for Probabilistic Concurrent Systems. In: Proc. IFIP Work, Conf. on Programming, Concepts and Methods, pp. 443–458.
  19. Hans Hansson & Bengt Jonsson (1994): A logic for reasoning about time and reliability. Formal Aspects of Computing 6(5), pp. 512–535, doi:10.1007/BF01211866.
  20. Matthew Hennessy & Robin Milner (1985): Algebraic laws for nondeterminism and concurrency. J. Assoc. Comput. Mach. 32, pp. 137–161, doi:10.1145/2455.2460.
  21. Holger Hermanns, Augusto Parma, Roberto Segala, Björn Wachter & Lijun Zhang (2011): Probabilistic Logical Characterization. Information and Computation 209(2), pp. 154–172, doi:10.1016/j.ic.2010.11.024.
  22. Leonid V. Kantorovich (1942): On the Transfer of Masses. Original article in Russian, translation in Management Science, 5: 1-4 (1959).
  23. Robert M. Keller (1976): Formal Verification of Parallel Programs. Commun. ACM 19(7), pp. 371–384, doi:10.1145/360248.360251.
  24. Marta Z. Kwiatkowska & Gethin Norman (1996): Probabilistic Metric Semantics for a Simple Language with Recursion. In: Proc. MFCS'96, pp. 419–430, doi:10.1007/3-540-61550-4_167.
  25. Kim G. Larsen, Radu Mardare & Prakash Panangaden (2012): Taking It to the Limit: Approximate Reasoning for Markov Processes. In: Proc. MFCS 2012, pp. 681–692, doi:10.1007/978-3-642-32589-2_59.
  26. Augusto Parma & Roberto Segala (2007): Logical Characterizations of Bisimulations for Discrete Probabilistic Systems. In: Proceedings of FoSSaCS 2007, pp. 287–301, doi:10.1007/978-3-540-71389-0_21.
  27. Roberto Segala (1995): A Compositional Trace-Based Semantics for Probabilistic Automata. In: Proceedings of CONCUR '95, pp. 234–248, doi:10.1007/3-540-60218-6_17.
  28. Roberto Segala (1995): Modeling and Verification of Randomized Distributed Real-Time Systems. MIT. Available at http://hdl.handle.net/1721.1/36560.
  29. Lin Song, Yuxin Deng & Xiaojuan Cai (2007): Towards Automatic Measurement of Probabilistic Processes. In: Proceedings of QSIC 2007, pp. 50–59, doi:10.1109/QSIC.2007.65.
  30. William J. Stewart (1994): Introduction to the Numerical Solution of Markov Chains. Princeton University Press.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org