Decidability results in first-order hybrid Petri nets (Q5930251): Difference between revisions

A First-Order Hybrid Petri Net (FOHPN) is a system \(N=(P, T, \text{Pre,Post}, C)\), where \(C : T_{c} \to \mathbb{R}^{+}_{0} \times \mathbb{R}^{+}_{\infty}\) specifies the firing speeds associated to continuous transitions. In this paper a special class of FOHPN is determined, consisting of nets, satisfying the conditions: \(\text{Pre, Post}\in \mathbb{N}^{n \times q}\), \(T_{c}= \{ t_{c} \}\), \({}^{\bullet}t_{c}= \emptyset\), \(C(t_{c})=(v,v)\) \((v \in \mathbb{N}^{+})\), \(\{w_{i}= \text{Post} (p_{i}, t_{c}) \mid p_{i} \in P_{c} \}\) is a set of positive integers such that \(\text{GCD} ( w_{1} , \dots , w_{n_{c}}) = 1\). Elements of this class are named Single-Rate FOHPN (SRHPN). It is established that the reachability problem for SRHPN is decidable. The method of proof is based on reducing to a reachability problem for a corresponding discrete PN (it is known that the last one is decidable).