Abstract
We define 2 operators on relations over natural numbers such that they generalize the operators ‘+’ and ‘*’ and show that the membership and emptiness problem of relations constructed from finite relations with these operators and ∪ is decidable. This generalizes Presburger arithmetics and allows to decide the reachability problem for those Petri nets where inhibitor arcs occur only in some restricted way. Especially the reachability problem is decidable for Petri nets with only one inhibitor arc, which solves an open problem in [H. Kleine Büning, T. Lettmann, and E. W. Mayr. Projections of vector addition system reachability sets are semilinear. Theoret. Comput. Sci., 64:343–350, 1989]. Furthermore we describe the corresponding automaton having a decidable emptiness problem.
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.
