Author/Authors
Boucerredj, Leila University Badji-Mokhtar Annaba - Faculty of Engineering - Department of electronics, Laboratory of Automatic and Signals - Annaba (LASA), Algeria , Debbache, Nasr Eddine University Badji-Mokhtar Annaba - Faculty of Engineering - Department of electronics, Laboratory of Automatic and Signals - Annaba (LASA), Algeria
Title Of Article
Minimality of critical scenarios with linear logic and cutsets
شماره ركورد
31196
Abstract
This work proposes a new approach for analyzing the dependability of mechatronic systems; its goal is to extract all minimal feared scenarios that lead a system in a state of failure, directly from the proof trees of linear logic to establish the causality between undesirable events and normal operations. The proof trees of linear logic contain events that are the result of event in the scenario, but not strictly necessary for the final production of the critical feared state. The size of the proof tree is proportional to the number of firing transitions in the sequent provable. The proposed approach is based on the concept of minimal cutsets of the fault tree method applied to the proof trees of linear logic of Petri net model in an unknown context. The aim is to reduce the size of the proof trees of linear logic and generate a minimum number of feared scenarios.
From Page
42
NaturalLanguageKeyword
Dependability , Mechatronic systems , Petri net , Linear logic , Minimal Feared scenarios , Cutsets
JournalTitle
Revue Des Sciences Et De La Technologie, Synthèse
To Page
50
JournalTitle
Revue Des Sciences Et De La Technologie, Synthèse
Link To Document