Randomized non-sequential processes: (Preliminary version)

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

Volumn 2154, Issue , 2001, Pages 184-201

  Völzer, Hagen ^a,b  

^a UNIVERSITY OF QUEENSLAND   (Australia)

^b HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

PETRI NETS; PROBABILITY DISTRIBUTIONS;

BRANCHING PROCESS; CANONICAL PROBABILITY; RANDOMIZED DISTRIBUTED ALGORITHMS; SEQUENTIAL PROCESS; SEQUENTIAL SEMANTICS; TRUE CONCURRENCY;

SEMANTICS;

EID: 84944071896     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44685-0_13     Document Type: Conference Paper

References (26)

1. Christel Baier and Marta Kwiatkowska. On the verification of qualitative properties of probabilistic processes under fairness constraints. Information Processing Letters, 66:71–79, 1998.
2. Michael Ben-Or. Another advantage of free choice: Completely asynchronous agreement protocols. In Proceedings of the 2nd Annual ACM Symposium on Principles of Distributed Computing, pages 27–30. ACM, 1983.
3. Eike Best. Structure theory of Petri nets: the free choice hiatus. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets: Central Models and Their Properties, volume 254 of LNCS, pages 167–205. Springer, 1987.
4. Eike Best and César Fernández. Nonsequential Processes, volume 13 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1988.
5. Ed Brinksma, Joost-Pieter Katoen, Rom Langerak, and Diego Latella. A stochastic causality-based process algebra. The Computer Journal, 38(7):552–565, 1995.
6. K. Mani Chandy and Jayadev Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.
7. Joost Engelfriet. Branching processes of Petri nets. Acta Informatica, 28:575–591, 1991.
8. Rajiv Gupta, Scott A. Smolka, and Shaji Bhaskar. On randomization in sequential and distributed algorithms. ACM Computing Surveys, 26(1):7–86, March 1994.
9. Sergiu Hart, Micha Sharir, and Amir Pnueli. Termination of probabilistic concurrent programs. ACM Transactions on Programming Languages and Systems, 5(3):356–380, July 1983.
10. Alon Itai and Michael Rodeh. Symmetry breaking in distributive networks. In Proc. 22nd Annual Symposium on Foundations of Computer Science, pages 150–158. IEEE, 1981.
11. Manfred Jaeger. Fairness, computable fairness, and randomness. In Proc. 2nd PROBMIV Int. Workshop on Probabilistic Methods in Verification. Technical Report CSR-99-8 School of Computer Science, University of Birmingham, 1999.
12. Ralph E. Johnson and Fred B. Schneider. Symmetry and similarity in distributed systems. In Proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computing. ACM, 1985.
13. Orna Lichtenstein, Amir Pnueli, and Lenore Zuck. The glory of the past. In Proc. Workshop on Logics of Programs, volume 193 of LNCS, 1985.
14. M. Ajmone Marsan, G. Balbo, G. Conte, S. Donatelli, and G. Franceschinis. Modelling with Generalized Stochastic Petri Nets. Series in Parallel Computing. Wiley, 1995.
15. Carroll Morgan, Annabelle McIver, and Karen Seidel. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems, 18(3):325–353, May 1996.
16. Mogens Nielsen, Gordon Plotkin, and Glynn Winskel. Petri nets, event structures and domains, part i. Theoretical Computer Science, 13:85–108, 1981.
17. Doron A. Peled, Vaughan R. Pratt, and Gerard J. Holzmann (eds). Partial Order Methods in Verification, DIMACSWorkshop, Proceedings, volume 29 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. AMS, 1996.
18. Amir Pnueli. On the extremely fair treatment of probabilistic algorithms. In Proc. 15th Annual Symposium on Theory of Computing (STOC), pages 278–290. ACM, 1983.
19. Amir Pnueli and Lenore D. Zuck. Probabilistic verification. Information and Computation, 103:1–29, 1993.
20. Michael O. Rabin. The choice coordination problem. Acta Informatica, 17:121–134, 1982.
21. Josyula Rao. Reasoning about probabilistic algorithms. In Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, pages 247–264. ACM, 1990.
22. Wolfgang Reisig. Elements of Distributed Algorithms: Modeling and Analysis with Petri Nets. Springer, 1998.
23. Wolfgang Reisig, Ekkart Kindler, Tobias Vesper, Hagen Völzer, and Rolf Walter. Distributed algorithms for networks of agents. In Lectures on Petri Nets II: Applications, volume 1492 of LNCS, pages 331–385. Springer, 1998.
24. Roberto Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. Technical report mit/lcs/tr-676, MIT, Laboratory for Computer Science, June 1995.
25. Einar Smith. On the border of causality: contact and confusion. Theoretical Computer Science, 153:245–270, 1996.
26. Hagen Völzer. Fairneß, Randomisierung und Konspiration in Verteilten Algorithmen. PhD thesis, Humboldt-Universität zu Berlin, Institut f¨ur Informatik, February 2001. in German, available via http://dochost.rz.hu-berlin.de/dissertationen/voelzer-hagen-2000-12-08.