TY - GEN
T1 - The safety simple subset
AU - Ben-David, Shoham
AU - Fisman, Dana
AU - Ruah, Sitvanit
PY - 2006/7/7
Y1 - 2006/7/7
N2 - Regular-LTL (RLTL), extends LTL with regular expressions, and it is the core of the IEEE standard temporal logic PSL. Safety formulas of RLTL, as well as of other temporal logics, are easier to verify than other formulas. This is because verification of safety formulas can be reduced to invariance checking using an auxiliary automaton recognizing violating prefixes. In this paper we define a special subset of safety RLTL formulas, called RLTL LV, for which the automaton built is linear in the size of the formula. We then give two procedures for constructing such an automaton, the first provides a translation into a regular expression of linear size, while the second constructs the automaton directly from the given formula. We have derived the definition of RLTL LV by combining several results in the literature, and we devote a major part of the paper to reviewing these results and exploring the involved relationships.
AB - Regular-LTL (RLTL), extends LTL with regular expressions, and it is the core of the IEEE standard temporal logic PSL. Safety formulas of RLTL, as well as of other temporal logics, are easier to verify than other formulas. This is because verification of safety formulas can be reduced to invariance checking using an auxiliary automaton recognizing violating prefixes. In this paper we define a special subset of safety RLTL formulas, called RLTL LV, for which the automaton built is linear in the size of the formula. We then give two procedures for constructing such an automaton, the first provides a translation into a regular expression of linear size, while the second constructs the automaton directly from the given formula. We have derived the definition of RLTL LV by combining several results in the literature, and we devote a major part of the paper to reviewing these results and exploring the involved relationships.
UR - http://www.scopus.com/inward/record.url?scp=33745580268&partnerID=8YFLogxK
U2 - 10.1007/11678779_2
DO - 10.1007/11678779_2
M3 - Conference contribution
AN - SCOPUS:33745580268
SN - 3540326049
SN - 9783540326045
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 14
EP - 29
BT - Hardware and Software, Verification and Testing - First International Haifa Verification Conference, Revised Selected Papers
T2 - 1st International Haifa Verification Conference on Hardware and Software, Verification and Testing
Y2 - 13 November 2005 through 16 November 2005
ER -