Task-structured probabilistic I/O automata
Name
wodes06.pdf
Description
Accepted version
Size
137.96 KB
Format
Adobe PDF
Checksum (MD5)
929a10d678320484f11972fdfb0c8a7e
Author(s)
Canetti, Ran
Cheung, Ling
Kaynar, Dilsun
Liskov, Moses
Lynch, Nancy A.
Pereira, Olivier
Segala, Roberto
Date Issued
2018
Journal
Journal of Computer and System Sciences
Publisher
Elsevier BV
Version
Author's final manuscript
Abstract
© 2017 Elsevier Inc. 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. In this paper, 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, a new kind of simulation relation that is sound for proving implementation, and supports simple compositionality results.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-NonCommercial-NoDerivs License
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/J.JCSS.2017.09.007
