Switched PIOA: Parallel composition via distributed scheduling

Theoretical Computer Science

Volumn 365, Issue 1-2, 2006, Pages 83-108

  Cheung, Ling ^a   Lynch, Nancy ^b   Segala, Roberto ^c   Vaandrager, Frits ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF VERONA   (Italy)

Author keywords

Compositionality; Distributed scheduling; Parallel composition; Switched probabilistic input output automata; Trace style semantics

Indexed keywords

AUTOMATA THEORY; INFORMATION ANALYSIS; INPUT OUTPUT PROGRAMS; PROBABILISTIC LOGICS; SCHEDULING; SEMANTICS;

DISTRIBUTED SCHEDULING; PARALLEL COMPOSITION; SWITCHED PROBABILISTIC INPUT/OUTPUT AUTOMATA; TRACE-STYLE SEMANTICS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33750156740     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.07.033     Document Type: Article

References (34)

1. S. Aggarwal, Time optimal self-stabilizing spanning tree algorithms, Master's Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Massachusetts, May 1994. Technical Report MIT/LCS/TR-632.
2. Anderson J.H., and Moir M. Wait-free synchronization in multi-programmed systems: integrating priority-based and quantum-based scheduling. Proc. 18th Annu. ACM Symp. on Principles of Distributed Computing (1999) 123-132
3. Aspnes J. Fast deterministic consensus in a noisy environment. Proc. 19th Annu. ACM Symp. on Principles of Distributed Computing (2000) 299-309
4. Aspnes J. Randomized protocols for asynchronous consensus. Distributed Comput. 16 2-3 (2003) 165-175
5. Y. Aumann, M.A. Bender, Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler, Distributed Comput. 2004, accepted for publication.
6. M. Backes, B. Pfitzmann, M. Waidner, Secure asynchronous reactive systems, Cryptology ePrint Archive Report 2004/082, 2004.
7. Universally composable security: a new paradigm for cryptographic protocols R.Canetti. Proc. 42nd IEEE Symp. on Foundations of Computing (2001) 136-145
8. Chandra T.D. Polylog randomized wait-free consensus. Proc. 15th Annu. ACM Symp. on Principles of Distributed Computing (1996) 166-175
9. L. Cheung, M. Hendriks, Causal dependencies in parallel composition of stochastic processes, Technical Report ICIS-R05020, Institute for Computing and Information Sciences, University of Nijmegen, 2005.
10. L. Cheung, N.A. Lynch, R. Segala, F.W. Vaandrager, Switched probabilistic I/O automata. in: Proc. First Internat. Colloq. on Theoretical Aspects of Computing (ICTAC2004), Lecture Notes in Computer Science, Springer, Berlin, 2004.
11. L. Cheung, N.A. Lynch, R. Segala, F.W. Vaandrager, Switched probabilistic I/O automata. Technical Report NIII-R0437, University of Nijmegen, September 2004.
12. L. Cheung, M.I.A. Stoelinga, F.W. Vaandrager, A testing scenario for probabilistic processes, Technical Report ICIS-R06002, ICIS, Radboud University Nijmegen, January 2006.
13. de Alfaro L., Henzinger T.A., and Jhala R. Compositional methods for probabilistic systems. In: Larsen K.G., and Nielsen M. (Eds). Proc. CONCUR 01, Lecture Notes in Computer Science Vol. 2154 (2001), Springer, Berlin 351-365
14. P. D'Argenio, H. Hermanns, J.-P. Katoen, On generative parallel composition, in: Proc. PROBMIV'98, ENTCS, Vol. 22, 1998, pp. 105-122.
15. Desharnais J., Edalat A., and Panangaden P. Bisimulation for labeled Markov processes. Inform. and Comput. 179 2 (2002) 163-193
16. Devillers M.C.A., Griffioen W.O.D., Romijn J.M.T., and Vaandrager F.W. Verification of a leader election protocol-formal methods applied to IEEE 1394. Formal Meth. in System Design 16 3 (2000)
17. Haverkort B.R. Performance of Computer Communication Systems (1998), Wiley, New York
18. B. Jonsson, K.G. Larsen, W. Yi, in: Probabilistic extensions of process algebras, Handbook of Process Algebras, Elsevier, Amsterdam, 2001.
19. Kennedy J.G., and Snell J.L. Finite Markov Chains (1976), Springer, Berlin
20. Larsen K.G., and Skou A. Bisimulation through probabilistic testing. Inform. and Comput. 91 (1991) 1-28
21. Lynch N.A., Saias I., and Segala R. Proving time bounds for randomized distributed algorithms. Proc. 13th Annu. ACM Symp. on the Principles of Distributed Computing (1994) 314-323
22. Lynch N.A., Segala R., and Vaandrager F.W. Compositionality for probabilistic automata. In: Amadio R., and Lugiez D. (Eds). Proc. 14th Intern. Conf. on Concurrency Theory (CONCUR 2003), Lecture Notes in Computer Science Vol. 2761 (2003), Springer, Berlin 208-221
23. Lynch N.A., and Tuttle M.R. An introduction to input/output automata. CWI Quarterly 2 3 (1989) 219-246
24. Pogosyants A., Segala R., and Lynch N.A. Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study. Distributed Comput. 13 3 (2000) 155-186
25. R. Segala, Modeling and verification of randomized distributed real-time systems, Ph.D. Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, June 1995. Available as Technical Report MIT/LCS/TR-676.
26. Segala R., and Lynch N.A. Probabilistic simulations for probabilistic processes. Nordic J. Comput. 2 2 (1995) 250-273
27. J. Søgaard-Andersen, S. Garland, J. Guttag, N. Lynch, A. Pogosyants, Computer-assisted simulation proofs. in: Proc. Fourth Conf. on Computer Aided Verification, CAV'93, 1993, pp. 305-319.
28. A. Sokolova, E.P. de Vink, Probabilistic automata: system types, parallel composition and comparison, in: Validation of Stochastic Systems, Lecture Notes in Computer Science, Vol. 2925, Springer, Berlin, 2004, pp. 1-43.
29. Stewart W.J. Introduction to the Numerical Solutions of Markov Chains (1994), Princeton University Press, Princeton, NJ
30. Stoelinga M.I.A., and Vaandrager F.W. Root contention in IEEE 1394. In: Katoen J.-P. (Ed). Proc. Fifth Internat. AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems, Lecture Notes in Computer Science Vol. 1601 (1999), Springer, Berlin 53-74
31. M.I.A. Stoelinga, F.W. Vaandrager, A testing scenario for probabilistic automata, in: Proc. 30 ICALP, Lecture Notes in Computer Science, Vol. 2719, Springer, Berlin, 2003, pp. 407-418.
32. van Glabbeek R.J., Smolka S.A., and Steffen B. Reactive, generative, and stratified models of probabilistic processes. Inform. and Comput. 121 (1995) 59-80
33. Wu S.-H., Smolka S.A., and Stark E.W. Composition and behaviors of probabilistic I/O automata. In: Jonsson B., and Parrow J. (Eds). Proc. CONCUR 94, Lecture Notes in Computer Science Vol. 836 (1994), Springer, Berlin 513-528
34. Yi W., and Larsen K.G. Testing probabilistic and nondeterministic processes. Testing and Verification 12 (1992) 47-61 protocol specification