Abstract
We show how alternating automata provide decision procedures for the equivalence of inductively defined Boolean functions that are useful for 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 and show how our decision procedures can be implemented using BDDs. In comparison to previous work, our approach is simpler, yields better complexity bounds, and, in the case of tree structured families, is more general.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Basin, D., Klarlund, N.: Automata based symbolic reasoning in hardware verification. The Journal of Formal Methods in Systems Design 13(3), 255–288 (1998)
Brzozowski, J., Leiss, E.: On equations for regular languages, finite automata, and sequential networks. TCS 10(1), 19–35 (1980)
Chandra, A., Kozen, D., Stockmeyer, L.: Alternation. Journal of the ACM 28(1), 114–133 (1981)
Gécseg, F., Steinby, M.: Tree Automata. Akadémiai Kiadó, Budapest (1984)
Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages. Beyond Words, ch. 4, vol. 3, pp. 215–267. Springer, Heidelberg (1997)
Gupta, A.: Inductive Boolean Function Manipulation: A Hardware Verification Methodology for Automatic Induction. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh (1994)
Gupta, A., Fisher, A.: Parametric circuit representation using inductive boolean functions. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 15–28. Springer, Heidelberg (1993)
Gupta, A., Fisher, A.: Representation and symbolic manipulation of linearly inductive boolean functions. In: Proc. of the IEEE Internation Conference on Computer-Aided Design, pp. 192–199. IEEE Computer Society, Los Alamitos (1993)
Gupta, A., Fisher, A.: Tradeoffs in canonical sequential representations. In: Proc. of the International Conference on Computer Design, pp. 111–116 (1994)
Henriksen, J., Jensen, J., Jorgensen, M., Klarlund, N., Paige, B., Rauhe, T., Sandholm, A.: Mona: Monadic second-order logic in practice. In: Brinksma, E., Steffen, B., Cleaveland, W.R., Larsen, K.G., Margaria, T. (eds.) TACAS 1995. LNCS, vol. 1019, pp. 89–110. Springer, Heidelberg (1995)
Hopcroft, J., Ullman, J.: Formal Languages and their Relation to Automata. Addison-Wesley, Reading (1969)
Jiang, T., Ravikumar, B.: A note on the space complexity of some decision problems for finite automata. IPL 40(1), 25–31 (1991)
Klaedtke, F.: Induktive boolesche Funktionen, endliche Automaten und monadische Logik zweiter Stufe. Master’s thesis, Institut für Informatik, Albert-Ludwigs- Universität, Freiburg i. Br. (2000) (in German)
Klarlund, N.: Mona & Fido: The logic-automaton connection in practice. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol. 1414, pp. 311–326. Springer, Heidelberg (1998)
Slutzki, G.: Alternating tree automata. TCS 41(2-3), 305–318 (1985)
Somenzi, F.: CUDD: CU Decision Diagram Package, Release 2.3.0. Department of Electrical and Computer Engineering, University of Colorado at Boulder (1998)
Vardi, M.: An automata-theoretic approach to linear temporal logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol. 1043, pp. 238–266. Springer, Heidelberg (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ayari, A., Basin, D., Klaedtke, F. (2000). Decision Procedures for Inductive Boolean Functions Based on Alternating Automata. In: Emerson, E.A., Sistla, A.P. (eds) Computer Aided Verification. CAV 2000. Lecture Notes in Computer Science, vol 1855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722167_16
Download citation
DOI: https://doi.org/10.1007/10722167_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67770-3
Online ISBN: 978-3-540-45047-4
eBook Packages: Springer Book Archive