Skip to main content
SpringerLink
Log in

A framed temporal logic programming language

  • Formal Methods
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

An Erratum to this article was published on 01 December 2004

Abstract

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.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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.

  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.

  3. Lamport L. The temporal logic of actions,ACM TOPLAS, 1994, 16: 872–923.

    Article  Google Scholar 

  4. Moszkowski B. Executing Temporal Logic Programs. Cambridge University Press, Cambridge, 1986.

    Google Scholar 

  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. 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. 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.

  8. Milner R. Communication and Concurrency. Prentice Hall, London, 1989.

    MATH  Google Scholar 

  9. Hoare C A R. Communicating Sequential Processes. Prentice Hall International, London, 1985.

    MATH  Google Scholar 

  10. Manna Z, Pnueli A. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag, 1992.

  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.

  12. McDermott D. Non-monotonic logic I.Artificial Intelligence, 1980, 13(1/2): 41–72.

    Article  MATH  MathSciNet  Google Scholar 

  13. McCarthy J. Circumscription — A form of non-monotonic reasoning.Artificial Intelligence, 1980, 13(1/2): 27–39.

    Article  MATH  MathSciNet  Google Scholar 

  14. Reiter R. A logic for default reasoning.Artificial Intelligence, 1980, 13(1/2): 81–132.

    Article  MATH  MathSciNet  Google Scholar 

  15. Rosner R, Pnueli A. A. choppy logic. InProc. First Annual IEEE Symposium on Logic in Computer Science, 1986, pp. 306–314.

  16. Kröger F. Temporal Logic of Programs. Springer-Verlag, 1987.

  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. Dijkstra E W. Guarded commands, nondeterminacy, and formal derivation of programs.Communication of the ACM, 1975, 18(8): 453–457.

    Article  MATH  MathSciNet  Google Scholar 

  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. Ben-Ari M. Principles of Concurrent Programming. Prentice-Hall International, London, England, New Jersey, 1982.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Xidian University, 710071, Xi'an, P. R. China

    Zhen-Hua Duan

  2. University of Newcastle upon Tyne, NE1 7RU, Newcastle upon Tyne, U.K.

    Maciej Koutny

  3. Laboratory of Computer Science, ISCAS, 100080, Beijing, P.R. China

    Zhen-Hua Duan

Authors
  1. Zhen-Hua Duan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maciej Koutny
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhen-Hua Duan.

Additional information

This research is supported by the National Natural Science Foundation of China under Grant No. 60373103, the SRFDP Grant 20030701015 and the Grant SYSKF0407 from Lab. Computer Science, ISCAS.

Zhen-Hua Duan obtained his B.Sc. (1982) and M.Sc. (1987) degrees from Northwest University (China), and Ph.D. (1996) degree from University of Newcastle upon Tyne (UK). He became a lecturer in 1984 and was promoted to a professor in 1995 at Northwest University. In 1989 he joined Computer Science Department at University of Sheffield (UK) to work as a Visiting Scholar. From 1990 to 1997, he worked as a research associate in three universities inciluding University of Ulster (UK), University of Newcastle upon Tyne and University of Sheffield. From 1997 to 2002, he worked as a (experienced/senior) software engineer in three companies including Chorleys, Airsys ATM, and Altera in UK. In 2003 he joined Xidian University (China) as a professor of computer science. His research interests concentrate on concurrent, real-time, and hybrid systems, including modeling, simulation, and verification of such systems. In addition, he is interested in temporal logic programming, formal languages and automata, and formal semantics. He is also interested in design and development of high-tech software.

Maciej Koutny obtained his M.Sc. (1982) and Ph.D. degrees (1984) from the Warsaw University of Technology. In 1985 he joined the Computing Laboratory of the University of Newcastle upon Tyne to work as a Research Associate. In 1986 he became a Lecturer in Computing Science at Newcastle, and in 1994 was promoted to an established Readership at Newcastle. In 2000 he became a professor of computing science. His research interests focus on the theory of distributed and concurrent systems, including both theoretical aspects of their semantics and application of formal techniques to the modelling and verification of such systems; in particular, model checking based on net unfoldings. Recently, he has been working on the development of a formal model combining Petri nets and process algebras. He has also investigated noninterleaving semantics of priority systems, and the relationship between temporal logic and process algebras. He is a member of the Steering Committee of the International Conference on Applications and Theory of Petri nets (http://www.daimi.au.dk/PetriNets/).

An erratum to this article is available at http://dx.doi.org/10.1007/BF02973464.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Duan, ZH., Koutny, M. A framed temporal logic programming language. J. Comput. Sci. & Technol. 19, 341–351 (2004). https://doi.org/10.1007/BF02944904

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02944904

Keywords

Search

Navigation