Task-structured probabilistic I/O automata
type: Item
instance of: scholarly article
title: Task-structured probabilistic I/O automata
zbMATH Open document ID: 1390.68382
author: Ran Canetti
author: Ling Cheung
author: Dilsun Kaynar
author: Moses Liskov
author: Olivier Pereira
author: Roberto Segala
author: Nancy Lynch
published in: Journal of Computer and System Sciences
publication date: 2018-04-18T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q87
zbMATH DE Number: 6861261
zbMATH Keywords: probabilistic automata
zbMATH Keywords: I/O automata
zbMATH Keywords: formal modeling
zbMATH Keywords: cryptographic protocols
MaRDI profile type: Publication
full work available at URL: j.jcss.2017.09.007
OpenAlex ID: W2170634995
cites work: Fast randomized consensus using shared memory
cites work: Randomized protocols for asynchronous consensus
cites work: Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
cites work: Q5137353
cites work: The reactive simulatability (RSIM) framework for asynchronous systems
cites work: Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
cites work: Polylog randomized wait-free consensus
cites work: Switched PIOA: parallel composition via distributed scheduling
cites work: Finite state Markovian decision processes
cites work: Theory of Cryptography
cites work: Q4279565
cites work: The knowledge complexity of interactive proof-systems
cites work: On the fly authentication and signature schemes based on groups of unknown order
cites work: On the translocation of masses
cites work: Planning and acting in partially observable stochastic domains
cites work: Proving time bounds for randomized distributed algorithms
cites work: CONCUR 2003 - Concurrency Theory
cites work: Q3519383
cites work: Q3833630
cites work: Proving approximate implementations for probabilistic I/O automata
cites work: A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
cites work: Relationship of Three Cryptographic Channels in the UC Framework
cites work: Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
cites work: Q4315289
cites work: The choice coordination problem
cites work: Validation of Stochastic Systems
cites work: Q4847023
DOI: 10.1016/J.JCSS.2017.09.007
Recommended article: Composition and behaviors of probabilistic I/O automata
Recommended article: Theoretical Aspects of Computing - ICTAC 2004
Recommended article: CONCUR 2003 - Concurrency Theory
Recommended article: Probabilistic I/O Automata: Theories of Two Equivalences
Recommended article: Proving approximate implementations for probabilistic I/O automata
Recommended article: Q4536590
Recommended article: Trace-Based Semantics for Probabilistic Timed I/O Automata
Recommended article: Probabilistic asynchronous automata
Recommended article: Abstract Probabilistic Automata
Recommended article: Abstract probabilistic automata
description: scientific article; zbMATH DE number 6861261