Task-Structured Probabilistic I/O Automata
"May 28, 2009."
| Main Authors: | , , , , , , |
|---|---|
| Other Authors: | |
| Published: |
2013
|
| Online Access: | http://hdl.handle.net/1721.1/78359 |
| _version_ | 1826190853341708288 |
|---|---|
| author | Canetti, Ran Cheung, Ling Kaynar, Dilsun Liskov, Moses Lynch, Nancy Pereira, Olivier Segala, Roberto |
| author2 | Nancy Lynch |
| author_facet | Nancy Lynch Canetti, Ran Cheung, Ling Kaynar, Dilsun Liskov, Moses Lynch, Nancy Pereira, Olivier Segala, Roberto |
| author_sort | Canetti, Ran |
| collection | MIT |
| description | "May 28, 2009." |
| first_indexed | 2024-09-23T08:46:39Z |
| id | mit-1721.1/78359 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T08:46:39Z |
| publishDate | 2013 |
| record_format | dspace |
| spelling | mit-1721.1/783592019-04-10T07:27:39Z Task-Structured Probabilistic I/O Automata Canetti, Ran Cheung, Ling Kaynar, Dilsun Liskov, Moses Lynch, Nancy Pereira, Olivier Segala, Roberto Nancy Lynch Theory of Computation "May 28, 2009." 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. 2013-04-11T20:45:03Z 2013-04-11T20:45:03Z 2009. http://hdl.handle.net/1721.1/78359 MIT-CSAIL-TR-2013-006 46 p. application/pdf |
| spellingShingle | Canetti, Ran Cheung, Ling Kaynar, Dilsun Liskov, Moses Lynch, Nancy Pereira, Olivier Segala, Roberto Task-Structured Probabilistic I/O Automata |
| title | Task-Structured Probabilistic I/O Automata |
| title_full | Task-Structured Probabilistic I/O Automata |
| title_fullStr | Task-Structured Probabilistic I/O Automata |
| title_full_unstemmed | Task-Structured Probabilistic I/O Automata |
| title_short | Task-Structured Probabilistic I/O Automata |
| title_sort | task structured probabilistic i o automata |
| url | http://hdl.handle.net/1721.1/78359 |
| work_keys_str_mv | AT canettiran taskstructuredprobabilisticioautomata AT cheungling taskstructuredprobabilisticioautomata AT kaynardilsun taskstructuredprobabilisticioautomata AT liskovmoses taskstructuredprobabilisticioautomata AT lynchnancy taskstructuredprobabilisticioautomata AT pereiraolivier taskstructuredprobabilisticioautomata AT segalaroberto taskstructuredprobabilisticioautomata |