Skip to main content
SpringerLink
Log in

A Complete Fragment of Higher-Order Duration μ-Calculus

  • Conference paper
  • First Online:
FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1974))

Abstract

The paper presents an extension μHDC of Higher-order Duration Calculus (HDC,[ZGZ99]) by a polyadic least fixed point (μ) operator and a class of non-logical symbols with a finite variability restriction on their interpretations, which classifies these symbols as intermediate between rigid symbols and flexible symbols as known in DC. The μ operator and the new kind of symbols enable straightforward specification of recursion and data manipulation by HDC. The paper contains a completeness theorem about an extension of the proof system for HDC by axioms about μ and symbols of finite variability for a class of simple μHDC formulas. The completeness theorem is proved by the method of local elimination of the extending operator μ, which was earlier used for a similar purpose in [Gue98].

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Dang Van Hung and D. P. Guelev. Completeness and Decidability of a Fragment of Duration Calculus with Iteration. In: P.S. Thiagarajan and R. Yap (eds), Advances in Computing Science, LNCS 1742, Springer-Verlag, 1999, pp. 139–150.

    Chapter  Google Scholar 

  2. Dang Van Hung and Wang Ji. On The Design of Hybrid Control Systems Using Automata Models. In: Chandru, V. and V. Vinay (eds.) LCNS 1180, Foundations of Software Technology and Theoretical Computer Science, 16th Conference, Hyderabad, India, December 1996, Springer, 1996.

    Google Scholar 

  3. Dutertre, B. On First Order Interval Temporal Logic. Report no. CSDTR-94-3 Department of Computer Science, Royal Holloway, University of London, Egham, Surrey TW20 0EX, England, 1995.

    Google Scholar 

  4. Guelev, D. P. Iteration of Simple Formulas in Duration Calculus. Tech. report 141, UNU/IIST, June 1998.

    Google Scholar 

  5. Guelev, D. P. Probabilistic and Temporal Modal Logics, Ph.D. thesis, submitted, January 2000.

    Google Scholar 

  6. Guelev, D. P. A Complete Fragment of Higher-Order Duration μ-Calculus. Tech. Report 195, UNU/IIST, April 2000.

    Google Scholar 

  7. He Jifeng and Xu Qiwen. Advanced Features of DC and Their Applications. Proceedings of the Symposium in Celebration of the Work of C.A.R. Hoare, Oxford, 13-15 September, 1999.

    Google Scholar 

  8. M. R. Hansen and Zhou Chaochen. Semantics and Completeness of Duration Calculus. Real-Time: Theory and Practice, LNCS 600, Springer-Verlag, 1992, pp. 209–225.

    Chapter  Google Scholar 

  9. Kozen, D. Results on the propositional μ-calculus. TCS 27:333–354, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  10. Li Li and He Jifeng. A Denotational Semantics of Timed RSL using Duration Calculus. Proceedings of RTCSA’99, pp. 492–503, IEEE Computer Society Press, 1999.

    Google Scholar 

  11. Mendelson, E. Introduction to Mathematical Logic. Van Nostrand, Princeton, 1964.

    Google Scholar 

  12. Pandya, P. K. Some Extensions to Propositional Mean-Value Calculus. Expressiveness and Decidability. Proceedings of CSL’95, Springer-Verlag, 1995.

    Google Scholar 

  13. Pandya, P. K. and Y Ramakrishna. A Recursive Duration Calculus. Technical Report TCS-95/3, TIFR, Bombay, 1995.

    Google Scholar 

  14. Pandya, P. K, Wang Hanping and Xu Qiwen. Towards a Theory of Sequential Hybrid Programs. Proc. IFIP Working Conference PROCOMET’ 98 D. Gries and W.-P. de Roever (eds.), Chapman & Hall, 1998.

    Google Scholar 

  15. Schneider, G. and Xu Qiwen. Towards a Formal Semantics of Verilog Using Duration Calculus. Proceedings of FTRTFT’98, Anders P. Ravn and Hans Rischel (eds.), LNCS 1486, pp. 282–293, Springer-Verlag, 1998.

    Google Scholar 

  16. Walurkiewicz, I. A Complete Deductive System for the μ-Calculus., Ph.D. Thesis, Warsaw University, 1993.

    Google Scholar 

  17. Zhou Chaochen, D. P. Guelev and Zhan Naijun. A Higher-Order Duration Calculus. Proceedings of the Symposium in Celebration of the Work of C.A.R. Hoare, Oxford, 1999.

    Google Scholar 

  18. Zhou Chaochen and M. Hansen Chopping a Point. Proceedings of BCS FACS 7th Refinement Workshop, Electronic Workshop in Computer Sciences, Springer-Verlag, 1996.

    Google Scholar 

  19. Zhu Huibiao and He Jifeng. A DC-based Semantics for Verilog Tech. Report 183, UNU/IIST, January 2000.

    Google Scholar 

  20. Zhou Chaochen, C. A. R. Hoare and A. P. Ravn. A Calculus of Durations. Information Processing Letters, 40(5), pp. 269–276, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  21. Zhan Naijun. Completeness of Higher-Order Duration Calculus. Research Report 175, UNU/IIST, August 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. International Institute for Software Technology of the United Nations University (UNU/IIST), Macau, P.O.Box 3058

    Dimitar P. Guelev

  2. Institute of Mathematics and Informatics Bulgarian Academy of Sciences Bl. 8, Akad G. Bonchev blvd., Sofia

    Dimitar P. Guelev

Authors
  1. Dimitar P. Guelev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, Delhi, Hauz Khas, 110016, New Delhi, India

    Sanjiv Kapoor  & Sanjiva Prasad  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guelev, D.P. (2000). A Complete Fragment of Higher-Order Duration μ-Calculus. In: Kapoor, S., Prasad, S. (eds) FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2000. Lecture Notes in Computer Science, vol 1974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44450-5_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-44450-5_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41413-1

  • Online ISBN: 978-3-540-44450-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation