Stochastic Relations: Foundations for Markov Transition SystemsCollecting information previously scattered throughout the vast literature, including the author's own research, Stochastic Relations: Foundations for Markov Transition Systems develops the theory of stochastic relations as a basis for Markov transition systems. After an introduction to the basic mathematical tools from topology, measure |
Contents
A Gentle Tutorial to All Things Considered | 1 |
Stochastic Relations as Monads | 83 |
EilenbergMoore Algebras for Stochastic Relations | 131 |
The Existence of SemiPullbacks | 157 |
Congruences and Bisimulations | 179 |
Interpreting Modal and Temporal Logics | 251 |
Notations | 327 |
| 331 | |
| 339 | |
Other editions - View all
Stochastic Relations: Foundations for Markov Transition Systems Ernst-Erich Doberkat Limited preview - 2007 |
Stochastic Relations: Foundations for Markov Transition Systems Ernst-Erich Doberkat No preview available - 2007 |
Stochastic Relations: Foundations for Markov Transition Systems Ernst-Erich Doberkat No preview available - 2019 |
Common terms and phrases
2-bisimulation An)nen analytic sets analytic spaces architecture assume behavioral equivalence bisimilar bisimulations Borel map Borel measurable Borel sets characterization closed sets coalgebras component computations congruences Consequently construction continuous map converse COROLLARY countable defined DEFINITION diagram discussion Eilenberg-Moore algebras established exists factor spaces functions Giry monad given graph hence holds implies induction input INV B(S invariant Borel sets investigated isomorphic Kripke models Lemma Let f logical equivalence map f measurable map measurable space metric space modal logics monad morphism natural transformation node nondeterministic nontrivial o-algebra objects open sets path formula PF-system Polish space positive convex structure probabilistic projective limit PROOF properties resp Section semi-pullbacks sequence simulation equivalent smooth equivalence relations stochastic relation surjective Theorem topology variable µCSL μη
Popular passages
Page 334 - HENNESSY, M., AND MILNER, R. (1980),. On observing nondeterminism and concurrency, in "Automata, Languages, and Programming.