On detectability of labeled Petri nets and finite automata
From MaRDI portal
Publication:2197590
DOI10.1007/s10626-020-00311-3zbMath1448.93038arXiv1802.07551OpenAlexW3012405281MaRDI QIDQ2197590
Publication date: 1 September 2020
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.07551
complexitydecidabilityfinite automatoneventual strong detectabilitylabeled Petri netweak approximate detectability
Formal languages and automata (68Q45) Discrete event control/observation systems (93C65) Observability (93B07)
Related Items (4)
Strong current-state and initial-state opacity of discrete-event systems ⋮ A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems ⋮ Analysis of strong and strong periodic detectability of bounded labeled Petri nets ⋮ Detectability of labeled weighted automata over monoids
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized detectability for discrete event systems
- Supervisor localization. A top-down approach to distributed control of discrete-event systems
- Detectability in stochastic discrete event systems
- An algorithm for calculating indistinguishable states and clusters in finite-state automata with partially observable transitions
- A unified approach for deciding the existence of certain petri net paths
- A structure to decide reachability in Petri nets
- The covering and boundedness problems for vector addition systems
- Supervisor reduction for discrete-event systems
- Verification complexity of a class of observational properties for modular discrete events systems
- Deciding detectability for labeled Petri nets
- Diagnosability of repairable faults
- Codiagnosability of networked discrete event systems subject to communication delays and intermittent loss of observation
- Faults prognosis using partially observed stochastic Petri nets: an incremental approach
- Implementation of inference-based diagnosis: computing delay bound and ambiguity levels
- Detectability of networked discrete event systems
- Complexity of deciding detectability in discrete event systems
- Initial-state detectability of stochastic discrete-event systems with probabilistic sensor failures
- The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete
- A Weighted Pair Graph Representation for Reconstructibility of Boolean Control Networks
- Observability of Boolean Control Networks: A Unified Approach Based on Finite Automata
- On Yen’s Path Logic for Petri Nets
- An Algorithm for the General Petri Net Reachability Problem
- On supervisor reduction in discrete-event systems
- Minimization of Sensor Activation in Decentralized Discrete-Event Systems
- On the Decidability and Complexity of Diagnosability for Labeled Petri Nets
- Diagnosability of discrete-event systems
- Sensor Selection for Structural Observability in Discrete Event Systems Modeled by Petri Nets
- Observability of place/transition nets
- Detectability of Discrete Event Systems
- A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets
- Delayed Detectability of Discrete Event Systems
- Observability, Reconstructibility and State Observers of Boolean Control Networks
This page was built for publication: On detectability of labeled Petri nets and finite automata
