Dynamic Data-Driven Formal Progress Envelopes for Distributed Algorithms

Paul, Saswata; Kopsaftopoulos, Fotis; Patterson, Stacy; Varela, Carlos A.

doi:10.1007/978-3-030-61725-7_29

Cited by 10 publications

(6 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [51], we have proposed an Internet of Planes (IoP), consisting of an asynchronous vehicle-to-vehicle (V2V) [41] network of aircraft, to facilitate autonomous capabilities such as decentralized admission control (DAC) [53]. In DAC, a candidate aircraft generates a conflict-aware flight plan that avoids NMACs with a set of owner aircraft of a controlled airspace [52].…”

Section: Introductionmentioning

confidence: 99%

Verification of Eventual Consensus in Synod Using a Failure-Aware Actor Model

Paul

Agha

Patterson

et al. 2021

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Successfully attaining consensus in the absence of a centralized coordinator is a fundamental problem in distributed multi-agent systems. We analyze progress in the Synod consensus protocol-which does not assume a unique leader-under the assumptions of asynchronous communication and potential agent failures. We identify a set of sufficient conditions under which it is possible to guarantee that a set of agents will eventually attain consensus. First, a subset of the agents must behave correctly and not permanently fail until consensus is reached, and second, at least one proposal must be eventually uninterrupted by higher-numbered proposals. To formally reason about agent failures, we introduce a failure-aware actor model (FAM). Using FAM, we model the identified conditions and provide a formal proof of eventual progress in Synod. Our proof has been mechanically verified using the Athena proof assistant and, to the best of our knowledge, it is the first machine-checked proof of eventual progress in Synod.

show abstract

Section: Introductionmentioning

confidence: 99%

Verification of Eventual Consensus in Synod Using a Failure-Aware Actor Model

Paul

Agha

Patterson

et al. 2021

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…In [50] we have presented an autonomous protocol for UTM called Decentralized Admission Control (DAC) in which aircraft connected through an asynchronous vehicle-2-vehicle (V2V) [47] network called the Internet-of-Planes (IoP) [51] can coordinate their use of a shared fourdimensional airspace. In DAC, an airspace has a set of owner aircraft which already have the authorization to carry out a fixed set of flight plans through the airspace (Fig.…”

Section: Introductionmentioning

confidence: 99%

“…Another important motivation behind developing a tailored library was to lay the foundation for a parameterized proof library that can be used in tandem with the dynamic data-driven applications systems (DDDAS) [14] paradigm for the runtime verification of autonomous distributed applications [51]. Autonomous UAM applications like DAC are expected to operate in unpredictable dynamic environments which cannot be completely modeled.…”

Section: Introductionmentioning

confidence: 99%

“…However, the operational conditions presented by UAM are expected to be highly dynamic in nature, making it infeasible to exhaustively model them. Under such circumstances, it is possible to probabilistically reason about these conditions to provide valuable non-deterministic guarantees that can be used by the participating aircraft to take important real-time operational deci- sions [51]. These guarantees can be supported by pre-developed formal proofs that have been mechanically verified for correctness under some reasonable assumptions about the conditions.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Formal Guarantees of Timely Progress for Distributed Knowledge Propagation

Paul

Patterson

Varela

2021

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Autonomous air traffic management (ATM) operations for urban air mobility (UAM) will necessitate the use of distributed protocols for decentralized coordination between aircraft. As UAM operations are time-critical, it will be imperative to have formal guarantees of progress for the distributed protocols used in ATM. Under asynchronous settings, message transmission and processing delays are unbounded, making it impossible to provide deterministic bounds on the time required to make progress. We present an approach for formally guaranteeing timely progress in a Two-Phase Acknowledge distributed knowledge propagation protocol by probabilistically modeling the delays using theories of the Multicopy Two-Hop Relay protocol and the M/M/1 queue system. The guarantee states a probabilistic upper bound to the time for progress as a function of the probabilities of the total transmission and processing delays being less than two given values. We also showcase the development of a library of formal theories, that is tailored towards reasoning about timely progress in distributed protocols deployed in airborne networks, in the Athena proof assistant.

show abstract

“…In [50], we have proposed an Internet of Planes (IoP), consisting of an asynchronous vehicle-to-vehicle (V2V) [41] network of aircraft, to facilitate autonomous capabilities such as decentralized admission control (DAC) [52]. In DAC, a candidate aircraft generates a conflict-aware flight plan that avoids NMACs with a set of owner aircraft of a controlled airspace [51].…”

Section: Introductionmentioning

confidence: 99%