Circuit theoretic analysis and synthesis of marked graphs

Marked graphs are a graph model for representing and studying parallel computations and concurrent processes. This paper provides circuit theoretic concepts and methods for the analysis and synthesis of marked graphs. Among the results obtained, the reachability theorem developed in this paper is a generalization of known results in the sense that it does not require two hypotheses: the liveness of an initial marking and the strongly connectedness of marked graphs. A synthesis problem of marked graphs from prescribed markings is proposed, and is shown to be that of realizing cutset matrices as directed graphs.