References

1. Luca Aceto, Anna Ingólfsdóttir, Paul Blain Levy & Joshua Sack (2012): Characteristic formulae for fixed-point semantics: a general framework. Mathematical Structures in Computer Science 22(2), pp. 125–173, doi:10.1017/S0960129511000375.
2. Alessandro Aldini, Mario Bravetti & Roberto Gorrieri (2004): A process-algebraic approach for the analysis of probabilistic noninterference. Journal of Computer Security 12(2), pp. 191–245, doi:10.3233/JCS-2004-12202. Available at http://content.iospress.com/articles/journal-of-computer-security/jcs198.
3. Alessandro Aldini, Mario Bravetti, Alessandra Di Pierro, Roberto Gorrieri, Chris Hankin & Herbert Wiklicky (2002): Two Formal Approaches for Approximating Noninterference Properties. In: FOSAD 2001/2002, pp. 1–43, doi:10.1007/978-3-540-24631-2_1.
4. Luca de Alfaro, Marco Faella & Mariëlle Stoelinga (2004): Linear and Branching Metrics for Quantitative Transition Systems. In: Proc. ICALP 2004, pp. 97–109, doi:10.1007/978-3-540-27836-8_11.
5. Luca de Alfaro, Thomas A. Henzinger & Rupak Majumdar (2003): Discounting the Future in Systems Theory. In: Proc. ICALP 2003, pp. 1022–1037, doi:10.1007/3-540-45061-0_79.
6. 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.
7. Giorgio Bacci, Giovanni Bacci, Kim G. Larsen & Radu Mardare (2014): Topologies of Stochastic Markov Models: Computational Aspects. CoRR abs/1403.6032. Available at http://arxiv.org/abs/1403.6032.
8. Christel Baier (1998): On Algorithmic Verification Methods for Probabilistic Systems. Uviversität Mannheim.
9. Marco Bernardo, Rocco De Nicola & Michele Loreti (2015): Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes. Acta Inf. 52(1), pp. 61–106, doi:10.1007/s00236-014-0210-1.
10. Bard Bloom, Wan J. Fokkink & Rob J. van Glabbeek (2004): Precongruence formats for decorated trace semantics. ACM Trans. Comput. Log. 5(1), pp. 26–78, doi:10.1145/963927.963929.
11. Franck van Breugel (2012): On behavioural pseudometrics and closure ordinals. Inf. Process. Lett. 112(19), pp. 715–718, doi:10.1016/j.ipl.2012.06.019.
12. Franck van Breugel & James Worrell (2001): An Algorithm for Quantitative Verification of Probabilistic Transition Systems. In: Proc. CONCUR 2001, pp. 336–350, doi:10.1007/3-540-44685-0_23.
13. 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.
14. Valentina Castiglioni, Daniel Gebler & Simone Tini (2016): Modal Decomposition on Nondeterministic Probabilistic Processes. In: Proc. CONCUR 2016, LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, doi:10.4230/LIPIcs.CONCUR.2016.36.
15. Konstantinos Chatzikokolakis, Daniel Gebler, Catuscia Palamidessi & Lili Xu (2014): Generalized Bisimulation Metrics. In: Proc. CONCUR 2014, pp. 32–46, doi:10.1007/978-3-662-44584-6_4.
16. Edmund M. Clarke & E. Allen Emerson (1981): Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic. In: Proc. Logics of Programs, pp. 52–71, doi:10.1007/BFb0025774.
17. Pedro R. D'Argenio, Pedro Sánchez Terraf & Nicolás Wolovick (2012): Bisimulations for non-deterministic labelled Markov processes. Mathematical Structures in Computer Science 22(1), pp. 43–68, doi:10.1017/S0960129511000454.
18. Yuxin Deng, Tom Chothia, Catuscia Palamidessi & Jun Pang (2006): Metrics for Action-labelled Quantitative Transition Systems. Electr. Notes Theor. Comput. Sci. 153(2), pp. 79–96, doi:10.1016/j.entcs.2005.10.033.
19. 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.
20. Yuxin Deng, Wenjie Du & Daniel Gebler (2015): Modal Characterisations of Behavioural Pseudometrics. CoRR abs/1509.03391. Available at http://arxiv.org/abs/1509.03391.
21. Yuxin Deng, Yuan Feng & Ugo Dal Lago (2015): On Coinduction and Quantum Lambda Calculi. In: Proc. CONCUR 2015, pp. 427–440, doi:10.4230/LIPIcs.CONCUR.2015.427.
22. Yuxin Deng & Rob J. van Glabbeek (2010): Characterising Probabilistic Processes Logically - (Extended Abstract). In: Proc. LPAR-17, pp. 278–293, doi:10.1007/978-3-642-16242-8_20.
23. 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.
24. Josee Desharnais, Abbas Edalat & Prakash Panangaden (2002): Bisimulation for Labelled Markov Processes. Inf. Comput. 179(2), pp. 163–193, doi:10.1006/inco.2001.2962.
25. 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.
26. Josee 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.
27. E. Allen Emerson (1990): Temporal and Modal Logic. In: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), pp. 995–1072.
28. 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.
29. Yuan Feng & Lijun Zhang (2014): When Equivalence and Bisimulation Join Forces in Probabilistic Automata. In: Proc. FM 2014, pp. 247–262, doi:10.1007/978-3-319-06410-9_18.
30. Wan J. Fokkink & Robert J. van Glabbeek (2016): Divide and Congruence II: From Decomposition of Modal Formulas to Preservation of Delay and Weak Bisimilarity. CoRR abs/1604.07530.
31. Wan J. Fokkink, Robert J. van Glabbeek & Paulien de Wind (2006): Compositionality of Hennessy-Milner logic by structural operational semantics. Theoret. Comput. Sci. 354(3), pp. 421–440, doi:10.1016/j.tcs.2005.11.035.
32. Wan J. Fokkink, Robert J. van Glabbeek & Paulien de Wind (2012): Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarity. Inf. Comput. 214, pp. 59–85, doi:10.1016/j.ic.2011.10.011.
33. Daniel Gebler & Wan J. Fokkink (2012): Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics. In: Proc. CONCUR 2012, pp. 395–409, doi:10.1007/978-3-642-32940-1_28.
34. Daniel Gebler, Kim G. Larsen & Simone Tini (2015): Compositional Metric Reasoning with Probabilistic Process Calculi. In: Proc. FoSSaCS 2015, pp. 230–245, doi:10.1007/978-3-662-46678-0_15.
35. Daniel Gebler, Kim G. Larsen & Simone Tini (2016): Compositional metric reasoning with Probabilistic Process Calculi. Logical Methods in Computer Science.
36. Daniel Gebler & Simone Tini (2014): Fixed-point Characterization of Compositionality Properties of Probabilistic Processes Combinators. In: Proc. EXPRESS/SOS 2014, pp. 63–78, doi:10.4204/EPTCS.160.7.
37. 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.
38. 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.
39. Susanne Graf & Joseph Sifakis (1986): A Modal Characterization of Observational Congruence on Finite Terms of CCS. Information and Control 68(1-3), pp. 125–145, doi:10.1016/S0019-9958(86)80031-6.
40. Matthew Hennessy (2012): Exploring Probabilistic Bisimulations, part I. Formal Asp. Comput. 24(4-6), pp. 749–768, doi:10.1007/s00165-012-0242-7.
41. Matthew Hennessy & Robin Milner (1985): Algebraic laws for nondeterminism and concurrency. J. Assoc. Comput. Mach. 32, pp. 137–161, doi:10.1145/2455.2460.
42. Holger Hermanns, Jan Krcál & Jan Kretínský (2014): Probabilistic Bisimulation: Naturally on Distributions. In: Proc. CONCUR 2014, pp. 249–265, doi:10.1007/978-3-662-44584-6_18.
43. 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.
44. Leonid V. Kantorovich (1942): On the Transfer of Masses. Doklady Akademii Nauk 37(2), pp. 227–229. Original article in Russian, translation in Management Science, 5: 1-4 (1959).
45. Robert M. Keller (1976): Formal Verification of Parallel Programs. Commun. ACM 19(7), pp. 371–384, doi:10.1145/360248.360251.
46. 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.
47. 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.
48. Ruggero Lanotte & Simone Tini (2009): Probabilistic Bisimulation as a Congruence. ACM TOCL 10, pp. 1–48, doi:10.1145/1462179.1462181.
49. Kim G. Larsen (1990): Proof Systems for Satisfiability in Hennessy-Milner Logic with Recursion. Theor. Comput. Sci. 72(2&3), pp. 265–288, doi:10.1016/0304-3975(90)90038-J.
50. 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.
51. Kim G. Larsen & Arne Skou (1991): Bisimulation through Probabilistic Testing. Inf. Comput. 94(1), pp. 1–28, doi:10.1016/0890-5401(91)90030-6.
52. Radu Mardare, Luca Cardelli & Kim G. Larsen (2012): Continuous Markovian Logics - Axiomatization and Quantified Metatheory. Logical Methods in Computer Science 8(4), doi:10.2168/LMCS-8(4:19)2012.
53. David M. R. Park (1981): Concurrency and automata of infinite sequences.. In: Proc. 5th GI Conference, LNCS 104. Springer, pp. 167–183, doi:10.1007/BFb0017309.
54. Augusto Parma & Roberto Segala (2007): Logical Characterizations of Bisimulations for Discrete Probabilistic Systems. In: Proc. FoSSaCS 2007, pp. 287–301, doi:10.1007/978-3-540-71389-0_21.
55. Alessandra Di Pierro, Chris Hankin & Herbert Wiklicky (2003): Quantitative Relations and Approximate Process Equivalences. In: Proc. CONCUR 2003, pp. 498–512, doi:10.1007/978-3-540-45187-7_33.
56. Joshua Sack & Lijun Zhang (2012): A General Framework for Probabilistic Characterizing Formulae. In: Proc. VMCAI 2012, pp. 396–411, doi:10.1007/978-3-642-27940-9_26.
57. Roberto Segala (1995): Modeling and Verification of Randomized Distributed Real-Time Systems. MIT.
58. Roberto Segala & Nancy A. Lynch (1995): Probabilistic Simulations for Probabilistic Processes. Nord. J. Comput. 2(2), pp. 250–273.
59. Simone Tini (2008): Non Expansive epsilon-Bisimulations. In: Proc. AMAST 2008, pp. 362–376, doi:10.1007/978-3-540-79980-1_27.
60. Simone Tini (2010): Non-expansive epsilon-bisimulations for probabilistic processes. Theor. Comput. Sci. 411(22-24), pp. 2202–2222, doi:10.1016/j.tcs.2010.01.027.
61. Cédric Villani (2009): Optimal transport: old and new. Springer, doi:10.1007/978-3-540-71050-9.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org