Probabilistic propositional temporal logics
Information and Control
A probabilistic powerdomain of evaluations
Proceedings of the Fourth Annual Symposium on Logic in computer science
Stochastic Petri nets: an elementary introduction
Advances in Petri nets 1989
Bisimulation through probabilistic testing
Information and Computation
Performance modeling of automated manufacturing systems
Performance modeling of automated manufacturing systems
Probabilistic non-determinism
Dynamical systems, measures, and fractals via domain theory
Information and Computation
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Selected papers of the workshop on Topology and completion in semantics
Axiomatizing probabilistic processes: ACP with generative probabilities
Information and Computation
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Composition and behaviors of probabilistic I/O automata
Theoretical Computer Science
Stochastic processes as concurrent constraint programs
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communication and Concurrency
Time and Probability in Formal Design of Distributed Systems
Time and Probability in Formal Design of Distributed Systems
Testing Preorders for Probabilistic Processes
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Metrics for Labeled Markov Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Approximate Symbolic Model Checking of Continuous-Time Markov Chains
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
It Usually Works: The Temporal Logic of Stochastic Systems
Proceedings of the 7th International Conference on Computer Aided Verification
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Domain Theory in Stochastic Processes
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Compositional Testing Preorders for Probabilistic Processes
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Bisimulation for Labelled Markov Processes
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A Logical Characterization of Bisimulation for Labeled Markov Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Domain equations for probabilistic processes
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
A domain equation for bisimulation
Information and Computation
Verification of randomized distributed algorithms
Lectures on formal methods and performance analysis
Possibilistic and Probabilistic Abstraction-Based Model Checking
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Towards Quantitative Verification of Probabilistic Transition Systems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Symbolic Computation of Maximal Probabilistic Reachability
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
An Algorithm for Quantitative Verification of Probabilistic Transition Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Simulation for Continuous-Time Markov Chains
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
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
On finite-state approximants for probabilistic computation tree logic
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
Theoretical Computer Science
Bisimulation and cocongruence for probabilistic systems
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Model Checking Quantitative Linear Time Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Labelled Markov Processes: Stronger and Faster Approximations
Electronic Notes in Theoretical Computer Science (ENTCS)
A Quantitative Approach to Noninterference for Probabilistic Systems
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
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
Semi-pullbacks and bisimulations in categories of stochastic relations
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A counterexample-guided abstraction-refinement framework for markov decision processes
ACM Transactions on Computational Logic (TOCL)
Continuous time and/or continuous distributions
EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
Hyperfinite approximations to labeled markov transition systems
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Dexter kozen's influence on the theory of labelled markov processes
Logic and Program Semantics
Approximating Markov Processes by Averaging
Journal of the ACM (JACM)
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We study approximate reasoning about continuous-state labeled Markov processes. We show how to approximate a labeled Markov process by a family of finite-state labeled Markov chains. We show that the collection of labeled Markov processes carries a Polish space structure with a countable basis given by finite state Markov chains with rational probabilities. The primary technical tools that we develop to reach these results are: A finite-model theorem for the modal logic used to characterize bisimulation A categorical equivalence between the category of Markov processes (with simulation morphisms) with the w-continuous dcpo Proc , defined as the solution of the recursive domain equation Proc = ?Labels PProb ( Proc )1.The correspondence between labeled Markov processes and Proc yields logic complete for reasoning about simulation for continuous-state processes.