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. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Han, M., Duan, Z., & Wang, X. (2012). Time constraints with temporal logic programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7635 LNCS, pp. 266–282). https://doi.org/10.1007/978-3-642-34281-3_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
