You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Dave Parker
add96619d0
|
5 years ago | |
|---|---|---|
| .. | ||
| README.txt | 5 years ago | |
| auto | 5 years ago | |
| repudiation.prism | 5 years ago | |
| repudiation.props | 5 years ago | |
| repudiation_complex.prism | 5 years ago | |
README.txt
This case study concerns the non-repudiation protocol of Markowitch & Roggeman [MR99].
The models here are partially observable probabilistic timed automata (POPTAs),
as described in [NPZ17]. These extend the the probabilistic timed automaton (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
=====================================================================================
PARAMETERS:
K: the originator randomly selects an integer over the range 1,...,K
=====================================================================================
[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 a