Proving Approximate Implementations for Probabilistic I/O Automata
Work
Year: 2007
Type: article
Abstract: In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task structure on the locally... more
Authors Sayan Mitra, Nancy Lynch
Institution Massachusetts Institute of Technology
Cites: 39
Cited by: 9
Related to: 10
FWCI: 0.606
Citation percentile (by year/subfield): 72.21
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Peace, justice, and strong institutions
Open Access status: gold