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 Fix some examples/tests: duplicate actions not allowed in a state. 5 years ago
..
README.txt POMDP and POPTA examples. 5 years ago
auto POMDP and POPTA examples. 5 years ago
crypt.props POMDP and POPTA examples. 5 years ago
crypt3.prism Fix some examples/tests: duplicate actions not allowed in a state. 5 years ago
crypt4.prism Fix some examples/tests: duplicate actions not allowed in a state. 5 years ago
crypt5.prism Fix some examples/tests: duplicate actions not allowed in a state. 5 years ago
crypt6.prism Fix some examples/tests: duplicate actions not allowed in a state. 5 years ago

README.txt

This case study concerns the dining cryptographers protocol [Cha88].

This is a POMDP model, described in [NPZ17].

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

[NPZ17]
Gethin Norman, David Parker and Xueyi Zou
Verification and Control of Partially Observable Probabilistic Systems
Real-Time Systems, 53(3), pages 354-402, Springer, 2017

[Cha88]
D. Chaum
The dining cryptographers problem: Unconditional sender and recipient untraceability
Journal of Cryptology 1, 65–75, 1988