Symbolic Diagnosis of Partially Observable Concurrent Systems

Monitoring large distributed concurrent systems is a challenging task. In this paper we formulate (model-based) diagnosis by means of hidden state history reconstruction, from event (e.g. alarm) observations. We follow a so-called true concurrency approach: the model defines explicitly the causal and concurrency relations between the observable events, produced by the system under supervision on different points of observation. The problem is to compute on-the-fly the different partial order histories, which are the possible explanations of the observable events. In this paper we extend our first method based on Petri nets unfolding to high-level parameterized Petri nets. This allows the designer to model data aspects (even on infinite domains) and non deterministic actions. The observation of such an action gives only partial information and the supervisor has to introduce parameters to represent the hidden aspects of the reached state. This supposes that the possible values for the parameters are symbolically computed and refined during supervision. In practice, non deterministic actions can also be used as an approximation to deal with incomplete information about the system. In this case the refinement of the parameters during supervision improves the knowledge of the model.

[1]  Javier Esparza,et al.  An Unfolding Algorithm for Synchronous Products of Transition Systems , 1999, CONCUR.

[2]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[3]  Wolfgang Reisig Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[4]  Albert Benveniste,et al.  Diagnosis of asynchronous discrete event systems, a net unfolding approach , 2002, Sixth International Workshop on Discrete Event Systems, 2002. Proceedings..

[5]  L. Rabiner,et al.  An introduction to hidden Markov models , 1986, IEEE ASSP Magazine.

[6]  Walter Vogler,et al.  An Improvement of McMillan's Unfolding Algorithm , 2002, Formal Methods Syst. Des..

[7]  C. A. Petri,et al.  Concurrency Theory , 1986, Advances in Petri Nets.

[8]  Eric Fabre,et al.  Monitoring distributed systems with distributed algorithms , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[9]  Isabelle Mounier,et al.  Symbolic Executions of Symmetrical Parallel Programs , 1996, PDP.

[10]  Jörg Desel,et al.  Free choice Petri nets , 1995 .

[11]  James L. Peterson,et al.  Petri Nets , 1977, CSUR.

[12]  Graham C. Goodwin,et al.  Adaptive filtering prediction and control , 1984 .

[13]  Kurt Jensen,et al.  Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Vol. 2, Analysis Methods , 1992 .

[14]  Joost Engelfriet,et al.  Branching processes of Petri nets , 1991, Acta Informatica.

[15]  Bonaventure Intercontinental,et al.  ON DECISION AND CONTROL , 1985 .

[16]  Kurt Jensen,et al.  Coloured Petri Nets: Modelling and Validation of Concurrent Systems , 2009 .

[17]  Christos G. Cassandras,et al.  Introduction to Discrete Event Systems , 1999, The Kluwer International Series on Discrete Event Dynamic Systems.

[18]  Maciej Koutny,et al.  Branching Processes of High-Level Petri Nets , 2003, TACAS.

[19]  Stéphane Lafortune,et al.  Failure diagnosis using discrete event models , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.