Fast randomized consensus using shared memory
Journal of Algorithms
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Weak Bisimulation for Fully Probabilistic Processes
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Model Checking Performability Properties
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
Optimal state-space lumping in Markov chains
Information Processing Letters
Parametric probabilistic transition systems for system design and analysis
Formal Aspects of Computing
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Combined Decision Techniques for the Existential Theory of the Reals
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Probabilistic reachability for parametric Markov models
International Journal on Software Tools for Technology Transfer (STTT) - SPIN 2009
Model repair for probabilistic systems
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Symbolic and parametric model checking of discrete-time markov chains
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Safety verification of non-linear hybrid systems is quasi-semidecidable
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
PARAM: a model checker for parametric markov models
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
QoS verification and model tuning @ runtime
Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering
Parameter identification for Markov models of biochemical reactions
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Exploring parameter space of stochastic biochemical systems using quantitative model checking
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
From software verification to `everyware' verification
Computer Science - Research and Development
| Hi-index | 0.00 |
In parametric Markov decision processes (PMDPs), transition probabilities are not fixed, but are given as functions over a set of parameters. A PMDP denotes a family of concrete MDPs. This paper studies the synthesis problem for PCTL in PMDPs: Given a specification F in PCTL, we synthesise the parameter valuations under which F is true. First, we divide the possible parameter space into hyper-rectangles. We use existing decision procedures to check whether F holds on each of the Markov processes represented by the hyper-rectangle. As it is normally impossible to cover the whole parameter space by hyper-rectangles, we allow a limited area to remain undecided. We also consider an extension of PCTL with reachability rewards. To demonstrate the applicability of the approach, we apply our technique on a case study, using a preliminary implementation.