Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Well-structured_transition_system> ?p ?o. }
Showing items 1 to 28 of
28
with 100 items 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 wikiPageExternalLink FinSch-TCS99.pdf.
- Well-structured_transition_system wikiPageID "30352492".
- Well-structured_transition_system wikiPageRevisionID "543814942".
- Well-structured_transition_system hasPhotoCollection Well-structured_transition_system.
- Well-structured_transition_system subject Category:Automata_(computation).
- Well-structured_transition_system subject Category:Automata_theory.
- Well-structured_transition_system subject Category:Wellfoundedness.
- Well-structured_transition_system type Anomaly109606527.
- Well-structured_transition_system type Automata.
- Well-structured_transition_system type Automaton109825519.
- Well-structured_transition_system type CausalAgent100007347.
- Well-structured_transition_system type LivingThing100004258.
- Well-structured_transition_system type Object100002684.
- Well-structured_transition_system type Organism100004475.
- Well-structured_transition_system type Person100007846.
- Well-structured_transition_system type PhysicalEntity100001930.
- Well-structured_transition_system type Whole100003553.
- Well-structured_transition_system type YagoLegalActor.
- Well-structured_transition_system type YagoLegalActorGeo.
- 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 m.0g5pz7n.
- Well-structured_transition_system sameAs Q7981061.
- Well-structured_transition_system sameAs Q7981061.
- Well-structured_transition_system sameAs Well-structured_transition_system.
- Well-structured_transition_system wasDerivedFrom Well-structured_transition_system?oldid=543814942.
- Well-structured_transition_system isPrimaryTopicOf Well-structured_transition_system.