The Diagnosability of Petri Net Models Using Minimal Explanations
Volume: 55, Issue: 7, Pages: 1663 - 1668
Published: Jul 1, 2010
Abstract
For a bounded Petri Net model the diagnosability property is usually checked via its regular language represented by the reachability graph RG. However, this is problematic because the computational complexity of the diagnosability test is polynomial in the cardinality of the state space of the model which is typically very large. This limitation can be overcome by using for the diagnosability test an ROF-automaton, with a state space...
Paper Details
Title
The Diagnosability of Petri Net Models Using Minimal Explanations
Published Date
Jul 1, 2010
Volume
55
Issue
7
Pages
1663 - 1668
Citation AnalysisPro
You’ll need to upgrade your plan to Pro
Looking to understand the true influence of a researcher’s work across journals & affiliations?
- Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
- Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.
Notes
History