Skip to main content
Log in

Partial Order Techniques for Distributed Discrete Event Systems: Why You Cannot Avoid Using Them

  • Published:
Discrete Event Dynamic Systems Aims and scope Submit manuscript

Abstract

Monitoring or diagnosis of large scale distributed Discrete Event Systems with asynchronous communication is a demanding task. Ensuring that the methods developed for Discrete Event Systems properly scale up to such systems is a challenge. In this paper we explain why the use of partial orders cannot be avoided in order to achieve this objective. To support this claim, we try to push classical techniques (parallel composition of automata and languages) to their limits and we eventually discover that partial order models arise at some point. We focus on on-line techniques, where a key difficulty is the choice of proper data structures to represent the set of all runs of a distributed system, in a modular way. We discuss the use of previously known structures such as execution trees and unfoldings. We propose a novel and more compact data structure called “trellis.” Then, we show how all the above data structures can be used in performing distributed monitoring and diagnosis. The techniques reported here were used in an industrial context for fault management and alarm correlation in telecommunications networks. This paper is an extended and improved version of the plenary address that was given by the second author at WODES’ 2006.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Aghasaryan A, Jard C, Thomas J (2004) UML specification of a generic model for fault diagnosis of telecommunication networks. In: International communication conference (ICT), August 2004. LNCS, vol 3124. Fortaleza, Brasil, pp 841–847

  • Abbes S, Benveniste A (2005) Branching cells as local states for event structures and nets: probabilistic applications. In: Sassone (ed) FoSSaCSV, vol 3441, pp 95–109

  • Abbes S, Benveniste A (2006) True-concurrency probabilistic models: branching cells and distributed probabilities for event structures. Inf Comput 204(2):231–274

    Article  MATH  Google Scholar 

  • Baldan P, Haar S, König B (2006) Distributed unfolding of petri nets. In: Proc. of FOSSACS 2006. LNCS, vol 3921. Springer, pp 126–141

  • Baroni P, Lamperti G, Pogliano P, Zanella M (1999) Diagnosis of large active systems. Artif Intell. 110:135–183

    Article  MATH  Google Scholar 

  • Benveniste A, Fabre E, Haar S, Jard C (2003) Diagnosis of asynchronous discrete event systems, a net unfolding approach. IEEE Trans. Automat Contr 48(5):714–727

    Article  Google Scholar 

  • Boel RK, van Schuppen JH (2002) Decentralized failure diagnosis for discrete event systems with costly communication between diagnosers. In: Proc. 6th Int. workshop on discrete event systems, WODES’02, pp 175–181

  • Boel RK, Jiroveanu G (2004) Distributed contextual diagnosis for very large systems. In: Proc. of WODES’04, pp 343–348

  • Chatain T, Jard C (2005) Time supervision of concurrent systems using symbolic unfoldings of time petri nets. In: 3rd International conference on formal modelling and analysis of timed systems (FORMATS 2005), September 2005. LNCS, vol 3829, Springer, pp 196–210

  • Contant O, Lafortune S (2004) Diagnosis of modular discrete event systems. In: Proc. of WODES’04, pp 337–342

  • Debouk R, Lafortune S, Teneketzis D (2000) Coordinated decentralized protocols for failure diagnosis of discrete event systems. J Discrete Event Dyn Syst 10(1/2):33–86

    Article  MATH  Google Scholar 

  • Debouk R, Lafortune S, Teneketzis D (2003) On the effect of communication delays in failure diagnosis of decentralized discrete event systems. J Discrete Event Dyn Syst 13(3):263–289

    Article  MATH  Google Scholar 

  • Dousson C, Gaborit P, Ghallab M (1993) Situation recognition: representation and algorithms. IJCAI 1993, 166–174

  • Devillers R, Klaudel H (2004) Solving petri net recursions through finite representation. In: Proc of IASTED’04.

  • Fabre E (2003) Factorization of unfoldings for distributed tile systems, part 1 : limited interaction case, Inria research report no. 4829 http://www.inria.fr/rrrt/rr-4829.html

  • Fabre E (2004) Factorization of unfoldings for distributed tile systems, part 2 : general case, Inria research report no. 5186 http://www.inria.fr/rrrt/rr-5186.html

  • Fabre E (2003) Convergence of the turbo algorithm for systems defined by local constraints, Irisa research report no. PI 1510 http://www.irisa.fr/doccenter/publis/PI/2003/irisapublication.2006-01-27.8249793876

  • Fabre E, Benveniste A, Haar S, Jard C (2005) Distributed monitoring of concurrent and asynchronous systems. J Discrete Event Dyn Syst, 15(1):33–84 (special issue)

    Article  MATH  Google Scholar 

  • Fabre E (2005) Distributed diagnosis based on trellis processes. In: Proc. conf. on decision and control. Sevilla, pp 6329-6334

  • Fabre E, Hadjicostis C (2006) A trellis notion for distributed system diagnosis with sequential semantics. In Proc. of Wodes 2006, 10–12 July 2006. Ann Arbor, USA

  • Fabre E (2007) Habilitation thesis. Uni. Rennes I

  • Fidge CJ (1991) Logical time in distributed computing systems. IEEE Computer 24(8):28–33

    Google Scholar 

  • Genc S, Lafortune S (2003) Distributed diagnosis of discrete-event systems using petri nets. In: Proc. 24th int. conf. on applications and theory of petri nets, June 2003. LNCS vol 2679, pp 316–336

  • Genc S, Lafortune S (2007) Distributed diagnosis of place-bordered petri nets. IEEE Trans Automat Sci Eng 4(2):206–219, April

    Article  Google Scholar 

  • Haar S, Benveniste A, Fabre E, Jard C (2005) Fault diagnosis for distributed asynchronous dynamically reconfigured discrete event systems. In: IFAC world congress praha 2005

  • Jéron T, Marchand H, Pinchinat S, Cordier M-O (2006) Supervision patterns in discrete event systems diagnosis. In: 8th international workshop on discrete event systems, July 2006. Ann Arbor, Michigan, USA, pp 10–12

  • Kumar R, Takai S (2006) Inference-based ambiguity management in decentralized decision making: decentralized diagnosis of discrete event systems, 2006 American Control Conference, Minneapolis

  • Lamperti G, Zanella M (2002) Diagnosis of discrete-event systems from uncertain temporal observations. Artif Intell 137(1–2):91–163

    Article  MATH  Google Scholar 

  • Lamperti G, Zanella M (2003) Diagnosis of active systems: principles and techniques. Kluwer International Series in Engineering and Computer Science, vol 741

  • Lamperti G, Zanella M (2006) Flexible diagnosis of discrete-event systems by similarity-based reasoning techniques. Artif Intell 170(3):232–297

    Article  Google Scholar 

  • Lamperti G, Zanella M (2006) Incremental processing of temporal observations in supervision and diagnosis of discrete-event systems. ICEIS (2) 2006:47–57

  • Lauritzen SL (1996) Graphical models. Oxford Statistical Science Series 17, Oxford Univ. Press

  • Mac Lane S (1998) Categories for the working mathematician. Springer

  • McMillan KL (1992) Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In: Proc. 4th Workshop of computer aided verification. Montreal, pp 164–174

  • McMillan KL (1993) Symbolic Model checking: an approach to the state explosion problem, PhD. thesis, Kluwer

  • Mattern F (1989) Virtual time and global states of distributed systems. In: Cosnard, Quinton, Raynal, Robert (eds) Proc. int. workshop on parallel and distributed algorithms bonas, France, Oct. 1988. North Holland

  • Nielsen M, Plotkin G, Winskel G (1981) Petri nets, event structures and domains. Theor Comput Sci 13(1):85–108

    Article  MATH  Google Scholar 

  • Pearl J (1986) Fusion, propagation, and structuring in belief networks. Artif Intell 29:241–288

    Article  MATH  Google Scholar 

  • Pencole Y, Cordier M-O, Roze L (2002) A decentralized model-based diagnostic tool for complex systems. Int J on Artif Intel Tools, World Scientific Publishing Comp 11(3):327–346

    Article  Google Scholar 

  • Qiu W, Kumar R (2006) Decentralized failure diagnosis of discrete event systems. IEEE Trans Syst Man Cybern Part A 36(2):384–395

    Article  Google Scholar 

  • Qiu W, Kumar R (2006) A new protocol for distributed diagnosis, 2006 American Control Conference. Minneapolis

  • Rauch HE, Tung F, Striebel CT (1965) Maximum likelihood estimates of linear systems. AIAA J (3):1445–1450, August

  • Raynal M (1988) Distributed algorithms and protocols. Wiley & Sons

  • Rozenberg G (ed) (1997) Handbook on graph grammars and computing by graph transformation 1 (Foundations), World Scientific

  • Sampath M, Sengupta R, Lafortune S, Sinnamohideen K, Teneketzis D (1995) Diagnosability of discrete-event systems. IEEE Trans Automat Contr 40(9):1555–1575

    Article  MATH  Google Scholar 

  • Su R (2004) Distributed diagnosis for discrete-event systems, PhD Thesis, Dept of Elec and Comp Eng, Univ. of Toronto

  • Su R, Wonham, WM, Kurien J, Koutsoukos X (2002) Distributed diagnosis for qualitative systems. In: Proc. 6th int. workshop on discrete event systems, WODES’02, pp 169–174

  • Su R, Wonham WM (2006) Hierarchical fault diagnosis for discrete-event systems under global consistency. J Discrete Event Dyn Syst 16(1):39–70, January

    Article  MATH  Google Scholar 

  • Tripakis S (2004) Undecidable problems in decentralized observation and control for regular languages. In: Information Processing Letters, 15 April 2004, vol 90, Issue 1, pp 21–28

  • Yoo T, Lafortune S (2002) A general architecture for decentralized supervisory control of discrete-event systems. J Discrete Event Dyn Syst 12(3):335–377, July

    Article  MATH  Google Scholar 

  • Wang Y, Lafortune S, Yoo T-S (2005) Decentralized diagnosis of discrete event systems using unconditional and conditional decisions. In: Proc. of the 44th IEEE Conference on Decision and Control Sevilla, Spain, 12–15 December 2005

  • Winskel G (1985) Categories of models for concurrency. Seminar on Concurrency, Carnegie-Mellon Univ., July 1984. LNCS, vol. 197, pp 246-267

  • Winskel G (1997) Petri nets, algebras, morphisms, and compositionality. Inf Comput (72):197–238

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Albert Benveniste.

Additional information

This report has been written as a support to the plenary address given by the second author at WODES 2006. This work has been supported in part by joint RNRT contracts Magda and Magda2, with France Telecom R&D and Alcatel, funded by french Ministère de la Recherche, and by direct contracts with Alcatel. This paper reports on experience and joint work with Stefan Haar and Claude Jard, from IRISA. It is based on tight cooperation and interaction with Chistophe Dousson from France Telecom R&D and Armen Aghasaryan from Alcatel.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fabre, E., Benveniste, A. Partial Order Techniques for Distributed Discrete Event Systems: Why You Cannot Avoid Using Them. Discrete Event Dyn Syst 17, 355–403 (2007). https://doi.org/10.1007/s10626-007-0016-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10626-007-0016-1

Keywords

Navigation