An Efficient Algorithm for Finding Structural Deadlocks in Colored Petri Nets.
Kamel BarkaouiClaude DutheilletSerge HaddadPublished in: Application and Theory of Petri Nets (1993)
Keyphrases
- dynamic programming
- preprocessing
- improved algorithm
- times faster
- matching algorithm
- detection algorithm
- np hard
- experimental evaluation
- computational cost
- input data
- memory efficient
- computationally efficient
- high accuracy
- computational complexity
- k means
- linear programming
- objective function
- convergence rate
- search space
- segmentation algorithm
- significant improvement
- learning algorithm
- worst case
- experimental study
- ant colony optimization
- tree structure
- theoretical analysis
- selection algorithm
- optimal solution
- highly efficient