Pages that link to "Item:Q4686521"
From MaRDI portal
The following pages link to The Complexity of Diagnosability and Opacity Verification for Petri Nets (Q4686521):
Displaying 9 items.
- The complexity of diagnosability and opacity verification for Petri nets (Q1662539) (← links)
- Online verification of \(K\)-step opacity by Petri nets in centralized and decentralized structures (Q2081818) (← links)
- Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems (Q2348371) (← links)
- Verification of opacity and diagnosability for pushdown systems (Q2375627) (← links)
- A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems (Q5158671) (← links)
- Corrections to “On the Decidability and Complexity of Diagnosability for Labeled Petri Nets” [Nov 17 5931-5938] (Q5223685) (← links)
- State-based opacity of labeled real-time automata (Q6122597) (← links)
- A semi-symbolic diagnoser for fault diagnosis of bounded labeled Petri nets (Q6569829) (← links)
- Diagnosability of labeled \(\mathfrak{D}_{\mathfrak{p}}\)-automata (Q6614006) (← links)