@inproceedings{3c0fdb1e77734009b72db3a00ade3f17,
title = "Coalgebraic trace semantics for combined possibilitistic and probabilistic systems",
abstract = "Non-deterministic (also known as possibilistic) and probabilistic state based systems (or automata) have been studied for quite some time. Separately, they are reasonably well-understood. The combination however is difficult, both for conceptual and technical reasons. Here we study the combination from a coalgebraic perspective and identify a monad that captures the combination{\textemdash}following work of Varacca. We use this monad to apply the coalgebraic framework for (finite) trace semantics in this setting. It yields a smooth, but not entirely trivial, description of traces.",
author = "B.P.F. Jacobs",
year = "2008",
doi = "10.1016/j.entcs.2008.05.023",
language = "English",
series = "Electronic Notes in Theoretical Computer Science",
pages = "131--152",
editor = "J. Ad{\'a}mek and C. Kupke",
booktitle = "Proceedings of the Ninth Workshop on Coalgebraic Methods in Computer Science (CMCS 2008, Budapest, Hungary, April 4-6, 2008)",
}