Paper Info
Title
Trace Semantics for Nondeterministic Probabilistic Automata via Determinization.
Abstract
This paper studies trace-based equivalences for systems combining nondeterministic and probabilistic choices. We show how trace semantics for such processes can be recovered by instantiating a coalgebraic construction known as the generalised powerset construction. We characterise and compare the resulting semantics to known definitions of trace equivalences appearing in the literature. This inspires, in turn, a general theory of may and must testing where tests are finite traces. Most of our results are based on the exciting interplay between monads and their presentations via algebraic theories.
Year
Venue
Field
2018
arXiv: Logic in Computer Science
Discrete mathematics,Algebraic number,Algebra,Nondeterministic algorithm,Probabilistic logic,Semantics,Monad (functional programming),Mathematics
DocType
Volume
Citations 
Journal
abs/1808.00923
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Filippo Bonchi157947.04
Ana Sokolova225418.88
Valeria Vignudelli321.38