An algorithm for judging liveness of marked graph is presented in this paper. A proof of correctness and a valuation of complexity for the algorithm are also given. The result shows that the algorithm is of polynomial complexity, hence it is a valid algorithm.
Marked Graph, Liveness, circuit, Algorithm
All articles published by Studies in Informatics and Control (SIC) are published in accordance with the terms and conditions of the Creative Commons Attribution License (CC BY-NC-SA 4.0).