{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:20:24Z","timestamp":1760242824041,"version":"build-2065373602"},"reference-count":17,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2016,8,18]],"date-time":"2016-08-18T00:00:00Z","timestamp":1471478400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>Prevention and avoidance of deadlocks in sensor networks that use the wormhole routing algorithm is an active research domain. There are diverse control policies that will address this problem being our approach a new method. In this paper we present a virtual control policy for the new specialized Petri net subclass called Binary Ordered Resources Petri Net (BORPN). Essentially, it is an ordinary class constructed from various state machines that share unitary resources in a complex form, which allows branching and joining of processes. The reduced structure of this new class gives advantages that allow analysis of the entire system\u2019s behavior, which is a prohibitive task for large systems because of the complexity and routing algorithms.<\/jats:p>","DOI":"10.3390\/s16081307","type":"journal-article","created":{"date-parts":[[2016,8,18]],"date-time":"2016-08-18T09:58:54Z","timestamp":1471514334000},"page":"1307","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Virtual Control Policy for Binary Ordered Resources Petri Net Class"],"prefix":"10.3390","volume":"16","author":[{"given":"Carlos","family":"Rovetto","sequence":"first","affiliation":[{"name":"Computer Systems Engineering Department, Technological University of Panama, 0819-07289, El Dorado, Panama City, Republic of Panama"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1s","family":"Concepci\u00f3n","sequence":"additional","affiliation":[{"name":"Computer Systems Engineering Department, Technological University of Panama, 0819-07289, El Dorado, Panama City, Republic of Panama"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elia","family":"Cano","sequence":"additional","affiliation":[{"name":"Computer Systems Engineering Department, Technological University of Panama, 0819-07289, El Dorado, Panama City, Republic of Panama"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2016,8,18]]},"reference":[{"key":"ref_1","unstructured":"Tricas, F. (2003). Analysis, Prevention and Avoidance of Deadlocks in Sequential Resource Allocation Systems, University of Zaragoza."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1109\/TSMCA.2005.855751","article-title":"Computing minimal siphons in Petri net models of resource allocation systems: A parallel solution","volume":"36","author":"Tricas","year":"2006","journal-title":"IEEE Trans. Syst. Man Cybern. Part A"},{"key":"ref_3","first-page":"215","article-title":"Deadlock prevention for sequence resource allocation systems","volume":"23","author":"Huang","year":"2007","journal-title":"J. Inf. Sci. Eng."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1109\/12.926158","article-title":"Symbolic analysis of bounded Petri nets","volume":"50","author":"Pastor","year":"2001","journal-title":"IEEE Trans. Comput."},{"key":"ref_5","unstructured":"Klai, K., Tata, S., and Desel, J. (2009). Business Process Management, Springer-Verlag."},{"key":"ref_6","unstructured":"Ciardo, G. (2007). Formal Methods for Performance Evaluation, Springer-Verlag."},{"key":"ref_7","unstructured":"Boel, R., and Stremersch, G. (2000). Structurally Safe Net Systems, Kluwer Academic Press."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1028","DOI":"10.1016\/j.automatica.2011.01.070","article-title":"Design of a maximally permissive liveness-enforcing supervisor with a compressed supervisory structure for flexible manufacturing systems","volume":"47","author":"Chen","year":"2011","journal-title":"Automatica"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1109\/TASE.2010.2060332","article-title":"Design of a maximally permissive liveness-enforcing Petri net supervisor for flexible manufacturing systems","volume":"8","author":"Chen","year":"2011","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Chen, Y.F., Li, Z.W., Barkaoui, K., Wu, N.Q., and Zhou, M.C. (2016). Compact supervisory control of discrete event systems by Petri nets with data inhibitor arcs. IEEE Trans. Syst. Man Cybern. Syst.","DOI":"10.1109\/TSMC.2016.2521833"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Cano, E., Rovetto, A., and Colom, J. (2010, January 13\u201316). On the computation of the minimal siphons of S4PR nets from a generating family of siphons. Proceedings of the 15th IEEE International Conference on Emerging Technologies and Factory Automation, Bilbao, Spain.","DOI":"10.1109\/ETFA.2010.5641317"},{"key":"ref_12","unstructured":"Cano, E.E., Rovetto, C.A., and Colom, J.M. (September, January 30). An algorithm to compute the minimal siphons in S4PR nets. Proceedings of the 10th International Workshop on Discrete Event Systems (WODES), Berlin, Germany."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/5.24143","article-title":"Petri nets: Properties, analysis and applications","volume":"77","author":"Murata","year":"1989","journal-title":"Proc. IEEE"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1145\/356586.356588","article-title":"System deadlocks","volume":"3","author":"Coffman","year":"1971","journal-title":"ACM Comput. Surv."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Rovetto, C.A., Cano, E.E., and Colom, J. (2010, January 10\u201313). Deadlock analysis in minimal adaptive routing algorithms using Petri nets. Proceedings of the 2010 IEEE International Conference on Systems, Man, and Cybernetics, Istanbul, Turkey.","DOI":"10.1109\/ICSMC.2010.5641904"},{"key":"ref_16","unstructured":"Concepci\u00f3n, T., Rovetto, C.A., and Cano, E.E. (2016, January 21\u201322). Clase Red de Petri para Usos de Recursos Binarios Ordenados. Proceedings of the Ambient Intelligence, Software Engineering and Electronic and Mobile Health\u2014(AmISEmeH 2016), Rio Hato, Panama. (In Spanish)."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10626-012-0132-4","article-title":"An Algorithm to Compute the Minimal Siphons in S4PR Nets","volume":"22","author":"Cano","year":"2012","journal-title":"Discrete Event Dyn. Syst."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/16\/8\/1307\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T19:28:38Z","timestamp":1760210918000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/16\/8\/1307"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,18]]},"references-count":17,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2016,8]]}},"alternative-id":["s16081307"],"URL":"https:\/\/doi.org\/10.3390\/s16081307","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2016,8,18]]}}}