References

  1. Luca Aceto, Wan Fokkink & Anna Ingólfsdóttir (2001): 2-Nested Simulation Is Not Finitely Equationally Axiomatizable. In: Afonso Ferreira & Horst Reichel: Proc. STACS'01, Lecture Notes in Computer Science 2010. Springer, pp. 39–50, doi:10.1007/3-540-44693-1_4.
  2. Luca deAlfaro, 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.
  3. Luca deAlfaro, ThomasA. Henzinger & Rupak Majumdar (2003): Discounting the Future in Systems Theory. In: Proc. ICALP'03, Lecture Notes in Computer Science 2719. Springer-Verlag, pp. 1022–1037, doi:10.1007/3-540-45061-0_79.
  4. CharalambosD. Aliprantis & KimC. Border (2007): Infinite Dimensional Analysis: A Hitchhiker's Guide, 3rd edition. Springer-Verlag.
  5. HansL. Bodlaender (1993): Complexity of Path-Forming Games. Theoretical Computer Science 110(1), pp. 215–245, doi:10.1016/0304-3975(93)90357-Y.
  6. Patricia Bouyer, Uli Fahrenberg, KimG. Larsen, Nicolas Markey & Jiř\'ıSrba (2008): Infinite Runs in Weighted Timed Automata with Energy Constraints. In: Proc. FORMATS'08, Lecture Notes in Computer Science 5215. Springer-Verlag, pp. 33–47, doi:10.1007/978-3-540-85778-5_4.
  7. Franck van Breugel (2005): A Behavioural Pseudometric for Metric Labelled Transition Systems. In: Proc. CONCUR'05, Lecture Notes in Computer Science 3653. Springer-Verlag, pp. 141–155, doi:10.1007/11539452_14.
  8. Pavol Černý, ThomasA. Henzinger & Arjun Radhakrishna (2010): Simulation Distances. In: Proc. CONCUR'10, Lecture Notes in Computer Science 6269. Springer-Verlag, pp. 253–268, doi:10.1007/978-3-642-15375-4_18.
  9. Krishnendu Chatterjee, Laurent Doyen & ThomasA. Henzinger (2010): Quantitative languages. ACM Trans. Comput. Log. 11(4), doi:10.1145/1805950.1805953.
  10. 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.
  11. Josée Desharnais, François Laviolette & Mathieu Tracol (2008): Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games. In: Proc. QEST'08. IEEE Computer Society, pp. 264–273, doi:10.1109/QEST.2008.42.
  12. Uli Fahrenberg, KimG. Larsen & Claus Thrane (2010): A Quantitative Characterization of Weighted Kripke Structures in Temporal Logic. Computing and Informatics 29(6+), pp. 1311–1324.
  13. ThomasS. Ferguson: Game Theory. http://www.math.ucla.edu/tom/Game_Theory/.
  14. AviezriS. Fraenkel & Shai Simonson (1993): Geography. Theoretical Computer Science 110(1), pp. 197–214, doi:10.1016/0304-3975(93)90356-X.
  15. Alessandro Giacalone, Chi-chang Jou & ScottA. Smolka (1990): Algebraic Reasoning for Probabilistic Concurrent Systems. In: Proc. IFIP TC2 Working Conference on Programming Concepts and Methods. North-Holland, pp. 443–458.
  16. RobJ. van Glabbeek (2001): The Linear Time – Branching Time Spectrum I. In: JanA. Bergstra, Alban Ponse & ScottA. Smolka: Handbook of Process Algebra, Chapter 1. Elsevier, pp. 3–99.
  17. JanFriso Groote & FritsW. Vaandrager (1992): Structured Operational Semantics and Bisimulation as a Congruence. Inf. Comput. 100(2), pp. 202–260, doi:10.1016/0890-5401(92)90013-6.
  18. RichardW. Hamming (1950): Error Detecting and Error Correcting Codes. Bell System Technical Journal 29, pp. 147–160.
  19. ThomasA. Henzinger, Rupak Majumdar & Vinayak Prabhu (2005): Quantifying Similarities Between Timed Systems. In: Proc. FORMATS'05, Lecture Notes in Computer Science 3829. Springer-Verlag, pp. 226–241, doi:10.1007/11603009_18.
  20. ThomasA. Henzinger & Joseph Sifakis (2006): The Embedded Systems Design Challenge. In: Proc. FM'06, Lecture Notes in Computer Science 4085. Springer-Verlag, pp. 1–15, doi:10.1007/11813040_1.
  21. Dexter Kozen (1983): A Probabilistic PDL. In: Proc. STOC'83. ACM, pp. 291–297, doi:10.1145/800061.808758.
  22. KimG. Larsen, Uli Fahrenberg & Claus Thrane (2011): Metrics for Weighted Transition Systems: Axiomatization and Complexity. Theoretical Computer Science, doi:10.1016/j.tcs.2011.04.003. To appear.
  23. Ana KarlaAlves deMedeiros, Wil M.P. vander Aalst & A.J. M.M. Weijters (2008): Quantifying process equivalence based on observed behavior. Data & Knowledge Engineering 64(1), pp. 55–74, doi:10.1016/j.datak.2007.06.010.
  24. Robin Milner (1989): Communication and Concurrency. Prentice Hall.
  25. Colin Stirling (1995): Modal and Temporal Logics for Processes. In: Proc. Banff Higher Order Workshop, Lecture Notes in Computer Science 1043. Springer-Verlag, pp. 149–237.
  26. Bent Thomsen (1987): An Extended Bisimulation Induced by a Preorder on Actions. Aalborg University Centre.
  27. Claus Thrane, Uli Fahrenberg & KimG. Larsen (2010): Quantitative analysis of weighted transition systems. Journal of Logic and Algebraic Programming 79(7), pp. 689–703, doi:10.1016/j.jlap.2010.07.010.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org