Switched PIOA: Parallel composition via distributed scheduling

This paper presents the framework of switched probabilistic input/output automata (or switched PIOA), augmenting the original PIOA framework with an explicit control exchange mechanism. Using this mechanism, we model a network of processes passing a single token among them, so that the location of this token determines which process is scheduled to make the next move. This token structure therefore implements a distributed scheduling scheme: scheduling decisions are always made by the (unique) active component.Distributed scheduling allows us to draw a clear line between local and global nondeterministic choices. We then require that local nondeterministic choices are resolved using strictly local information. This eliminates unrealistic schedules that arise under the more common centralized scheduling scheme. As a result, we are able to prove that our trace-style semantics is compositional.

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

[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]  B. Nordstrom.  FINITE MARKOV CHAINS , 2005 .

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

[6]  Ling Cheung,et al.  A testing scenario for probabilistic processes , 2007, JACM.

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

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

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

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

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

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

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

[14]  Michael A. Bender,et al.  Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler , 2004, Distributed Computing.

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

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

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

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

[19]  R. Blute,et al.  Bisimulation for Labeled Markov Processes , 1997 .

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

[21]  Mark Moir,et al.  Wait-free synchronization in multiprogrammed systems: integrating priority-based and quantum-based scheduling , 1999, PODC '99.

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

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

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

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

[26]  Boudewijn R. Haverkort,et al.  Performance of computer communication systems - a model-based approach , 1998 .

[27]  Scott A. Smolka,et al.  Composition and Behaviors of Probabilistic I/O Automata , 1994, Theor. Comput. Sci..

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

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

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

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

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

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

[34]  Wang Yi,et al.  Probabilistic Extensions of Process Algebras , 2001, Handbook of Process Algebra.

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

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