Diagnosis of asynchronous discrete-event systems: a net unfolding approach

Benveniste, Albert; Fabre, Éric; Haar, Stefan; Jard, Claude

doi:10.1109/tac.2003.811249

Cited by 236 publications

(72 citation statements)

References 40 publications

(75 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The product of a boxed lpo automaton A 1 and a B-automaton A 2 , denoted by A 1 × A 2 is the boxed lpo automaton resulting on the cartesian product of states of these automata and such that (s 1 , s 2 Proof. l ∈ U (L(U B(l) × Mπ Σo B (A))) is equivalent to l ∈ U (L(U B(l) )) and l is an instance of an element of U (L (Mπ Σo B (A))), using definition of ×.…”

Section: Fig 7 Unfolding and Synchronizationmentioning

confidence: 99%

See 1 more Smart Citation

Event Correlation with Boxed Pomsets

Gazagnaire

Hélouët

2007

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper proposes a diagnosis framework for distributed systems based on pomset languages. Diagnosis is performed by projecting these models on a collection of observable labels and then synchronization with an observation. This paper first proposes a new model called boxed pomset languages, which extends classical pomset-based languages as so called High-level Message Sequence Charts. It can describe infinite scenarios, and has good properties with respect to projections. We then give a solution for the event correlation problem (knowing whether two observed alarms are causally related) for pomset languages.

show abstract

Section: Fig 7 Unfolding and Synchronizationmentioning

confidence: 99%

“…Jeron et al [10] describe a similar approach with enhanced fault models. Benveniste et al [2] propose Petri Nets based diagnosis techniques. They recover complete explanations from an incomplete observation using a Petri Net model of the monitored system.…”

Section: Introductionmentioning

confidence: 99%

Event Correlation with Boxed Pomsets

Gazagnaire

Hélouët

2007

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The diagnosis approach in [3,4,9], which the present work builds upon, differs from all of the above in the fact that the asynchronous behaviour is captured by partial order semantics, thus abstracting away time aspects and interleavings of concurrent events in order to fight state space explosion. The system behaviour is given in the form of a Petri net model, where only a subset of transitions is observable.…”

Section: Introductionmentioning

confidence: 99%

“…Then a sequence (or partially ordered scenario) of observations, called alarm pattern, is explainable by several net computations. These explanations are obtained by unfolding the synchronous product of the model net with the alarm pattern, and extracting the maximal configurations compatible with the alarm pattern (see [3]). This approach suffers, for large systems, from the explosion of the size of the global unfolding.…”

Section: Introductionmentioning

confidence: 99%

Distributed Unfolding of Petri Nets

Baldan

Haar

König

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Some recent Petri net-based approaches to fault diagnosis of distributed systems suggest to factor the problem into local diagnoses based on the unfoldings of local views of the system, which are then correlated with diagnoses from neighbouring supervisors. In this paper we propose a notion of system factorisation expressed in terms of pullback decomposition. To ensure coherence of the local views and completeness of the diagnosis, data exchange among the unfolders needs to be specified with care. We introduce interleaving structures as a format for data exchange between unfolders and we propose a distributed algorithm for computing local views of the unfolding for each system component. The theory of interleaving structures is developed to prove correctness of the distributed unfolding algorithm.

show abstract

“…An analogy to the iteration graph is the the reachability graph in the Petri net literature. The reachability graph is used for verification and supervisory control and obtained sometimes via a method called unfolding that simplifies the procedure [4]. Remark 2.…”

Section: Iteration Graphmentioning

confidence: 99%

On Communication Requirements for Multi-agent Consensus Seeking

Fang

Antsaklis

Lecture Notes in Control and Information Science

View full text Add to dashboard Cite

Several consensus protocols have been proposed in the literature and their convergence properties studied via a variety of methods. In all these methods, the communication topologies play a key role in the convergence of consensus processes. The goal of this paper is two fold. First, we explore communication topologies, as implied by the communication assumptions, that lead to consensus among agents. For this, several important results in the literature are examined and the focus is on different classes of communication assumptions being made, such as synchronism, connectivity, and direction of communication. In the latter part of this paper, we show that the confluent iteration graph unifies various communication assumptions and proves to be fundamental in understanding the convergence of consensus processes. In particular, based on asynchronous iteration methods for nonlinear paracontractions, we establish a new result which shows that consensus is reachable under directional, time-varying and asynchronous topologies with nonlinear protocols. This result extends the existing ones in the literature and have many potential applications.

show abstract

Diagnosis of asynchronous discrete-event systems: a net unfolding approach

Cited by 236 publications

References 40 publications

Event Correlation with Boxed Pomsets

Event Correlation with Boxed Pomsets

Distributed Unfolding of Petri Nets

On Communication Requirements for Multi-agent Consensus Seeking

Contact Info

Product

Resources

About