Real-Time and Fault-Tolerant Systems

  • Zhiming Liu
  • Mathai Joseph
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3167)


In this chapter, we show that functional and many non-functional properties of a real-time system, such as schedulability, or proving that its implementation meets its timing constraints, can be verified in a similar way. Likewise, the fault-tolerance of a system can be proved using the same techniques. We use a single notation and model and take a unified view of the functional and non-functional properties of programs. A simple transformational method is used to combine these properties [167, 168]. We show how the theory of concurrency, fault-tolerance, real-time and scheduling can be built on the theories of sequential programming, such as those of Dijkstra’s calculus of weakest preconditions [81], Hoare Logic [114], Morgan’s refinement calculus [192] and Hoare and He’s UTP [117]. These theories are discussed and used in Chapter 4 and Chapter 6.


Temporal Logic Timing Property State Sequence Atomic Action Read Operation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Zhiming Liu
    • 1
  • Mathai Joseph
    • 2
  1. 1.International Institute for Software Technology United Nations UniversityMacao SARChina
  2. 2.Tata Research Development and Design CentrePuneIndia

Personalised recommendations