Decision procedures for inductive Boolean functions based on alternating automata

Authors:
Abdelwaheb Ayari;David Basin;Felix Klaedtke
Affiliations:
Institut für Informatik, Albert-Ludwigs-Universität Freiburg, Georges-Köhler-Allee 52, D-79110 Freiburg, Germany;Institut für Informatik, Albert-Ludwigs-Universität Freiburg, Georges-Köhler-Allee 52, D-79110 Freiburg, Germany;Institut für Informatik, Albert-Ludwigs-Universität Freiburg, Georges-Köhler-Allee 52, D-79110 Freiburg, Germany
Venue:
Theoretical Computer Science
Year:
2003

Citing 15
Cited 0

Alternating tree automata

Theoretical Computer Science
Introduction to algorithms

Introduction to algorithms
A note on the space complexity of some decision problems for finite automata

Information Processing Letters
Completeness results concerning systolic tree automata and E0L languages

Information Processing Letters
An automata-theoretic approach to linear temporal logic

Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Representation and symbolic manipulation of linearly inductive Boolean functions

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Tree languages

Handbook of formal languages, vol. 3
Automata based symbolic reasoning in hardware verification

Formal Methods in System Design
Alternation

Journal of the ACM (JACM)
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Tradeoffs in Canonical Sequential Function Representations

ICCS '94 Proceedings of the1994 IEEE International Conference on Computer Design: VLSI in Computer & Processors
Mona: Monadic Second-Order Logic in Practice

TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Parametric Circuit Representation Using Inductive Boolean Functions

CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Mona & Fido: The Logic-Automaton Connection in Practice

CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Structural and Behavioral Modeling with Monadic Logics

ISMVL '99 Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic

Quantified Score

Hi-index	5.23

Visualization

Abstract

We show how alternating automata provide decision procedures for the equality of inductively defined Boolean functions and present applications to reasoning about parameterized families of circuits. We use alternating word automata to formalize families of linearly structured circuits and alternating tree automata to formalize families of tree structured circuits. We provide complexity bounds for deciding the equality of function (or circuit) families and show how our decision procedures can be implemented using BDDs. In comparison to previous work, our approach is simpler, has better complexity bounds, and, in the case of tree-structured families, is more general.