Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Topological completeness in an ideal model for polymorphic types
SIAM Journal on Computing
Categories, types, and structures: an introduction to category theory for the working computer scientist
Bisimulation for probabilistic transition systems: a coalgebraic approach
Theoretical Computer Science
Model-checking continuous-time Markov chains
ACM Transactions on Computational Logic (TOCL)
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Communication and Concurrency
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
A Logical Characterization of Bisimulation for Labeled Markov Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
Approximating labelled Markov processes
Information and Computation
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
A behavioural pseudometric for probabilistic transition systems
Theoretical Computer Science - Automata, languages and programming
Semi-pullbacks for stochastic relations over analytic spaces
Mathematical Structures in Computer Science
Stochastic Relations: Congruences, Bisimulations and the Hennessy--Milner Theorem
SIAM Journal on Computing
Approximating and computing behavioural distances in probabilistic transition systems
Theoretical Computer Science
Recursively defined metric spaces without contraction
Theoretical Computer Science
Complete deductive systems for probability logic with application to harsanyi type spaces
Complete deductive systems for probability logic with application to harsanyi type spaces
Approximating Markov Processes by Averaging
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
A Complete Deductive System for Probability Logic1
Journal of Logic and Computation
Labelled Markov Processes: Stronger and Faster Approximations
Electronic Notes in Theoretical Computer Science (ENTCS)
Bisimulation and cocongruence for probabilistic systems
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Final coalgebras for functors on measurable spaces
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Probability Logic of Finitely Additive Beliefs
Journal of Logic, Language and Information
Deduction Systems for Coalgebras Over Measurable Spaces
Journal of Logic and Computation
Exemplaric Expressivity of Modal Logics
Journal of Logic and Computation
Coalgebraic logic over general measurable spaces ??? a survey
Mathematical Structures in Computer Science
Approximating Bisimilarity for Markov Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Stone Duality for Markov Processes
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 5.23 |
In this paper, we define a probabilistic version of filtration and use it to provide a finite approximation of Markov processes. In order to measure the approximation, we employ probability logic to construct the final Markov process and define a metric on the set of Markov processes through this logic. Moreover, we show that the set endowed with this metric is a Polish space. Finally we point to some questions connecting approximation to uniformity and approximate bisimilarity as topics for future research.