Abstract
A stateful search needs to decide whether a state has already been visited to avoid re-exploration. This process is called state matching. The last chapter already presented a general state matching algorithm that works in two steps. First the concrete state parts are matched. And only if they are equal, the symbolic state parts will be checked for subsumption. An exact method, called Exact Symbolic Subsumption (ESS), has been presented to detect subsumption between symbolic state parts.
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
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer Fachmedien Wiesbaden
About this chapter
Cite this chapter
Herdt, V. (2016). Heuristic Symbolic Subsumption. In: Complete Symbolic Simulation of SystemC Models. BestMasters. Springer Vieweg, Wiesbaden. https://doi.org/10.1007/978-3-658-12680-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-658-12680-3_6
Published:
Publisher Name: Springer Vieweg, Wiesbaden
Print ISBN: 978-3-658-12679-7
Online ISBN: 978-3-658-12680-3
eBook Packages: Computer ScienceComputer Science (R0)