Task-Structured Probabilistic I/O Automata
Name
MIT-CSAIL-TR-2013-006.pdf
Size
499.12 KB
Format
Adobe PDF
Checksum (MD5)
77cc43a0bd6810f9ee30efbdf38e1a2e
Author(s)
Canetti, Ran
Cheung, Ling
Kaynar, Dilsun
Liskov, Moses
Lynch, Nancy A.
Pereira, Olivier
Segala, Roberto
Advisor(s)
Nancy Lynch
Date Issued
2009
Series/Report no.
MIT-CSAIL-TR-2013-006
Abstract
Modeling frameworks such as Probabilistic I/O Automata (PIOA) and Markov Decision Processes permit both probabilistic and nondeterministic choices. In order to use these frameworks to express claims about probabilities of events, one needs mechanisms for resolving nondeterministic choices. For PIOAs, nondeterministic choices have traditionally been resolved by schedulers that have perfect information about the past execution. However, these schedulers are too powerful for certain settings, such as cryptographic protocol analysis, where information must sometimes be hidden. Here, we propose a new, less powerful nondeterminism-resolution mechanism for PIOAs, consisting of tasks and local schedulers. Tasks are equivalence classes of system actions that are scheduled by oblivious, global task sequences. Local schedulers resolve nondeterminism within system components, based on local information only. The resulting task-PIOA framework yields simple notions of external behavior and implementation, and supports simple compositionality results. We also define a new kind of simulation relation, and show it to be sound for proving implementation. We illustrate the potential of the task-PIOAframework by outlining its use in verifying an Oblivious Transfer protocol.
Description
"May 28, 2009."
Persistent DSpace Link
