Journals Proceedings

Abstract

It is shown that Shannon’s information capacity calculation metric (originally developed for discrete noiseless channels) can be used for constrainedness quantification of Petri Net based models if they are k-bounded and deadlock free. The proposed approach includes generation of finite marking reachability graph from a given restricted Petri Net based model followed by capacity calculation using the graph by setting up an analogy between Petri Net transitions and letters of Shannon languages.