Distributed monitoring of concurrent and asynchronous systems

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

Volumn 2761, Issue , 2003, Pages 1-26

  Benveniste, Albert ^a   Haar, Stefan ^a   Fabre, Eric ^a   Jard, Claude ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

Asynchronous; Belief propagation; Concurrent; Distributed; Event structures; Fault diagnosis; Fault management; Unfoldings

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; FAILURE ANALYSIS; FAULT DETECTION; INFORMATION SERVICES; INFORMATION THEORY; TELECOMMUNICATION NETWORKS;

ASYNCHRONOUS; BELIEF PROPAGATION; CONCURRENT; DISTRIBUTED; EVENT STRUCTURES; FAULT MANAGEMENT; UNFOLDINGS;

COMPUTATION THEORY;

EID: 24644508439     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45187-7_1     Document Type: Article

References (28)

1. extended version, available as IRISA report No 1540 http://www.irisa.fr/bibli/publi/pi/2003/1540/1540.html
2. A. Aghasaryan, C. Dousson, E. Fabre, Y. Pencolé, A. Osmani. Modeling Fault Propagation in Telecommunications Networks for Diagnosis Purposes. XVIII World Telecommunications Congress 22-27 September 2002 - Paris, France. Available: http://www.irisa.fr/sigma2/benveniste/pub/topic_distribdiag.html
3. A. Benveniste, E. Fabre, C. Jard, and S. Haar. Diagnosis of asynchronous discrete event systems, a net unfolding approach. IEEE Trans. on Automatic Control, 48(5), May 2003. Preliminary version available from http://www.irisa.fr/sigma2/benveniste/pub/IEEE_TAC_AsDiag_2003.html
4. A. Benveniste, S. Haar, and E. Fabre. Markov Nets: probabilistic Models for Distributed and Concurrent Systems. INRIA Report 4235, 2001; available electronically at http://www.inria.fr/rrrt/rr-4754.html.
5. B. Caillaud, E. Badouel and Ph. Darondeau. Distributing Finite Automata through Petri Net Synthesis. Journal on Formal Aspects of Computing, 13, 447-470, 2002.
6. C. Cassandras and S. Lafortune. Introduction to discrete event systems. Kluwer Academic Publishers, 1999.
7. J.-M. Couvreur, S. Grive t, D. Poitrenaud, Unfolding of Products of Symmetrical Petri Nets, 22nd International Conference on Applications and Theory of Petri Nets (ICATPN 2001), Newcastle upon Tyne, UK, June 2001, LNCS 2075, pp. 121-143.
8. J. Desel, and J. Esparza. Free Choice Petri Nets. Cambridge University Press, 1995.
9. J. Engelfriet. Branching Processes of Petri Nets. Acta Informatica 28, 1991, pp. 575-591.
10. J. Esparza, S. Römer. An unfolding algorithm for synchronous products of transition systems. in proc. of CONCUR'99, LNCS Vol. 1664, Springer Verlag, 1999.
11. E. Fabre, A. Benveniste, C. Jard. Distributed diagnosis for large discrete event dynamic systems. In Proc of the IFAC congress, Jul. 2002.
12. E. Fabre. Compositional models of distributed and asynchronous dynamical systems. In Proc of the 2002 IEEE Conf. on Decision and Control, 1-6, Dec. 2002, Las Vegas, 2002.
13. E. Fabre. Monitoring distributed systems with distributed algorithms. In Proc of the 2002 IEEE Conf. on Decision and Control, 411-416, Dec. 2002, Las Vegas, 2002.
14. E. Fabre. Distributed diagnosis for large discrete event dynamic systems. In preparation.
15. E. Fabre. Convergence of the turbo algorithm for systems defined by local constraints. IRISA Res. Rep. 1510, 2003.
16. G.C. Goodwin and K.S. Sin. Adaptive Filtrering, Prediction, and Control. Prentice-Hall, Upper Sadle River, N.J. 1984.
17. S. Haar. Probabilistic Cluster Unfoldings. Fundamenta Informaticae 53(3-4), 281-314, 2002.
18. L. Lamport and N. Lynch. Distributed Computing: Models and Methods, in Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, Jan van Leeuwen, editor, Elsevier (1990), 1157-1199.
19. S.L. Lauritzen. Graphical Models, Oxford Statistical Science Series 17, Oxford University Press, 1996.
20. S.L. Lauritzen and D.J. Spiegelhalter. Local computations with probabilities on graphical structures and their application to expert systems. J. Royal Statistical Society, Series B, 50(2), 157-224, 1988.
21. R.J. McEliece, D.J.C. MacKay, J.-F. Cheng, Turbo Decoding as an Instance of Pearl's Belief Propagation Algorithm. IEEE Transactions on Selected Areas in Communication, 16(2), 140-152, Feb. 1998.
22. M. Nielsen and G. Plotkin and G. Winskel. Petri nets, event structures, and domains. Part I. Theoretical Computer Science 13:85-108, 1981.
23. J. Pearl. Fusion, Propagation, and Structuring in Belief Networks. Artificial Intelligence, 29, 241-288, 1986.
24. L.R. Rabiner and B.H. Juang. An introduction to Hidden Markov Models. IEEE ASSP magazine 3, 4-16, 1986.
25. M. Raynal. Distributed Algorithms and Protocols. Wiley & Sons, 1988.
26. W. Reisig. Petri nets. Springer Verlag, 1985.
27. M. Sampath, R. Sengupta, K. Sinnamohideen, S. Lafortune, and D. Teneketzis. Failure diagnosis using discrete event models. IEEE Trans. on Systems Technology, 4(2), 105-124, March 1996.
28. Y. Weiss, W.T. Freeman, On the Optimality of Solutions of the Max-Product Belief-Propagation Algorithm in Arbitrary Graphs. IEEE Trans. on Information Theory, 47(2), 723-735, Feb. 2001.