{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:26:00Z","timestamp":1772119560184,"version":"3.50.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T00:00:00Z","timestamp":1752019200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T00:00:00Z","timestamp":1752019200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-22-CE48-0012"],"award-info":[{"award-number":["ANR-22-CE48-0012"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Form Methods Syst Des"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s10703-025-00484-3","type":"journal-article","created":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T09:39:59Z","timestamp":1752140399000},"page":"498-528","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Automatic assume-guarantee reasoning for safety and liveness using passive learning"],"prefix":"10.1007","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8146-4429","authenticated-orcid":false,"given":"Ocan","family":"Sankur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,9]]},"reference":[{"key":"484_CR1","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s00165-017-0436-0","volume":"30","author":"K Abd\u00a0Elkader","year":"2018","unstructured":"Abd\u00a0Elkader K, Grumberg O, P\u0103s\u0103reanu CS, Shoham S (2018) Automated circular assume-guarantee reasoning. Formal Aspects Comput 30:571\u2013595","journal-title":"Formal Aspects Comput"},{"key":"484_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1008739929481","volume":"15","author":"R Alur","year":"1999","unstructured":"Alur R, Henzinger TA (1999) Reactive modules. Formal Methods Syst Des 15:7\u201348","journal-title":"Formal Methods Syst Des"},{"key":"484_CR3","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/11513988_52","volume-title":"Computer Aided Verification","author":"P Rajeev Alur","year":"2005","unstructured":"Rajeev Alur P, Madhusudan WN (2005) Symbolic compositional verification by learning assumptions. In: Etessami K, Rajamani SK (eds) Computer Aided Verification. Springer, Berlin Heidelberg, pp 548\u2013562"},{"issue":"2","key":"484_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D Angluin","year":"1987","unstructured":"Angluin D (1987) Learning regular sets from queries and counterexamples. Inf Comput 75(2):87\u2013106","journal-title":"Inf Comput"},{"key":"484_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2016.07.031","volume":"650","author":"D Angluin","year":"2016","unstructured":"Angluin D, Fisman D (2016) Learning regular omega languages. Theor Comput Sci 650:57\u201372","journal-title":"Theor Comput Sci"},{"key":"484_CR6","first-page":"307","volume-title":"Michael Leuschel and Heike Wehrheim","author":"N Bene\u0161","year":"2009","unstructured":"Bene\u0161 N, Brim L, \u010cern\u00e1 I, Sochor J, Va\u0159ekov\u00e1 P, Zimmerova B (2009) Partial order reduction for state\/event ltl. In: Formal I (ed) Michael Leuschel and Heike Wehrheim. Methods Springer, Berlin Heidelberg, pp 307\u2013321"},{"issue":"2\u20133","key":"484_CR7","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1561\/1000000053","volume":"12","author":"A Benveniste","year":"2018","unstructured":"Benveniste A, Caillaud B, Nickovic D, Passerone R, Raclet J-B, Reinkemeier P, Sangiovanni-Vincentelli A, Damm W, Henzinger TA, Larsen KG et al (2018) Contracts for system design. Found Trends\u00ae Elect Des Autom 12(2\u20133):124\u2013400","journal-title":"Found Trends\u00ae Elect Des Autom"},{"key":"484_CR8","first-page":"508","volume-title":"NASA Formal Methods","author":"Alberto Bombardelli and Stefano Tonetta","year":"2022","unstructured":"Alberto Bombardelli and Stefano Tonetta (2022) Asynchronous composition of local interface ltl properties. In: Deshmukh JV, Havelund K, Perez I (eds) NASA Formal Methods. Springer International Publishing, Cham, pp 508\u2013526"},{"key":"484_CR9","doi-asserted-by":"crossref","unstructured":"Mathieu Boussard, Dinh\u00a0Thai Bui, Laurent Ciavaglia, Richard Douville, Michel\u00a0Le Pallec, Nicolas\u00a0Le Sauze, Ludovic Noirie, Serge Papillon, Pierre Peloso, and Francesco Santoro (2015). Software-defined lans for interconnected smart environment. In 2015 27th International Teletraffic Congress, pages 219\u2013227,","DOI":"10.1109\/ITC.2015.33"},{"key":"484_CR10","doi-asserted-by":"crossref","unstructured":"Bshouty NH (1993). Exact learning via the monotone theory. In Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, pages 302\u2013311,","DOI":"10.1109\/SFCS.1993.366857"},{"key":"484_CR11","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/978-3-642-14295-6_44","volume-title":"Computer Aided Verification","author":"Y-F Chen","year":"2010","unstructured":"Chen Y-F, Clarke EM, Farzan A, Tsai M-H, Tsay Y-K, Wang B-Y (2010) Automated assume-guarantee reasoning through implicit learning. In: Touili T, Cook B, Jackson P (eds) Computer Aided Verification. Springer, Berlin Heidelberg, pp 511\u2013526"},{"key":"484_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-00768-2_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Y-F Chen","year":"2009","unstructured":"Chen Y-F, Farzan A, Clarke EM, Tsay Y-K, Wang B-Y (2009) Learning minimal separating dfa\u2019s for compositional verification. In: Kowalewski S, Philippou A (eds) Tools and Algorithms for the Construction and Analysis of Systems. Springer, Berlin Heidelberg, pp 31\u201345"},{"key":"484_CR13","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-319-10575-8","volume-title":"Handbook of model checking","author":"EM Clarke","year":"2018","unstructured":"Clarke EM, Henzinger TA, Veith H, Bloem R et al (2018) Handbook of model checking. Springer, Berlin Heidelberg, p 10"},{"key":"484_CR14","doi-asserted-by":"crossref","unstructured":"Clarke EM, Long DE, McMillan KL (1989). Compositional model checking. In 1989 Proceedings. Fourth Annual Symposium on Logic in Computer Science, pp 353\u2013362,","DOI":"10.1109\/LICS.1989.39190"},{"key":"484_CR15","doi-asserted-by":"crossref","unstructured":"Patrick Cousot and Radhia Cousot (1977). Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Robert\u00a0M. Graham, Michael\u00a0A. Harrison, and Ravi Sethi, editors, Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, Los Angeles, California, USA, January 1977, pages 238\u2013252. ACM,","DOI":"10.1145\/512950.512973"},{"issue":"5","key":"484_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/503271.503226","volume":"26","author":"L De\u00a0Alfaro","year":"2001","unstructured":"De\u00a0Alfaro L, Henzinger TA (2001) Interface automata. ACM SIGSOFT Softw Eng Notes 26(5):109\u2013120","journal-title":"ACM SIGSOFT Softw Eng Notes"},{"key":"484_CR17","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-031-13188-2_9","volume-title":"Computer Aided Verification","author":"A Duret-Lutz","year":"2022","unstructured":"Duret-Lutz A, Renault E, Colange M, Renkin F, Aisse AG, Schlehuber-Caissier P, Medioni T, Martin A, Dubois J, Gillard C, Lauko H (2022) From spot 2.0 to spot 2.10: What\u2019s new? In: Shoham S, Vizel Y (eds) Computer Aided Verification. Springer International Publishing, Cham, pp 174\u2013187"},{"key":"484_CR18","doi-asserted-by":"crossref","unstructured":"Karam\u00a0Abd Elkader, Orna Grumberg, Corina\u00a0S. Pasareanu, and Sharon Shoham (2016). Automated circular assume-guarantee reasoning with n-way decomposition and alphabet refinement. In Swarat Chaudhuri and Azadeh Farzan, (Eds) Computer Aided Verification - 28th International Conference, CAV 2016, Toronto, ON, Canada, July 17-23, 2016, Proceedings, Part I, volume 9779 of Lecture Notes in Computer Science, pages 329\u2013351. Springer,","DOI":"10.1007\/978-3-319-41528-4_18"},{"key":"484_CR19","doi-asserted-by":"crossref","unstructured":"P\u00a0Ezudheen, Daniel Neider, Deepak D\u2019Souza, Pranav Garg, and P\u00a0Madhusudan (2018). Horn-ice learning for synthesizing invariants and contracts. Proceedings of the ACM on programming languages, 2(OOPSLA):1\u201325,","DOI":"10.1145\/3276501"},{"key":"484_CR20","doi-asserted-by":"crossref","unstructured":"Robert\u00a0W Floyd (1993). Assigning meanings to programs. In Program Verification: Fundamental Issues in Computer Science, pages 65\u201381. Springer,","DOI":"10.1007\/978-94-011-1793-7_4"},{"key":"484_CR21","unstructured":"Ivan Gavran. Samples2ltl. https:\/\/github.com\/ivan-gavran\/samples2LTL"},{"key":"484_CR22","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-71209-1_23","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Gheorghiu","year":"2007","unstructured":"Gheorghiu M, Giannakopoulou D, P\u0103s\u0103reanu CS (2007) Refining interface alphabets for compositional verification. In: Grumberg O, Huth M (eds) Tools and Algorithms for the Construction and Analysis of Systems. Springer, Berlin Heidelberg, Berlin Heidelberg, pp 292\u2013307"},{"key":"484_CR23","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-540-70545-1_14","volume-title":"Computer Aided Verification","author":"MG Bobaru","year":"2008","unstructured":"Bobaru MG, P\u0103s\u0103reanu CS, Giannakopoulou D (2008) Automated assume-guarantee reasoning by abstraction refinement. In: Gupta A, Malik S (eds) Computer Aided Verification. Springer, Berlin Heidelberg, pp 135\u2013148"},{"key":"484_CR24","first-page":"345","volume-title":"Compositional Reasoning","author":"D Giannakopoulou","year":"2018","unstructured":"Giannakopoulou D, Namjoshi KS, P\u0103s\u0103reanu CS (2018) Compositional Reasoning. Springer International Publishing, Cham, pp 345\u2013383"},{"key":"484_CR25","doi-asserted-by":"crossref","unstructured":"Susanne Graf, Roberto Passerone, and Sophie Quinton (2013). Contract-based reasoning for component systems with rich interactions. In Embedded Systems Development: From Functional Models to Implementations, pages 139\u2013154. Springer,","DOI":"10.1007\/978-1-4614-3879-3_8"},{"key":"484_CR26","doi-asserted-by":"crossref","unstructured":"Susanne Graf and Hassen Saidi (1997) Construction of abstract state graphs with pvs. In Computer Aided Verification: 9th International Conference, CAV\u201997 Haifa, Israel, June 22\u201325, 1997 Proceedings 9, pages 72\u201383. Springer,","DOI":"10.1007\/3-540-63166-6_10"},{"key":"484_CR27","volume-title":"25 years of model checking: history, achievements, perspectives","author":"Orna Grumberg and Helmut Veith","year":"2008","unstructured":"Orna Grumberg and Helmut Veith (2008) 25 years of model checking: history, achievements, perspectives. Springer, Berlin Heidelberg"},{"key":"484_CR28","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10703-008-0050-0","volume":"32","author":"A Gupta","year":"2008","unstructured":"Gupta A, McMillan KL, Zhaohui F (2008) Automated assumption generation for compositional verification. Formal Methods Syst Des 32:285\u2013301","journal-title":"Formal Methods Syst Des"},{"key":"484_CR29","doi-asserted-by":"crossref","unstructured":"Matthias Heizmann, Jochen Hoenicke, and Andreas Podelski (2009). Refinement of trace abstraction. In International Static Analysis Symposium, Springer, Berlin Heidelberg pages 69\u201385","DOI":"10.1007\/978-3-642-03237-0_7"},{"key":"484_CR30","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-45351-2_24","volume-title":"Hybrid Systems: Computation and Control","author":"TA Henzinger","year":"2001","unstructured":"Henzinger TA, Minea M, Prabhu V (2001) Assume-guarantee reasoning for hierarchical hybrid systems. In: Benedetto M, Sangiovanni-Vincentelli A (eds) Hybrid Systems: Computation and Control. Springer, Berlin Heidelberg, pp 275\u2013290"},{"key":"484_CR31","doi-asserted-by":"crossref","unstructured":"Thomas\u00a0A Henzinger, Shaz Qadeer, and Sriram\u00a0K Rajamani (1998). You assume, we guarantee: Methodology and case studies. In Computer Aided Verification: 10th international conference, CAV\u201998 Vancouver, BC, Canada, June 28\u2013July 2, 1998 Proceedings 10, pages 440\u2013451. Springer,","DOI":"10.1007\/BFb0028765"},{"key":"484_CR32","unstructured":"Fr\u00e9d\u00e9ric Herbreteau and G\u00e9rald Point. The TChecker tool and librairies. https:\/\/github.com\/ticktac-project\/tchecker"},{"key":"484_CR33","doi-asserted-by":"crossref","unstructured":"Malte Isberner, Falk Howar, and Bernhard Steffen (2015). The open-source learnlib - A framework for active automata learning. In Daniel Kroening and Corina\u00a0S. Pasareanu, editors, Computer Aided Verification - 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part I, volume 9206 of Lecture Notes in Computer Science, pages 487\u2013495. Springer,","DOI":"10.1007\/978-3-319-21690-4_32"},{"key":"484_CR34","doi-asserted-by":"crossref","unstructured":"Orna Kupferman and Moshe\u00a0Y Vardi (1997) Modular model checking. In International Symposium on Compositionality, pages 381\u2013401. Springer,","DOI":"10.1007\/3-540-49213-5_14"},{"key":"484_CR35","doi-asserted-by":"crossref","unstructured":"Alexander Maier (2014) Online passive learning of timed automata for cyber-physical production systems. In 2014 12th IEEE International conference on industrial informatics (INDIN), pages 60\u201366. IEEE,","DOI":"10.1109\/INDIN.2014.6945484"},{"key":"484_CR36","doi-asserted-by":"crossref","unstructured":"Abdul Majith, Ocan Sankur, Herve Marchand, and Thai Dinh (2021). Compositional model checking of a SDN platform. In International conference on the design of reliable communication networks (DRCN 2021),","DOI":"10.1109\/DRCN51631.2021.9477393"},{"key":"484_CR37","unstructured":"Kenneth\u00a0L McMillan (1998). Verification of an implementation of tomasulo\u2019s algorithm by compositional model checking. In Computer aided verification: 10th international conference, CAV\u201998 Vancouver, BC, Canada, June 28\u2013July 2, 1998 Proceedings 10, pages 110\u2013121. Springer,"},{"key":"484_CR38","doi-asserted-by":"crossref","unstructured":"Kenneth\u00a0L McMillan (1999) Circular compositional reasoning about liveness. In Correct Hardware Design and Verification Methods: 10th IFIP WG10. 5 Advanced Research Working Conference, CHARME\u201999 BadHerrenalb, Germany, September 27\u201329, 1999 Proceedings 10, pages 342\u2013346. Springer,","DOI":"10.1007\/3-540-48153-2_30"},{"key":"484_CR39","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-48153-2_17","volume-title":"Advanced Research Working Conference on Correct Hardware Design and Verification Methods","author":"KL McMillan","year":"1999","unstructured":"McMillan KL (1999) Verification of infinite state systems by compositional model checking. Advanced Research Working Conference on Correct Hardware Design and Verification Methods. Springer, Berlin Heidelberg, pp 219\u2013237"},{"issue":"1\u20133","key":"484_CR40","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0167-6423(99)00030-1","volume":"37","author":"KL McMillan","year":"2000","unstructured":"McMillan KL (2000) A methodology for hardware verification using compositional model checking. Sci Comput Program 37(1\u20133):279\u2013309","journal-title":"Sci Comput Program"},{"key":"484_CR41","unstructured":"Jakub Michaliszyn and Jan Otop (2022) Learning deterministic visibly pushdown automata under accessible stack. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), pages 74\u20131. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik,"},{"issue":"4","key":"484_CR42","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1109\/TSE.1981.230844","volume":"7","author":"J Misra","year":"1981","unstructured":"Misra J, Chandy KM (1981) Proofs of networks of processes. IEEE Trans Software Eng 7(4):417\u2013426","journal-title":"IEEE Trans Software Eng"},{"key":"484_CR43","doi-asserted-by":"crossref","unstructured":"Kedar\u00a0S Namjoshi and Richard\u00a0J Trefler (2000) On the completeness of compositional reasoning. In Computer Aided Verification: 12th International Conference, CAV 2000, Chicago, IL, USA, July 15-19, 2000. Proceedings 12, pages 139\u2013153. Springer,","DOI":"10.1007\/10722167_14"},{"key":"484_CR44","doi-asserted-by":"crossref","unstructured":"Daniel Neider and Ivan Gavran (2018). Learning linear temporal properties. In 2018 Formal Methods in Computer Aided Design (FMCAD), pages 1\u201310. IEEE,","DOI":"10.23919\/FMCAD.2018.8603016"},{"key":"484_CR45","doi-asserted-by":"crossref","unstructured":"Jos\u00e9 Oncina and Pedro Garcia (1992). Inferring regular languages in polynomial updated time. In Pattern recognition and image analysis: selected papers from the IVth Spanish Symposium, pages 49\u201361. World Scientific,","DOI":"10.1142\/9789812797902_0004"},{"issue":"3","key":"484_CR46","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10703-008-0049-6","volume":"32","author":"CS P\u0103s\u0103reanu","year":"2008","unstructured":"P\u0103s\u0103reanu CS, Giannakopoulou D, Gheorghiu Bobaru M, Cobleigh JM, Barringer H (2008) Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning. Formal Methods Syst Des 32(3):175\u2013205","journal-title":"Formal Methods Syst Des"},{"key":"484_CR47","doi-asserted-by":"crossref","unstructured":"Amir Pnueli (1977). The temporal logic of programs. In 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pages 46\u201357,","DOI":"10.1109\/SFCS.1977.32"},{"key":"484_CR48","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-82453-1_5","volume-title":"Logics and Models of Concurrent Systems","author":"A Pnueli","year":"1985","unstructured":"Pnueli A (1985) In transition from global to modular temporal reasoning about programs. In: Apt KR (ed) Logics and Models of Concurrent Systems. Springer, Berlin Heidelberg., pp 123\u2013144"},{"key":"484_CR49","doi-asserted-by":"crossref","unstructured":"Ritam Raha, Rajarshi Roy, Nathana\u00ebl Fijalkow, and Daniel Neider (2022). Scalable anytime algorithms for learning fragments of linear temporal logic. In International conference on tools and algorithms for the construction and analysis of systems, pages 263\u2013280. Springer,","DOI":"10.1007\/978-3-030-99524-9_14"},{"key":"484_CR50","unstructured":"Rajarshi Roy, Dana Fisman, and Daniel Neider (2021). Learning interpretable models in the property specification language. In Proceedings of the Twenty-Ninth International joint conference on artificial intelligence, IJCAI\u201920,"},{"key":"484_CR51","doi-asserted-by":"crossref","unstructured":"Eugene\u00a0W Stark (1985) A proof technique for rely\/guarantee properties. In Foundations of Software Technology and Theoretical Computer Science: Fifth Conference, New Delhi, India December 16\u201318, 1985 Proceedings 5, pages 369\u2013391. Springer,","DOI":"10.1007\/3-540-16042-6_21"}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-025-00484-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10703-025-00484-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-025-00484-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T15:26:43Z","timestamp":1759246003000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10703-025-00484-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,9]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["484"],"URL":"https:\/\/doi.org\/10.1007\/s10703-025-00484-3","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3910982\/v1","asserted-by":"object"}]},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"value":"0925-9856","type":"print"},{"value":"1572-8102","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,9]]},"assertion":[{"value":"30 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}