Skip to Main content Skip to Navigation

What Topology tells us about Diagnosability in Partial Order Semantics

Stefan Haar 1, 2 
2 MEXICO - Modeling and Exploitation of Interaction and Concurrency
LSV - Laboratoire Spécification et Vérification [Cachan], Inria Saclay - Ile de France
Abstract : From a partial observation of the behaviour of a labeled Discrete Event System, \emph{fault diagnosis} strives to determine whether or not a given ''invisible'' fault event has occurred. The \emph{diagnosability problem} can be stated as follows: does the labeling allow for an outside observer to determine the occurrence of the fault, no later than a bounded number of events after that unobservable occurrence ? When this problem is investigated in the context of concurrent systems, partial order semantics adds to the difficulty of the problem, but also provides a richer and more complex picture of observation and diagnosis. In particular, it is crucial to clarify the intuitive notion of ''\emph{time after fault occurrence}". To this end, we will use a unifying metric framework for event structures, providing a general topological description of diagnosability in both sequential and nonsequential semantics for Petri nets.
Document type :
Complete list of metadata
Contributor : Stefan Haar Connect in order to contact the contributor
Submitted on : Thursday, April 7, 2011 - 11:15:15 AM
Last modification on : Thursday, January 20, 2022 - 4:12:12 PM
Long-term archiving on: : Friday, July 8, 2011 - 2:34:46 AM


Files produced by the author(s)


  • HAL Id : inria-00583666, version 1


Stefan Haar. What Topology tells us about Diagnosability in Partial Order Semantics. [Research Report] RR-7593, INRIA. 2011. ⟨inria-00583666⟩



Record views


Files downloads