Trace-based semantics for probabilistic timed I/O automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4416 LNCS, Issue , 2007, Pages 718-722

  Mitra, Sayan ^a   Lynch, Nancy ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER SIMULATION; PROBABILITY;

HYBRID SYSTEMS; PROBABILISTIC TIMED I/O AUTOMATA (PTIOA); SHARED TRANSITION;

SEMANTICS;

EID: 38049151419     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71493-4_69     Document Type: Conference Paper

References (12)

1. M. Bujorianu and J. Lygeros. General stochastic hybrid systems: Modelling and optimal control. In IEEE Conference on Decision and Control, December 2004.
2. R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. Lynch, O. Pereira, and R. Segala. Task-structured probabilistic I/O automata. Tech. Report MIT-CSAIL-TR-2006-060, MIT, Cambridge, 2006.
3. S. Cattani, R. Segala, M. Z. Kwiatkowska, and G. Norman. Stochastic transition systems for continuous state spaces and non-determinism. In FoSSaCS'05, LNCS 3441, pages 125-139, 2005.
4. L. Cheung. Reconciling nondeterministic and probabilistic choices. PhD thesis, ICIS, Radboud University Nijmegen, The Netherlands, 2006.
5. V. Danos, J. Desharnais, F. Laviolette, and P. Panangaden. Bisimulation and cocongruence for probabilistic systems. Information and Computation, Special issue for selected papers from CMCS04, 2005.
6. L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, CA, 1997. Technical Report STAN-CS-TR-98-1601.
7. S. Smolka E. Stark, R. Cleaveland. A process-algebraic language for probabilistic I/O automata. In Proc. CONCUR 03, LNCS 2761:189-203, 2003.
8. H. Hermanns. Interactive Markov Chains : The Quest for Quantified Quality. Springer, 2002.
9. D. Kaynar, N. Lynch, R. Segala, and F. Vaandrager. The Theory of Timed I/O Automata. Synthesis Lectures on Computer Science. Morgan Claypool, 2005.
10. S. Mitra and N. Lynch. Trace-based Semantics for Probabilistic Timed I/O Automata Full version http://theory.lcs.mit.edu/~mitras/research/PTI0A06-full. pdf
11. S. Mitra and N. Lynch Approximate simulations for task-structured probabilistic I/O automata. In LICS Workshop on Probabilistic Automata and Logics, 2006.
12. F. van Breugel, M. W. Mislove, J. Ouaknine, and J. Worrell. Domain theory, testing and simulation for labelled markov processes. Theoretical Computer Science, 2005.