Endlessly circulating messages in IEEE 1588-2008 systems

Broman, David; Derler, Patricia; Desai, Ankush; Eidson, John C.; Seshia, Sanjit A.

doi:10.1109/ispcs.2014.6948522

Cited by 2 publications

(2 citation statements)

References 5 publications

(2 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Existence of a rogue frame can lead to network congestion or cause the BMC algorithm to never converge. The counter example was cross-validated using simulation and is described in detail in [6]. It was well received by the IEEE 1588 standards committee.…”

Section: Verification and Testing Using Approximate Synchronymentioning

confidence: 99%

“…Our results show that approximate synchrony can reduce the state space to be explored by orders of magnitude while modeling relevant timing semantics of these protocols, allowing one to verify properties that cannot be verified otherwise. Moreover, we were able to find a so-called "rogue frame" scenario that the IEEE 1588 standards committee had long debated without resolution (see our companion paper written for the IEEE 1588 community [6] for details).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Approximate Synchrony: An Abstraction for Distributed Almost-Synchronous Systems

Desai

Seshia

Qadeer

et al. 2015

Computer Aided Verification

Self Cite

View full text Add to dashboard Cite

Abstract. Forms of synchrony can greatly simplify modeling, design, and verification of distributed systems. Thus, recent advances in clock synchronization protocols and their adoption hold promise for system design. However, these protocols synchronize the distributed clocks only within a certain tolerance, and there are transient phases while synchronization is still being achieved. Abstractions used for modeling and verification of such systems should accurately capture these imperfections that cause the system to only be "almost synchronized." In this paper, we present approximate synchrony, a sound and tunable abstraction for verification of almost-synchronous systems. We show how approximate synchrony can be used for verification of both time synchronization protocols and applications running on top of them. We provide an algorithmic approach for constructing this abstraction for symmetric, almost-synchronous systems, a subclass of almost-synchronous systems. Moreover, we show how approximate synchrony also provides a useful strategy to guide state-space exploration. We have implemented approximate synchrony as a part of a model checker and used it to verify models of the Best Master Clock (BMC) algorithm, the core component of the IEEE 1588 precision time protocol, as well as the time-synchronized channel hopping protocol that is part of the IEEE 802.15.4e standard.

show abstract

Section: Verification and Testing Using Approximate Synchronymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%