Skip to main content
Conference Proceedings

Automata as abstractions

Lecture Notes in Computer Science (2005) 3385 216-232
DOI: 10.1007/978-3-540-30579-8_15
25Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Dams, D., & Namjoshi, K. S. (2005). Automata as abstractions. In Lecture Notes in Computer Science (Vol. 3385, pp. 216–232). Springer Verlag. https://doi.org/10.1007/978-3-540-30579-8_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free