A Compositional Trace-Based Semantics for Probabilistic Automata
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
A hierarchy of probabilistic system types
Theoretical Computer Science - Selected papers of CMCS'03
Distributing probability over non-determinism
Mathematical Structures in Computer Science
Modular construction of complete coalgebraic logics
Theoretical Computer Science
RETRACTED: Semantic Domains for Combining Probability and Non-Determinism
Electronic Notes in Theoretical Computer Science (ENTCS)
Context-free languages via coalgebraic trace semantics
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Generic forward and backward simulations
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Distributed online evolution: an algebraic problem?
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
A coalgebraic approach to non-determinism: Applications to multilattices
Information Sciences: an International Journal
Parametric effect monads and semantics of effect systems
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.01 |
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 CM 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.