{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T14:17:06Z","timestamp":1774966626958,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031331695","type":"print"},{"value":"9783031331701","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-33170-1_14","type":"book-chapter","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T12:55:27Z","timestamp":1685710527000},"page":"224-240","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Rewrite-Based Decomposition of Signal Temporal Logic Specifications"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5894-7190","authenticated-orcid":false,"given":"Kevin","family":"Leahy","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1555-5784","authenticated-orcid":false,"given":"Makai","family":"Mann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1132-1462","authenticated-orcid":false,"given":"Cristian-Ioan","family":"Vasile","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,3]]},"reference":[{"key":"14_CR1","volume-title":"Term Rewriting and All That","author":"F Baader","year":"1999","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1999)"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Banks, C., Wilson, S., Coogan, S., Egerstedt, M.: Multi-agent task allocation using cross-entropy temporal logic optimization. In: 2020 IEEE International Conference on Robotics and Automation (ICRA), pp. 7712\u20137718. IEEE (2020)","DOI":"10.1109\/ICRA40945.2020.9197066"},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1146\/annurev-control-053018-023717","volume":"2","author":"C Belta","year":"2019","unstructured":"Belta, C., Sadraddini, S.: Formal methods for control synthesis: an optimization perspective. Annu. Rev. Control Robot. Auton. Syst. 2(1), 115\u2013140 (2019). https:\/\/doi.org\/10.1146\/annurev-control-053018-023717","journal-title":"Annu. Rev. Control Robot. Auton. Syst."},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"1375","DOI":"10.1109\/LRA.2021.3057049","volume":"6","author":"AT Buyukkocak","year":"2021","unstructured":"Buyukkocak, A.T., Aksaray, D., Yaz\u0131c\u0131o\u011flu, Y.: Planning of heterogeneous multi-agent systems under signal temporal logic specifications with integral predicates. IEEE Robot. Autom. Lett. 6(2), 1375\u20131382 (2021)","journal-title":"IEEE Robot. Autom. Lett."},{"key":"14_CR5","unstructured":"Castanon, D., Drummond, O., Bellovin, M.: Comparison of 2-D assignment algorithms for rectangular, floating point cost matrices. In: Proc. Os SDI Panels on tracking, No. 4 (1990)"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.1109\/LCSYS.2021.3090980","volume":"6","author":"M Charitidou","year":"2021","unstructured":"Charitidou, M., Dimarogonas, D.V.: Signal temporal logic task decomposition via convex optimization. IEEE Contr. Syst. Lett. 6, 1238\u20131243 (2021)","journal-title":"IEEE Contr. Syst. Lett."},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1109\/TRO.2011.2163434","volume":"28","author":"Y Chen","year":"2011","unstructured":"Chen, Y., Ding, X.C., Stefanescu, A., Belta, C.: Formal approach to the deployment of distributed robotic teams. IEEE Trans. Rob. 28(1), 158\u2013171 (2011)","journal-title":"IEEE Trans. Rob."},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-319-11164-3_19","volume-title":"Runtime Verification","author":"A Dokhanchi","year":"2014","unstructured":"Dokhanchi, A., Hoxha, B., Fainekos, G.: On-line monitoring for temporal logic robustness. In: Bonakdarpour, B., Smolka, S.A. (eds.) RV 2014. LNCS, vol. 8734, pp. 231\u2013246. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11164-3_19"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-15297-9_9","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"A Donz\u00e9","year":"2010","unstructured":"Donz\u00e9, A., Maler, O.: Robust satisfaction of temporal logic over real-valued signals. In: Chatterjee, K., Henzinger, T.A. (eds.) FORMATS 2010. LNCS, vol. 6246, pp. 92\u2013106. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15297-9_9"},{"key":"14_CR10","unstructured":"Gamrath, G., et al.: The SCIP optimization suite 7.0. Technical report, Optimization Online (2020). http:\/\/www.optimization-online.org\/DB_HTML\/2020\/03\/7705.html"},{"issue":"2","key":"14_CR11","doi-asserted-by":"publisher","first-page":"3687","DOI":"10.1109\/LRA.2021.3064220","volume":"6","author":"D Gundana","year":"2021","unstructured":"Gundana, D., Kress-Gazit, H.: Event-based signal temporal logic synthesis for single and multi-robot tasks. IEEE Robot. Autom. Lett. 6(2), 3687\u20133694 (2021)","journal-title":"IEEE Robot. Autom. Lett."},{"key":"14_CR12","unstructured":"Gurobi Optimization, LLC: Gurobi optimizer reference manual (2022). https:\/\/www.gurobi.com"},{"issue":"4","key":"14_CR13","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R Jonker","year":"1987","unstructured":"Jonker, R., Volgenant, A.: A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38(4), 325\u2013340 (1987). https:\/\/doi.org\/10.1007\/BF02278710","journal-title":"Computing"},{"issue":"2","key":"14_CR14","doi-asserted-by":"publisher","first-page":"2297","DOI":"10.1109\/LRA.2022.3143304","volume":"7","author":"K Leahy","year":"2022","unstructured":"Leahy, K., Jones, A., Vasile, C.I.: Fast decomposition of temporal logic specifications for heterogeneous teams. IEEE Robot. Autom. Lett. 7(2), 2297\u20132304 (2022)","journal-title":"IEEE Robot. Autom. Lett."},{"issue":"4","key":"14_CR15","doi-asserted-by":"publisher","first-page":"2516","DOI":"10.1109\/TRO.2021.3130794","volume":"38","author":"K Leahy","year":"2021","unstructured":"Leahy, K., et al.: Scalable and robust algorithms for task-based coordination from high-level specifications (ScRATCHeS). IEEE Trans. Robot. 38(4), 2516\u20132535 (2021)","journal-title":"IEEE Trans. Robot."},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.automatica.2019.05.013","volume":"106","author":"L Lindemann","year":"2019","unstructured":"Lindemann, L., Dimarogonas, D.V.: Feedback control strategies for multi-agent systems under a fragment of signal temporal logic tasks. Automatica 106, 284\u2013293 (2019)","journal-title":"Automatica"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Liu, S., Saoud, A., Jagtap, P., Dimarogonas, D.V., Zamani, M.: Compositional synthesis of signal temporal logic tasks via assume-guarantee contracts. arXiv preprint arXiv:2203.10041 (2022)","DOI":"10.1109\/CDC51059.2022.9992715"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-540-30206-3_12","volume-title":"Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems","author":"O Maler","year":"2004","unstructured":"Maler, O., Nickovic, D.: Monitoring temporal properties of continuous signals. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS\/FTRTFT -2004. LNCS, vol. 3253, pp. 152\u2013166. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30206-3_12"},{"key":"14_CR19","unstructured":"Mitchell, S., O\u2019Sullivan, M., Dunning, I.: PuLP: a linear programming toolkit for Python (2011)"},{"key":"14_CR20","first-page":"196","volume":"10","author":"JR Munkres","year":"1957","unstructured":"Munkres, J.R.: Algorithms for the assignment and transportation problems. J. Soc. Ind. Appl. Math. 10, 196\u2013210 (1957)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"14_CR21","series-title":"Springer Proceedings in Advanced Robotics","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-319-73008-0_18","volume-title":"Distributed Autonomous Robotic Systems","author":"P Schillinger","year":"2018","unstructured":"Schillinger, P., B\u00fcrger, M., Dimarogonas, D.V.: Decomposition of finite LTL specifications for efficient multi-agent planning. In: Gro\u00df, R., et al. (eds.) Distributed Autonomous Robotic Systems. SPAR, vol. 6, pp. 253\u2013267. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73008-0_18"},{"issue":"2","key":"14_CR22","doi-asserted-by":"publisher","first-page":"3451","DOI":"10.1109\/LRA.2022.3146951","volume":"7","author":"D Sun","year":"2022","unstructured":"Sun, D., Chen, J., Mitra, S., Fan, C.: Multi-agent motion planning from signal temporal logic specifications. IEEE Robot. Autom. Lett. 7(2), 3451\u20133458 (2022)","journal-title":"IEEE Robot. Autom. Lett."},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Zhou, Z., Lee, D.J., Yoshinaga, Y., Guo, D., Zhao, Y.: Reactive task allocation and planning of a heterogeneous multi-robot system. arXiv preprint arXiv:2110.08436 (2021)","DOI":"10.1109\/CASE49997.2022.9926658"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33170-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T12:58:00Z","timestamp":1685710680000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33170-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031331695","9783031331701"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33170-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"3 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Houston, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/nfm-2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.9","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}