About: Well-structured transition system

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In computer science, specifically in the field of formal verification, well-structured transition systems (WSTSs) 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.

Property	Value
dbo:abstract	In computer science, specifically in the field of formal verification, well-structured transition systems (WSTSs) 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. (en)
dbo:thumbnail	wiki-commons:Special:FilePath/UpwardCompatibilityDiagramForWSTS.svg?width=300
dbo:wikiPageID	30352492 (xsd:integer)
dbo:wikiPageLength	6269 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID	730784343 (xsd:integer)
dbo:wikiPageWikiLink	dbr:Preorder dbr:Binary_relation dbr:Decidability_(logic) dbr:Computability dbr:Computer_science dbr:Transitive_relation dbr:Well-quasi-ordering dbr:Formal_verification dbc:Automata_(computation) dbr:Transition_system dbc:Wellfoundedness dbr:Ideal_(order_theory) dbr:Reflexive_relation dbr:Petri_nets dbr:Quasi-ordering dbr:Decidable_language dbr:Coverability dbr:File:UpwardCompatibilityDiagramForWSTS.svg
dbp:wikiPageUsesTemplate	dbt:Reflist
dcterms:subject	dbc:Automata_(computation) dbc:Wellfoundedness
gold:hypernym	dbr:Class
rdfs:comment	In computer science, specifically in the field of formal verification, well-structured transition systems (WSTSs) 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. (en)
rdfs:label	Well-structured transition system (en)
owl:sameAs	freebase:Well-structured transition system wikidata:Well-structured transition system https://global.dbpedia.org/id/4xrEm
prov:wasDerivedFrom	wikipedia-en:Well-structured_transition_system?oldid=730784343&ns=0
foaf:depiction	wiki-commons:Special:FilePath/UpwardCompatibilityDiagramForWSTS.svg
foaf:isPrimaryTopicOf	wikipedia-en:Well-structured_transition_system
is dbo:wikiPageDisambiguates of	dbr:WSTS_(disambiguation)
is dbo:wikiPageWikiLink of	dbr:Widening_(computer_science) dbr:WSTS_(disambiguation)
is foaf:primaryTopic of	wikipedia-en:Well-structured_transition_system