Probabilistic cluster unfoldings

Fundamenta Informaticae

Volumn 53, Issue 3-4, 2002, Pages 281-314

  Haar, Stefan ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

MARKOV PROCESSES; PETRI NETS; SEMANTICS;

GIBBS POTENTIAL;

PROBABILITY;

EID: 0036953385     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (38)

1. M. Ajmone Marsan, G. Balbo, G. Conte, S. Donatelli, and G. Franceschinis. Modeling with Generalized Stochastic Petri Nets. Parallel Computing Series, Wiley, 1995.
2. M. Ajmone Marsan, G. Balbo, G. Chiola, and G. Conte. Generalized Stochastic Petri Nets Revisited: Random Switches and Priorities. Proc. 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. Stochastic Transition Systems. CONCUR 98, LNCS 1466:423-438, Springer.
5. M.S. Andersland and D. Teneketzis. Information Structures, Causality, and Nonsequential Stochastic Control. SIAM J. of Contr. and Opt. Part I: Design-Independent Properties. 30(6):1447-1475, 1992. Part II: Design-Dependent Properties. 32(6):1726-1751, 1994.
6. M.S. Andersland and D. Teneketzis. Information Structures, Causality, and Nonsequential Stochastic Control. SIAM J. of Contr. and Opt. Part I: Design-Independent Properties. 30(6):1447-1475, 1992. Part II: Design-Dependent Properties. 32(6):1726-1751, 1994.
7. A. Benveniste, S. Haar, and E. Fabre. Markov Nets: probabilistic Models for Distributed and Concurrent Systems. Rapport de Recherche INRIA 4235, September 2001. Submitted to a journal.
8. A. Benveniste, E. Fabre, S. Haar, and C. Jard. Diagnosis of Asynchronous Discrete Event Systems, a Net Unfolding Approach. To appear in IEEE Trans. on Automatic Control.
9. E. Best and C. Fernández. Nonsequential Processes. A Petri Net View, EATCS Monographs 13, Springer, 1988.
10. P. Cartier and D. Foata. Problèmes combinatoires de commutations et réarrangements. Lecture Notes in Mathematics 85, Springer, 1969.
11. K. L. Chung. A Course in Probability Theory. Academic Press, 1974.
12. C. Derman. Finite State Markovian Decision Processes. Academic Press, 1970.
13. J. Desel and J. Esparza. Free Choice Petri Nets. Cambridge University Press, 1995.
14. R. Dobrushin. The description of a random field by means of conditional probabilities and conditions of its regularity. Theory Prob. Appl. 13:197-224, 1968.
15. V. Diekert and G. Rozenberg (eds.) The Book of Traces. World Scientific, 1995.
16. S. Dolev, A. Israeli, and S. Moran. Analyzing expected time by scheduler-luck games. IEEE Transactions on Parallel and Distributed Systems, 8(4):424-440, April 1997.
17. J. Engelfriet. Branching Processes of Petri Nets. Acta Informatica 28:575-591, 1991.
18. J. Esparza, S. Römer, and W. Vogler. An Improvement of McMillan's Unfolding Algorithm. Formal Methods in System Design 20(3):285-310, May 2002.
19. J. Esparza. Model Checking Using Net Unfoldings. Sci. of Comp. Prog. 23:151-195, 1994.
20. C. Fernández and P. S. Thiagarajan. A Lattice Theoretic View of K-Density. G. Rozenberg (ed.), Advances in Petri Nets 1984. LNCS 188:139-153, Springer, Berlin, 1985.
21. F. Bacelli and S. Foss and B. Gaujal. Free - Choice Petri Nets - An Algebraic Approach. IEEE Transactions on Automatic Control 41(12):1751-1778, 1996.
22. B. Gaujal, S. Haar, and J. Mairesse. Blocking a transition in a Free Choice net and what it tells about its throughput. To appear in Journal of Computer and System Science.
23. H.-O. Georgii. Gibbs Measures and Phase Transitions. de Gruyter, Berlin/New York 1988.
24. S. Haar. Branching Processes of general S/T-Systems. Elec. Notes in Theor. Comp. Sci. 18, 1998.
25. S. Haar. Occurrence Net Logics. Fundamenta Informaticae 43:105-127, 2000.
26. S. Haar. Clusters, confusion and unfoldings. Fundamenta Informaticae 47(3-4):259-270, 2001.
27. S. Haar. Probabilistic Unfoldings and Partial Order Fairness in Petri Nets. In: H. Hermanns and R. Segala (eds.), Proceedings PAPM-ProbMiV 2002, LNCS 2399, 95-114.
28. C.N. Hadjicostis and G.C. Verghese. Monitoring discrete event systems using Petri Net embeddings. Proc. ICATON 99, LNCS 1639, 188-208.
29. K. McMillan. Using Unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. 4th Workshop on Computer Aided Verification, pp. 164-174, 1992.
30. R. Kindermann and J. L. Snell. Markov Random Fields and their Applications. American Mathematical Society, Contemporary Mathematics Vol. 1, Providence (RI), 1980.
31. M. Nielsen, G. Plotkin, and G. Winskel. Petri nets, event structures, and domains. Part I. Theoretical Computer Science 13:85-108, 1981.
32. M.O. Rabin. Probabilistic Automata. Information and Control 6:230-245, 1963.
33. R. Segala. Verification of Randomized Distributed Algorithms, Lectures on Formal Methods and Performance Analysis. LNCS 2090:232-260, Springer 2001.
34. R. Segala. A Compositional Trace-Based Semantics for Probabilistic Automata. CONCUR' 01, LNCS 962:234-248, Springer 1995.
35. E. Smith. On the border of causality: Contact and Confusion. TCS 153:245-270, 1996.
36. G. Stremersch. Supervision of Petri Nets, Kluwer, Boston/Dordrecht/London, 2001.
37. H. Völzer. Randomized non-sequential processes. CONCUR. LNCS 2154, Springer, 2001.
38. W. Vogler. Executions: A New Partial Order Semantics of Petri Nets. Theoretical Computer Science 91:205-238, 1991.