Results 1 - 10 of 43

Formal Verification for Time-Triggered Clock Synchronization

by Holger Pfeifer, Detlef Schwier, Friedrich W. Von Henke , 1999
"... Distributed dependable real-time systems crucially depend on faulttolerant clock synchronization. This paper reports on the formal analysis of the clock synchronization service provided as an integral feature by the Time-Triggered Protocol (TTP), a communication protocol particularly suitable for sa ..."
Abstract - Cited by 20 (1 self) - Add to MetaCart
Distributed dependable real-time systems crucially depend on faulttolerant clock synchronization. This paper reports on the formal analysis of the clock synchronization service provided as an integral feature by the Time-Triggered Protocol (TTP), a communication protocol particularly suitable

Society. Formal Verification for Time-Triggered Clock Synchronization

by Holger Pfeifer, Detlef Schwier, Friedrich W. Von Henke
"... Distributed dependable real-time systems crucially depend on fault-tolerant clock synchronization. This paper reports on the formal anal-ysis of the clock synchronization service provided as an integral feature by the Time-Triggered Protocol (TTP), a communication protocol par-ticularly suitable for ..."
Abstract - Add to MetaCart
Distributed dependable real-time systems crucially depend on fault-tolerant clock synchronization. This paper reports on the formal anal-ysis of the clock synchronization service provided as an integral feature by the Time-Triggered Protocol (TTP), a communication protocol par-ticularly suitable

Formal Verification of Time-Triggered Systems

by Lee Pike , 2005
"... Fault-tolerant real-time distributed control systems are being developed for next-generation aircraft and automobiles. They employ numerous complex protocols; because their uses are safety-critical, the design and implementation of these protocols must be error-free. The following modeling considera ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
considerations make the formal verification of these protocols difficult: faults, real-time constraints, distributed control, nonfunctional behavioral requirements, and intricate protocol interactions. We describe a methodology for the formal verification of time-triggered systems, a class of synchronized fault

Formal Verification of a TDMA Protocol Start-Up Mechanism

by Henrik Lönn, Paul Pettersson - In Pacific Rim International Symposium on Fault-Tolerant Systems (PRFTS ’97 , 1997
"... This paper presents a formal verification of the start-up algorithm of the DACAPO protocol. The protocol uses TDMA (Time Division Multiple Access) bus arbitration. It was verified that an ensemble of four communicating stations becomes synchronized and operational within a bounded time from an arbit ..."
Abstract - Cited by 22 (4 self) - Add to MetaCart
This paper presents a formal verification of the start-up algorithm of the DACAPO protocol. The protocol uses TDMA (Time Division Multiple Access) bus arbitration. It was verified that an ensemble of four communicating stations becomes synchronized and operational within a bounded time from

Automated Formal Verification of the DHCP Failover Protocol Using Timeout Order Abstraction

by Shinya Umeno, Nancy Lynch , 2010
"... In this paper, we present automated formal verification of the DHCP Failover protocol. We conduct bounded model-checking for the protocol using Timeout Order Abstraction (TO-Abstraction), a technique to abstract a given timed model in a certain sub-class of loosely synchronized real-time distribute ..."
Abstract - Add to MetaCart
In this paper, we present automated formal verification of the DHCP Failover protocol. We conduct bounded model-checking for the protocol using Timeout Order Abstraction (TO-Abstraction), a technique to abstract a given timed model in a certain sub-class of loosely synchronized real

Formal Derivation of a Protocol in CSP

by Burghard Von Karger , 1996
"... We study a distributed version of Misra's phase synchronization problem in which a number of parallel processes have to execute their phases in lockstep. Unlike Misra we do not postulate a global communication mechanism. Instead we assume that the processes are distributed over a tree-shaped ne ..."
Abstract - Add to MetaCart
We study a distributed version of Misra's phase synchronization problem in which a number of parallel processes have to execute their phases in lockstep. Unlike Misra we do not postulate a global communication mechanism. Instead we assume that the processes are distributed over a tree

Formal Modelling and Verification of an Asynchronous Extension of SOAP. ISTI

by Maurice H. Ter Beek, Stefania Gnesi, Franco Mazzanti, Corrado Moiso - Proceedings of the 4th IEEE European Conference on Web Services (ECOWS ´06 , 2006
"... Abstract. Current web services are largely based on a synchronous request-response model that uses the Simple Object Access Protocol SOAP. Next-generation telecommunication networks, on the contrary, are characterised by the need to handle asynchronous interactions among distributed service componen ..."
Abstract - Cited by 7 (1 self) - Add to MetaCart
Abstract. Current web services are largely based on a synchronous request-response model that uses the Simple Object Access Protocol SOAP. Next-generation telecommunication networks, on the contrary, are characterised by the need to handle asynchronous interactions among distributed service

A Formal Modeling Framework for Deploying Synchronous Designs on Distributed Architectures

by Luca P. Carloni, Alberto L. Sangiovanni-vincentelli - In FMGALS 2003: Formal Methods for Globally Asynchronous Locally Asynchronous Architecture , 2003
"... Synchronous specifications are appealing in the design of large scale hardware and software systems because of their properties that facilitate verification and synthesis. When the target architecture is a distributed system, implementing a synchronous specification as a synchronous design may b ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
Synchronous specifications are appealing in the design of large scale hardware and software systems because of their properties that facilitate verification and synthesis. When the target architecture is a distributed system, implementing a synchronous specification as a synchronous design may

On the expressiveness of attribute global types: The formalization of a real multiagent system protocol

by Viviana Mascardi, Daniela Briola, Davide Ancona - AI*IA 2013: Advances in Artificial Intelligence. Proceedings, volume 8249 of LNCS , 2013
"... Abstract. Attribute global types are a formalism for specifying and dy-namically verifying multi-party agents interaction protocols. They allow the multiagent system designer to easily express synchronization con-straints among protocol branches and global constraints on sub-sequences of the allowed ..."
Abstract - Cited by 3 (3 self) - Add to MetaCart
Abstract. Attribute global types are a formalism for specifying and dy-namically verifying multi-party agents interaction protocols. They allow the multiagent system designer to easily express synchronization con-straints among protocol branches and global constraints on sub

Verification of Clock Synchronization Algorithms: Experiments on a combination of deductive tools

by Damian Barsotti, Leonor Prensa Nieto, Alwen Tiu
"... We report on an experiment in combining the theorem prover Isabelle with automatic first-order arithmetic provers to increase automation on the verification of distributed protocols. As a case study for the experiment we verify several averaging clock synchronization algorithms. We present a formal ..."
Abstract - Cited by 15 (3 self) - Add to MetaCart
We report on an experiment in combining the theorem prover Isabelle with automatic first-order arithmetic provers to increase automation on the verification of distributed protocols. As a case study for the experiment we verify several averaging clock synchronization algorithms. We present a
Results 1 - 10 of 43