Abstract
In the following, we use the term transition to refer to a directed arc of an STG, which enables the movement of an automaton from the current state to the next state. The transition predicate indicates when the transition is enabled. A transition predicate is an arbitrary Boolean function in terms of the inputs. In some cases, this function is just a minterm. In this case, to avoid confusion, we will refer to a minterm transition.
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 subscriptionsAuthor information
Authors and Affiliations
Corresponding author
Rights 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). Implementation of Automata Manipulations. In: The Unknown Component Problem. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-68759-9_6
Download citation
DOI: https://doi.org/10.1007/978-0-387-68759-9_6
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34532-1
Online ISBN: 978-0-387-68759-9
eBook Packages: EngineeringEngineering (R0)