Time Supervision of Concurrent Systems Using Symbolic Unfoldings of Time Petri Nets
Monitoring real-time concurrent systems is a challenging task. In this paper we formulate (model-based) supervision by means of hidden state history reconstruction, from event (e.g. alarm) observations. We follow a so-called true concurrency approach using time Petri nets: the model defines explicitly the causal and concurrency relations between the observable events, produced by the system under supervision on different points of observation, and constrained by time aspects. The problem is to compute on-the-fly the different partial order histories, which are the possible explanations of the observable events. We do not impose that time is observable: the aim of supervision is to infer the partial ordering of the events and their possible firing dates. This is achieved by considering a model of the system under supervision, given as a time Petri net, and the on-the-fly construction of an unfolding, guided by the observations. Using a symbolic representation, this paper presents a new definition of the unfolding of time Petri nets with dense time.
KeywordsPartial State Extended Process Concurrent System Extended Event Input Place
Unable to display preview. Download preview PDF.
- 1.Aura, T., Lilius, J.: Time processes for time Petri nets. In: ICATPN, pp. 136–155 (1997)Google Scholar
- 4.Berthomieu, B., Vernadat, F.: State class constructions for branching analysis of time Petri nets. In: TACAS, pp. 442–457 (2003)Google Scholar
- 6.Chatain, T., Jard, C.: Symbolic diagnosis of partially observable concurrent systems. In: FORTE, pp. 326–342 (2004)Google Scholar
- 7.Chatain, T., Jard, C.: Time supervision of concurrent systems using symbolic unfoldings of time petri nets. Technical Report RR-5076, Institut National de Recherche en Informatique et en Automatique, INRIA (2005)Google Scholar
- 9.Esparza, J., Römer, S., Vogler, W.: An improvement of McMillan’s unfolding algorithm. In: TACAS, pp. 87–106 (1996)Google Scholar
- 10.Fleischhack, H., Stehno, C.: Computing a finite prefix of a time Petri net. In: ICATPN, pp. 163–181 (2002)Google Scholar
- 11.Merlin, P.M., Farber, D.J.: Recoverability of communication protocols – implications of a theorical study. IEEE Transactions on Communications 24 (1976)Google Scholar
- 12.Pradin-Chézalviel, B., Valette, R., Künzle, L.A.: Scenario duration characterization of t-timed Petri nets using linear logic. In: IEEE PNPM, pp. 208–217 (1999)Google Scholar