Abstract
Considera distributed real-time program which is executed on a systemwith a limited set of hardware resources. Assume the programis required to satisfy some timing constraints, despite the occurrenceof anticipated hardware failures. For efficient use of resources,scheduling decisions must be taken at run-time, considering deadlines,the load and hardware failures. The paper demonstrates how toreason about such dynamically scheduled programs in the frameworkof a timed process algebra and modal logic. The algebra providesa uniform process encoding of programs, hardware and schedulers,with an operational semantics of a process depending on the assumptionsabout faults. The logic specifies the timing properties of aprocess and verifies them via this fault-affected semantics,establishing fault-tolerance. The approach lends itself to applicationof existing tools and results supporting reasoning in processalgebras and modal logics.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abadi, M., Lamport, L., and Wolper, P. 1989. Realizable and unrealizable specifications of reactive systems. LNCS 372: 1-17.
H. Ben-Abdallah at al. 1998. A process algebraic approach to the schedulability analysis of real-time systems. Real-Time Systems 15(3): 189-220.
Bertossi, A. A., and Mancini, L. V. 1994. Scheduling algorithms for fault-tolerance in hard-real-time systems. Real-Time Systems 7(3): 229-245.
Borjesson, A., Larsen, K. G., and Skou, A. 1995. Generality in design and compositional verification using TAV. Formal Methods in System Design 6(3): 239-258.
Burns, A., and Wellings, A. 1995. A computational model for fixed priority scheduling. In Real-Time Systems: Specification, Verification and Analysis, Joseph, M., ed., Prentice-Hall.
Camilleri, J., and Winskel, G. 1995. CCS with priority choice. Information and Computation 116: 26-37.
Cleaveland, R., and Hennessy, M. 1990. Priorities in process algebras. Information and Computation 87: 58-77.
Davies, J., and Schneider, S. 1995. A brief history of timed CSP. Theoretical Computer Science 138(2): 243-271.
Gerber, R., and Lee, I. 1994. A resource-based prioritized bisimulation for real-time systems. Information and Computation 113: 102-142.
Ghosh, S., et al. 1998. Fault-tolerant rate-monotonic scheduling. Real-Time Systems 15(2): 149-181.
Godskesen, J. C., et al. 1993. Epsilon-User's Manual. Department of Mathematics and Computer Science, University of Aalborg.
Hennessy, M., and Regan, T. 1991. A process algebra for timed systems. University of Sussex, Technical report.
Janowski, T. 1997. On bisimulation, fault-monotonicity and provable fault-tolerance. In LNCS, Volume 1349, pp. 292-306.
Kozen, D. 1983. Results on the propositional mu-calculus. Theoretical Computer Science 27.
Larsen, K. 1990. Modal specifications. LNCS 407.
Larsen, K. G., and Thomsen, B. 1988. A modal process logic. In Proc. 3rd Annual Symposium on Logic in Computer Science, pp. 203-210.
Liu, X. 1992. Specification and Decomposition in Concurrency. Department of Mathematics and Computer Science, University of Aalborg, PhD thesis.
Liu, Z., and Joseph, M. 1992. Transformations of programs for fault-tolerance. Formal Aspects of Computing 4: 442-469.
Liu, Z., and Joseph, M. 1999 Specification and verification of fault-tolerance, timing, and scheduling. ACM Transactions on Programming Languages and Systems 21(1): 46-89.
Milner, R. 1989. Communication and Concurrency. Prentice-Hall International.
Parrow, J. 1989. Submodule construction as equation solving in CCS. Theoretical Computer Science 68: 175-202.
Pleinevaux, P. 1995. Real-time fault tolerant operation of the 802.5 token ring. Real-Time Systems 8: 79-91.
Ramamritham, K. 1995. Dynamic priority scheduling. In Real-Time Systems: Specification, Verification and Analysis, Joseph, M., ed., Prentice-Hall.
Roscoe, A. W. 1998. The Theory and Practice of Concurrency. Prentice Hall.
Salwicki, A., and Műldner, T. 1981. On the algorithmic properties of concurrent programs. LNCS 125.
Wang, Yi. 1991. A Calculus of Real Time Systems. Department of Computer Science, Chalmers University of Technology, PhD thesis.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Janowski, T., Joseph, M. Dynamic Scheduling and Fault-Tolerance: Specification and Verification. Real-Time Systems 20, 51–81 (2001). https://doi.org/10.1023/A:1026537232278
Issue Date:
DOI: https://doi.org/10.1023/A:1026537232278