Daws, C., Kwiatkowska, M. and Norman, G. (2004) Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM. International Journal on Software Tools for Technology Transfer (STTT), 5(2), pp. 221-236. (doi: 10.1007/s10009-003-0118-5)
Full text not currently available from Enlighten.
Publisher's URL: http://www.springerlink.com
Abstract
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time model checker Kronos and the probabilistic model checker Prism. The system is modelled as a probabilistic timed automaton. We first use Kronos to perform a symbolic forwards reachability analysis to generate the set of states that are reachable with non-zero probability from the initial state and before the deadline expires. We then encode this information as a Markov decision process to be analyzed with Prism. We apply this technique to compute the minimal probability of a leader being elected before a deadline, for different deadlines, and study how this minimal probability is influenced by using a biased coin and considering different wire lengths.
Item Type: | Articles |
---|---|
Status: | Published |
Refereed: | Yes |
Glasgow Author(s) Enlighten ID: | Norman, Dr Gethin |
Authors: | Daws, C., Kwiatkowska, M., and Norman, G. |
College/School: | College of Science and Engineering > School of Computing Science |
Journal Name: | International Journal on Software Tools for Technology Transfer (STTT) |
Journal Abbr.: | STTT |
Publisher: | SpringerLink |
ISSN: | 1433-2779 |
ISSN (Online): | 1433-2787 |
University Staff: Request a correction | Enlighten Editors: Update this record