| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 721456 | IFAC Proceedings Volumes | 2006 | 6 Pages |
Abstract
Deadlock detection is one of the important problems of analysis of discrete parallel systems. There is an efficient method of deadlock detection in Petri nets known as the stubborn set method. It cannot be directly used for the interpreted Petri nets; such net and its underlying Petri net may have different sets of deadlocks. In the article a method of deadlock detection for the generalized parallel discrete systems is presented with the theoretical results proving its correctness; concretization of the method for the interpreted Petri nets and sequent automata is proposed.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Andrei Karatkevich,