Modeling probabilistic logic using Petri nets

We investigate the use of Petri nets to represent the possible worlds in probabilistic logic. We propose a new method to generate the possible worlds based on the reachability tree of the Petri net model. To deal with the size problem where the number of columns in the possible world matrix grows exponentially, it was suggested by Duda et al. (1981) to only generate those highly solution-relevant columns in the possible world matrix, but no concrete algorithm was given, in this paper we proceed to provide a generating algorithm based on Petri net model and further show that simple and intuitive computation can be obtained