Advertisement

A duration calculus with infinite intervals

  • Zhou Chaochen
  • Dang Van Hung
  • Li Xiaoshan
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 965)

Abstract

This paper introduces infinite intervals into the Duration Calculus [33]. The extended calculus defines a state duration over an infinite interval by a property which specifies the limit of the state duration over finite intervals, and excludes the description operator. Thus the calculus can be established without involvement of unpleasant calculation of infinity. With limits of state durations, one can treat conventional liveness and fairness, and can also measure liveness and fairness through properties of limits. Including both finite and infinite intervals, the calculus can, in a simple manner, distinguish between terminating behaviour and nonterminating behaviour, and therefore directly specify and reason about sequentiality.

Keywords

Boolean Function Finite Interval Atomic Formula Disjunctive Normal Form State Duration 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dang Van Hung and Zhou Chaochen: Probabilistic Duration Calculus for Continuous Time. UNU/IIST Report No. 25, 1994.Google Scholar
  2. 2.
    M. Engel, M. Kubica, J. Madey, D.J. Parnas, A.P. Ravn and A.J. van Schouwen: A Formal Approach to Computer Systems Requirements Documentation. In Proc. the Workshop on Theory of Hybrid Systems, LNCS 736, R.L. Grossman, A. Nerode, A.P. Ravn and H. Rischel (Editors), pp. 452–474, 1993.Google Scholar
  3. 3.
    M. Engel and H. Rischel: Dagstuhl-Seminar Specification Problem — a Duration Calculus Solution. Personal communication, September 1994.Google Scholar
  4. 4.
    M.R. Hansen: Model-Checking Discrete Duration Calculus. In Formal Aspects of Computing. Vol. 6, No. 6A, pp. 826–845, 1994.Google Scholar
  5. 5.
    M.R. Hansen, P.K. Pandya and Zhou Chaochen: Finite Divergence. In Theoretical Computer Science, Vol.138, pp 113–139, 1995.Google Scholar
  6. 6.
    M.R. Hansen and Zhou Chaochen: Semantics and Completeness of Duration Calculus. In Real-Time: Theory in Practice, REX Workshop, LNCS 600, J.W. de Bakker, C. Huizing, W.-P. de Roever and G. Rozenberg (Editors), pp. 209–225, 1992.Google Scholar
  7. 7.
    M.R. Hansen, Zhou Chaochen and J. Staunstrup: A Real-Time Duration Semantics for Circuits. In Proc. of the 1992 ACM/SIGDA Workshop on Timing Issues in the Specification and Synthesis of Digital Systems, Princeton, March 1992.Google Scholar
  8. 8.
    He Jifeng and J. Bowen: Time Interval Semantics and Implementation of A Real-Time Programming Language. In Proc. 4th Euromicro Workshop on Real Time Systems, IEEE Press, June 1992.Google Scholar
  9. 9.
    He Weidong and Zhou Chaochen: A Case Study of Optimization. UNU/IIST Report No. 34, December 1994.Google Scholar
  10. 10.
    C.A.R. Hoare: Communicating Sequential Processes. Prentice Hall International (UK) Ltd., 1985.Google Scholar
  11. 11.
    Y. Kesten, A. Pnueli, J. Sifakis and S. Yovine: Integration Graphs: A Class of Decidable Hybrid Systems. In Hybrid Systems, LNCS 736, R.L. Grossman, A. Nerode, A.P. Ravn and H. Rischel (Editors), pp. 179–208, 1993.Google Scholar
  12. 12.
    B.C. Kuo: Automatic Control Systems (sixth edition), Prentice-Hall International Inc., 1991.Google Scholar
  13. 13.
    Liu Zhiming, A.P. Ravn, E.V. Sørensen and Zhou Chaochen: A Probabilistic Duration Calculus. In, Dependable Computing and Fault-Tolerant Systems Vol. 7: Responsive Computer Systems. H. Kopetz and Y. Kakuda (Editor), pp. 30–52, Springer Verlag, 1993.Google Scholar
  14. 14.
    Liu Zhiming, A.P. Ravn, E.V. Sørensen and Zhou Chaochen: Towards a Calculus of Systems Dependability. In Journal of High Integrity System, Vol. 1, No. 1, Oxford University Press, pp. 49–65, 1994.Google Scholar
  15. 15.
    B. Moszkowski: A Temporal Logic for Multilevel Reasoning about Hardware. In IEEE Computer, Vol. 18, No. 2, pp. 10–19, 1985.Google Scholar
  16. 16.
    B. Moszkowski: Some Very Compositional Temporal Properties, In Programming Concepts, Methods and Calculi (A-56), E.-R. Olderog (Editor), Elsevier Science B.V. (North-Holland), pp. 307–326, 1994.Google Scholar
  17. 17.
    B. Moszkowski: Compositional Reasoning about Projected and Infinite Time, Technical Report EE/0495/M1, Department of Electrical and Electronic Engineering, University of Newcastle upon Tyne, U.K., 1995.Google Scholar
  18. 18.
    P.H. Pandya: Weak Chop Inverses and Liveness in Duration Calculus. Technical Report TR-95-1, Computer Science Group, TIFR, India, 1994.Google Scholar
  19. 19.
    A.P. Ravn and H. Rischel: Requirements Capture for Embedded Real-Time Systems. In Proc. IMACS-MCTS'91 Symp. Modelling and Control of Technological Systems, Vol. 2, pp. 147–152, Villeneuve d'Ascq, France, 1991.Google Scholar
  20. 20.
    A.P. Ravn, H. Rischel and K.M. Hansen: Specifying and Verifying Requirements of Real-Time Systems. In IEEE Trans. Software Eng., Vol. 19, No. 1, pp. 41–55, January 1993.Google Scholar
  21. 21.
    R. Rosner and A. Pnueli: A Choppy Logic. In First Annual IEEE Symposium on Logic In Computer Science, pp 306–314, IEEE Computer Society Press, June, 1986.Google Scholar
  22. 22.
    J.U. Skakkebæk: Liveness and Fairness in Duration Calculus. In CONCUR'94: Concurrency Theory, LNCS 836, B. Jonsson and J. Parrow(Editors), pp. 283–298, 1994.Google Scholar
  23. 23.
    J.U. Skakkebæk, A.P. Ravn, H. Rischel and Zhou Chaochen: Specification of Embedded Real-Time Systems. In Proc. 4th Euromicro Workshop on Real-Time Systems, pp. 116–121, IEEE Press, June 1992.Google Scholar
  24. 24.
    J.U. Skakkebæk and N. Shankar: Towards a Duration Calculus Proof Assistant in PVS. In Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863, H. Langmaack, W.-P. de Roever and J. Vytopil (Editors), pp. 660–679, Sept. 1994.Google Scholar
  25. 25.
    J.U. Skakkebæk, and P. Sestoft: Checking Validity of Duration Calculus Formulas. ProCoS II Report ID/DTH JUS 3/1, January 1993Google Scholar
  26. 26.
    Y. Venema: A Modal Logic for Chopping Intervals. In Journal of Logic Computation, Vol. 1, No. 4, pp. 453–476, 1991.Google Scholar
  27. 27.
    H. Weyl: Mathematics and Logic. A Brief Survey Serving as a Preface to a View of “The Philosophy of Bertrand Russell”. In Amer. Math. Monthly, Vol. 53, pp. 2–13, 1946.Google Scholar
  28. 28.
    B.H. Widjaja, Chen Zongji, He Weidong and Zhou Chaochen: A Cooperative Design for Hybrid Control System. UNU/IIST Report No.36, 1995.Google Scholar
  29. 29.
    Yu Huiqun, P.K. Pandya and Sun Yongqiang: A Calculus for Hybrid Sampled Data Systems. In Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863, H. Langmaack, W.-P. de Roever and J. Vytopil (Editors), pp. 716–737, Sept. 1994.Google Scholar
  30. 30.
    Yu Xinyao, Wang Ji, Zhou Chaochen and P.K. Pandya: Formal Design of Hybrid Systems. In Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863, H. Langmaack, W.-P. de Roever and J. Vytopil (Editors), pp. 738–755, Sept. 1994.Google Scholar
  31. 31.
    Zheng Yuhua and Zhou Chaochen: A Formal Proof of the Deadline Driven Scheduler. In Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863, H. Langmaack, W.-P. de Roever and J. Vytopil (Editors), pp. 756–775, Sept. 1994.Google Scholar
  32. 32.
    Zhou Chaochen: Duration Calculi: An Overview. In the Proceedings of Formal Methods in Programming and Their Applications, LNCS 735, D. Bjørner, M. Broy and I.V. Pottosin (Editors), pp. 256–266, July 1993.Google Scholar
  33. 33.
    Zhou Chaochen, C.A.R. Hoare and A.P. Ravn: A Calculus of Durations. In Information Processing Letters, Vol. 40, No. 5, pp. 269–276, 1991.Google Scholar
  34. 34.
    Zhou Chaochen, M.R. Hansen, A.P. Ravn and H. Rischel: Duration Specifications for Shared Processors. In Proc. of the Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 571, J. Vytopil (Editor), pp. 21–32, January 1992.Google Scholar
  35. 35.
    Zhou Chaochen, M.R. Hansen and P. Sestoft: Decidability and Undecidability Results for Duration Calculus. In Proc. of STACS '93. 10th Symposium on Theoretical Aspects of Computer Science, LNCS 665, P. Enjalbert, A. Finkel and K.W. Wagner (Editor), pp. 58–68, Feb. 1993.Google Scholar
  36. 36.
    Zhou Chaochen and Li Xiaoshan: Infinite Duration Calculus. Draft, August 1992.Google Scholar
  37. 37.
    Zhou Chaochen and Li Xiaoshan: A Mean Value Calculus of Durations. In A Classical Mind (Essays in Honour of C.A.R. Hoare), A.W.Roscoe (Editor), Prentice-Hall, pp. 431–451,1994.Google Scholar
  38. 38.
    Zhou Chaochen, A.P. Ravn and M.R. Hansen: An Extended Duration Calculus for Hybrid Real-Time Systems. In Hybrid Systems, LNCS 736, R.L. Grossman, A. Nerode, A.P. Ravn and H. Rischel (Editors), pp. 36–59, 1993.Google Scholar
  39. 39.
    Zhou Chaochen, Zhang Jingzhong, Yang Lu and Li Xiaoshan: Linear Duration Invariants. In Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863, H. Langmaack, W.-P. de Roever and J. Vytopil (Editors), pp. 86–109, Sept. 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Zhou Chaochen
    • 1
  • Dang Van Hung
    • 1
  • Li Xiaoshan
    • 1
  1. 1.UNU/IISTMacau

Personalised recommendations