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 e28c7d0c4a Bugfix: output infinite loop when too many satisfying states. 17 years ago
..
.autopp CSMA tweaks. 17 years ago
.csmaK.pctl.pp CSMA tweaks. 17 years ago
.csmaK_N.nm.pp CSMA tweaks. 17 years ago
README typo 17 years ago
auto Less ambitious auto file for csma. 17 years ago
csma2.pctl CSMA tweaks. 17 years ago
csma2_2.nm CSMA tweaks. 17 years ago
csma2_3.nm CSMA tweaks. 17 years ago
csma2_4.nm CSMA tweaks. 17 years ago
csma4.pctl CSMA tweaks. 17 years ago
csma4_2.nm CSMA tweaks. 17 years ago
csma4_3.nm CSMA tweaks. 17 years ago
csma4_4.nm CSMA tweaks. 17 years ago
csma6.pctl CSMA tweaks. 17 years ago
csma6_2.nm CSMA tweaks. 17 years ago
csma6_3.nm CSMA tweaks. 17 years ago
csma6_4.nm CSMA tweaks. 17 years ago

README

This case study concerns the IEEE 802.3 CSMA/CD (Carrier Sense, Multiple Access with Collision Detection) protocol


model files csmaK_N.nm
specification files: csmaK.pctl

where K is the maximum backoff and N is the number of stations

For more information on the probabilistic timed automata see: http://www.prismmodelchecker.org/casestudies/csma.php

The PRISM model uses the integer semantics given in [KNPS06].

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

[KNPS06]
M. Kwiatkowska, G. Norman, D. Parker and J. Sproston
Performance Analysis of Probabilistic Timed Automata using Digital Clocks
Formal Methods in System Design, 29:33-78, 2006