Online manual on the SHARPE package:

Reliability and Availability Modeling:
- Example 1: A reliability block diagram
- Example 2: Another reliability block diagram
- Example 3: A relcomp-type system
- Example 4: A fault tree for a series system
- Example 5: A fault tree for an aircraft control system
- Example 6: Rai's fault tree
- Example 7: A reliability graph and equivalent non-series-parallel block diagram
- Example 8: An acyclic Markov reliability model
- Example 9: A non-acyclic Markov chain with an absorbing state
- Example 10: Markov models for the three repair strtegies
- Example 11: A system with Weibull failure distribution

Ring network:
- Example 12: Fault tree model for ring network
- Example 13: Markov model for ring network
- Example 14: GSPN model of ring network

Performance Modeling:
- Example 15: A task graph model of a program with concurrency
- Example 16: Precedence graph for the CPU-I/O overlap example
- Example 17: Precedence graph for more detailed CPU-I/O overlap example
- Example 18: An example parallel program
- Example 19: A graph model for a program whose segments can fail
- Example 20: Kung's example: a graph model for interprocess communication
- Example 21: A central server queuing system
- Example 22: A multi-chain queuing network
- Example 23: A birth-death type Markov chain for the M/M/5/100 system
- Example 24: Markov model for queue with server failure and repair
- Example 25: GSPN model for queue with server failure and repair
- Example 26: Markov model for a single server queue
- Example 27: Markov model of an ISDN channel
- Example 28: ISDN channel with Poisson and MMPP arrival processes
- Example 29: Discrete time Markov model for shared memory multiprocessor example
- Example 30: Markov model for system with hypo-exponential service times
- Example 31: A semi-Markov chain

Hierarchical Models:
- Example 32: Reliability graph inside a reliability graph
- Example 33: Reliability graph inside a block diagram
- Example 34: Markov model (of a bridge system) inside a block diagram
- Example 35: A non-series-parallel graph and an exact model decomposition
- Example 36: A task graph with a cycle and its exact decomposition
- Example 37: A queuing model with resource constraints
- Example 38: Queuing network with simultaneousresource constraints
- Example 39: A queuing model with job priorities
- Example 40: Two-level model for task graph
- Example 41: Markov chains for decomposition of a queue with failure and repair
- Example 42: Markov chains withinh fault tree: repair per subsystem
- Example 43: Fault/error-handling model

Performability Models:
- Example 44: A Markov model reward
- Example 45: An irreducible Markov model reward
- Example 46: A hierarchical Markov reward model
- Example 47: A multiprocessor performability model


Kishor Trivedi
Last modified: Wed April 28 11:49:28 EST 1999