On the computational complexity of the verification of modular discrete-event systems.
Kurt RohloffStéphane LafortunePublished in: CDC (2002)
Keyphrases
- discrete event systems
- computational complexity
- petri net
- complex systems
- model based diagnosis
- telecommunication networks
- failure diagnosis
- discrete event
- timed petri nets
- model checking
- high computational complexity
- np complete
- special case
- np hard
- temporal constraints
- computational cost
- signature verification
- visual information
- dynamic systems
- modular structure
- database
- optimal solution