First order Büchi automata and their application to verification of LTL specifications

Büchi automata have applications in formal verification, e.g., in deciding whether a system satisfies given properties. We provide a definition of Büchi automata based on first order logics for representing infinite state systems, and investigate rules for proving emptiness and non-emptiness of such...

Full description

Saved in:
Bibliographic Details
Published inJournal of logical and algebraic methods in programming Vol. 142; p. 101021
Main Author Zhang, Wenhui
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.01.2025
Subjects
Büchi automata
Concurrent systems
Deductive verification
Linear temporal logics
Logical methods
Verification condition generation
Weak well founded sets
Deductive verification
Weak well founded sets
Concurrent systems
Logical methods
Büchi automata
Linear temporal logics
Verification condition generation
Online AccessGet full text

Cover

More Information
Summary:Büchi automata have applications in formal verification, e.g., in deciding whether a system satisfies given properties. We provide a definition of Büchi automata based on first order logics for representing infinite state systems, and investigate rules for proving emptiness and non-emptiness of such automata. We then apply these rules to solve the problem of verifying correctness of concurrent transition systems, leading to a relatively complete approach for proving and disproving LTL (Linear Temporal Logic) specifications. This approach overcomes weaknesses of existing work based on well-founded sets in the sense that the relative completeness does not depend on additional specification for ensuring progress of non-stuttering transitions. On the practical aspect, we provide a set of examples with an experimental verification condition generation tool to demonstrate the potential applicability of the approach for the verification of concurrent systems.
ISSN:2352-2208
DOI:10.1016/j.jlamp.2024.101021