Journal of Computer Science and Technology

, Volume 19, Issue 3, pp 341–351 | Cite as

A framed temporal logic programming language

  • Zhen-Hua Duan
  • Maciej Koutny
Formal Methods


We discuss the projection temporal logic (PTL), based on a primitive projection operator,prj. A framing technique is also presented, using which a synchronization operator,await, is defined within the underlying logic. A framed temporal logic programming language (FTLL) is presented. To illustrate how to use both the language and framing technique, some examples are given.


temporal logic temporal logic programming frame projection concurrency 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Barringer H, Fisher M, Gabbay Det al. METATEM: A framework for programming in temporal logic. InProc. REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formulisms, Correctness, Mook, Netherlands,Lecture Notes in Computer Science 430, Springer-Verlag, 1989, pp. 94–129.Google Scholar
  2. [2]
    Fujita M, Kono S, Tanaka Het al. Tokio: Logic programming language based on temporal logic and its compilation to PROLOG.Third International Conference on Logic Programming, London, Lecture Notes in Computer Science 225, Springer-Verlag, July, 1986, pp. 695–709.Google Scholar
  3. [3]
    Lamport L. The temporal logic of actions,ACM TOPLAS, 1994, 16: 872–923.CrossRefGoogle Scholar
  4. [4]
    Moszkowski B. Executing Temporal Logic Programs. Cambridge University Press, Cambridge, 1986.Google Scholar
  5. [5]
    Tang C S. Toward a unified logic basis for programming languages. InProc. IFIP Congress 83, Amsterdam, Elsevier Science Publishers B.V. (North-Holland), 1983, pp. 425–429.Google Scholar
  6. [6]
    Tang C S. A temporal logic language oriented toward software engineering — Introduction to XYZ system (I).Chinese Journal of Advanced Software Research, 1994, 1(1): 1–27.Google Scholar
  7. [7]
    Duan Z, Koutny M, Holt C. Projection in temporal logic programming. In:Proc. 5th International Conference on Logic Programming and Automated Reasoning, Lecture Notes in Computer Science 822, Springer, 1994, pp. 333–344.Google Scholar
  8. [8]
    Milner R. Communication and Concurrency. Prentice Hall, London, 1989.zbMATHGoogle Scholar
  9. [9]
    Hoare C A R. Communicating Sequential Processes. Prentice Hall International, London, 1985.zbMATHGoogle Scholar
  10. [10]
    Manna Z, Pnueli A. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag, 1992.Google Scholar
  11. [11]
    Duan Z. An extended interval temporal logic and a framing technique for temporal logic programming [Dissertation]. Technical Report 556, Department of Computing Science, University of Newcastle upon Tyne, September, 1996.Google Scholar
  12. [12]
    McDermott D. Non-monotonic logic I.Artificial Intelligence, 1980, 13(1/2): 41–72.zbMATHCrossRefMathSciNetGoogle Scholar
  13. [13]
    McCarthy J. Circumscription — A form of non-monotonic reasoning.Artificial Intelligence, 1980, 13(1/2): 27–39.zbMATHCrossRefMathSciNetGoogle Scholar
  14. [14]
    Reiter R. A logic for default reasoning.Artificial Intelligence, 1980, 13(1/2): 81–132.zbMATHCrossRefMathSciNetGoogle Scholar
  15. [15]
    Rosner R, Pnueli A. A. choppy logic. InProc. First Annual IEEE Symposium on Logic in Computer Science, 1986, pp. 306–314.Google Scholar
  16. [16]
    Kröger F. Temporal Logic of Programs. Springer-Verlag, 1987.Google Scholar
  17. [17]
    Moszkowski B. Some very compositional temporal properties. InProgramming Concepts, Methods and Calculi. Olderog E R (Ed.) IFIP Transactions A-56, pp. 307–326. IFIP, Elsevier Science B.V., North-Holland, 1994.Google Scholar
  18. [18]
    Dijkstra E W. Guarded commands, nondeterminacy, and formal derivation of programs.Communication of the ACM, 1975, 18(8): 453–457.zbMATHCrossRefMathSciNetGoogle Scholar
  19. [19]
    Duan Z. An algorithm of constructing even order magic square.Chinese Journal of Micro-Electronics and Computer, 1990, 4: 13–16.Google Scholar
  20. [20]
    Ben-Ari M. Principles of Concurrent Programming. Prentice-Hall International, London, England, New Jersey, 1982.zbMATHGoogle Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 2004

Authors and Affiliations

  1. 1.Xidian UniversityXi'anP. R. China
  2. 2.University of Newcastle upon TyneNewcastle upon TyneU.K.
  3. 3.Laboratory of Computer ScienceISCASBeijingP.R. China

Personalised recommendations