Formal Aspects of Computing · 2006 · 73 citations · 26 references
EngineeringComputer EngineeringSystems EngineeringSystems AnalysisSystems DesignSystems ModelingFinite State Machine ModelingMarkov ChainsMarkov ProcessesMulti-state ModelsState-space ModelingState-space ModelsParametric Multi-state ModelsState Transition SystemsState-transition ModelsTransition Probability FunctionsTransition Systems
Abstract 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).
26
Rajeev Alur, David L. Dill · Theoretical Computer Science · 1994 · 6.5K citations
Michael K. Reiter, Aviel D. Rubin · ACM Transactions on Information and System Security · 1998 · 1.8K citations
Choice Reviews Online · 1992 · 1.5K citations