Proving Approximate Implementations for Probabilistic I/O Automata-Reference-Cited by-同舟云学术

Proving Approximate Implementations for Probabilistic I/O Automata

Published:2007-06 Issue:8 Volume:174 Page:71-93
ISSN:1571-0661
Container-title:Electronic Notes in Theoretical Computer Science
language:en
Short-container-title:Electronic Notes in Theoretical Computer Science

Author:

Mitra Sayan,Lynch Nancy

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference35 articles.

1. A theory of timed automata;Alur;Theoretical Computer Science,1994

2. Polynomial-time algorithms for testing probabilistic bisimulation and simulation;Baier,1996

3. M. Ben-Or. Another advantage of free choice: Completely asynchronous agreement protocols. In PODC, pages 27–30, Montreal, Canada, August 1983

4. M.L. Bujorianu, J. Lygeros, and M.C. Bujorianu. Bisimulation for general stochastic hybrid systems. In Morari and Thiele [25], pages 198–214

5. R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. Lynch, O. Pereira, and R. Segala. Task-structured probabilistic I/O automata. Technical Report MIT-CSAIL-TR-2006-060, Massachusetts Institute of Technology, Cambridge, MA, September 2006

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Task-structured probabilistic I/O automata;Journal of Computer and System Sciences;2018-06

2. Stuttering for Abstract Probabilistic Automata;The Journal of Logic and Algebraic Programming;2014-01

3. Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms;Lecture Notes in Computer Science;2014

4. Stuttering for Abstract Probabilistic Automata;Logical Foundations of Computer Science;2013

5. Modular Methods for Verification and Validation of Air Traffic Control Algorithms;Infotech@Aerospace 2012;2012-06-19