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, Thomas A. Henzinger & Rupak Majumdar (2003): Discounting the Future in Systems Theory. In: Proc. ICALP'03, ICALP '03. Springer, pp. 1022–1037, doi:10.1007/3-540-45061-0_79.
  3. Giorgio Bacci, Giovanni Bacci, Kim G. Larsen & Radu Mardare (2015): Converging from Branching to Linear Metrics on Markov Chains. In: Proc. ICTAC 2015, pp. 349–367, doi:10.1007/978-3-319-25150-9_21.
  4. Marco Bernardo, Rocco De Nicola & Michele Loreti (2012): Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes. In: Proc. FoSSaCS 2012, pp. 195–209, doi:10.1007/978-3-642-28729-9_13.
  5. Marco Bernardo, Rocco De Nicola & Michele Loreti (2013): The Spectrum of Strong Behavioral Equivalences for Nondeterministic and Probabilistic Processes. In: Proc. QAPL 2013, pp. 81–96, doi:10.4204/EPTCS.117.6.
  6. Marco Bernardo, Rocco De Nicola & Michele Loreti (2014): Relating strong behavioral equivalences for processes with nondeterminism and probabilities. Theor. Comput. Sci. 546, pp. 63–92, doi:10.1016/j.tcs.2014.03.001.
  7. 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.
  8. Stephen D. Brookes, C. A. R. Hoare & A. W. Roscoe (1984): A Theory of Communicating Sequential Processes. J. ACM 31(3), pp. 560–599, doi:10.1145/828.833.
  9. Valentina Castiglioni, Daniel Gebler & Simone Tini (2016): Logical Characterization of Bisimulation Metrics. In: Proc. QAPL'16, 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, pp. 36:1–36:15, doi:10.4230/LIPIcs.CONCUR.2016.36.
  11. Valentina Castiglioni, Daniel Gebler & Simone Tini (2018): SOS-based Modal Decomposition on Nondeterministic Probabilistic Processes. Logical Methods in Computer Science Volume 14, Issue 2, doi:10.23638/LMCS-14(2:18)2018.
  12. Valentina Castiglioni & Simone Tini (2017): Logical Characterization of Trace Metrics. In: Proc. QAPL@ETAPS 2017, EPTCS 250, pp. 39–74, doi:10.4204/EPTCS.250.4.
  13. Przemyslaw Daca, Thomas A. Henzinger, Jan Křetínský & Tatjana Petrov (2016): Linear Distances between Markov Chains. In: Proc. CONCUR 2016, pp. 20:1–20:15, doi:10.4230/LIPIcs.CONCUR.2016.20.
  14. Rocco De Nicola & Matthew Hennessy (1984): Testing Equivalences for Processes. Theor. Comput. Sci. 34, pp. 83–133, doi:10.1016/0304-3975(84)90113-0.
  15. Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy & Carroll Morgan (2008): Characterising Testing Preorders for Finite Probabilistic Processes. Logical Methods in Computer Science 4(4), doi:10.2168/LMCS-4(4:4)2008.
  16. Josee Desharnais, Vineet Gupta, Radha Jagadeesan & Prakash Panangaden (2004): Metrics for labelled Markov processes. Theor. Comput. Sci. 318(3), pp. 323–354, doi:10.1016/j.tcs.2003.09.013.
  17. Uli Fahrenberg & Axel Legay (2014): The quantitative linear-time-branching-time spectrum. Theor. Comput. Sci. 538, pp. 54–69, doi:10.1016/j.tcs.2013.07.030.
  18. Sonja Georgievska & Suzana Andova (2012): Probabilistic may/must testing: retaining probabilities by restricted schedulers. Formal Asp. Comput. 24(4-6), pp. 727–748, doi:10.1007/s00165-012-0236-5.
  19. Hans Hansson & Bengt Jonsson (1994): A logic for reasoning about time and reliability. FAC 6(5), pp. 512–535, doi:10.1007/BF01211866.
  20. Holger Hermanns, Augusto Parma, Roberto Segala, Björn Wachter & Lijun Zhang (2011): Probabilistic Logical Characterization. Inf. Comput. 209(2), pp. 154–172, doi:10.1016/j.ic.2010.11.024.
  21. Anthony Hoare (1985): Communicating Sequential Processes. Prentice-Hall.
  22. Chi-Chang Jou & Scott A. Smolka (1990): Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes. In: Proc. CONCUR '90, Lecture Notes in Computer Science 458, pp. 367–383, doi:10.1007/BFb0039071.
  23. Robert M. Keller (1976): Formal Verification of Parallel Programs. Commun. ACM 19(7), pp. 371–384, doi:10.1145/360248.360251.
  24. Roberto Segala (1995): A Compositional Trace-Based Semantics for Probabilistic Automata. In: Proc. CONCUR '95, pp. 234–248, doi:10.1007/3-540-60218-6_17.
  25. Roberto Segala (1995): Modeling and Verification of Randomized Distributed Real-Time Systems. MIT. Available at http://hdl.handle.net/1721.1/36560.
  26. Roberto Segala & Nancy A. Lynch (1995): Probabilistic Simulations for Probabilistic Processes. Nord. J. Comput. 2(2), pp. 250–273.
  27. Lin Song, Yuxin Deng & Xiaojuan Cai (2007): Towards Automatic Measurement of Probabilistic Processes. In: Proc. QSIC 2007, pp. 50–59, doi:10.1109/QSIC.2007.65.
  28. Nicolás Wolovick & Sven Johr (2006): A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes. In: Proc. FORMATS 2006, pp. 352–367, doi:10.1007/11867340_25.
  29. Wang Yi & Kim G. Larsen (1992): Testing Probabilistic and Nondeterministic Processes. In: Proc. PSTV'92 IFIP Transactions C-8, pp. 47–61.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org