A compositional proof theory for fault tolerant real-time distributed systems

A compositional network proof theory for specifying and verifying fault tolerant real-time distributed systems is presented. Important in such systems is the failure hypothesis that stipulates the class of failures that must be tolerated. In the formalism presented, the failure hypothesis of a system is represented by a predicate which expresses how faults might transform the behavior of the system. The approach is illustrated by investigating a triple modular redundant system

Predictable embedded multiprocessor system design

Consumers have high expectations about the video and audio quality delivered by media processing devices like TVsets, DVD-players and digital radios. Predictable heterogenous application domain specific multiprocessor systems, which are designed around networks-on-chip, can meet demanding performance, flexibility and power-e#ciency requirements as well as stringent timing requirements. The timing requirements can be guaranteed by making use of resource management techniques and the analytical techniques that are described in this paper

Predictable embedded multiprocessor system design

Consumers have high expectations about the video and audio quality delivered by media processing devices like TVsets, DVD-players and digital radios. Predictable heterogenous application domain specific multiprocessor systems, which are designed around networks-on-chip, can meet demanding performance, flexibility and power-e#ciency requirements as well as stringent timing requirements. The timing requirements can be guaranteed by making use of resource management techniques and the analytical techniques that are described in this paper