Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Liu, Z., Joseph, M. (2006). Real-Time and Fault-Tolerant Systems. In: Cavalcanti, A., Sampaio, A., Woodcock, J. (eds) Refinement Techniques in Software Engineering. PSSE 2004. Lecture Notes in Computer Science, vol 3167. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889229_5
Download citation
DOI: https://doi.org/10.1007/11889229_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46253-8
Online ISBN: 978-3-540-46254-5
eBook Packages: Computer ScienceComputer Science (R0)