Markov Nets: Probabilistic Models for Distributed and Concurrent Systems

IEEE Transactions on Automatic Control

Volumn 48, Issue 11, 2003, Pages 1936-1950

  Benveniste, Albert ^a   Fabre, Eric ^a   Haar, Stefan ^a,b  

^a CAMPUS DE BEAULIEU   (France)

^b ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

Distributed discrete event systems; Petri nets (PNs); Probabilistic models; Unfoldings

Indexed keywords

AUTOMATA THEORY; MARKOV PROCESSES; MATHEMATICAL MODELS; PETRI NETS; PROBABILITY; RANDOM PROCESSES; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION SYSTEMS;

DISTRIBUTED DISCRETE EVENT SYSTEMS;

DISTRIBUTED PARAMETER CONTROL SYSTEMS;

EID: 0345690124     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2003.819076     Document Type: Article

References (31)

1. A. Benveniste, E. Fabre, and S. Haar, "Markov nets: Probabilistic models for distributed and concurrent systems,", IRISA Res. Rep. 1538, 2003.
2. A. Aghasaryan, E. Fabre, A. Benveniste, R. Boubour, and C. Jard, "Fault detection and diagnosis in distributed systems: An approach by partially stochastic PNs," Discrete Event Dynamic Systems: Theory and Application, Special Issue on Hybrid Systems, vol. 8, pp. 203-231, June 1998.
3. M. A. Marsan, G. Balbo, G. Conte, S. Donatelli, and G. Franceschinis, Modeling With Generalized Stochastic Petri Nets. New York: Wiley, 1995.
4. M. A. Marsan, G. Balbo, G. Chiola, and G. Conte, "Generalized stochastic PNs revisited: Random switches and priorities," in Proc. PNPM '87, pp. 44-53.
5. F. Baccelli, S. Foss, and B. Gaujal, "Free choice PNs - an algebraic approach," IEEE Trans. Automat. Contr., vol. 41, pp. 1751-1778, Dec 1996.
6. F. Bause and P. S. Kritzinger, Stochastic Petri Nets, An introduction to the Theory. Berlin, Germany: Verlag-Vieweg, 1996.
7. A. Benveniste, B. C. Levy, E. Fabre, and P. L. Guernic, "A calculus of stochastic systems: specification, simulation, and hidden state estimation," Theoretical Comput. Sci., vol. 152, pp. 171-217, 1995.
8. A. Benveniste, E. Fabre, S. Haar, and C. Jard, "Diagnosis of asynchronous discrete-event systems: A net unfolding approach," IEEE Trans. Automat. Contr., pp. 714-727, May 2003.
9. C. Cassandras and S. Lafortune, Introduction to Discrete Event Systems. Norwell, MA: Kluwer, 1999.
10. R. David and H. Alla, "PNs for modeling of dynamical systems: A survey," Automatica, vol. 30, no. 2, pp. 175-202, 1994.
11. J. Desel and J. Esparza, Free Choice Petri Nets. Cambridge, U.K.: Cambridge Univ. Press, 1995.
12. R. Debouk, S. Lafortune. and D. Teneketzis, "Coordinated decentralized protocols for failure diagnosis of discrete event systems," Discrete Event Dyna. Syst.: Theory Applicat., vol. 10, no. (1/2), pp. 33-86, 2000.
13. J. Engelfriet, "Branching processes of PNs," Acta Informatica, vol. 28, pp. 575-591, 1991.
14. J. Esparza, S. Römer, and W. Vogler, "An improvement of McMillan's unfolding algorithm," Formal Meth. Syst. Design, vol. 20, no. (3), pp. 285-310, May 2002.
15. J. Esparza and S. Römer, "An unfolding algorithm for synchronous products of transition systems," in Proc. CONCUR'99, vol. 1664, LNCS, 1999.
16. E. Fabre, A. Benveniste, C. Jard, L. Ricker, and M. Smith, "Distributed state reconstruction for discrete event systems," Proc. 2000 IEEE Control Decision Conf. (CDC), Dec 2000.
17. S. Haar, "Branching processes of general S/T-systems," in Proc. Workshop on Concurrency, MFCS'98, vol. 18, 1998.
18. _, "Occurrence net logics," Fundamente Informaticae, vol. 43, pp. 105-127, 2000.
19. _, "Probabilistic unfoldings and partial order fairness in PNs," in Process Algebra Probabilistic Methods: Proc. PAPM-ProbMiV, vol. 2399, LNCS, H. Hermanns and R. Segala, Eds., 2002, pp. 95-114.
20. _, "Probabilistic cluster unfoldings," Fundaments Informaticae, vol. 53, no. 3-4, pp. 281-314, 2002.
21. P. J. Haas, Stochastic PNs. Modeling, Stability, Simulation. New York: Springer-Verlag, 2002.
22. K. X. He and M. D. Lemmon, "Liveness verification of discrete-event systems modeled by n-safe PNs," presented at the 21st Int. Conf. Application Theory Petri Nets, Aarhus, Denmark, June 2000.
23. _, "On the existence of liveness-enforcing supervisory policies of discrete-event systems modeled by n-safe PNs," presented at the IFAC'2000 Conf. Control Systems Design, Special Session on Petri Nets, Slovakia, June 2000.
24. K. McMillan, Symbolic Model Checking: An Approach to the State Explosion Problem. Norwell, MA: Kluwer, 1993.
25. P. A. Meyer and C. Dellacherie, Probabilités et Potentiels. Paris, France: Hermann, 1975, ch. I-IV.
26. M. Nielsen, G. Plotkin, and G. Winskel, "PNs, event structures, and domains," Theoretical Comput. Sci., vol. 13, pp. 85-108, 1981.
27. M. Raynal, Networks and Distributed Computation: Concepts, Tools and Algorithms. Cambridge, MA: MIT Press, 1988, p. 166.
28. W. Reisig, Petri Nets. New York: Springer-Verlag, 1985.
29. G. Shafer, A Mathematical Theory of Evidence. Princeton, NJ: Princeton Univ. Press, 1976.
30. H. Völzer, "Randomized nonsequential processes," in Proc. CONCUR 2001-12th Int. Conf. Concurrency Theory, vol. 2154, LNCS, Aug. 2001, pp. 184-201.
31. _, "Fairness, randomisierung und konspiration in Verteilten algorithmen," Ph.D. dissertation (in German), Humboldt-Universität zu Berlin Institut für Informatik, Berlin, Germany, 2001.