Abstract
A Petri net is called fork-attribution if it is choice-free (a unique output transition for each place) and join-free (a unique input place for each transition). Synthesis tries, for a given (finite) labelled transition system (LTS), to find an (unlabelled) Petri net with an isomorphic reachability graph. Synthesis often requires a large set of inequality systems to be solved, making it quite costly. In presynthesis we exploit common necessary properties of some class of Petri nets. If any of the properties do not hold, we can directly dismiss the LTS, it cannot be the reachability graph of a Petri net from our class. This also allows an implementation to give a meaningful response instead of just telling the user that some inequality system is unsolvable. If all properties hold, we may gain additional information that can simplify the inequality systems to be solved. In this paper, we enhance theoretically, and tune algorithmically a presynthesis strategy already known for choice-free nets to fork-attribution nets.
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.
