Jump to content

Well-structured transition system

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Kprateek88 (talk | contribs) at 11:44, 7 January 2011 (Creating page). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In computer science, specifically in the field of formal verification, well-structured transition systems (WSTS's) are a general class of infinite state systems for which many verification problems are decidable, owing to the existence of a kind of order between the states of the system which is compatible with the transitions of the system. WSTS decidability results can be applied to Petri nets, lossy channel systems, and more.

References

P ≟ NP 

This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Well-structured_transition_system&oldid=406471273"