Abstract
This chapter presents the first contribution of this book, namely, CHASM (Coding for Hazard-free Asynchronous State Machines), the first general and systematic method for optimal state assignment of asynchronous state machines. Given an asynchronous FSM, Chasm chooses a state assignment for which the logic, after state encoding, is optimal under some cost function. Because Chasm operates on asynchronous machines, it must also ensure that the resulting machine implementation is both critical race-free and hazard-free.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Fuhrer, R.M., Nowick, S.M. (2001). CHASM: Optimal State Assignment for Asynchronous FSM’s. In: Sequential Optimization of Asynchronous and Synchronous Finite-State Machines. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1417-6_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1417-6_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5543-4
Online ISBN: 978-1-4615-1417-6
eBook Packages: Springer Book Archive