Real-time Systems Performance in the Presence of Failures
Computer - Special issue on real-time systems
Performability Analysis of Distributed Real-Time Systems
IEEE Transactions on Computers
Implementing and checking timing constraints in real-time programs
EUROMICRO 93 Nineteenth EUROMICRO symposium on microprocessing and microprogramming on Open system design : hardware, software and applications: hardware, software and applications
Methods for validating real-time constraints
Journal of Systems and Software - Double issue on reengineering complex systems
The UltraSAN modeling environment
Performance Evaluation - Special issue: performance modeling tools
Performability modelling tools and techniques
Performance Evaluation
Totem: a fault-tolerant multicast group communication system
Communications of the ACM
Hard Real-Time Systems
A Unified Framework for the Performability Evaluation of Fault-Tolerant Computer Systems
IEEE Transactions on Computers
On Satisfying Timing Constraints in Hard-Real-Time Systems
IEEE Transactions on Software Engineering
Timing Analysis for Fixed-Priority Scheduling of Hard Real-Time Systems
IEEE Transactions on Software Engineering
SPNP: Stochastic Petri Net Package
PNPM '89 The Proceedings of the Third International Workshop on Petri Nets and Performance Models
Probabilistic Duration Automata for Analyzing Real-Time Systems
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Performability evaluation: where it is and what lies ahead
IPDS '95 Proceedings of the International Computer Performance and Dependability Symposium on Computer Performance and Dependability Symposium
| Hi-index | 0.00 |
The design of real-time dependable systems is dominated by the need to meet real-time deadlines. In this paper we present a methodology for analyzing durations in real-time dependable systems and for estimating the probabilities that real-time deadlines will be met. The probability density functions for the durations of composite operations are obtained by convolving the probability density functions for the durations of simpler operations. These probability density functions may be correlated, and such correlations must be handled correctly when the convolutions are performed. Example applications of the methodology are given for the Totem multicast group communication protocols.