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 | |
| task_graph.prism | 5 years ago | |
| task_graph.props | 5 years ago | |
| task_graph_prob.prism | 5 years ago | |
README.txt
This case study concerns the problem of scheduling tasks between several processors.
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]. Both are extensions of the timed automaton example from [BFLM11].
For more information, see: http://www.prismmodelchecker.org/casestudies/task_graph.php
=====================================================================================
[BFLM11]
P. Bouyer, U. Fahrenberg, K. Larsen and N. Markey
Quantitative Analysis of Real-Time Systems Using Priced Timed Automata
Communications of the ACM, 54(9), pages 78-87, 2011
[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