Symbolic Analysis

  • Janusz A. Brzozowski
  • Carl-Johan H. Seger
Part of the Monographs in Computer Science book series (MCS)


The race analysis algorithms and the behaviors introduced so far in this book all use the tacit assumption that the states of a network are represented explicitly. Since the state space grows exponentially with the size of the network, such a representation can only be used for relatively small circuits. In this chapter we consider representing states and other similar objects symbolically.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York, Inc. 1995

Authors and Affiliations

  • Janusz A. Brzozowski
    • 1
  • Carl-Johan H. Seger
    • 2
  1. 1.Department of Computer ScienceUniversity of WaterlooWaterlooCanada
  2. 2.Department of Computer ScienceUniversity of British ColumbiaVancouverCanada

Personalised recommendations