Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Well-structured_transition_system> ?p ?o }
Showing triples 1 to 38 of
38
with 100 triples per page.
- Well-structured_transition_system 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.".
- Well-structured_transition_system thumbnail UpwardCompatibilityDiagramForWSTS.svg?width=300.
- Well-structured_transition_system wikiPageID "30352492".
- Well-structured_transition_system wikiPageLength "6261".
- Well-structured_transition_system wikiPageOutDegree "20".
- Well-structured_transition_system wikiPageRevisionID "691329771".
- Well-structured_transition_system wikiPageWikiLink Binary_relation.
- Well-structured_transition_system wikiPageWikiLink Category:Automata_(computation).
- Well-structured_transition_system wikiPageWikiLink Category:Wellfoundedness.
- Well-structured_transition_system wikiPageWikiLink Computability.
- Well-structured_transition_system wikiPageWikiLink Computer_science.
- Well-structured_transition_system wikiPageWikiLink Coverability.
- Well-structured_transition_system wikiPageWikiLink Decidability.
- Well-structured_transition_system wikiPageWikiLink Formal_verification.
- Well-structured_transition_system wikiPageWikiLink Ideal_(order_theory).
- Well-structured_transition_system wikiPageWikiLink Petri_net.
- Well-structured_transition_system wikiPageWikiLink Preorder.
- Well-structured_transition_system wikiPageWikiLink Recursive_language.
- Well-structured_transition_system wikiPageWikiLink Reflexive_relation.
- Well-structured_transition_system wikiPageWikiLink Transition_system.
- Well-structured_transition_system wikiPageWikiLink Transitive_relation.
- Well-structured_transition_system wikiPageWikiLink Well-quasi-ordering.
- Well-structured_transition_system wikiPageWikiLink File:UpwardCompatibilityDiagramForWSTS.svg.
- Well-structured_transition_system wikiPageWikiLinkText "well structured transition systems".
- Well-structured_transition_system wikiPageUsesTemplate Template:Reflist.
- Well-structured_transition_system subject Category:Automata_(computation).
- Well-structured_transition_system subject Category:Wellfoundedness.
- Well-structured_transition_system hypernym Class.
- Well-structured_transition_system type Model.
- Well-structured_transition_system type Model.
- Well-structured_transition_system 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.".
- Well-structured_transition_system label "Well-structured transition system".
- Well-structured_transition_system sameAs Q7981061.
- Well-structured_transition_system sameAs m.0g5pz7n.
- Well-structured_transition_system sameAs Q7981061.
- Well-structured_transition_system wasDerivedFrom Well-structured_transition_system?oldid=691329771.
- Well-structured_transition_system depiction UpwardCompatibilityDiagramForWSTS.svg.
- Well-structured_transition_system isPrimaryTopicOf Well-structured_transition_system.
