Fun with fireWire: A comparative study of formal verification methods applied to the IEEE 1394 root contention protocol

DOI10.1007/s001650300009zbMath1029.68022OpenAlexW2093468548MaRDI QIDQ1402480

Mariëlle I. A. Stoelinga

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/s001650300009

zbMATH Keywords

Real timeApplied formal methodsIEEE standardsLeader election algorithmsNetwork protocolsParameter synthesisProbabilistic algorithms

Mathematics Subject Classification ID

Network protocols (68M12)

Related Items (8)

Comparative branching-time semantics for Markov chains ⋮ Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition ⋮ Simple stochastic games with almost-sure energy-parity objectives are in NP and conp ⋮ Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives ⋮ Compositional Design of Stochastic Timed Automata ⋮ An Inductive Technique for Parameterised Model Checking of Degenerative Distributed Randomised Protocols ⋮ CEGAR for compositional analysis of qualitative properties in Markov decision processes ⋮ Linear parametric model checking of timed automata

Uses Software

• PRISM
• TREX
• Uppaal2k
• HyTech

This page was built for publication: Fun with fireWire: A comparative study of formal verification methods applied to the IEEE 1394 root contention protocol