Skip to main content
SpringerLink
Log in

Integrating Variants of DC

  • Conference paper
Theoretical Aspects of Computing - ICTAC 2004 (ICTAC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3407))

Included in the following conference series:

Abstract

Duration Calculus (DC) [22] was introduced as a logic to specify real-time requirements of computing systems. It has been used successfully in a number of case studies. Moreover, many variants of DC were proposed to deal with various real-time systems, including communicating processes [24], sequential hybrid systems [19, 23] imperative programming languages [2,17,18,24] finite divergence [6] and liveness properties [1,25]. This paper aims to integrate those variants, and provides a logical framework for DC-based programming, and a design calculus for mixed hardware/software systems.

The work is partially supported by the 211 Key Project of the MoE, and the 973 project (no. 2002CB312001) of the MoST of China.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barua, R., Chanchen, Z.: Neighbourhood Logics. UNU/IIST Report No. 120 (1997)

    Google Scholar 

  2. Van Hung, D., Guelev, D.P.: Completeness and decidability of a fragment of duration calculus with iteration. In: Thiagarajan, P.S., Yap, R.H.C. (eds.) ASIAN 1999. LNCS, vol. 1742, pp. 139–150. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  3. Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall, Englewood Cliffs (1976)

    MATH  Google Scholar 

  4. Gordon, M.: The Semantic Challenge of Verilog HDL. In: Proc. of LICS 1995, San Diego, California (1995)

    Google Scholar 

  5. Gordon, M.: Event and Cyclic Semantics of Hardware Description Languages. Technical Report of the Verilog Formal Equivalence Project of Cambridge Computing Laboratory (1995)

    Google Scholar 

  6. Hansen, M., Pandya, P., Chaochen, Z.: Finite divergence Theoretical Computer Science 138, 113–139 (1995)

    Google Scholar 

  7. Jifeng, H.: A Common Framework for Mixed Hardware/Software Systems. In: Proc. of IFM 1999, pp. 1–25. Springer, Heidelberg (1999)

    Google Scholar 

  8. Jifeng, H., Qiwen, X.: Advance Features of DC and their applications in Sequential Hybrid Systems Formal Aspect of Computing 15, 84–99 (2003)

    Google Scholar 

  9. Hoare, C.A.R., Jifeng, H.: Unifying Theories of Programming. Prentice-Hall, Englewood Cliffs (1998)

    Google Scholar 

  10. Li, L., Jifeng, H.: A DC Semantic for Timed RSL. In: Proc. of RTCSA 1999, pp. 492–504 (1999)

    Google Scholar 

  11. Maler, O., Manna, Z., Pnueli, A.: From timed to hybrid systems. In: Huizing, C., de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.) REX 1991. LNCS, vol. 600. Springer, Heidelberg (1992)

    Google Scholar 

  12. Morgan, C.: Programming from Specifications, 2nd edn. Prentice Hall, Englewood Cliffs (1994)

    MATH  Google Scholar 

  13. Moszkowski, B.C.: A temporal logic for multi-level reasoning about hardware. IEEE Computer 18 (2), 10–19

    Google Scholar 

  14. Moszkowski, B.C.: Executing Temporal Logic Programs. Cambridge University Press, Cambridge (1986)

    Google Scholar 

  15. Moszkowski, B.C.: Compositional reasoning about projected and infinite time. In: Proc. of the First IEEE International Conference on Engineering of Complex Computer Systems, pp. 238–245 (1995)

    Google Scholar 

  16. Open Verilog International (OVI). Verilog Hardware Description Language Reference Manual. Version 1 (1994)

    Google Scholar 

  17. Pandya, P., Ramakrishna, Y.: A recursive duration calculus Technical Report, CS-95/3, Computer Science Group, TIFR, Bombay (1995)

    Google Scholar 

  18. Pandya, P., Dang, V.H.: Duration calculus of weakly monotonic time. In: Ravn, A.P., Rischel, H. (eds.) FTRTFT 1998. LNCS, vol. 1486, p. 55. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  19. Pandya, P., Wang, H.P., Xu, Q.W.: Towards a Theory of Sequential Hybrid Programs. In: Proc. of IFIP Conference. Chapman & Hall, Boca Raton (1998)

    Google Scholar 

  20. Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5, 285–309 (1955)

    MATH  MathSciNet  Google Scholar 

  21. Thomas, D.E., Moorby, P.: The VERILOG Hardware Description Language. Kluwer Publisher, Dordrecht (1991)

    Google Scholar 

  22. Chaochen, Z., Hoare, C.A.R., Ravn, A.P.: A calculus of duration. Information Processing Letters 40(5), 269–275 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  23. Chaochen, Z., Ravn, A., Hansen, M.: An extended duration calculus for hybrid systems. In: Grossman, R.L., Ravn, A.P., Rischel, H., Nerode, A. (eds.) HS 1991 and HS 1992. LNCS, vol. 736, pp. 36–59. Springer, Heidelberg (1993)

    Google Scholar 

  24. Chaochen, Z., Xiaoshan, L.: A Mean Value Calculus of Durations. In: Roscoe, A.W. (ed.) A Classical Mind: Essays in Honour of C.A.R. Hoare, pp. 431–451. Prentice-Hall, Englewood Cliffs (1994)

    Google Scholar 

  25. Chaochen, Z., Hansen, M.: Chopping a point. In: Proc. of BCS FACS 7th Refinement Workshop, Electronic Workshop in Computer Sciences. Springer, Heidelberg (1996)

    Google Scholar 

  26. Chaochen, Z., Guelev, D.P., Naijun, Z.: A Higher-Order Duration Calculus. In: Davies, J., et al. (eds.) Millennial Perspectives in Computer Science, pp. 407–416 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. International Institute for Software Technology, United Nations University, Macau

    He Jifeng

  2. SEI of East China Normal University, Shanghai, China

    Jin Naiyong

Authors
  1. He Jifeng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jin Naiyong
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. International Institute of Software Technology, United Nations University, Macau, China

    Zhiming Liu

  2. Department of Computer Science and Communication Engineering, Graduate School of Information Science and Electrical Engineering, Kyushu University, 6-10-1-Hakozaki, Higashi-ku, 812-8581, Fukuoka, Japan

    Keijiro Araki

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jifeng, H., Naiyong, J. (2005). Integrating Variants of DC. In: Liu, Z., Araki, K. (eds) Theoretical Aspects of Computing - ICTAC 2004. ICTAC 2004. Lecture Notes in Computer Science, vol 3407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31862-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31862-0_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25304-4

  • Online ISBN: 978-3-540-31862-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation