Task-Structured Probabilistic I/O Automata

Task-Structured Probabilistic I/O Automata

Show other versions (3)

"May 28, 2009."

Bibliographic Details
Main Authors:	Canetti, Ran, Cheung, Ling, Kaynar, Dilsun, Liskov, Moses, Lynch, Nancy, Pereira, Olivier, Segala, Roberto
Other Authors:	Nancy Lynch
Published:	2013
Online Access:	http://hdl.handle.net/1721.1/78359

Similar Items

Task-Structured Probabilistic I/O Automata
by: Canetti,, Ran, et al.
Published: (2006)

Task-structured probabilistic I/O automata
by: Canetti, Ran, et al.
Published: (2021)

Task-Structured Probabilistic I/O Automata
by: Canetti, Ran, et al.
Published: (2006)

Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol
by: Canetti, Ran, et al.
Published: (2007)

Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol
by: Canetti, Ran, et al.
Published: (2006)

Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol
by: Canetti, Ran, et al.
Published: (2006)

Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol
by: Canetti, Ran, et al.
Published: (2005)

Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol
by: Canetti, Ran, et al.
Published: (2006)

The Theory of Timed I/O Automata
by: Kaynar, Dilsun K., et al.
Published: (2005)

Modeling Computational Security in Long-Lived Systems, Version 2
by: Lynch, Nancy, et al.
Published: (2008)

The Theory of Timed I/O Automata
by: Kaynor, Dilsun K., et al.
Published: (2005)

Compositionality for Probabilistic Automata
by: Lynch, Nancy A., et al.
Published: (2023)

The theory of timed I/O automata /
by: Kaynar, Dilsun K.
Published: (2006)

Hybrid I/O Automata
by: Lynch, Nancy A., et al.
Published: (2023)

Hybrid I/O Automata*
by: Lynch, Nancy A., et al.
Published: (2023)

Hybrid I/O Automata
by: Lynch, Nancy A., et al.
Published: (2023)

A Process Algebraic View of I/O Automata
by: Segala, Roberto
Published: (2023)

Probabilistic Automata with Parameters
by: Lenhardt, R
Published: (2009)

Computing probabilistic bisimilarity distances for probabilistic automata
by: Bacci, G, et al.
Published: (2021)

Computing Probabilistic Bisimilarity Distances for Probabilistic Automata
by: Giorgio Bacci, et al.
Published: (2021-02-01)

Language Equivalence for Probabilistic Automata
by: Wachter, J
Published: (2011)

Probabilistic automata and stochastic languages
by: Soh, Royson Jun Heng
Published: (2024)

Language equivalence for probabilistic automata
by: Kiefer, S, et al.
Published: (2011)

Probabilistic automata of bounded ambiguity
by: Fijalkow, N, et al.
Published: (2017)

Refinement and Difference for Probabilistic Automata
by: Benoît Delahaye, et al.
Published: (2014-08-01)

I/O Automata: A Model for Discrete Event Systems
by: Lynch, Nancy A.
Published: (2023)

Deciding probabilistic bisimilarity distance one for probabilistic automata
by: Tang, Q, et al.
Published: (2020)

On the Complexity of the Equivalence Problem for Probabilistic Automata
by: Kiefer, S, et al.
Published: (2012)

When is containment decidable for probabilistic automata?
by: Daviaud, L, et al.
Published: (2018)

Concavely−Priced Probabilistic Timed Automata
by: Kwiatkowska, G, et al.
Published: (2009)

CONCAVELY−PRICED PROBABILISTIC TIMED AUTOMATA
by: Jurdzinski, M, et al.
Published: (2009)

Cost Preserving Bisimulations for Probabilistic Automata
by: Andrea Turrini, et al.
Published: (2014-12-01)

High-level Counterexamples for Probabilistic Automata
by: Ralf Wimmer, et al.
Published: (2015-03-01)

Quantitative Automata under Probabilistic Semantics
by: Krishnendu Chatterjee, et al.
Published: (2019-08-01)

Model Checking Probabilistic Pushdown Automata
by: Javier Esparza, et al.
Published: (2006-03-01)

Action Transducers and Timed Automata
by: Lynch, Nancy A., et al.
Published: (2023)

Model-based estimation of probabilistic hybrid automata
by: Henry, Melvin Michael, 1968-
Published: (2013)

Two Undecidability Results in Probabilistic Automata Theory
by: Kilian, Joseph J.
Published: (2023)

Two undecidability results in probabilistic automata theory
by: Kilian, Joe.
Published: (2020)

When are emptiness and containment decidable for probabilistic automata?
by: Daviaud, L, et al.
Published: (2021)