Dynamic scheduling in the presence of faults: Specification and verification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1135, Issue , 1996, Pages 279-297

  Janowski, Tomasz ^a   Joseph, Mathai ^b  

^a UNITED NATIONS UNIVERSITY   (Macao)

^b UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; FAULT TOLERANCE; SCHEDULING; STATIC ANALYSIS; TEMPORAL LOGIC;

DYNAMIC SCHEDULING; HARDWARE RESOURCES; PROCESS LANGUAGES; REAL TIME PROGRAMS; SCHEDULING DECISIONS; SPECIFICATION AND VERIFICATION; TIMING CONSTRAINTS; TIMING PROPERTIES;

REAL TIME SYSTEMS;

EID: 0042963799     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61648-9_46     Document Type: Conference Paper

References (26)

1. M. Abadi and L. Lamport. Composing specifications. ACM Transactions on Programming Languages and Systems, 15(1):73-132, 1993.
2. M. Abadi, L. Lamport, and P. Wolper. Realizable and unrealizable specifications of reactive systems. LNCS, 372:1-17, 1989.
3. A.A. Bertossi and L.V. Mancini. Scheduling algorithms for fault-tolerance in hardreal- time systems. Real-Time Systems, 7(3):229-245, 1994.
4. A. Borjesson, K.G. Larsen, and A. Skou. Generality in design and compositional verification using TAV. Formal Methods in System Design, 6(3):239-258, 1995.
5. A. Burns and A. Wellings. A computational model for fixed priority scheduling. In M. Joseph, editor, Real-Time Systems: Specification, Verification and Analysis. Prentice-Hall, 1995.
6. J. Camilleri and G. Winskel. CCS with priority choice. Information and Computation, 116:26-37, 1995.
7. K. Cerans, J.C. Godskesen, and K.G. Larsen. Timed modal specifications. LNCS, 715:253-267, 1993.
8. R. Cleaveland and M. Hennessy. Priorities in process algebras. Information and Computation, 87:58-77, 1990.
9. R. Gerber and I. Lee. A resource-based prioritized bisimulation for real-time systems. Information and Computation, 113:102-142, 1994.
10. J.C. Godskesen et al. Epsilon-User's Manual. Department of Mathematics and Computer Science, University of Aalborg, 1993.
11. M. Hennessy and T. Regan. A process algebra for timed systems. Technical report, University of Sussex, 1991.
12. T. Janowski. Bisimulation and Fault-Tolerance. PhD thesis, Department of Computer Science, University of Warwick, 1995.
13. K. Larsen. Proof systems for Hennessy-Milner logic with recursion. LNCS, 299:215-230, 1988.
14. K. Larsen. Modal specifications. LNCS, 407, 1990.
15. K.G. Larsen. Context-Dependent Bisimulation Between Processes. PhD thesis, University of Edinburgh, Scotland, 1986.
16. K.G. Larsen and B. Thomsen. A modal process logic. In Proc. 3rd Annual Symposium on Logic in Computer Science, pages 203-210, 88.
17. X. Liu. Specification and Decomposition in Concurrency. PhD thesis, Department of Mathematics and Computer Science, University of Aalborg, 1992.
18. Z. Liu and M. Joseph. Transformations of programs for fault-tolerance. Formal Aspects of Computing, 4:442-469, 1992.
19. R. Milner. Communication and Concurrency. Prentice-Hall International, 1989.
20. F. Moiler and C. Tofts. A temporal calculus of comm. systems. LNCS, 458, 90.
21. J. Parrow. Submodule construction as equation solving in CCS. Theoretical Computer Science, 68:175-202, 89.
22. P. Pleinevanx. Real-time fault tolerant operation of the 802.5 token ring. Real- Time Systems, 8:79-91, 1995.
23. K. Ramamritham. Dynamic priority scheduling. In M. Joseph, editor, Real-Time Systems: Specification, Verification and Analysis. Prentice-Hall, 1995.
24. A. Salwicki and T. Miildner. On the algorithmic properties of concurrent programs. LNCS, 125, 1981.
25. R.D. Schlichting and F.B. Schneider. Fail stop processors: An approach to designing fanlt-tolerant computing systems. ACM Trans. on Comp. Sys., 1(3), 1983.
26. Wang Yi. A Calculus of Real Time Systems. PhD thesis, Department of Computer Science, Chalmers University of Technology, 1991.