Timed protocol insecurity problem is NP-complete.
Massimo BenerecettiAdriano PeronPublished in: Future Gener. Comput. Syst. (2013)
Keyphrases
- np complete
- computational complexity
- np hard
- satisfiability problem
- randomly generated
- lightweight
- constraint satisfaction problems
- colored petri nets
- pspace complete
- petri net
- conjunctive queries
- communication protocol
- formal analysis
- neural network
- phase transition
- network protocols
- file transfer
- tcp ip
- application layer
- communication protocols
- authentication protocol
- np complete problems
- finite state machines
- conp complete
- query language
- databases