Time constraints with temporal logic programming

  • Authors:
  • Meng Han;Zhenhua Duan;Xiaobing Wang

  • Affiliations:
  • Institute of Computing Theory and Technology, and ISN Laboratory, Xidian University, Xi'an, P.R. China;Institute of Computing Theory and Technology, and ISN Laboratory, Xidian University, Xi'an, P.R. China;Institute of Computing Theory and Technology, and ISN Laboratory, Xidian University, Xi'an, P.R. China

  • Venue:
  • ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents an approach for the real-time extension of Projection Temporal Logic (PTL) and the corresponding programming language, Timed Modeling, Simulation and Verification Language (TMSVL). To this end, quantitative temporal constraints are employed to limit the time duration bounded on a formula or a program. First, the syntax and semantics of TPTL formulas are defined and some logic laws are given. Then, the corresponding executable programming language TMSVL is presented. Moreover, the operational semantics of TMSVL is formalized. Finally, an example of modeling and verification is given to show how TMSVL works.