Affiliations: [a] College of Mathematics and Information Science, Shaanxi Normal University, South Chang’an Road, Yanta District, Xi’an, P.R. China | [b] College of Computer Science, Shaanxi Normal University, West Chang’an Avenue, Chang’an District, Xi’an, P.R. China
Correspondence:
[*]
Corresponding author. Hui-Xian Shi, College of Mathematics and Information Science, Shaanxi Normal University, No. 199, South Chang’an Road, Yanta District, Xi’an, P.R. China. Tel.: +86 15829631605; Fax: +86 29 85310232; E-mail: [email protected]
Note: [1] This paper was supported by the National Natural Science Foundation of China (11171200, 11271237, 11501343, 11426148) and the Fundamental Research Funds for the Central Universities (GK201402006).
Abstract: In the present paper, the concepts of characters as well as the least characters for LTL (Linear Temporal Logic) formulae are introduced. It is pointed out that those LTL formulae with characters can always be checked within finite steps during model checking even in some cases when the underlying transition system contains infinite states. What is more, the class of LTL formulae with characters can be characterized by full LTLn, the bounded case for LTL. Meanwhile, two types of temporal normal form for LTL formulae are proposed. A necessary and sufficient condition is given in which an LTL formula has an equivalent formula in temporal normal form.
Keywords: Linear Temporal Logic, transition system, character, temporal normal form
