On the construction of fine automata for safety properties

Orna Kupferman*, Robby Lampert

*Corresponding author for this work

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

16 Scopus citations

Abstract

Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region. Each safety property ^ can be associated with a set of bad prefixes: a set of finite computations such that an infinite computation violates ψ iff it has a prefix in the set. By translating a safety property to an automaton for its set of bad prefixes, verification can be reduced to reasoning about finite words: a system is correct if none of its computations has a bad prefix. Checking the latter circumvents the need to reason about cycles and simplifies significantly methods like symbolic fixed-point based verification, bounded model checking, and more. A drawback of the translation lies in the size of the automata: while the translation of a safety LTL formula ψ to a nondeterministic Büchi automaton is exponential, its translation to a tight bad-prefix automaton -one that accepts all the bad prefixes of ψ, is doubly exponential. Kupferman and Vardi showed that for the purpose of verification, one can replace the tight automaton by a fine automaton - one that accepts at least one bad prefix of each infinite computation that violates ψ. They also showed that for many safety LTL formulas, a fine automaton has the same structure as the Büchi automaton for the formula. The problem of constructing fine automata for general safety LTL formulas was left open. In this paper we solve this problem and show that while a fine automaton cannot, in general, have the same structure as the Büchi automaton for the formula, the size of a fine automaton is still only exponential in the length of the formula.

Original languageAmerican English
Title of host publicationAutomated Technology for Verification and Analysis - 4th International Symposium, ATVA 2006, Proceedings
PublisherSpringer Verlag
Pages110-124
Number of pages15
ISBN (Print)3540472371, 9783540472377
DOIs
StatePublished - 2006
Event4th International Symposium on Automated Technology for Verification and Analysis, ATVA 2006 - Beijing, China
Duration: 23 Oct 200626 Oct 2006

Publication series

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

Conference

Conference4th International Symposium on Automated Technology for Verification and Analysis, ATVA 2006
Country/TerritoryChina
CityBeijing
Period23/10/0626/10/06

Fingerprint

Dive into the research topics of 'On the construction of fine automata for safety properties'. Together they form a unique fingerprint.

Cite this