The safety simple subset

Shoham Ben-David, Dana Fisman, Sitvanit Ruah

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

10 Scopus citations


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.

Original languageEnglish
Title of host publicationHardware and Software, Verification and Testing - First International Haifa Verification Conference, Revised Selected Papers
Number of pages16
StatePublished - 7 Jul 2006
Externally publishedYes
Event1st International Haifa Verification Conference on Hardware and Software, Verification and Testing - Haifa, Israel
Duration: 13 Nov 200516 Nov 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3875 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference1st International Haifa Verification Conference on Hardware and Software, Verification and Testing

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'The safety simple subset'. Together they form a unique fingerprint.

Cite this