Abstract
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.
This research is supported by the NSFC Grant No. 60373103 and 60433010, and the SRFDP Grant 20030701015.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Manna, Z., Pnueli, A.: Temporal Logic of Reactive and Concurrent Systems. Springer, Heidelberg (1992)
Plotkin, G.D.: A Structual Approach to Operational Semantics. DAIMI FN-19, Computer Science Dept. Aarhus Univ. Denmark (1981)
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)
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)
Duan, Z., Koutny, M.: A Framed Temporal Logic Programming Language. Journal of Computer Science and Technology 19, 341–351 (2004)
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)
Moszkowski, B.: Executing Temporal Logic Programs. Cambridge University Press, Cambridge (1986)
Hale, R.: Temporal Logic Programming. In: Galton, A. (ed.) Temporal Logics and Their Applications, pp. 91–119. Academic Press, London (1987)
Tang, C.S.: Toward a Unified Logic Basis for Programming Languages, pp. 425–429. Elsevier science Publishers, Amsterdam (1983)
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)
Lamport, L.: The Temporal Logic of Actions. ACM Transactions on Programming Languages and Systems 16(3), 872–923 (1994)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Yang, X., Duan, Z. (2007). Operational Semantics of Framed Temporal Logic Programs. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plášil, F. (eds) SOFSEM 2007: Theory and Practice of Computer Science. SOFSEM 2007. Lecture Notes in Computer Science, vol 4362. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69507-3_49
Download citation
DOI: https://doi.org/10.1007/978-3-540-69507-3_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69506-6
Online ISBN: 978-3-540-69507-3
eBook Packages: Computer ScienceComputer Science (R0)