Bisimulation through probabilistic testing
Information and Computation
Reasoning about knowledge and probability
Journal of the ACM (JACM)
Bisimulation for probabilistic transition systems: a coalgebraic approach
Theoretical Computer Science
An Algorithm for Quantitative Verification of Probabilistic Transition Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Approximating labelled Markov processes
Information and Computation
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
Stochastic Relations
Complete deductive systems for probability logic with application to harsanyi type spaces
Complete deductive systems for probability logic with application to harsanyi type spaces
Analysing Biochemical Oscillation through Probabilistic Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Harsanyi Type Spaces and Final Coalgebras Constructed from Satisfied Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
Labelled Markov Processes
An intrinsic characterization of approximate probabilistic bisimilarity
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
| Hi-index | 0.00 |
We develop a fusion of logical and metrical principles for reasoning about Markov processes. More precisely, we lift metrics from processes to sets of processes satisfying a formula and explore how the satisfaction relation behaves as sequences of processes and sequences of formulas approach limits. A key new concept is dynamically-continuous metric bisimulation which is a property of (pseudo)metrics. We prove theorems about satisfaction in the limit, robustness theorems as well as giving a topological characterization of various classes of formulas. This work is aimed at providing approximate reasoning principles for Markov processes.