Abstract
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the Ninth Workshop on Coalgebraic Methods in Computer Science (CMCS 2008, Budapest, Hungary, April 4-6, 2008) |
| Editors | J. Adámek, C. Kupke |
| Pages | 131-152 |
| DOIs | |
| Publication status | Published - 2008 |
Publication series
| Name | Electronic Notes in Theoretical Computer Science |
|---|---|
| Volume | 203(5) |
| ISSN (Print) | 1571-0061 |
Fingerprint
Cite this
}
Coalgebraic trace semantics for combined possibilitistic and probabilistic systems. / Jacobs, B.P.F.
Proceedings of the Ninth Workshop on Coalgebraic Methods in Computer Science (CMCS 2008, Budapest, Hungary, April 4-6, 2008). ed. / J. Adámek; C. Kupke. 2008. p. 131-152 (Electronic Notes in Theoretical Computer Science; Vol. 203(5)).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
TY - GEN
T1 - Coalgebraic trace semantics for combined possibilitistic and probabilistic systems
AU - Jacobs, B.P.F.
PY - 2008
Y1 - 2008
N2 - 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—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.
AB - 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—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.
U2 - 10.1016/j.entcs.2008.05.023
DO - 10.1016/j.entcs.2008.05.023
M3 - Conference contribution
T3 - Electronic Notes in Theoretical Computer Science
SP - 131
EP - 152
BT - Proceedings of the Ninth Workshop on Coalgebraic Methods in Computer Science (CMCS 2008, Budapest, Hungary, April 4-6, 2008)
A2 - Adámek, J.
A2 - Kupke, C.
ER -