Publications
Filters: Author is Daniel Gebler [Clear All Filters]
{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.
, “ {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.
, “ Generalized bisimulation metrics”, in CONCUR - 25th Conference on Concurrency Theory, Rome, Italy, 2014.
, “ Computing Behavioral Relations for Probabilistic Concurrent Systems”, in {ROCKS}, 2012.
, “ Tree rules in probabilistic transition system specifications with negative and quantitative premises”, Electronic Proceedings in Theoretical Computer Science, vol. 89, p. 115 - 130, 2012.
, “ A Tutorial on Interactive Markov Chains”, in {ROCKS}, 2012.
, “