1. Giorgio Bacci & Marino Miculan (2012): Structural Operational Semantics for Continuous State Probabilistic Processes. In: Proc. CMCS'12, LNCS 7399. Springer, pp. 71–89, doi:10.1007/978-3-642-32784-1_5.
  2. Falk Bartels (2004): On Generalised Coinduction and Probabilistic Specification Formats. VU University Amsterdam.
  3. 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.
  4. Pedro R. D'Argenio & Matias David Lee (2012): Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation. In: Proc. FoSSaCS'12, LNCS 7213. Springer, pp. 452–466, doi:10.1007/978-3-642-28729-9_30.
  5. Josée Desharnais, Vineet Gupta, Radha Jagadeesan & Prakash Panangaden (2003): Approximating Labelled Markov Processes. Information and Computation 184(1), pp. 160 – 200, doi:10.1016/S0890-5401(03)00051-8.
  6. Josée 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.
  7. Josée Desharnais, Francois Laviolette & Mathieu Tracol (2008): Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games. In: Proc. QEST'08. IEEE, pp. 264–273, doi:10.1109/QEST.2008.42.
  8. Alessandro Giacalone, Chi-Chang Jou & Scott A. Smolka (1990): Algebraic Reasoning for Probabilistic Concurrent Systems. In: Proc. IFIP TC2 Working Conf. on Prog. Concepts and Methods, pp. 443–458.
  9. Rob J. van Glabbeek (2004): The Meaning of Negative Premises in Transition System Specifications II. J. Log. Algebr. Program. 60-61, pp. 229–258, doi:10.1016/j.jlap.2004.03.007.
  10. Jan Friso Groote (1993): Transition System Specifications with Negative Premises. Theor. Comput. Sci. 118(2), pp. 263–299, doi:10.1016/0304-3975(93)90111-6.
  11. Jan Friso Groote & Frits Vaandrager (1992): Structured Operational Semantics and Bisimulation as a Congruence. Inf. Comput. 100, pp. 202–260, doi:10.1016/0890-5401(92)90013-6.
  12. Ruggero Lanotte & Simone Tini (2005): Probabilistic Congruence for Semistochastic Generative Processes. In: Proc. FoSSaCS'05, LNCS 3441. Springer, pp. 63–78, doi:10.1007/978-3-540-31982-5_4.
  13. Ruggero Lanotte & Simone Tini (2009): Probabilistic Bisimulation as a Congruence. ACM TOCL 10, pp. 1–48, doi:10.1145/1462179.1462181.
  14. Kim G. Larsen & Arne Skou (1991): Bisimulation Through Probabilistic Testing. Inf. Comput. 94, pp. 1–28, doi:10.1016/0890-5401(91)90030-6.
  15. Matias David Lee, Daniel Gebler & Pedro R. D'Argenio (2012): Tree Rules in Probabilistic Transition System Specifications with Negative and Quantitative Premises. In: Proc. EXPRESS/SOS'12, EPTCS 89, pp. 115–130, doi:10.4204/EPTCS.89.9.
  16. Matteo Mio & Alex Simpson (2013): A Proof System for Compositional Verification of Probabilistic Concurrent Processes. In: Proc. FoSSaCS'13, LNCS 7794. Springer, pp. 161–176, doi:10.1007/978-3-642-37075-5_11.
  17. Gordon Plotkin (1981): A Structural Approach to Operational Semantics. Report DAIMI FN-19. Aarhus University.
  18. Roberto Segala (1995): Modeling and Verification of Randomized Distributed Real-Time Systems. MIT.
  19. Simone Tini (2008): Non Expansive ε-bisimulations. In: Proc. AMAST'08, LNCS 5140. Springer, pp. 362–376, doi:10.1007/978-3-540-79980-1_27.
  20. Simone Tini (2010): Non-expansive ε-bisimulations for Probabilistic Processes. Theoret. Comput. Sci. 411, pp. 2202–2222, doi:10.1016/j.tcs.2010.01.027.
  21. Mathieu Tracol (2010): Approximate Verification of Probabilistic Systems. Dissertation. LRI, Université Paris-Sud.
  22. Mathieu Tracol, Josée Desharnais & Abir Zhioua (2011): Computing Distances between Probabilistic Automata. In: Proc. QAPL'11, EPTCS 57, pp. 148–162, doi:10.4204/EPTCS.57.11.

Comments and questions to:
For website issues: