{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:18:45Z","timestamp":1750306725916,"version":"3.41.0"},"reference-count":20,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2015,2,17]],"date-time":"2015-02-17T00:00:00Z","timestamp":1424131200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"EPSRC","doi-asserted-by":"crossref","award":["EP\/K001698\/1 (UNCOVER)"],"award-info":[{"award-number":["EP\/K001698\/1 (UNCOVER)"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2015,3,25]]},"abstract":"<jats:p>Factored planning mitigates the state explosion problem by avoiding the construction of the state space of the whole system and instead working with the system's components. Traditionally, finite automata have been used to represent the components, with the overall system being represented as their product. In this article, we change the representation of components to safe Petri nets. This allows one to use cheap structural operations like transition contractions to reduce the size of the Petri net before its state space is generated, which often leads to substantial savings compared with automata. The proposed approach has been implemented and proved efficient on several factored planning benchmarks. This article is an extended version of our ACSD 2013 paper [Jezequel et al. 2013], with the addition of the proofs and the experimental results of Sections 6 and 7.<\/jats:p>","DOI":"10.1145\/2656215","type":"journal-article","created":{"date-parts":[[2015,2,18]],"date-time":"2015-02-18T13:24:05Z","timestamp":1424265845000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Factored Planning"],"prefix":"10.1145","volume":"14","author":[{"given":"Lo\u00efg","family":"Jezequel","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Nantes, IRCCyN, UMR CNRS 6597, Nantes, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Fabre","sequence":"additional","affiliation":[{"name":"INRIA Rennes Bretagne Atlantique, Rennes, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Khomenko","sequence":"additional","affiliation":[{"name":"Newcastle University, Newcastle, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,2,17]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1630659.1630793"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/647731.734975"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(96)00047-1"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167161"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89287-8_11"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the 18th International Conference on Automated Planning and Scheduling. 28--35","author":"Brafman Ronen","year":"2008","unstructured":"Ronen Brafman and Carmel Domshlak . 2008 . From one to many: Planning for loosely coupled multi-agent systems . In Proceedings of the 18th International Conference on Automated Planning and Scheduling. 28--35 . Ronen Brafman and Carmel Domshlak. 2008. From one to many: Planning for loosely coupled multi-agent systems. In Proceedings of the 18th International Conference on Automated Planning and Scheduling. 28--35."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.489078"},{"volume-title":"Unfoldings -- A Partial-Order Approach to Model Checking","author":"Esparza Javier","key":"e_1_2_1_9_1","unstructured":"Javier Esparza and Keijo Heljanko . 2008. Unfoldings -- A Partial-Order Approach to Model Checking . Springer . Javier Esparza and Keijo Heljanko. 2008. Unfoldings -- A Partial-Order Approach to Model Checking. Springer."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014746130920"},{"key":"e_1_2_1_11_1","unstructured":"Eric Fabre. 2007a. Bayesian Networks of Dynamic Systems. Habilitation \u00e0 Diriger des Recherches. Universit\u00e9 de Rennes.  Eric Fabre. 2007a. Bayesian Networks of Dynamic Systems. Habilitation \u00e0 Diriger des Recherches. Universit\u00e9 de Rennes."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10626-006-0001-0"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2009.5400084"},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the 20th International Conference on Automated Planning and Scheduling. 65--72","author":"Fabre Eric","year":"2010","unstructured":"Eric Fabre , Lo\u00efg Jezequel , Patrik Haslum , and Sylvie Thi\u00e9baux . 2010 . Cost-optimal factored planning: Promises and pitfalls . In Proceedings of the 20th International Conference on Automated Planning and Scheduling. 65--72 . Eric Fabre, Lo\u00efg Jezequel, Patrik Haslum, and Sylvie Thi\u00e9baux. 2010. Cost-optimal factored planning: Promises and pitfalls. In Proceedings of the 20th International Conference on Automated Planning and Scheduling. 65--72."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the 19th International Joint Conference on Artificial Intelligence. 1904--1911","author":"Hickmott Sarah","year":"2007","unstructured":"Sarah Hickmott , Jussi Rintanen , Sylvie Thi\u00e9baux , and Lang White . 2007 . Planning via Petri net unfolding . In Proceedings of the 19th International Joint Conference on Artificial Intelligence. 1904--1911 . Sarah Hickmott, Jussi Rintanen, Sylvie Thi\u00e9baux, and Lang White. 2007. Planning via Petri net unfolding. In Proceedings of the 19th International Joint Conference on Artificial Intelligence. 1904--1911."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSD.2013.16"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-006-0023-y"},{"key":"e_1_2_1_20_1","first-page":"541","article-title":"Output-determinacy and asynchronous circuit synthesis","volume":"88","author":"Khomenko Victor","year":"2008","unstructured":"Victor Khomenko , Mark Schaefer , and Walter Vogler . 2008 . Output-determinacy and asynchronous circuit synthesis . Fundamenta Informaticae 88 , 4 (2008), 541 -- 579 . Victor Khomenko, Mark Schaefer, and Walter Vogler. 2008. Output-determinacy and asynchronous circuit synthesis. Fundamenta Informaticae 88, 4 (2008), 541--579.","journal-title":"Fundamenta Informaticae"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-009-0102-y"},{"key":"e_1_2_1_22_1","first-page":"161","article-title":"Improved decomposition of signal transition graphs","volume":"78","author":"Vogler Walter","year":"2007","unstructured":"Walter Vogler and Ben Kangsah . 2007 . Improved decomposition of signal transition graphs . Fundamenta Informaticae 78 , 1 (2007), 161 -- 197 . Walter Vogler and Ben Kangsah. 2007. Improved decomposition of signal transition graphs. Fundamenta Informaticae 78, 1 (2007), 161--197.","journal-title":"Fundamenta Informaticae"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2656215","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2656215","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:19:37Z","timestamp":1750231177000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2656215"}},"subtitle":["From Automata to Petri Nets"],"short-title":[],"issued":{"date-parts":[[2015,2,17]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,3,25]]}},"alternative-id":["10.1145\/2656215"],"URL":"https:\/\/doi.org\/10.1145\/2656215","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2015,2,17]]},"assertion":[{"value":"2013-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-02-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}