Bisimulation through probabilistic testing
Information and Computation
Dynamic power management based on continuous-time Markov decision processes
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Model-checking continuous-time Markov chains
ACM Transactions on Computational Logic (TOCL)
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Stochastic activity networks: formal definitions and concepts
Lectures on formal methods and performance analysis
Generalized Stochastic Petri Nets: A Definition at the Net Level and its Implications
IEEE Transactions on Software Engineering
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Beyond Memoryless Distributions: Model Checking Semi-Markov Chains
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
Equivalence notions and model minimization in Markov decision processes
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Continuous Time Discounted Jump Markov Decision Processes: A Discrete-Event Approach
Mathematics of Operations Research
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Dynamic Fault Tree Analysis Using Input/Output Interactive Markov Chains
DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Comparative branching-time semantics for Markov chains
Information and Computation
On optimal scheduling under uncertainty
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Three-valued abstraction for continuous-time Markov chains
CAV'07 Proceedings of the 19th international conference on Computer aided verification
A characterization of meaningful schedulers for continuous-time markov decision processes
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Delayed Nondeterminism in Continuous-Time Markov Decision Processes
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Probabilistic Logical Characterization
Information and Computation
The how and why of interactive Markov chains
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
| Hi-index | 0.00 |
This paper introduces strong bisimulation for continuoustime Markov decision processes (CTMDPs), a stochastic model which allows for a nondeterministic choice between exponential distributions, and shows that bisimulation preserves the validity of CSL. To that end, we interpret the semantics of CSL--a stochastic variant of CTL for continuous-time Markov chains--on CTMDPs and show its measuretheoretic soundness. The main challenge faced in this paper is the proof of logical preservation that is substantially based on measure theory.