Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7981061> ?p ?o }
Showing triples 1 to 22 of
22
with 100 triples per page.
- Q7981061 subject Q7036095.
- Q7981061 subject Q8146252.
- Q7981061 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.".
- Q7981061 thumbnail UpwardCompatibilityDiagramForWSTS.svg?width=300.
- Q7981061 wikiPageWikiLink Q1173442.
- Q7981061 wikiPageWikiLink Q130901.
- Q7981061 wikiPageWikiLink Q1425985.
- Q7981061 wikiPageWikiLink Q1455907.
- Q7981061 wikiPageWikiLink Q1656686.
- Q7981061 wikiPageWikiLink Q173326.
- Q7981061 wikiPageWikiLink Q176468.
- Q7981061 wikiPageWikiLink Q21198.
- Q7981061 wikiPageWikiLink Q2894153.
- Q7981061 wikiPageWikiLink Q621850.
- Q7981061 wikiPageWikiLink Q64861.
- Q7981061 wikiPageWikiLink Q7036095.
- Q7981061 wikiPageWikiLink Q724168.
- Q7981061 wikiPageWikiLink Q8146252.
- Q7981061 wikiPageWikiLink Q818888.
- Q7981061 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.".
- Q7981061 label "Well-structured transition system".
- Q7981061 depiction UpwardCompatibilityDiagramForWSTS.svg.
