Automata as abstractions

We propose the use of tree automata as abstractions in the verification of branching time properties, and show several benefits. In this setting, soundness and completeness are trivial. It unifies the abundance of frameworks in the literature, and clarifies the role of concepts therein in terms of t...

Full description

Saved in:
Bibliographic Details
Published inLecture notes in computer science pp. 216 - 232
Main Authors Dams, Dennis, Namjoshi, Kedar S.
Format Conference Proceeding Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer-Verlag 01.01.2005
Springer Berlin Heidelberg
Springer
SeriesACM Conferences
Subjects
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Software
Software engineering
Branching
Automata theory
Model checking
Abstract interpretation
Abstraction
Modeling
Tree automaton
Program verification
Online AccessGet full text

Cover

More Information
Summary:We propose the use of tree automata as abstractions in the verification of branching time properties, and show several benefits. In this setting, soundness and completeness are trivial. It unifies the abundance of frameworks in the literature, and clarifies the role of concepts therein in terms of the well-studied field of automata theory. Moreover, using automata as models simplifies and generalizes results on maximal model theorems.
ISBN:354024297X
9783540242970
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-30579-8_15