Publications
Filters: Author is Erik P. de Vink [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.
, “ Reconciling real and stochastic time: the need for probabilistic refinement”, Formal Aspects of Computing, vol. 24, p. 497-518, 2012.
, “