Making random choices invisible to the scheduler

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

Volumn 4703 LNCS, Issue , 2007, Pages 42-58

  Chatzikokolakis, Konstantinos ^a   Palamidessi, Catuscia ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; NETWORK PROTOCOLS; PROBABILISTIC LOGICS; PROBLEM SOLVING;

PRECONGRUENCES; PROBABILISTIC SUMMATION; PROCESS ALGEBRAIC FRAMEWORKS; SCHEDULERS;

AUTOMATA THEORY;

EID: 38149090986     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74407-8_4     Document Type: Conference Paper

References (22)

1. Vardi, M.: Automatic verification of probabilistic concurrent finite-state programs. In: Proc. of the Symp. on Foundations of Comp. Sci., pp. 327-338. IEEE Computer Society Press, Los Alamitos (1985)
2. Hansson, H., Jonsson, B.: A framework for reasoning about time and reliability. In: Proceedings of the Symp. on Real-Time Systems, pp. 102-111. IEEE Computer Society Press, Los Alamitos (1989)
3. Yi, W., Larsen, K.: Testing probabilistic and nondeterministic processes. In: Proc. of the IFIP Symp. on Protocol Specification, Testing and Verification (1992)
4. Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT/LCS/TR-676 (1995)
5. Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. Nordic Journal of Computing 2(2), 250-273 (1995)
6. Hansson, H., Jonsson, B.: A calculus for communicating systems with time and probabitilies. In: Proc. of the Real-Time Systems Symp., pp. 278-287. IEEE Computer Society Press, Los Alamitos (1990)
7. Bandini, E., Segala, R.: Axiomatizations for probabilistic bisimulation. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 370-381. Springer, Heidelberg (2001)
8. Andova, S.: Probabilistic process algebra. PhD thesis, TU Eindhoven (2002)
9. Mislove, M., Ouaknine, J., Worrell, J.: Axioms for probability and nondeterminism. In: Proc. of EXPRESS. ENTCS, vol. 96, pp. 7-28. Elsevier, Amsterdam (2004)
10. Palamidessi, C., Herescu, O.: A randomized encoding of the π-calculus with mixed choice. Theoretical Computer Science 335(2-3), 373-404 (2005)
11. Deng, Y., Palamidessi, C., Pang, J.: Compositional reasoning for probabilistic finite-state behaviors. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol. 3838, pp. 309-337. Springer, Heidelberg (2005)
12. Sokolova, A., de Vink, E.: Probabilistic automata: system types, parallel composition and comparison. In: Baier, C., Haverkort, B., Hermanns, H., Katoen, J.-P., Siegle, M. (eds.) Validation of Stochastic Systems. LNCS, vol. 2925, pp. 1-43. Springer, Heidelberg (2004)
13. Jonsson, B., Larsen, K., Yi, W.: Probabilistic extensions of process algebras. In: Handbook of Process Algebra, pp. 685-710. Elsevier, Amsterdam (2001)
14. Chatzikokolakis, K., Palamidessi, C.: A framework for analyzing probabilistic protocols and its application to the partial secrets exchange. In: De Nicola, R., Sangiorgi, D. (eds.) TGC 2005. LNCS, vol. 3705, pp. 146-162. Springer, Heidelberg (2005)
15. Canetti, R., Cheung, L., Kaynar, D., Liskov, M., Lynch, N., Pereira, O., Segala, R.: Task-structured probabilistic i/o automata. In: Proc. of WODES (2006)
16. Canetti, R., Cheung, L., Kaynar, D., Liskov, M., Lynch, N., Pereira, O., Segala, R.: Time-bounded task-PIOAs: A framework for analyzing security protocols. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 238-253. Springer, Heidelberg (2006)
17. Garcia, F., van Rossum, P., Sokolova, A.: Probabilistic anonymity and admissible schedulers, arXiv:0706.1019vl (2007)
18. de Alfaro, L., Henzinger, T., Jhala, R.: Compositional methods for probabilistic systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, Springer, Heidelberg (2001)
19. De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theoretical Computer Science 34(1-2), 83-133 (1984)
20. Abadi, M., Gordon, A.: A calculus for cryptographic protocols: The spi calculus. Information and Computation 148(1), 1-70 (1999)
21. Chaum, D.: The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology 1, 65-75 (1988)
22. Bhargava, M., Palamidessi, C.: Probabilistic anonymity. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 171-185. Springer, Heidelberg (2005)