Add to ORKGThe paper presents a verification of the IEEE Root Contention Protocol as an illustration of a new and innovative approach for the verification of real-time distributed systems. Systems are modeled with basic Gurevich abstract state machines (ASMs), and requirements are expressed in a first order timed logic (FOTL). FOTL is undecidable, however the protocol we study is in a decidable class of practical interest. Advantages of this framework are twofold: on the one hand, a great expressive power which permits in particular an easy treatment of parameters, on the other hand the modeling task is simplified by an adequate choice of tools
It is important to reason about a number of desirable protocol properties to ensure correctness of a...
An assertional method to verify distributed real-time and fault-tolerant protocols is presented. To ...
We propose here a tool which implements an algorithm proposed for a decidable class of verification ...
The paper presents a verification of the IEEE Root Contention Protocol as an illustration of a new a...
We describe an automatic verification technique for distributed real-time systems that are specified...
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root cont...
This paper describes a methodology for modeling and verifying protocols for asynchronous message pa...
The increasing use of model-based tools enables further use of formal verification techniques in the...
Abstract. We present a model of the IEEE 1394 Root Contention Protocol with a proof of Safety. This ...
A new generation of distributed real-time systems (DRTS) is based on heterogeneous models of computa...
AbstractWe introduce a framework for the verification of protocols involving a distinguished machine...
Abstract. The mechanical verification of the root contention protocol from the physical layer of the...
. Traditional approaches to the algorithmic verification of real-time systems are limited to checkin...
Traditional approaches to the algorithmic verification of real-time systems are limited to checking...
Abstract. Bounded Model Checking (BMC) is an efficient technique applicable to verification of tempo...
It is important to reason about a number of desirable protocol properties to ensure correctness of a...
An assertional method to verify distributed real-time and fault-tolerant protocols is presented. To ...
We propose here a tool which implements an algorithm proposed for a decidable class of verification ...
The paper presents a verification of the IEEE Root Contention Protocol as an illustration of a new a...
We describe an automatic verification technique for distributed real-time systems that are specified...
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root cont...
This paper describes a methodology for modeling and verifying protocols for asynchronous message pa...
The increasing use of model-based tools enables further use of formal verification techniques in the...
Abstract. We present a model of the IEEE 1394 Root Contention Protocol with a proof of Safety. This ...
A new generation of distributed real-time systems (DRTS) is based on heterogeneous models of computa...
AbstractWe introduce a framework for the verification of protocols involving a distinguished machine...
Abstract. The mechanical verification of the root contention protocol from the physical layer of the...
. Traditional approaches to the algorithmic verification of real-time systems are limited to checkin...
Traditional approaches to the algorithmic verification of real-time systems are limited to checking...
Abstract. Bounded Model Checking (BMC) is an efficient technique applicable to verification of tempo...
It is important to reason about a number of desirable protocol properties to ensure correctness of a...
An assertional method to verify distributed real-time and fault-tolerant protocols is presented. To ...
We propose here a tool which implements an algorithm proposed for a decidable class of verification ...