This case study concerns the non-repudiation protocol of Markowitch & Roggeman [MR99].

These are turn-based probabilistic timed game (TPTG) models, which are an extension of
stochastic multi-player games with real-valued clocks or, equivalently, a game-based
extension of probabilistic timed automaton (PTA).

This case study [KNP19] extends the the PTA version from [NPS13], the files for which
can be found in ../../ptas/repudiation. Both are extensions of the PTA model developed
in [LMST04].

For more information, see: http://www.prismmodelchecker.org/casestudies/nonrepudiation.php

=====================================================================================

[KNP19]
Marta Kwiatkowska, Gethin Norman and David Parker
Verification and Control of Turn-Based Probabilistic Real-Time Games
In The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy (Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday), volume 11760 of LNCS, pages 379-396, Springer, 2019

[LMST04]
R. Lanotte, A. Maggiolo-Schettini and A. Troina
Automatic Analysis of a Non-Repudiation Protocol
In Proc. 2nd International Workshop on Quantitative Aspects of Programming Languages (QAPL'04), 2004
(available as ENTCS, vol. 112, pp. 113–129, 2005)

[MR99]
O. Markowitch and Y. Roggeman
Probabilistic non-repudiation without trusted third party
In Proc. 2nd Workshop on Security in Communication Networks, 1999

[NPS13]
Gethin Norman, David Parker and Jeremy Sproston
Model Checking for Probabilistic Timed Automata
Formal Methods in System Design, 43(2), pages 164-190, Springer, 2013
