Abstract
Reset Petri nets extend Petri nets by allowing transitions to empty places, in addition to the usual adding or removing of constants. A Reset Petri net is normalized if the flow function over the Petri arcs (labeled with integers) and the initial state are valuated into {0,1}. In this paper, we give an efficient method to turn a general Reset Petri net into a λ-bisimilar normalized Reset Petri net. Our normalization preserves the main usually studied properties: boundedness, reachability, t-liveness and language (through a λ-labeling function). The main contribution is the improvement of the complexity: our algorithm takes a time in O(size( N) 2), for a Reset Petri net N, while other known normalizations require an exponential space and are presented for Petri nets only.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
