Safety and Reliability

ͽ Safe system
ͽ Reliable system
ͽ Fail-safe system
ͽ Ways to achieve reliability
ͽ Error Avoidance
ͽ Error Detection and Removal
ͽ Fault-tolerance
ͽ Hardware FT
ͽ BIST
ͽ TMR
ͽ Software FT
ͽ N-Version programming
ͽ Recovery blocks
ͽ Checkpointing and Rollback recovery
 Types of Real-Time Tasks
ͽ Real-time task is one for which quantitative expressions of time are needed to describe
its behavior.
ͽ A real-time task can be classified into
ͽ hard,
ͽ soft,
ͽ firm real-time task
depending on the consequences of a task missing its deadline.
 Timing Constraints
ͽ An event may be generated either by the system or its environment. Two
types:
ͽ 1. Stimulus Events:
ͽ generated by the environment and act on the system.
ͽ produced asynchronously, periodically.
ͽ For example, a user pressing a button on a telephone set
ͽ periodic sensing of the temperature of the reactor in a nuclear plant.
ͽ 2. Response Events:
ͽ produced by the system in response to some stimulus events and act on
the environment.
ͽ For example, consider a chemical plant where as soon as the temperature
exceeds 100°C, the system responds by switching off the heater. Here,
the event of temperature exceeding100°C is the stimulus and switching
off of the heater is the response.
ͽ Response events can either be periodic or aperiodic.
 Classification of Timing Constraints
ͽ Why classification needed?
ͽ give an insight into the different types of timing constraints
that can exist in a system.
ͽ help to quickly identify the different timing constraints that
can exist from a casual examination of a problem.
ͽ it can also let us work out the specification of a real-time
system accurately.
 Classification of Timing Constraints
ͽ Behavioral constraints
ͽ are the constraints that are imposed on the stimuli generated
by the environment.
ͽ ensure that the environment of a system is well behaved.

ͽ Performance constraints
ͽ are the constraints that are imposed on the response of the
system.
ͽ ensure that the computer system performs satisfactorily.
 Classification of Timing Constraints
ͽ 1. Delay: A delay constraint captures the minimum time (delay) that must
elapse between the occurrence of two arbitrary events e1, and e2.
ͽ Delay violation.

ͽ t(e2) and t(e1) are the time stamps on the events e2 and e1.
ͽ Δ denotes the actual separation in time between the occurrence of the two
events e1 and e2 and d is a delay.
ͽ Example: Once a digit is dialed, the next digit should be dialed after at least
1 second..
 Classification of Timing Constraints
ͽ 2. Deadline: A deadline constraint captures the permissible maximum
separation between any two arbitrary events.
ͽ t(e2) and t(e1) are the time stamps on the events e2 and e1.
ͽ Δ denotes the actual separation in time between the occurrence of the two
events e1 and e2 and d is a deadline.
ͽ Once the dial tone appears, the first digit must be dialed within 30 seconds.
ͽ
Classification
3. Duration constraint :
of Timing Constraints
ͽ specifies the time period over which the event acts.
ͽ can either be minimum type or maximum type.
ͽ The minimum type duration constraint requires that once the event starts, the event must not end
before a certain minimum duration;
ͽ whereas a maximum type duration constraint requires that once the event starts, the event must
end before a certain maximum duration elapses.
ͽ Ex: If you press the button of the handset for less than 15 seconds, it connects to the local
operator.
ͽ If you press the button for any duration lasting between 15 to 30 seconds, it connects to the
international operator.
ͽ If you keep the button pressed for more than 30 seconds, then on releasing it would produce the
dial tone.
ͽ t(e2) and t(e1) are the time stamps on the events e2 and e1.
ͽ Δ denotes the actual separation in time between the occurrence of the two events e1 and e2 and d is a
 Classification of Timing Constraints
ͽ 1. Stimulus—Stimulus (SS):
ͽ In this case, the deadline is defined between two stimuli.
ͽ This is a behavioral constraint, since the constraint is imposed on a
stimuli event.
ͽ Example: Once a user completes dialing a digit, he must dial the next
digit within the next 5 seconds. Otherwise an idle tone is produced.
ͽ 2. Stimulus—Response(SR):
ͽ In this case, the deadline is defined on the response event, measured
from the occurrence of the corresponding stimulus event.
ͽ This is a performance constraint, since the constraint is imposed on a
response event.
ͽ Example: Once the receiver of the hand set is lifted, the dial tone must be
produced by the system within 2 seconds.
 Classification of Timing Constraints
ͽ 3. Response—Stimulus(RS):
ͽ Here the deadline is on the production of response counted from the
corresponding stimulus.
ͽ This is a behavioral constraint, since the constraint is imposed on the
stimulus event.
ͽ Example: Once the dial tone appears, the first digit must be dialed within 30
seconds, otherwise the system enters an idle state and an idle tone is
produced.
 Classification of Timing Constraints
ͽ 4. Response—Response(RR):
ͽ is defined on two response events.
ͽ In this case, once the first response event occurs, the second response event
must occur before a certain deadline.
ͽ This is a performance constraint, since the timing constraint has been
defined on a response event.
ͽ Example: Once the ring tone is given to the callee, the corresponding ring
back tone must be given to the caller within two seconds, otherwise the call
is terminated.
 Modelling Timing Constraints
ͽ Modelling time constraints
ͽ help to verify and understand a real-time system.
ͽ used to automatically generate code from it.
ͽ Once a model of the time constraints in a system is
constructed, it can serve as a formal specification of the
system.
 Finite State Machines (FSMs)
ͽ powerful tool which has long been used to model traditional
systems.
ͽ In an FSM model, at any point of time, a system can be in any one
of a (possibly infinite) number of states.
 Finite State Machines (FSMs)
ͽ A state is represented by a circle.
ͽ A transition from one state to another is represented by drawing a
directed arc from the source to the destination.
ͽ The event causing a transition is annotated on the arc.
 Finite State Machines (FSMs)
ͽ The system changes state due to events.
ͽ A state change is also called a state transition.
ͽ A transition causing event may either be an interface event that
are transmitted between the environment and the computer
system or it could also be an internal event that is generated and
consumed solely within the system.
 Extended Finite State Machines (EFSMs)
ͽ Incorporates the action of setting a timer and the expiry event of a
timer.

ͽ SS, RS, SR, RR

 SS
ͽ Once the first digit has been dialed on the telephone handset, the
next digit must be dialed within the next 5 milli seconds.
 RS
ͽ Once the dial tone appears, the first digit must be dialed within 30
seconds,otherwise the system enters an idle state and an idle tone
is produced.
 SR
ͽ Once the receiver of the hand set is lifted, the dial tone must be
produced by the system within 2 seconds, otherwise a beeping
sound is produced until the handset is replaced.
 RR
ͽ Once the ring tone is given to the callee, the corresponding ring
back tone must be givento the caller within two seconds,
otherwise the call is terminated.
 Delay
ͽ After a digit is dialed, the next digit should be dialed no sooner
than 10 milli seconds.
 Durational constraint
ͽ If you press the button of the handset for less than 15 seconds it connects to the local
operator. If you press the button for any duration lasting between 15 to 30 seconds, it
connects to the international operator. If you keep the button pressed for more than 30
seconds, then on releasing it would produce the dial tone.