Diagnosability verification with Petri net unfoldings

Authors:
Agnes Madalinski;Farid Nouioua;Philippe Dague
Affiliations:
(Correspd. E-mail: amadalin@uach.cl) Faculty of Engineering Science, Univ. Austral de Chile, Valdivia, Chile;Laboratoire des sciences de l'information et des systèmes, Marseille, France;LRI, Univ. Paris-Sud, CNRS/INRIA Saclay, Orsay, France
Venue:
International Journal of Knowledge-based and Intelligent Engineering Systems
Year:
2010

Citing 4
Cited 2

An Improvement of McMillan's Unfolding Algorithm

Formal Methods in System Design
A probabilistic analysis of diagnosability in discrete event systems

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Scalable diagnosability checking of event-driven systems

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Formal verification of diagnosability via symbolic model checking

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence

What topology tells us about diagnosability in partial order semantics

Discrete Event Dynamic Systems
Optimal sensor selection for ensuring diagnosability in labeled Petri nets

Automatica (Journal of IFAC)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Complex systems increasingly require safety and robustness with regards to faults occurrences, and diagnosability is a key property to ensure this at design stage. This paper demonstrates how Petri net unfoldings, which have been proven to elevate the state explosion problem, can be applied to verify diagnosability by adapting the twin plant method.