Basis Coverability Graph for Partially Observable Petri Nets with Application to Diagnosability Analysis
Open Access
- 8 May 2018
- book chapter
- Published by Springer Nature
- p. 164-183
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- The Complexity of Diagnosability and Opacity Verification for Petri NetsLecture Notes in Computer Science, 2017
- Basis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability ProblemIEEE Transactions on Automatic Control, 2016
- Introduction to Petri Nets2013
- Reducing Interleaving Semantics Redundancy in Reachability Analysis of Time Petri NetsACM Transactions on Embedded Computing Systems, 2013
- A New Approach for Diagnosability Analysis of Petri Nets Using Verifier NetsIEEE Transactions on Automatic Control, 2012
- Discrete event diagnosis using labeled Petri nets. An application to manufacturing systemsControl Engineering Practice, 2011
- Fault detection for discrete event systems using Petri nets with unobservable transitionsAutomatica, 2010
- Marking Estimation of Petri Nets With Silent TransitionsIEEE Transactions on Automatic Control, 2007
- Partial-Order Methods for the Verification of Concurrent Systems1996
- Parallel program schemataJournal of Computer and System Sciences, 1969