Skip to main content
SpringerLink
Log in
Book cover

International Conference on Formal Engineering Methods

ICFEM 2004: Formal Methods and Software Engineering pp 464–482Cite as

From Durational Specifications to TLA Designs of Timed Automata

  • Conference paper

  • 690 Accesses

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

Abstract

Different temporal logics tend to emphasise different aspects of a hybrid system. In this paper, we study the predicative interpretation of Duration Calculus (DC) and Temporal Logic of Actions (TLA) and the link between them. A notation called generic composition is used to simplify the manipulation of predicates. The modalities of possibility and necessity become generic composition and its inverse of converse respectively. The transformation between different temporal logics is also characterised as such modalities. The formalism provides a framework in which human experience about hybrid system development can be formalised as refinement laws. A high-level durational specification can be decomposed to two durational specifications driven by an automaton. In such a stepwise design process, durational features are reduced while automaton features increase gradually. The application of the technique is demonstrated in the case study of the gas burner problem.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Back, R., von Wright, J.: Refinement Calculus: A Systematic Introduction. In: Graduate Texts in Computer Science. Springer, Heidelberg (1998)

    Google Scholar 

  2. Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

  3. Chen, Y.: Generic composition. Formal Aspects of Computing 14(2), 108–122 (2002)

    Article  MATH  Google Scholar 

  4. Chen, Y.: Cumulative computing. In: 19th Conference on the Mathematical Foundations of Programming Semantics. Electronic Notes in Theoretical Computer Science, vol. 38. Elsevier, Amsterdam (2004)

    Google Scholar 

  5. Chen, Y.F., Liu, Z.: Integrating temporal logics. In: Boiten, E.A., Derrick, J., Smith, G.P. (eds.) IFM 2004. LNCS, vol. 2999, pp. 402–420. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Hehner, E.C.R.: Predicative programming I, II. Communications of ACM 27(2), 134–151 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  7. Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)

    MATH  Google Scholar 

  8. Hoare, C.A.R., He, J.: Unifying Theories of Programming. Prentice-Hall, Englewood Cliffs (1998)

    Google Scholar 

  9. Kripke, S.: Semantical considerations on modal logic. Acta Philosophica Fennica 16, 83–94 (1963)

    MATH  MathSciNet  Google Scholar 

  10. Lamport, L.: Hybrid systems in TLA+. In: Grossman, R.L., Ravn, A.P., Rischel, H., Nerode, A. (eds.) HS 1991 and HS 1992. LNCS, vol. 736, pp. 77–102. Springer, Heidelberg (1993)

    Google Scholar 

  11. Lamport, L.: A temporal logic of actions. ACM Transctions on Programming Languages and Systems 16(3), 872–923 (1994)

    Article  Google Scholar 

  12. Liu, Z., Ravn, A.P., Li, X.: Unifying proof methodologies of duration calculus and linear temporal logic. Technical Report 1999/14, Department of Maths and Computer Science. University of Leicester (July 1999 ), Formal Aspects of Computing, 19 pages (to appear)

    Google Scholar 

  13. Morgan, C.C.: The cuppest capjunctive capping, and Galois. In: Roscoe, A.W. (ed.) A Classical Mind, pp. 317–332. Prentice-Hall, Englewood Cliffs (1994)

    Google Scholar 

  14. Pnueli, A.: The temporal semantics of concurrent programs. Theoretical Computer Science 13, 45–60 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  15. Pnueli, A., Harel, E.: Applications of temporal logic to the specification of real-time systems. In: Joseph, M. (ed.) FTRTFT 1988. LNCS, vol. 331, pp. 84–98. Springer, Heidelberg (1988)

    Google Scholar 

  16. Ravn, A.P., Rischel, H., Hansen, K.M.: Specifying and verifying requirements of real-time systems. IEEE Transactions on Software Engineering 19(1), 41–55 (1993)

    Article  Google Scholar 

  17. Schenke, M., Olderog, E.: Transformational design of real-time systems part I: From requirements to program specifications. Acta Informatica 36(1), 1–65 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  18. Shalqvist, H.: Completeness and correspondence in the first and second order semantics for modal logic. In: Proceedings of the third Scandinavian logic symposium, pp. 110–143. North-Holland, Amsterdam (1975)

    Chapter  Google Scholar 

  19. von Karger, B.: A calculational approach to reactive systems. Science of Computer Programming 37, 139–161 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  20. Zhou, C., Hoare, C.A.R., Ravn, A.P.: A calculus of durations. Information Processing Letters 40(5), 269–276 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  21. Zhou, C.C., Ravn, A.P., Hansen, M.R.: An extended duration calculus for hybrid real-time 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 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Leicester, Leicester, LE1 7RH, UK

    Yifeng Chen & Zhiming Liu

Authors
  1. Yifeng Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhiming Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing, Queen’s University, K7L 3N6, Kingston, ON, Canada

    Jim Davies

  2. Microsoft Research, One Microsoft Way, WA 98052, Redmond, USA

    Wolfram Schulte

  3. Microsoft Research, WA 98052, Redmond, USA

    Mike Barnett

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, Y., Liu, Z. (2004). From Durational Specifications to TLA Designs of Timed Automata. In: Davies, J., Schulte, W., Barnett, M. (eds) Formal Methods and Software Engineering. ICFEM 2004. Lecture Notes in Computer Science, vol 3308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30482-1_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30482-1_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23841-6

  • Online ISBN: 978-3-540-30482-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation