Abstract
Developing applications over a distributed and asynchronous architecture without the need for synchronization services is going to become a central track for distributed computing. This research track will be central for the domain of autonomic computing and self-management. Distributed constraint solving, distributed observation, and distributed optimization, are instances of such applications. This paper is about distributed observation: we investigate the problem of distributed monitoring of concurrent and asynchronous systems, with application to distributed fault management in telecommunications networks.
Our approach combines two techniques: compositional unfoldings to handle concurrency properly, and a variant of graphical algorithms and belief propagation, originating from statistics and information theory.
This work is or has been supported in part by the following projects: MAGDA, MAGDA2, funded by the ministery of research. Other partners of these projects were or are: Alcatel, France Telecom R&D, Ilog, Paris-Nord University.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
extended version, available as IRISA report No 1540, http://www.irisa.fr/bibli/publi/pi/2003/1540/1540.html
Aghasaryan, A., Dousson, C., Fabre, E., Pencolé, Y., Osmani, A.: Modeling Fault Propagation in Telecommunications Networks for Diagnosis Purposes. XVIII World Telecommunications Congress September 22–27, 2002 – Paris, France (2002), Available: http://www.irisa.fr/sigma2/benveniste/pub/topic_distribdiag.html
Benveniste, A., Fabre, E., Jard, C., Haar, S.: 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
Benveniste, A., Haar, S., Fabre, E.: Markov Nets: probabilistic Models for Distributed and Concurrent Systems. INRIA Report 4235 (2001), available electronically at http://www.inria.fr/rrrt/rr-4754.html
Caillaud, B., Badouel, E., Darondeau, P.: Distributing Finite Automata through Petri Net Synthesis. Journal on Formal Aspects of Computing 13, 447–470 (2002)
Cassandras, C., Lafortune, S.: Introduction to discrete event systems. Kluwer Academic Publishers, Dordrecht (1999)
Couvreur, J.-M., Grivet, S., Poitrenaud, D.: Unfolding of Products of Symmetrical Petri Nets. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol. 2075, pp. 121–143. Springer, Heidelberg (2001)
Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge University Press, Cambridge (1995)
Engelfriet, J.: Branching Processes of Petri Nets. Acta Informatica 28, 575–591 (1991)
Esparza, J., Römer, S.: An unfolding algorithm for synchronous products of transition systems. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, p. 2. Springer, Heidelberg (1999)
Fabre, E., Benveniste, A., Jard, C.: Distributed diagnosis for large discrete event dynamic systems. In: Proc of the IFAC congress (July 2002)
Fabre, E.: Compositional models of distributed and asynchronous dynamical systems. In: Proc of the 2002 IEEE Conf. on Decision and Control, Las Vegas, December 1-6 (2002)
Fabre, E.: Monitoring distributed systems with distributed algorithms. In: Proc of the 2002 IEEE Conf. on Decision and Control, Las Vegas, December 2002, pp. 411–416 (2002)
Fabre, E.: Distributed diagnosis for large discrete event dynamic systems (in preparation)
Fabre, E.: Convergence of the turbo algorithm for systems defined by local constraints. IRISA Res. Rep. 1510 (2003)
Goodwin, G.C., Sin, K.S.: Adaptive Filtrering, Prediction, and Control. Prentice-Hall, Upper Sadle River (1984)
Haar, S.: Probabilistic Cluster Unfoldings. Fundamenta Informaticae 53(3-4), 281–314 (2002)
Lamport, L., Lynch, N.: Distributed Computing: Models and Methods. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Formal Models and Semantics, vol. B, pp. 1157–1199. Elsevier, Amsterdam (1990)
Lauritzen, S.L.: Graphical Models. Oxford Statistical Science Series, vol. 17. Oxford University Press, Oxford (1996)
Lauritzen, S.L., Spiegelhalter, D.J.: Local computations with probabilities on graphical structures and their application to expert systems. J. Royal Statistical Society, Series B 50(2), 157–224 (1988)
McEliece, R.J., MacKay, D.J.C., Cheng, J.-F.: Turbo Decoding as an Instance of Pearl’s Belief Propagation Algorithm. IEEE Transactions on Selected Areas in Communication 16(2), 140–152 (1998)
Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures, and domains. Part I. Theoretical Computer Science 13, 85–108 (1981)
Pearl, J.: Fusion, Propagation, and Structuring in Belief Networks. Artificial Intelligence 29, 241–288 (1986)
Rabiner, L.R., Juang, B.H.: An introduction to Hidden Markov Models. IEEE ASSP magazine 3, 4–16 (1986)
Raynal, M.: Distributed Algorithms and Protocols. Wiley & Sons, Chichester (1988)
Reisig, W.: Petri nets. Springer, Heidelberg (1985)
Sampath, M., Sengupta, R., Sinnamohideen, K., Lafortune, S., Teneketzis, D.: Failure diagnosis using discrete event models. IEEE Trans. on Systems Technology 4(2), 105–124 (1996)
Weiss, Y., Freeman, W.T.: On the Optimality of Solutions of the Max-Product Belief-Propagation Algorithm in Arbitrary Graphs. IEEE Trans. on Information Theory 47(2), 723–735 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benveniste, A., Haar, S., Fabre, E., Jard, C. (2003). Distributed Monitoring of Concurrent and Asynchronous Systems. In: Amadio, R., Lugiez, D. (eds) CONCUR 2003 - Concurrency Theory. CONCUR 2003. Lecture Notes in Computer Science, vol 2761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45187-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-45187-7_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40753-9
Online ISBN: 978-3-540-45187-7
eBook Packages: Springer Book Archive