The existence of refinement mappings
Theoretical Computer Science
Proving time bounds for randomized distributed algorithms
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Forward and backward simulations II.: timing-based systems
Information and Computation
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
UPPAAL—a tool suite for automatic verification of real-time systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
FireWire system architecture: IEEE 1394
FireWire system architecture: IEEE 1394
Liveness in timed and untimed systems
Information and Computation
Distributed Algorithms
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Verification of the Randomized Consensus Algorithms of Aspnes and Herlihy: A Case Study
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Description and formal specification of the Link Layer of P1394
Description and formal specification of the Link Layer of P1394
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Linear Parametric Model Checking of Timed Automata
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
First Passage Time Analysis of Stochastic Process Algebra Using Partial Orders
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Design and Verification of Fault-Tolerant Components
Methods, Models and Tools for Fault Tolerance
A game-based abstraction-refinement framework for Markov decision processes
Formal Methods in System Design
Concurrency and composition in a stochastic world
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Switched probabilistic i/o automata
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Quantitative refinement and model checking for the analysis of probabilistic systems
FM'06 Proceedings of the 14th international conference on Formal Methods
Compositional reasoning for probabilistic finite-state behaviors
Processes, Terms and Cycles
| Hi-index | 0.00 |
The model of probabilistic I/O automata of Segala and Lynch is used for the formal specification and analysis of the root contention protocol from the physical layer of the IEEE 1394 ("FireWire") standard. In our model of the protocol both randomization and real-time play an essential role. In order to make our verification easier to understand we introduce several intermediate automata in between the implementation and the specification automaton. This allows us to use very simple notions of refinement rather than the more general but also very complex simulation relations which have been proposed by Segala and Lynch.