Coalgebraic trace semantics for combined possibilitistic and probabilistic systems

B.P.F. Jacobs

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

17 Citations (Scopus)

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—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.
Original languageEnglish
Title of host publicationProceedings of the Ninth Workshop on Coalgebraic Methods in Computer Science (CMCS 2008, Budapest, Hungary, April 4-6, 2008)
EditorsJ. Adámek, C. Kupke
Pages131-152
DOIs
Publication statusPublished - 2008

Publication series

NameElectronic Notes in Theoretical Computer Science
Volume203(5)
ISSN (Print)1571-0061

Fingerprint Dive into the research topics of 'Coalgebraic trace semantics for combined possibilitistic and probabilistic systems'. Together they form a unique fingerprint.

Cite this