Fault-tolerant computation using algebraic homomorphisms
Fault-tolerant computation using algebraic homomorphisms
Feedback control of Petri nets based on place invariants
Automatica (Journal of IFAC)
Coding approaches to fault tolerance in dynamic systems
Coding approaches to fault tolerance in dynamic systems
Towards a Fault-Tolerant Architecture for Enterprise Application Integration Solutions
OTM '09 Proceedings of the Confederated International Workshops and Posters on On the Move to Meaningful Internet Systems: ADI, CAMS, EI2N, ISDE, IWSSA, MONET, OnToContent, ODIS, ORM, OTM Academy, SWWS, SEMELS, Beyond SAWSDL, and COMBEK 2009
State estimation and fault detection using petri nets
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
International Journal of Applied Mathematics and Computer Science - Semantic Knowledge Engineering
Probabilistic Cluster Unfoldings
Fundamenta Informaticae
| Hi-index | 0.00 |
In this paper we discuss a methodology for monitoring failures and other activity in discrete event systems that are described by Petri nets. Our method is based on embedding the given Petri net model in a larger Petri net that retains the functionality and properties of the given one, perhaps in a non-separate (that is, not immediately identifiable) way. This redundant Petri net embedding introduces "structured redundancy" that can be used to facilitate fault detection, identification and correction, or to offer increased capabilities for monitoring and control. We focus primarily on separate embeddings in which the functionality of the original Petri net is retained in its exact form. Using these embeddings, we construct monitors that operate concurrently with the original system and allow us to detect and identify different types of failures by performing consistency checks between the state of the original Petri net and that of the monitor. The methods that we propose are attractive because the resulting monitors are robust to failures, they may not require explicit acknowledgments from each activity, and their construction is systematic and easily adaptable to restrictions in the available information. We also discuss briefly how to construct nonseparate Petri net embeddings.