✦ LIBER ✦

Systematic formal verification for fault-tolerant time-triggered algorithms

✍ Scribed by Rushby, J.

Book ID: 117872374
Publisher: IEEE
Year: 1999
Tongue: English
Weight: 193 KB
Volume: 25
Category: Article
ISSN: 0098-5589
DOI: 10.1109/32.815324

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on inconsistent axioms in Rushby'

A note on inconsistent axioms in Rushby's "systematic formal verification for fault-tolerant time-triggered algorithms"

✍ Pike, L. 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 66 KB

Safe, fault-tolerant and deterministic a

Safe, fault-tolerant and deterministic algorithms for real-time control

✍ P.R. Croll 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 491 KB

A new study for fault-tolerant real-time

A new study for fault-tolerant real-time dynamic scheduling algorithms

✍ G. Manimaran; C. Siva Ram Murthy 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 823 KB

Constant time fault tolerant algorithms

Constant time fault tolerant algorithms for a linear array with a reconfigurable pipelined bus system

✍ Anu G. Bourgeois; Yi Pan; Sushil K. Prasad 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 212 KB

Safe, fault-tolerant and deterministic a

Safe, fault-tolerant and deterministic algorithms for real-time control : P.R. Croll, pp 81–86

📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 168 KB

A distributed algorithm for embedding tr

A distributed algorithm for embedding trees in hypercubes with modifications for run-time fault tolerance

✍ Foster J. Provost; Rami Melhem 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 588 KB

In this paper we present a distributed algorithm for embedding binary trees in hypercubes. Starting with the root (invoked in some cube node by a host), each node is responsible for determining the addresses of its children, and for invoking the embedding algorithm for the subtree rooted at each chi