S w itch ed PIO A : P arallel C o m p o sitio n v ia D istr ib u te d S ch ed u lin g

[1]  Bernhard Steffen,et al.  Reactive, Generative and Stratified Models of Probabilistic Processes , 1995, Inf. Comput..

[2]  Joost-Pieter Katoen,et al.  On Generative Parallel Composition , 1998, PROBMIV.

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

[4]  James Aspnes,et al.  Randomized protocols for asynchronous consensus , 2002, Distributed Computing.

[5]  Nancy A. Lynch,et al.  Compositionality for Probabilistic Automata , 2003, CONCUR.

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

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

[8]  Frits W. Vaandrager,et al.  Verification of a Leader Election Protocol: Formal Methods Applied to IEEE 1394 , 2000, Formal Methods Syst. Des..

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

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

[11]  Birgit Pfitzmann,et al.  Secure Asynchronous Reactive Systems , 2004 .

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

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

[14]  Wang Yi,et al.  Testing Probabilistic and Nondeterministic Processes , 1992, PSTV.

[15]  Scott A. Smolka,et al.  Composition and Behaviors of Probabilistic I/O Automata , 1994, CONCUR.

[16]  Ling Cheung,et al.  Causal Dependencies in Parallel Composition of Stochastic Processes , 2005 .

[17]  Ran Canetti,et al.  Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[18]  James Aspnes,et al.  Fast deterministic consensus in a noisy environment , 2000, PODC '00.

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

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

[21]  Nancy A. Lynch,et al.  Computer-Assisted Simulation Proofs , 1993, CAV.

[22]  William J. Stewart,et al.  Introduction to the numerical solution of Markov Chains , 1994 .

[23]  Abbas Edalat,et al.  Bisimulation for Labelled Markov Processes , 2002, Inf. Comput..

[24]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

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

[26]  Boudewijn R. Haverkort.  Performance of computer communication systems , 1998 .

[27]  Tushar Deepak Chandra.  Polylog randomized wait-free consensus , 1996, PODC '96.

[28]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..