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
c96c3d121b
|
5 years ago | |
|---|---|---|
| .. | ||
| README.txt | 5 years ago | |
| auto | 5 years ago | |
| network.props | 5 years ago | |
| network2.prism | 5 years ago | |
| network2_noidle.prism | 5 years ago | |
| network2_priorities.prism | 5 years ago | |
| network2_priorities_noidle.prism | 5 years ago | |
| network3.prism | 5 years ago | |
| network3_noidle.prism | 5 years ago | |
| network3_priorities.prism | 5 years ago | |
| network3_priorities_noidle.prism | 5 years ago | |
| network_priorities.props | 5 years ago | |
README.txt
This case study concerns wireless downlink scheduling of traffic to a number
of different users with hard deadlines and where packets have priorities.
This is a POMDP model, described in [NPZ17], and based on [YMZ11].
Model variants:
* without priorities: network2.prism and network3.prism
* without priorities and no idling: network2_noidle.prism and network3_noidle.prism
* with priorities: network2_priorities.prism and network3_priorities.prism
* with priorities and no idling: network2_priorities_noidle.prism and network3_priorities_noidle.prism
Property files: network.props and network_priorities.props
=====================================================================================
PARAMETERS:
T: number of slots per time period
K: number of time periods
=====================================================================================
[NPZ17]
Gethin Norman, David Parker and Xueyi Zou
Verification and Control of Partially Observable Probabilistic Systems
Real-Time Systems, 53(3), pages 354-402