Probabilistic model checking of deadline properties in the IEEE 1394 fireWire root contention protocol
From MaRDI portal
Publication:1402478
DOI10.1007/s001650300007zbMath1029.68017OpenAlexW2057873236MaRDI QIDQ1402478
Marta Kwiatkowska, Jeremy Sproston, Gethin Norman
Publication date: 27 August 2003
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001650300007
Related Items
Symbolic model checking for probabilistic timed automata, Performance analysis of probabilistic timed automata using digital clocks, Value iteration for simple stochastic games: stopping criterion and learning algorithm, Exact quantitative probabilistic model checking through rational search, An extension of the inverse method to probabilistic timed automata, Model checking for probabilistic timed automata, Evaluating Complex MAC Protocols for Sensor Networks with APMC, Consistency in parametric interval probabilistic timed automata, Probabilistic Time Petri Nets
Uses Software
