Entwurf und Bewertung fehlertoleranter, verteilter Echtzeitsysteme am Beispiel MARS

@inproceedings{Kopetz1988EntwurfUB,
  title={Entwurf und Bewertung fehlertoleranter, verteilter Echtzeitsysteme am Beispiel MARS},
  author={Hermann Kopetz and Andreas Damm and Christian Koza and Marco Mulazzani and Wolfgang Schwabl and Christoph Senft and Ralph Zainlinger},
  booktitle={GI Jahrestagung},
  year={1988}
}
Verteilte Prozesrechneranwendungen steilen hohe Anforderungen an das Computerkontrollsystem sowohl in bezug auf die Einhaltung von zeitlichen Schranken als auch in bezug auf Zuverlassigkeit und Fehlertoleranz. Das MARS-Entwurfssystem berucksichtigt diese Anforderungen und unterscheidet zwischen dem kreativen Entwerfen (Entwurfsphase) und der Bewertung eines Entwurfes (Bewertungsphase). Beide Phasen werden durch entsprechende Tools mit graphischer Benutzerschnittsteile unterstutzt. Die… 

References

SHOWING 1-10 OF 33 REFERENCES

Interprocess Communication in MARS

TLDR
This paper outlines the interprocess communication mechanisms developed in the MARS (MAintainable Real-time System) project, which meets the real-time communication requirements by using periodic messages, a deterministic medium access strategy, and a simple datagram protocol.

An open layered architecture for dependability analysis and its application

  • M. Mulazzani
  • Computer Science
    [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers
  • 1988
TLDR
The author presents a proposal for an open layered architecture for dependability analysis, corresponding to the respective levels of abstraction to support structuring, reusability, and variability of methods and tools.

Reliability Modeling Using SHARPE

TLDR
This paper presents an approach for avoiding the large state space problem and uses a hierarchical modeling technique for analyzing complex reliability models that allows the flexibility of Markov models where necessary and retains the efficiency of combinatorial solution where possible.

Statecharts: A Visual Formalism for Complex Systems

  • D. Harel
  • Computer Science
    Sci. Comput. Program.
  • 1987

Reasoning About Time in Higher-Level Language Software

  • A. Shaw
  • Computer Science
    IEEE Trans. Software Eng.
  • 1989
TLDR
A methodology for specifying and providing assertions about time in higher-level-language programs is described, and examples of timing bounds and assertions that are proved include deadlines, timing invariants for periodic processes, and the specification of time-based events such as those needed for the recognition of single and double clicks from a mouse button.

On the criteria to be used in decomposing systems into modules

This paper discusses modularization as a mechanism for improving the flexibility and comprehensibility of a system while allowing the shortening of its development time. The effectiveness of a

Clock Synchronization in Distributed Real-Time Systems

TLDR
Depending on the types and number of tolerated faults, this paper presents upper bounds on the achievable synchronization accuracy for external and internal synchronization in a distributed real-time system.

A computer-aided design environment for distributed realtime systems

  • C. Senft
  • Computer Science
    [Proceedings] COMPEURO 88 - System Design: Concepts, Methods and Tools
  • 1988
TLDR
The author presents a distributed project support environment for the design of fault-tolerant distributed realtime systems using an entity-relationship model implemented by a hybrid data-management approach that is based on a relational database system and the Unix file system.

Design of Totally Self-Checking Check Circuits for m-Out-of-n Codes

TLDR
The design of totally self-checking check circuits for m-out-of-n codes is described and various gate level implementations for the majority detection circuits are presented, although the self- checking capability of the checker does not depend on their particular implementation since they are exhaustively tested by code inputs.

Preemptive Scheduling Under Time and Resource Constraints

TLDR
Algorithms for determining whether or not a set of preemptive tasks is schedulable in such a real-time system, and if so, determining a schedule for it are developed and evaluated.