Probabilistic Reachability for Parametric Markov Models
Proceedings of the 16th International SPIN Workshop on Model Checking Software
Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Synthesis for PCTL in parametric Markov decision processes
NFM'11 Proceedings of the Third international conference on NASA Formal methods
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
PARAM: a model checker for parametric markov models
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Approaches to modelling security scenarios with domain-specific languages
SP'12 Proceedings of the 20th international conference on Security Protocols
An extension of the inverse method to probabilistic timed automata
Formal Methods in System Design
| Hi-index | 0.00 |
We develop a model of parametric probabilistic transition Systems (PPTSs), where probabilities associated with transitions may be parameters. We show how to find instances of the parameters that satisfy a given property and instances that either maximize or minimize the probability of reaching a certain state. As an application, we model a probabilistic non-repudiation protocol with a PPTS. The theory we develop allows us to find instances that maximize the probability that the protocol ends in a fair state (no participant has an advantage over the others).