Abstract
Large distributed system inherently display concurrency, i.e. the fact that several “independent” events may happen in parallel. The more components in a distributed system are independent (or less coupled), the more this feature appears. With its immediate consequence: handling trajectories as sequences of events means representing an explosive number of possible interleavings of concurrent events. To turn independence/concurrency into an advantage rather than an opponent, a key idea is to adopt a true concurrency semantics, that represents runs of a distributed system as partial orders of events. The chapter introduces ways to represent and handle sets of trajectories in such semantics, in particular by means of Petri net unfoldings. It is then explained how one can perform diagnosis with such objects, in the sense of discovering which trajectories of a concurrent system can explain a set of distributed and partially ordered observations. This framework is then extended to the distributed case, where each component aims at building its local view of the diagnosis. Finally, diagnosability issues are examined in the setting of true concurrency semantics, that is the possibility of detecting the occurrence of an unobservable fault not later than after a limited execution following that fault.
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
Abbes, S.: The (True) Concurrent Markov Property and Some Applications to Markov Nets. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 70–89. Springer, Heidelberg (2005)
Abbes, S., Benveniste, A.: Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 95–109. Springer, Heidelberg (2005)
Abbes, S., Benveniste, A.: Probabilistic true-concurrency models: branching cells and distributed probabilities for event structures. Information & Computation 204(2), 231–274 (2006)
Abbes, S., Benveniste, A.: Probabilistic true-concurrency models: Markov nets and a law of large numbers. Theoretical Computer Science 390(2-3), 129–170 (2008)
Abbes, S., Benveniste, A.: Concurrency, σ-Algebras, and Probabilistic Fairness. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 380–394. Springer, Heidelberg (2009)
Baldan, P., Haar, S., König, B.: Distributed Unfolding of Petri Nets. In: Aceto, L., Ingólfsdóttir, A. (eds.) FOSSACS 2006. LNCS, vol. 3921, pp. 126–141. Springer, Heidelberg (2006)
Baldan, P., Chatain, T., Haar, S., König, B.: Unfolding-based diagnosis of systems with an evolving topology. Information and Computation 208(10), 1169–1192 (2010)
Bauer, A., Pinchinat, S.: A topological perspective on diagnosis. In: 9th International Workshop on Discrete Event Systems, Gothenburg, Sweden (2008)
Benveniste, A., Fabre, E., Haar, S.: Markov nets: Probabilistic models for distributed and concurrent systems. IEEE Transactions on Automatic Control 48(11), 1936–1950 (2003)
Benveniste, A., Fabre, E., Haar, S., Jard, C.: Diagnosis of asynchronous discrete event systems: A net unfolding approach. IEEE Transactions on Automatic Control 48(5), 714–727 (2003)
Bouillard, A., Haar, S., Rosario, S.: Critical Paths in the Partial Order Unfolding of a Stochastic Petri Net. In: Ouaknine, J., Vaandrager, F.W. (eds.) FORMATS 2009. LNCS, vol. 5813, pp. 43–57. Springer, Heidelberg (2009)
Cabasino, M.P., Giua, A., Seatzu, C.: Diagnosability of bounded Petri nets. In: Proc. 48th IEEE Conference on Decision and Control, Shangai, China (2009)
Cabasino, M.P., Giua, A., Lafortune, S., Seatzu, C.: Diagnosability analysis of unbounded Petri nets. In: Proc. 48th IEEE Conference on Decision and Control, Shangai, China (2009)
Cassandras, C.G., Lafortune, S.: Introduction to Discrete Event Systems, 2nd edn. Springer (2008)
Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific (1995)
Fabre, E.: Distributed diagnosis based on trellis processes. In: 44th Conference on Decision and Control, Seville, Spain (2005)
Fabre, E., Benveniste, A., Haar, S., Jard, C.: Distributed monitoring of concurrent and asynchronous systems. Discrete Event Dynamic Systems: Theory and Applications 15(1), 33–84 (2005)
Fabre, E.: On the construction of pullbacks for safe Petri nets. In: Applications and Theory of Petri Nets and other Models of Concurrency, Turku, Finland (2006)
Fabre, E.: Trellis processes: A compact representation for runs of concurrent systems. Discrete Event Dynamic Systems 17, 267–306 (2007)
Haar, S.: Probabilistic cluster unfoldings. Fundamenta Informaticae 53(3-4), 281–314 (2002)
Haar, S., Benveniste, A., Fabre, A., Jard, C.: Fault diagnosis for distributed asynchronous dynamically reconfigured discrete event systems. In: Proc. 16th IFAC World Congress, Prague, Czech Republic (2005)
Haar, S.: Unfold and cover: Qualitative diagnosability for Petri nets. In: Proc. 46th IEEE Conference on Decision and Control, New Orleans, LA, USA (2007)
Haar, S.: Qualitative diagnosability of labeled Petri nets revisited. In: Proc. 48th IEEE Conference on Decision and Control and 28th Chinese Control Conference (CDC 2009), Shanghai, China (2009)
Haar, S.: Types of asynchronous diagnosability and the reveals-relation in occurrence nets. IEEE Transactions on Automatic Control 55(10), 2310–2320 (2010)
Haar, S.: What topology tells us about diagnosability in partial order semantics. In: Proc. 10th Workshop on Discrete Event Systems, Berlin (2010)
Kummetz, R., Kuske, D.: The topology of Mazurkiewicz Traces. Theoretical Computer Science 305, 237–258 (2003)
Madalinski, A., Fabre, E.: Modular Construction of Finite and Complete Prefixes of Petri Net Unfoldings. Fundamenta Informaticae 95(1), 219–244 (2009)
Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures and domains (I). Theoretical Computer Science 13, 85–108 (1981)
Nouioua, F., Madalinski, A., Dague, P.: Diagnosability verification with Petri net unfoldings. KES Journal 14(2), 49–55 (2010); Long version: Rapport de recherche No. 1516, UMR 8623, CNRS. Université Paris-Sud (March 2009)
Römer, S., Esparza, J., Vogler, W.: An improvement of Mcmillan’s unfolding algorithm. Formal Methods in System Design 20(3), 285–310 (2002)
Sampath, M., Sengupta, R., Lafortune, S., Sinnamohideen, K., Teneketzis, D.: Diagnosability of discrete-event systems. IEEE Transactions on Automatic Control 40(9), 1555–1575 (1995)
Wang, Y., Lafortune, S., Yoo, T.-S.: Decentralized diagnosis of discrete event systems using unconditional and conditional decisions. In: Proc. 44th IEEE Conference on Decision and Control, Seville, Spain (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this chapter
Cite this chapter
Haar, S., Fabre, E. (2013). Diagnosis with Petri Net Unfoldings. In: Seatzu, C., Silva, M., van Schuppen, J. (eds) Control of Discrete-Event Systems. Lecture Notes in Control and Information Sciences, vol 433. Springer, London. https://doi.org/10.1007/978-1-4471-4276-8_15
Download citation
DOI: https://doi.org/10.1007/978-1-4471-4276-8_15
Publisher Name: Springer, London
Print ISBN: 978-1-4471-4275-1
Online ISBN: 978-1-4471-4276-8
eBook Packages: EngineeringEngineering (R0)