Skip to main content
SpringerLink
Log in

The Software Package BALM

  • Chapter
  • First Online:
The Unknown Component Problem

  • 539 Accesses

Abstract

Finite automata and their languages are well-studied topics since the early development of computation theory. Traditional implementations of automata manipulations are based on explicit state representation, and are limited to automata with a few thousand states. The manipulation of automata became more practical with the advent of efficient symbolic techniques based on binary decision diagrams (BDDs), satisfiability (SAT) solvers and AND-INVERTER graphs (AIGs).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Such a node generates, for a given input, a randomly selected output value from a specified subset of output values.

  2. 2.

    Lines introducing mv variables like.mv SF, SP 32 st0 st1... st31 stand for the full list of symbolic names of the values of the mv variables, e.g.,.mv SF, SP 32 st0 st1 st2 st3 st4 st5 st6 st7 st8 st9 st10 st11 st12 st13 st14 st15 st16 st17 st18 st19 st20 st21 st22 st23 st24 st25 st26 st27 st28 st29 st39 st31.

  3. 3.

    Notice that technically the AUT format is just a special case of the BLIF-MV format.

  4. 4.

    Precisely, the initial sequential circuits F and S yield deterministic FSMs whose automata define the language equation for which we look for a solution that is an FSM automaton, i..e., a prefix-closed input-progressive automaton.

  5. 5.

    Two caveats about using support:

    1. 1.

      One must declare explicitly the number of values of input variables with more than two values.

    2. 2.

      It cannot handle an automaton with only one state; a work-around is to define an automaton with two equivalent states.

Author information

Authors and Affiliations

  1. Dipartimento D’Informatica, Università di Verona, Strada le Grazie, 15, 37134, Verona, Italy

    Tiziano Villa

  2. Department of EECS, Tomsk State University, Tomsk, Russia

    Nina Yevtushenko

  3. Department of Electrical Engineering and Computer Science, University of California, Berkeley, California, USA

    Robert K. Brayton

  4. Department of Electrical Engineering and Computer Science (EECS), University of California, Berkeley, Berkeley, California, USA

    Alan Mishchenko & Alberto Sangiovanni-Vincentelli

  5. Computer Research Institute of Montreal (CRIM), Ogilvy 405, Suite 101, H3N 1M3, Montreal, Quebec, Canada

    Alexandre Petrenko

Authors
  1. Tiziano Villa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nina Yevtushenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Robert K. Brayton
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Alan Mishchenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Alexandre Petrenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Alberto Sangiovanni-Vincentelli
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tiziano Villa .

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Villa, T., Yevtushenko, N., Brayton, R.K., Mishchenko, A., Petrenko, A., Sangiovanni-Vincentelli, A. (2012). The Software Package BALM. In: The Unknown Component Problem. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-68759-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-68759-9_8

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-34532-1

  • Online ISBN: 978-0-387-68759-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation