Prefix Codes Determined by Petri Nets

摘要

This paper deals with mathematical problems concerning Petri nets. For a given Petri net with an initial marking μ, we define naturally an automaton Which has the initial marking as the initial state, the reachability set Re(μ) as the Set of states, and the set of transitions as the set of inputs. The method analogous To the one used to produce a prefix code from an automaton can be applied to Petri nets. We define five types of prefix codes by considering the set of all firing Sequences on which the net arrives from the positive initial marking of a Petri net To some subset of the reachability set and study fundamental properties of these Codes.