Task-structured probabilistic I/O automata (Q1745718): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fast randomized consensus using shared memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized protocols for asynchronous consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5137353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The reactive simulatability (RSIM) framework for asynchronous systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylog randomized wait-free consensus / 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: Finite state Markovian decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The knowledge complexity of interactive proof-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fly authentication and signature schemes based on groups of unknown order / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Translocation of Masses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning and acting in partially observable stochastic domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving time bounds for randomized distributed algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2003 - Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3519383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3833630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Approximate Implementations for Probabilistic I/O Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2003 - Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationship of Three Cryptographic Channels in the UC Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The choice coordination problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of Stochastic Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847023 / rank
 
Normal rank

Latest revision as of 12:09, 15 July 2024

scientific article
Language Label Description Also known as
English
Task-structured probabilistic I/O automata
scientific article

    Statements

    Task-structured probabilistic I/O automata (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 April 2018
    0 references
    probabilistic automata
    0 references
    I/O automata
    0 references
    formal modeling
    0 references
    cryptographic protocols
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers