Decision Procedures For Inductive Boolean . . . (2003)
| Venue: | THEORETICAL COMPUTER SCIENCE |
BibTeX
@MISC{Ayari03decisionprocedures,
author = {Abdelwaheb Ayari and David Basin and Felix Klaedtke},
title = {Decision Procedures For Inductive Boolean . . . },
year = {2003}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We show how alternating automata provide decision procedures for theequalVofinductivel de#nedBoolfW functions and presentappltfqqVqW to reasoning about parameterizedfamilet of circuits. We use alWzzzEf7q word automata toformalEf familE oflf##WJq structured circuits and alfzzzIPf7 tree automata toformal#f famil# of tree structured circuits. We providecomplfzJW bounds for deciding theequal-E of function (or circuit) familt) and show how our decision procedures can beimpl##f7qI using BDDs. In comparison to previous work, our approach issimpl#f has bettercomplW--J bounds, and, in the case of tree-structured families is more general.
