Advertisement

Formalizing real-time scheduling as program refinement

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

Abstract

This paper shows how the feasibility of scheduling a realtime program consisting of a number of parallel processes (tasks) can be proved as a step in the refinement of the program from its specification. Verification of this step of refinement makes formal use of methods and results from real-time scheduling theory.

Keywords

real-time program specification refinement feasibility 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AL88]
    M. Abadi and L. Lamport. The existence of refinement mapping. In Proc. 3rd IEEE Symposium on Logic and Computer Science, 1988.Google Scholar
  2. [AL92]
    M. Abadi and L. Lamport. An old-fashioned recipe for real-time. In W.P. de Rover J.W. de Bakker, C. Huizing and G. Rozenberg, editors, Real-Time: Theory in Practice, Lecture Notes in Computer Science 600. Springer-Verlag, 1992.Google Scholar
  3. [BDP95]
    A. Burns, R. Davis, and S. Punnekkat. Feasibility analysis of fault-tolerant real-time tasks. Technical report, Department of Computer Science, University of York, 1995.Google Scholar
  4. [BW96]
    A. Burns and A. Wellings. Advanced fixed priority scheduling. In M. Joseph, editor, Real-Time Systems: Specification, Verification and and Analysis, pages 32–65. Prentice Hall, 1996.Google Scholar
  5. [HMP91]
    T. Henzinger, Z. Manna, and A. Pnueli. Temporal proof methodologies for real-time systems. In Proceedings of the 8th ACM Annual Symposium on Principles of Programming Languages, pages 269–276, 1991.Google Scholar
  6. [Lam94]
    L. Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3):872–923, 1994.CrossRefGoogle Scholar
  7. [LJ93]
    Z. Liu and M. Joseph. Specifying and verifying of recovery in asynchronous communicating systems. In J. Vytopil, editor, Formal Techniques in RealTime and Fault Tolerant Systems, pages 137–166. Kluwer Academic Publishers, 1993.Google Scholar
  8. [LJ96a]
    Z. Liu and M. Joseph. Formalizing real-time scheduling as program refinement. Technical report, Department of Maths and Computer Science, University of Leicester, 1996.Google Scholar
  9. [LJ96b]
    Z. Liu and M. Joseph. Verification of fault-tolerance and real-time. In Proceedings of the 26th Annual International Symposium on Fault-Tolerant Computing, pages 220–229. IEEE Computer Society, 1996.Google Scholar
  10. [LJJ95]
    Z. Liu, M. Joseph, and T. Janowski. Verification of schedulability. Formal Aspects of Computing, 7(5):510–532, 1995.CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Zhiming Liu
    • 1
  • Mathai Joseph
    • 2
  1. 1.Department of Maths & Computer ScienceUniversisty of LeicesterLeicesterUK
  2. 2.Department of Computer ScienceUniversity of WarwickCoventryUK

Personalised recommendations