Filters: Author is Daniel Gebler [Clear All Filters]
, “A general SOS theory for the specification of probabilistic transition systems”, Information and Computation, vol. 249, pp. 76-109, 2016.
paper-300.pdf (1.83 MB)
paper-300.pdf (1.83 MB), “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, pp. 31–45. paper-274.pdf (205.49 KB)
paper-274.pdf (205.49 KB), “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, pp. 31–45. paper-274.pdf (205.49 KB)
paper-274.pdf (205.49 KB), “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, vol. 8412, Springer, 2014. paper-258.pdf (345.22 KB)
paper-258.pdf (345.22 KB), “Tree rules in probabilistic transition system specifications with negative and quantitative premises”, in Proceedings Combined 19th International Workshop on Expressiveness in Concurrency and 9th Workshop on Structured Operational Semantics, 2012, vol. 89, pp. 115-130. paper-122.pdf (192.61 KB)
paper-122.pdf (192.61 KB)