Publications
Filters: Author is Lee, Matias D. [Clear All Filters]
, “Rooted branching bisimulation as a congruence for probabilistic transition systems”, in {\rm Proceedings Thirteenth Workshop on} Quantitative Aspects of Programming Languages and Systems, {\rm London, UK, 11th-12th April 2015}, vol. 194, 2015, p. 79-94.
, “Rooted branching bisimulation as a congruence for probabilistic transition systems”, in Proceedings Thirteenth Workshop on Quantitative Aspects of Programming Languages and Systems, {QAPL} 2015, London, UK, 11th-12th April 2015., 2015.
, “{SOS} rule formats for convex and abstract probabilistic bisimulations”, in Proceedings of the Combined 22th International Workshop on Expressiveness in Concurrency and 12th Workshop on Structural Operational Semantics, and 12th Workshop on Structural Operational Semantics, {EXPRESS/SOS} 2015, Madrid, Spain, 31st August 2015., vol. 190, 2015, p. 31–45.
, “Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules”, in Foundations of Software Science and Computation Structures - 17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings, 2014.
, “A Petri Net Based Analysis of Deadlocks for Active Objects and Futures”, in Formal Aspects of Component Software, 9th International Symposium, FACS 2012, Mountain View, CA, USA, September 12-14, 2012. Revised Selected Papers, vol. 7684, 2013, p. 110-127.
, “Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation”, in Foundations of Software Science and Computational Structures - 15th International Conference, FOSSACS 2012, 2012, vol. 7213, p. 452-466.
, “Tree rules in probabilistic transition system specifications with negative and quantitative premises”, Electronic Proceedings in Theoretical Computer Science, vol. 89, p. 115 - 130, 2012.
