State space enumeration

In computer science, state space enumeration are methods that consider each reachable program state to determine whether a program satisfies a given property.[1] As programs increase in size and complexity, the state space grows exponentially. The state space used by these methods can be reduced by maintaining only the parts of the state space that are relevant to the analysis. However, the use of state and memory reduction techniques makes runtime a major limiting factor.[2]

See also

References

  1. ↑ "A Compact Petri Net Representation for Concurrent Programs", Matthew B. Dwyer, Lori A. Clarke, Kari A. Niesy, Department of Computer Science, University of Massachusetts, Amherst Amherst, MA 01003
  2. ↑ "Proceedings of the conference on Application and theory of petri nets: formal methods in software engineering and defence systems - Volume 12", ACM International Conference Proceeding Series, Vol. 145, by Marko Mäkelä, Laboratory for Theoretical Computer Science, Helsinki University of Technology, Espoo, Finland
This article is issued from Wikipedia - version of the Wednesday, January 09, 2013. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.