Pages that link to "Item:Q1737932"
From MaRDI portal
The following pages link to Deciding detectability for labeled Petri nets (Q1737932):
Displaying 15 items.
- Deciding detectability for labeled Petri nets (Q1737932) (← links)
- Detectability of networked discrete event systems (Q1790664) (← links)
- Complexity of deciding detectability in discrete event systems (Q1797011) (← links)
- Verification of C-detectability using Petri nets (Q2023240) (← links)
- Analysis of strong and strong periodic detectability of bounded labeled Petri nets (Q2060875) (← links)
- On verification of D-detectability for discrete event systems (Q2065231) (← links)
- Detectability of labeled weighted automata over monoids (Q2081085) (← links)
- On detectability of labeled Petri nets and finite automata (Q2197590) (← links)
- The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete (Q2409237) (← links)
- An improved approach for verifying delayed detectability of discrete-event systems (Q2663854) (← links)
- Initial-state detectability and initial-state opacity of unambiguous weighted automata (Q2664211) (← links)
- Deciding Selective Declassification of Petri Nets (Q2894328) (← links)
- A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems (Q5158671) (← links)
- On the verification of detectability for timed discrete event systems (Q6550243) (← links)
- Path detectability verification for time-dependent systems with application to flexible manufacturing systems (Q6658942) (← links)