Verification of C-detectability using Petri nets
From MaRDI portal
Publication:2023240
DOI10.1016/j.ins.2020.04.024zbMath1459.68146arXiv1903.07827OpenAlexW2921227100MaRDI QIDQ2023240
Jin Guo, Hao Lan, Yin Tong, Carla Seatzu
Publication date: 3 May 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.07827
Discrete event control/observation systems (93C65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (2)
Analysis of strong and strong periodic detectability of bounded labeled Petri nets ⋮ Detectability of labeled weighted automata over monoids
Uses Software
Cites Work
- Comparative analysis of related notions of opacity in centralized and coordinated architectures
- Generalized detectability for discrete event systems
- Fault detection for discrete event systems using Petri nets with unobservable transitions
- On observability of discrete-event systems
- Deciding detectability for labeled Petri nets
- Complexity of deciding detectability in discrete event systems
- The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete
- Introduction to Discrete Event Systems
- Finding All the Elementary Circuits of a Directed Graph
- Observer-Based State-Feedback Control of Timed Petri Nets With Deadlock Recovery
- Marking Estimation of Petri Nets With Silent Transitions
- Detectability of Discrete Event Systems
- Basis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem
- Verification of State-Based Opacity Using Petri Nets
- A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets
- Delayed Detectability of Discrete Event Systems
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: Verification of C-detectability using Petri nets
