Three-Valued Abstraction for Continuous-Time Markov Chains
- 1 January 2007
- book chapter
- Published by Springer Nature
- p. 311-324
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Partial Order Reduction for Markov Decision Processes: A SurveyLecture Notes in Computer Science, 2006
- Don’t Know in Probabilistic Systems2006
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processesTheoretical Computer Science, 2005
- Comparative branching-time semantics for Markov chainsInformation and Computation, 2005
- CSL Model Checking for the GreatSPN ToolLecture Notes in Computer Science, 2004
- An Abstraction Framework for Mixed Non-deterministic and Probabilistic SystemsLecture Notes in Computer Science, 2004
- Logical and Stochastic Modeling with SmartLecture Notes in Computer Science, 2003
- Reachability Analysis of Probabilistic Systems by Successive Refinements2001
- Model-checking continuous-time Markov chainsACM Transactions on Computational Logic, 2000
- The PEPA workbench: A tool to support a process algebra-based approach to performance modelling1994