Results 1  10
of
9,859
1 Example: Alternating Bit Protocol
"... In this section, we present an alternating bit protocol with a sender and a receiver processes that are subject to message loss faults. Using the synthesis method presented in [1], we synthesize an alternating bit protocol that is nonmasking faulttolerant; i.e., when faults occur the program guarant ..."
Abstract
 Add to MetaCart
In this section, we present an alternating bit protocol with a sender and a receiver processes that are subject to message loss faults. Using the synthesis method presented in [1], we synthesize an alternating bit protocol that is nonmasking faulttolerant; i.e., when faults occur the program
A Stepwise Development of the Alternating Bit Protocol
"... In this paper, the theory of fair action systems is used in the specification and development of the Alternating Bit Protocol. A version of the Movers Theorem for fair action systems is proved, which permits the interleaving of actions of one action system within another. This Movers Theorem is appl ..."
Abstract
 Add to MetaCart
In this paper, the theory of fair action systems is used in the specification and development of the Alternating Bit Protocol. A version of the Movers Theorem for fair action systems is proved, which permits the interleaving of actions of one action system within another. This Movers Theorem
A Mechanical Verification of the Alternating Bit Protocol
, 1981
"... The Alternating Bit Protocol has been modeled via a straighforward application of the Gypsy methodology. A safety property was stated for its service specification and a procedural protocol specification was written using Gypsy procedure definitions. Mechanical verification was carried out, includin ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
The Alternating Bit Protocol has been modeled via a straighforward application of the Gypsy methodology. A safety property was stated for its service specification and a procedural protocol specification was written using Gypsy procedure definitions. Mechanical verification was carried out
A Formal Verification of the Alternating Bit Protocol in the Calculus of Constructions
"... We report on a formal verification of the Alternating Bit Protocol (ABP) in the Calculus of Constructions. We outline a semiformal correctness proof of the ABP with su cient detail to be formalised. Thereafter we show by examples how the formalised proof has been veri ed by the automated proof chec ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
We report on a formal verification of the Alternating Bit Protocol (ABP) in the Calculus of Constructions. We outline a semiformal correctness proof of the ABP with su cient detail to be formalised. Thereafter we show by examples how the formalised proof has been veri ed by the automated proof
CoInductive Types in Coq: An Experiment with the Alternating Bit Protocol
, 1995
"... We describe an experience concerning the implementation and use of coinductive types in the proof editor Coq. Coinductive types are recursive types which, opposite to inductive ones, may be inhabited by infinite objects. In order to illustrate their use in Coq, we describe an axiomatisation of ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
of a calculus of broadcasting systems where recursive processes are represented using infinite objects. This calculus is used for developing a verification proof of the alternating bit protocol.
Alternating Bit Protocol from A Supervisory Control Perspective
"... Alternating bit protocol had been invented more than 3 decades ago for reliable fullduplex data transmission over halfduplex telephone lines. The objective of this paper is to formally model the protocol in order to better understand its principal idea, and extend it to more general problems in de ..."
Abstract
 Add to MetaCart
Alternating bit protocol had been invented more than 3 decades ago for reliable fullduplex data transmission over halfduplex telephone lines. The objective of this paper is to formally model the protocol in order to better understand its principal idea, and extend it to more general problems
Specifying and Verifying the Alternating Bit Protocol with ProbabilisticTimed LOTOS
, 1996
"... In this paper we use a probabilistictimed version of Lotos (PTLotos) for specifying and verifying the Alternating Bit Protocol (ABP). First, we present the language which is an upward compatible version of Lotos where some new operators to deal with time and probabilistic features have been include ..."
Abstract
 Add to MetaCart
In this paper we use a probabilistictimed version of Lotos (PTLotos) for specifying and verifying the Alternating Bit Protocol (ABP). First, we present the language which is an upward compatible version of Lotos where some new operators to deal with time and probabilistic features have been
A Formal Verification of the Alternating Bit Protocol in µCRL
, 1993
"... We present a formal verification proof for the Alternating Bit Protocol in the specification language and proof theory of µCRL. A brief outline, dwelling on the more elaborate parts of the derivation, as well as a very detailed version of the proof are given. The proof follows the one presented in [ ..."
Abstract
 Add to MetaCart
We present a formal verification proof for the Alternating Bit Protocol in the specification language and proof theory of µCRL. A brief outline, dwelling on the more elaborate parts of the derivation, as well as a very detailed version of the proof are given. The proof follows the one presented
A Stochastic Process Algebra Model for the Analysis of the Alternating Bit Protocol
 in Proc. of the 11th Int. Symp. on Computer and Information Sciences (ISCIS XI), METU
, 1996
"... We illustrate an application of the integrated approach for modeling and analyzing concurrent systems proposed in [4]. The case study concerns the alternating bit protocol. The protocol is specified by means of a set of terms of the stochastic process algebra EMPA, and then studied from the function ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We illustrate an application of the integrated approach for modeling and analyzing concurrent systems proposed in [4]. The case study concerns the alternating bit protocol. The protocol is specified by means of a set of terms of the stochastic process algebra EMPA, and then studied from
Mechanically Verified Abstractions to Finite State Systems  A Case Study of the Alternating Bit Protocol in Isabelle
"... ions to Finite State Systems  A Case Study of the Alternating Bit Protocol in Isabelle Olaf Muller Institut fur Informatik, Technische Universitat Munchen, 80290 Munchen, Germany, email: mueller@informatik.tumuenchen.de Abstract We provide tool support for the verification of infinite state ..."
Abstract
 Add to MetaCart
ions to Finite State Systems  A Case Study of the Alternating Bit Protocol in Isabelle Olaf Muller Institut fur Informatik, Technische Universitat Munchen, 80290 Munchen, Germany, email: mueller@informatik.tumuenchen.de Abstract We provide tool support for the verification of infinite
Results 1  10
of
9,859