An Efficient Polynomial-Time Algorithm to Decide Liveness and Boundedness of Free-Choice Nets.
Peter KemperFalko BausePublished in: Application and Theory of Petri Nets (1992)
Keyphrases
- theoretical analysis
- worst case
- significant improvement
- memory efficient
- preprocessing
- high accuracy
- cost function
- similarity measure
- optimization algorithm
- learning algorithm
- dynamic programming
- improved algorithm
- times faster
- matching algorithm
- computational complexity
- computationally efficient
- simulated annealing
- search space
- k means
- probabilistic model
- computational cost
- input data
- particle swarm optimization
- sufficient conditions
- optimal solution
- detection algorithm
- clustering method
- np hard
- causal graph