s14h
/
prism-accumulation
1
0
Fork 0
Code Releases Activity
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.
573 Commits
5 Branches
0 Tags
31 MiB
 
 
 
 
 
 
Tree: 7b195d996d
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '7b195d996d'
${ noResults }
prism-accumulation/prism-examples/csma
Gethin Norman 7b195d996d
expected properties added to firewire abstion version 		17 years ago
..
.autopp csma example added 17 years ago
.csmaK.pctl.pp csma example added 17 years ago
.csmaNK.nm.pp csma example added 17 years ago
README csma example added 17 years ago
auto csma example added 17 years ago
csma2.pctl csma example added 17 years ago
csma2_2.nm csma example added 17 years ago
csma2_3.nm csma example added 17 years ago
csma2_4.nm csma example added 17 years ago
csma2_6.nm csma example added 17 years ago
csma3_2.nm csma example added 17 years ago
csma3_4.nm csma example added 17 years ago
csma3_6.nm csma example added 17 years ago
csma4.pctl csma example added 17 years ago
csma4_2.nm csma example added 17 years ago
csma4_3.nm csma example added 17 years ago
csma4_4.nm csma example added 17 years ago
csma4_6.nm csma example added 17 years ago
csma6.pctl csma example added 17 years ago
csma6_2.nm csma example added 17 years ago
csma6_3.nm csma example added 17 years ago
csma6_4.nm csma example added 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 [KNS02b].

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

[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