Abstract
The theory and algorithms described to this point capture the nature of the problem. Nevertheless, the viability procedure is theoretically expensive; the inner loop of the procedure is a general satisfiability problem, and hence is strongly suspected to be of exponential complexity. Further, there is some bookkeeping associated with the computation of the viability function. In general, some applications may prefer a faster answer and a poorer approximation to the longest viable path, so long as the assurance is given that such an approximation will not underestimate the length of the longest viable path. In this section we explore such performance/quality tradeoffs, and end by giving a polynomial approximation to viability.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media New York
About this chapter
Cite this chapter
McGeer, P.C., Brayton, R.K. (1991). System Considerations and Approximations. In: Integrating Functional and Temporal Domains in Logic Design. The Springer International Series in Engineering and Computer Science, vol 139. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3960-5_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-3960-5_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6768-0
Online ISBN: 978-1-4615-3960-5
eBook Packages: Springer Book Archive