Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers (Q3184684): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Partial-order reduction in symbolic state-space exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking of probabilistic and nondeterministic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dining cryptographers problem: Unconditional sender and recipient untraceability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Switched PIOA: parallel composition via distributed scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791844 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative Model Checking Revisited: Neither Decidable Nor Approximable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive, generative, and stratified models of probabilistic processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem / rank
 
Normal rank

Latest revision as of 02:38, 2 July 2024

scientific article
Language Label Description Also known as
English
Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
scientific article

    Statements

    Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers (English)
    0 references
    0 references
    0 references
    22 October 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references