Deciding detectability for labeled Petri nets

DOI10.1016/j.automatica.2019.02.058zbMath1415.93063arXiv1802.02087OpenAlexW2962780884WikidataQ128182914 ScholiaQ128182914MaRDI QIDQ1737932

Xiang Yin, Tomáš Masopust

Publication date: 24 April 2019

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.02087

zbMATH Keywords

complexityPetri netsdecidabilitydiscrete event systemsdetectability

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Observability (93B07) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (8)

An improved approach for verifying delayed detectability of discrete-event systems ⋮ Initial-state detectability and initial-state opacity of unambiguous weighted automata ⋮ On detectability of labeled Petri nets and finite automata ⋮ Deciding detectability for labeled Petri nets ⋮ A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems ⋮ Verification of C-detectability using Petri nets ⋮ 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
• Generalized detectability for discrete event systems
• A unified approach for deciding the existence of certain petri net paths
• Verification of detectability in probabilistic finite automata
• Verification complexity of a class of observational properties for modular discrete events systems
• Deciding detectability for labeled Petri nets
• Complexity of deciding detectability in discrete event systems
• Decidability of opacity verification problems in labeled Petri net 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
• ON YEN'S PATH LOGIC FOR PETRI NETS
• Observability of discrete event dynamic systems
• On the Decidability and Complexity of Diagnosability for Labeled Petri Nets
• Detectability of Discrete Event Systems
• A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets
• Delayed Detectability of Discrete Event Systems

This page was built for publication: Deciding detectability for labeled Petri nets