The minimum initial submarking problem of Petri nets with application to communication protocol design
説明
The authors analyze the time complexity of the minimum initial submarking problem of Petri nets. The general problem is shown to be NP-hard. Some polynomially solvable subproblems are given, and some approximation algorithms for the problem are proposed. An application of the problem to designing communication protocols is outlined. >
収録刊行物
-
- [Proceedings] 1992 IEEE International Symposium on Circuits and Systems
-
[Proceedings] 1992 IEEE International Symposium on Circuits and Systems 4 1733-1736, 2003-01-02
IEEE