The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete.
Kuize ZhangPublished in: Autom. (2017)
Keyphrases
- discrete event systems
- pspace complete
- np complete
- model checking
- petri net
- model based diagnosis
- satisfiability problem
- decision problems
- telecommunication networks
- complex systems
- strips planning
- timed petri nets
- discrete event
- tree automata
- temporal constraints
- temporal logic
- causal graph
- dynamic systems
- np hard
- search algorithm
- database
- search space
- cooperative