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

In computer science, partial order reduction is a technique for reducing the size of the state-space to be searched by a model checking or automated planning and scheduling algorithm. It exploits the commutativity of concurrently executed transitions that result in the same state when executed in different orders.

Property Value
dbo:abstract
  • In computer science, partial order reduction is a technique for reducing the size of the state-space to be searched by a model checking or automated planning and scheduling algorithm. It exploits the commutativity of concurrently executed transitions that result in the same state when executed in different orders. In explicit state space exploration, partial order reduction usually refers to the specific technique of expanding a representative subset of all enabled transitions. This technique has also been described as model checking with representatives. There are various versions of the method, the so-called stubborn set method, ample set method, and persistent set method. (en)
  • En informatique, la réduction par ordre partiel est une technique pour éviter l'explosion d'états en vérification de modèles, en planification automatique. Les pionniers sont Antti Valmari, Patrice Godefroid, Doron Peled. La réduction par ordre partiel est expliquée dans les livres sur la vérification de modèles. (fr)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 3073934 (xsd:integer)
dbo:wikiPageLength
  • 5762 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1101727388 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • En informatique, la réduction par ordre partiel est une technique pour éviter l'explosion d'états en vérification de modèles, en planification automatique. Les pionniers sont Antti Valmari, Patrice Godefroid, Doron Peled. La réduction par ordre partiel est expliquée dans les livres sur la vérification de modèles. (fr)
  • In computer science, partial order reduction is a technique for reducing the size of the state-space to be searched by a model checking or automated planning and scheduling algorithm. It exploits the commutativity of concurrently executed transitions that result in the same state when executed in different orders. (en)
rdfs:label
  • Réduction par ordre partiel (fr)
  • Partial order reduction (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:knownFor of
is dbo:wikiPageDisambiguates of
is dbo:wikiPageWikiLink of
is dbp:knownFor of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License