Operational Semantics of Framed Temporal Logic Programs

  • Xiaoxiao Yang
  • Zhenhua Duan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4362)


This paper investigates the operational semantics of framed temporal logic programs. To this end, a framed temporal logic programming language called Framed Tempura is employed. The evaluation rules for both the arithmetic and boolean expressions are defined. The semantic equivalence rules for the reduction of a program within a state is formalized. Furthermore, the congruence and transition rules between configurations for the reduction of programs are also specified. Thus, the executable behavior of framed programs can be captured in an operational way. In addition, the consistency of the operational semantics and the minimal model semantics based on model theory is proved.


Minimal Model Temporal Logic Logic Programming Operational Semantic Transition Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Manna, Z., Pnueli, A.: Verification of Concurrent Programs: The Temporal Framework. In: Boyer, R.S., Moore, J.S. (eds.) The Correctness Problem in Computer Science, pp. 215–273. Academic Press, New York (1981)Google Scholar
  2. 2.
    Manna, Z., Pnueli, A.: Temporal Logic of Reactive and Concurrent Systems. Springer, Heidelberg (1992)Google Scholar
  3. 3.
    Plotkin, G.D.: A Structual Approach to Operational Semantics. DAIMI FN-19, Computer Science Dept. Aarhus Univ. Denmark (1981)Google Scholar
  4. 4.
    Duan, Z., Koutny, M., Holt, C.: Projection in Temporal Logic Programming. In: Pfenning, F. (ed.) LPAR 1994. LNCS, vol. 822, pp. 333–344. Springer, Heidelberg (1994)Google Scholar
  5. 5.
    Duan, Z.: An Extended Interval Temporal Logic and A Framing Technique for Temporal Logic Programming. Ph.D Thesis (Technical Report No.556), University of Newcastle upon Tyne (May 1996)Google Scholar
  6. 6.
    Duan, Z., Koutny, M.: A Framed Temporal Logic Programming Language. Journal of Computer Science and Technology 19, 341–351 (2004)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Duan, Z., Yang, X., Koutny, M.: Semantics of Framed Temporal Logic Programs. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 356–370. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. 8.
    Moszkowski, B.: Executing Temporal Logic Programs. Cambridge University Press, Cambridge (1986)Google Scholar
  9. 9.
    Hale, R.: Temporal Logic Programming. In: Galton, A. (ed.) Temporal Logics and Their Applications, pp. 91–119. Academic Press, London (1987)Google Scholar
  10. 10.
    Tang, C.S.: Toward a Unified Logic Basis for Programming Languages, pp. 425–429. Elsevier science Publishers, Amsterdam (1983)Google Scholar
  11. 11.
    Fujita, M., Kono, S., Tanaka, H., Moto-oka, T.: Tokio: Logic Programming Language Based on Temporal Logic and Its Compilation to PROLOG. In: Shapiro, E. (ed.) ICLP 1986. LNCS, vol. 225, pp. 695–709. Springer, Heidelberg (1986)Google Scholar
  12. 12.
    Lamport, L.: The Temporal Logic of Actions. ACM Transactions on Programming Languages and Systems 16(3), 872–923 (1994)CrossRefGoogle Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Xiaoxiao Yang
    • 1
  • Zhenhua Duan
    • 1
  1. 1.Institute of Computing Theory and Technology, Xidian University, Xi’an, 710071P.R. China

Personalised recommendations