Titlebook: Dependable Computing - EDCC-1; First European Depen Klaus Echtle,Dieter Hammer,David Powell Conference proceedings 1994 Springer-Verlag Ber

正論

A model for adaptive fault-tolerant systems,istributed system is network or processor failure, fault-tolerant distributed systems can be viewed as an important subclass of adaptive systems. As such, use of adaptive methods for dealing with failures in this context has the same potential advantages of improved efficiency and structural simplic

Ringworm

Designing secure and reliable applications using fragmentation-redundancy-scattering: an object-orincy-Scattering (FRS). The aim of FRS is to tolerate both accidental and intentional faults: the core idea consists in fragmenting confidential information in order to produce insignificant fragments and then in scattering the fragments so obtained in a redundant fashion across a distributed system,

FLAT

A fault-tolerant mechanism for simple controllers,t problem by making a proposal for a simple and low-cost fault-tolerant technique, yet very effective, that can be used even in the simplest controllers. The mechanism is able of tolerating both hardware and software faults. It uses behaviour-based error detection, with checkpointing and rollback, t

esculent

,Formal semantics for Ward & Mellor’s transformation schemas and the specification of fault-tolerantor defining the semantics of Statecharts [Har88] by Pnueli and Huizing. The models developed closely resemble those used for synchronous languages [BG92]. Each model has its own application area, e.g., one fits best for fault-tolerant systems, but only one model is modular. A number of ambiguities a

為寵愛

Formal reasoning on fault coverage of fault tolerant techniques: A case study,em with a set of predefined faults is considered. This method is based on process algebras and equivalence theory. The behaviour of the system in absence of faults is formally specified and faults are assumed as random events which interfere with the system by modifying its behaviour. A fault tolera

親屬

平躺

ANA

Computational restrictions for SPN with generally distributed transition times,oted to generalize the concept of Stochastic Petri nets, by allowing the firing times to be generally distributed. The evolution of the . in time becomes a stochastic process, for which in general, no analytical solution is available. The paper describes suitable restrictions of the . model with gen

LUCY

犬儒主義者