Probabilistic unfoldings and partial order fairness in Petri nets

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

Volumn 2399, Issue , 2002, Pages 95-114

  Haar, Stefan ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ARTIFICIAL LIFE; SEMANTICS;

ALGORITHMIC CONSTRUCTION; CLUSTER-BASED; GIBBS POTENTIAL; PARTIAL ORDER; PROBABILISTIC FRAMEWORK; PROBABILISTIC MODELING; UNFOLDING SEMANTICS; UNFOLDINGS;

PETRI NETS;

EID: 0012608461     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45605-8_7     Document Type: Conference Paper

References (32)

1. M. Ajmone Marsan, G. Balbo, G. Conte, S. Donatelli, and G. Franceschinis. Modeling with Generalized Stochastic Petri Nets. Wiley, 1995.
2. M. Ajmone Marsan, G. Balbo, G. Chiola, and G. Conte. Generalized Stochastic Petri Nets Revisited: Random Switches and Priorities. In: Proceedings of PNPM’87, IEEE-CS Press, pp. 44-53.
3. A. Aghasaryan, E. Fabre, A. Benveniste, R. Boubour, and C. Jard. Fault detection and diagnosis in distributed systems: An approach by partially stochastic petri nets. Discrete event dynamic systems 8:203-231, 1998.
4. L. de Alfaro. From Fairness to Chance. In: Electronic Notes on Theoretical Computer Science 22, Elsevier, 2000.
5. L. de Alfaro. Stochastic Transition Systems. In: CONCUR’98, LNCS 1466:, Springer-Verlag, 1998. 423-438
6. K.R. Apt, N. Francez, and S. Katz. Appraising fairness in languages for distributed programming. Distributed Computing 2:226-241,1988.
7. K.R. Attie, N. Francez, and O. Grumberg. Fairness and hyperfairness in multi-parti interactions. Distributed Computing 6:245-254,1993.
8. A. Benveniste, S. Haar, and E. Fabre. Markov Nets: probabilistic Models for Distributed and Concurrent Systems. INRIA Report 4235, 2001.
9. E. Best. Fairness and Conspiracies. Information Processing Letters 18(4):215-220, 1984. Erratum ibidem 19:162.
10. K. L. Chung. A Course in Probability Theory. Academic Press, 1974.
11. C. Derman. Finite State Markovian Decision Processes. Acad. Press, 1970.
12. J. Desel and J. Esparza. Free Choice Petri Nets. Camb. Univ. Press, 1995.
13. R. Dobrushin. The description of a random field by means of conditional probabilities and conditions of its regularity. Th. Prob. Appl. 13:197-224, 1968.
14. S. Dolev, A. Israeli, and S. Moran. Analyzing expected time by scheduler-luck games. IEEE Trans on Par. and Dist. Systems, 8(4):424-440, 1997.
15. J. Engelfriet. Branching Processes of Petri Nets. Acta Inf. 28:575-591, 1991.
16. J. Esparza, S. Römer, and W. Vogler. An Improvement of McMillan’s Unfolding Algorithm. In: TACAS’96, LNCS 1055:87-106, Springer 1996. Extended version to appear in Formal Methods in System Design.
17. J. Esparza. Model Checking Using Net Unfoldings. Science of Computer Programming 23:151-195, 1994.
18. N. Francez. Fairness. Springer, 1986.
19. S. Haar. Branching Processes of general S/T-Systems. Electronic Notes in Theoretical Computer Science 18, 1998.
20. S. Haar. Occurrence Net Logics. Fund. Informaticae 43:105-127, 2000.
21. S. Haar. Clusters, confusion and unfoldings. Fund.Informaticae 47(3-4):259-270, 2001.
22. S. Haar. Probabilistic Cluster Unfoldings for Petri Nets. INRIA Research Report 4426, 2002; http://www.inria.fr/rrrt/rr-4426.html; ftp://ftp.inria.fr/INRIA/publication/RR/RR-4426.ps.gz
23. M. Jaeger. Fairness, Computable Fairness and Randomness. PROBMIV’ 99, Tech. Report CSR-99-8, School of CS, Univ. of Birmingham 1999.
24. R. Kindermann and J. L. Snell. Markov Random Fields and their Applications. AMS Contemporary Mathematics Vol. 1, Providence 1980.
25. M. Kwiatkowska. Event fairness and non-interleaving concurrency. Formal Aspects of Computing 1:213-228, 1989.
26. K. McMillan. Using Unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. 4th CAV, pp. 164-174, 1992.
27. M. Nielsen, G. Plotkin, and G. Winskel. Petri nets, event structures, and domains. Part I. Theoretical Computer Science 13:85-108, 1981.
28. M.O. Rabin. Probabilistic Automata. Inf. and Control 6:230-245, 1963.
29. G. Rozenberg and J. Engelfriet. Elementary Net Systems. In: Lectures on Petri Nets I: Basic Models. LNCS 1491, pp. 12-121, Springer, 1998.
30. R. Segala. Verification of Randomized Distributed Algorithms. In: LNCS 2090:232-260, Springer 2001.
31. H. Völzer. Randomized non-sequential processes. In: Proc. CONCUR2001. LNCS 2154, Springer, August 2001.
32. W. Vogler. Fairness and Partial Order Semantics. Inf. Proc. Letters 55(1): 33-39, 1995.