BookRags.com Literature Guides Literature Guides Criticism/Essays Criticism/Essays Biographies Biographies My Bibliography Periodic Table U.S. Presidents Shakespeare Sonnet Shake-Up
Research Anything:        
History | Encyclopedias | Films | News | Create a Bibliography | More... Login | Register | Help
Not What You Meant?  There are 60 definitions for Reduction.

Partial order reduction

Print-Friendly
About 1 pages (333 words)

Bookmark and Share

In computer science, partial order reduction is a technique for reducing the size of the state-space to be searched by a model checking algorithm. It exploits the commutativity of concurrently executed transitions, which result in the same state when executed in different orders. Thus, this reduction technique is best suited for asynchronous systems. C0 <math> {ample(s)=\empty} \iff {enabled(s)=\empty} </math> C1 If a transition <math> \alpha </math> depends on some transition relation in ample(s), this transition cannot be invoked until some transition in the ample set executed. C2 If <math> enabled(s) \neq ample(s) </math>, each transition in the ample set is invisible C3 A cycle is not allowed if it contains a state in which some transition <math>\alpha</math> is enabled, but is never included in ample(s) for any states s on the cycle. These conditions are sufficient for an ample set, but not necessary conditions (Clarke et al. 1999). The premises of cutting a state out is that the state will not lead to some property-violate-states that cannot be uncovered by other states in the ample set. As those erroneous states cannot be known in advance, while exploring the state space, we use those conditions. There are also other notations for partial order reduction. One of the commonly used is the persistent set/sleep set algorithm. Detailed information can be found in Patrice Godefroid's thesis (Godefroid 1994). In explicit model checking, partial order reduction can be achieved by discovering the independent transitions. In symbolic model checking, partial order reduction can be achieved by adding more constraints (guard strengthening).

References

View More Summaries on Partial order reduction
 
Copyrights
Partial order reduction from Wíkipedia. ©2006 by Wíkipedia. Licensed under the GNU Free Documentation License. View a list of authors or edit this article.

Article Navigation
Join BookRagslearn moreJoin BookRags


About BookRags | Customer Service | Report an Error | Terms of Use | Privacy Policy