Reactive, generative, and stratified models of probabilistic processes
Information and Computation
A Complete Axiomatisation for Trace Congruence of Finite State Behaviors
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
A Compositional Trace-Based Semantics for Probabilistic Automata
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Eilenberg--Moore algebras for stochastic relations
Information and Computation
Erratum: Erratum and Addendum: Eilenberg-Moore algebras for stochastic relations
Information and Computation
An Algebra for Kripke Polynomial Coalgebras
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Trace Semantics is Fully Abstract
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
A Sound and Complete Calculus for Finite Stream Circuits
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Quantitative Kleene coalgebras
Information and Computation
| Hi-index | 0.00 |
We present a sound and complete axiomatization of finite complete trace semantics for generative probabilistic transition systems. Our approach is coalgebraic, which opens the door to axiomatize other types of systems. In order to prove soundness and completeness, we employ determinization and show that coalgebraic traces can be recovered via determinization, a result interesting in itself. The approach is also applicable to labelled transition systems, for which we can recover the known axiomatization of trace semantics (work of Rabinovich).