About: Partial order reduction

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Partial order reduction Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:TopicalConcept, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FPartial_order_reduction

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.

Attributes	Values
rdf:type	topical concept
rdfs:label	Réduction par ordre partiel (fr) Partial order reduction (en)
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)
dcterms:subject	Model checking
Wikipage page ID	3073934 (xsd:integer)
Wikipage revision ID	1101727388 (xsd:integer)
Link from a Wikipage to another Wikipage	Deadlocks Algorithm Model checking Computer Aided Verification Computer science Cycle (sequence) Linear temporal logic Model checking LNCS Transition (computer science) Automated planning and scheduling POPL Static analysis State transition system
Link from a Wikipage to an external page	http://dl.acm.org/citation.cfm%3Fid=1040315 https://www.springer.com/us/book/9783540607618 http://spinroot.com/spin/Doc/Book_extras/
sameAs	Partial order reduction Partial order reduction Partial order reduction Partial order reduction
dbp:wikiPageUsesTemplate	dbt:Cite_book dbt:Cite_conference dbt:Cite_thesis dbt:Reflist
has 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)
gold:hypernym	Technique
prov:wasDerivedFrom	wikipedia-en:Partial_order_reduction?oldid=1101727388&ns=0
page length (characters) of wiki page	5762 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Partial_order_reduction
is Link from a Wikipage to another Wikipage of	Principles of Model Checking Doron A. Peled SPIN model checker Glossary of artificial intelligence Model checking Computer Aided Verification PAT (model checker) Reduction Java Pathfinder
is Wikipage disambiguates of	Reduction
is known for of	Doron A. Peled
is known for of	Doron A. Peled
is foaf:primaryTopic of	wikipedia-en:Partial_order_reduction

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 60 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software