Compositionality for Probabilistic Automata

We establish that on the domain of probabilistic automata, the trace distribution preorder coincides with the simulation preorder.

[1]  Kim Guldstrand Larsen,et al.  Specification and refinement of probabilistic processes , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[2]  Thomas A. Henzinger,et al.  Compositional Methods for Probabilistic Systems , 2001, CONCUR.

[3]  Nancy A. Lynch,et al.  Forward and Backward Simulations: I. Untimed Systems , 1995, Inf. Comput..

[4]  Roberto Segala,et al.  Testing Probabilistic Automata , 1996, CONCUR.

[5]  Roberto Segala,et al.  Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study , 2000, Distributed Computing.

[6]  Erik P. de Vink,et al.  Probabilistic Automata: System Types, Parallel Composition and Comparison , 2004, Validation of Stochastic Systems.

[7]  Ling Cheung,et al.  Switched Probabilistic I/O Automata , 2004, ICTAC.

[8]  Frits W. Vaandrager,et al.  A Testing Scenario for Probabilistic Automata , 2003, ICALP.

[9]  Nancy A. Lynch,et al.  An introduction to input/output automata , 1989 .

[10]  Frits W. Vaandrager,et al.  Root Contention in IEEE 1394 , 1999, ARTS.

[11]  Erik P. de Vink,et al.  A hierarchy of probabilistic system types , 2003, CMCS.

[12]  Roberto Segala,et al.  A Compositional Trace-Based Semantics for Probabilistic Automata , 1995, CONCUR.

[13]  Mariëlle Stoelinga,et al.  An Introduction to Probabilistic Automata , 2002, Bull. EATCS.

[14]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[15]  Mariëlle Stoelinga,et al.  Alea jacta est : verification of probabilistic, real-time and parametric systems , 2002 .

[16]  Nancy A. Lynch,et al.  Proving time bounds for randomized distributed algorithms , 1994, PODC '94.

[17]  Nancy A. Lynch,et al.  Probabilistic Simulations for Probabilistic Processes , 1994, Nord. J. Comput..

[18]  Roberto Segala,et al.  Modeling and verification of randomized distributed real-time systems , 1996 .

[19]  Stephen Gilmore,et al.  Specifying Performance Measures for PEPA , 1999, ARTS.

[20]  Insup Lee,et al.  CONCUR '95: Concurrency Theory , 1995, Lecture Notes in Computer Science.

[21]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[22]  Shay Kutten,et al.  Time Optimal Self-Stabilizing Spanning Tree Algorithms , 1993, FSTTCS.