{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,28]],"date-time":"2026-10-28T02:06:47Z","timestamp":1793153207735,"version":"4.5.0"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319912677","type":"print"},{"value":"9783319912684","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-91268-4_18","type":"book-chapter","created":{"date-parts":[[2018,5,7]],"date-time":"2018-05-07T16:27:38Z","timestamp":1525710458000},"page":"351-362","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":41,"title":["Petri Net Model Checking with LoLA 2"],"prefix":"10.1007","author":[{"given":"Karsten","family":"Wolf","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,5,8]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.4204\/EPTCS.189.6","volume":"189","author":"Eike Best","year":"2015","unstructured":"Best, E., Schlachter, U.: Analysis of Petri nets and transition systems. In: Proceedings ICE. EPTCS, vol. 189, pp. 53\u201367 (2015)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"issue":"4","key":"18_CR2","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/1278349.1278357","volume":"12","author":"D Das","year":"2007","unstructured":"Das, D., Chakrabarti, P.P., Kumar, R.: Functional verification of task partitioning for multiprocessor embedded systems. ACM Trans. Des. Autom. Electron. Syst. 12(4), 44 (2007)","journal-title":"ACM Trans. Des. Autom. Electron. Syst."},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-540-85758-7_29","volume-title":"Business Process Management","author":"G Decker","year":"2008","unstructured":"Decker, G., Overdick, H., Weske, M.: Oryx \u2013 an open modeling platform for the BPM community. In: Dumas, M., Reichert, M., Shan, M.-C. (eds.) BPM 2008. LNCS, vol. 5240, pp. 382\u2013385. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85758-7_29"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24605-3_37"},{"issue":"3","key":"18_CR5","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0167-6423(83)90017-5","volume":"2","author":"EA Emerson","year":"1982","unstructured":"Emerson, E.A., Clarke, E.M.: Using branching time temporal logic to synthesize synchronization skeletons. Sci. Comput. Program. 2(3), 241\u2013266 (1982)","journal-title":"Sci. Comput. Program."},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-319-57861-3_10","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"AE Dalsgaard","year":"2017","unstructured":"Dalsgaard, A.E., et al.: Extended dependency graphs and efficient distributed fixed-point computation. In: van der Aalst, W., Best, E. (eds.) PETRI NETS 2017. LNCS, vol. 10258, pp. 139\u2013158. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57861-3_10"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-48540-7_2","volume-title":"Systems Biology and Regulatory Genomics","author":"DL Dill","year":"2007","unstructured":"Dill, D.L., Knapp, M.A., Gage, P., Talcott, C., Laderoute, K., Lincoln, P.: The pathalyzer: a tool for analysis of signal transduction pathways. In: Eskin, E., Ideker, T., Raphael, B., Workman, C. (eds.) RRG\/RSB-2005. LNCS, vol. 4023, pp. 11\u201322. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-48540-7_2"},{"key":"18_CR8","unstructured":"Kordon, F., et al.: Homepage of the Model Checking Contest, June 2017. http:\/\/mcc.lip6.fr\/"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/3-540-44919-1_31","volume-title":"Applications and Theory of Petri Nets 2003","author":"J Billington","year":"2003","unstructured":"Billington, J., et al.: The Petri net markup language: concepts, technology, and tools. In: van der Aalst, W.M.P., Best, E. (eds.) ICATPN 2003. LNCS, vol. 2679, pp. 483\u2013505. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-44919-1_31"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Cardozo, N., et al.: Modeling and analyzing self-adaptive systems with context Petri nets. In: Proceedings of the TASE, pp. 191\u2013198. IEEE (2013)","DOI":"10.1109\/TASE.2013.33"},{"issue":"1","key":"18_CR11","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.tcs.2005.07.004","volume":"345","author":"J Geldenhuys","year":"2005","unstructured":"Geldenhuys, J., Valmari, A.: More efficient on-the-fly LTL verification with Tarjan\u2019s algorithm. Theoret. Comput. Sci. 345(1), 60\u201382 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Gerth, R., Kuiper, R., Peled, D.A., Penczek, W.: A partial order approach to branching time logic model checking. In: Proceedings of the International Symposium on Theory of Computing and Systems, ISTCS 1995, Tel Aviv, Israel, 4\u20136 January 1995, pp. 130\u2013139. IEEE Computer Society (1995)","DOI":"10.1109\/ISTCS.1995.377038"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Heiner, M., Richter, R., Schwarick, M.: Snoopy - a tool to design and animate\/simulate graph-based formalisms. In: Proceedings of the PNTAP (2008)","DOI":"10.4108\/ICST.SIMUTOOLS2008.3098"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"DA Huffman","year":"1952","unstructured":"Huffman, D.A.: A method for the construction of minimum-redundancy codes. Proc. IRE 40, 1098\u20131101 (1952)","journal-title":"Proc. IRE"},{"issue":"4","key":"18_CR15","first-page":"307","volume":"7","author":"TA Junttila","year":"2001","unstructured":"Junttila, T.A.: Computational complexity of the place\/transition-net symmetry reduction method. J. UCS 7(4), 307\u2013326 (2001)","journal-title":"J. UCS"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/978-3-642-14295-6_55","volume-title":"Computer Aided Verification","author":"A Kaiser","year":"2010","unstructured":"Kaiser, A., Kroening, D., Wahl, T.: Dynamic cutoff detection in parameterized concurrent programs. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 645\u2013659. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14295-6_55"},{"issue":"2","key":"18_CR17","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"RM Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147\u2013195 (1969)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"18_CR18","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01375471","volume":"11","author":"DE Knuth","year":"1991","unstructured":"Knuth, D.E.: Efficient representation of perm groups. Combinatorica 11(1), 33\u201343 (1991)","journal-title":"Combinatorica"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/3-540-45614-7_31","volume-title":"FME 2002:Formal Methods\u2014Getting IT Right","author":"LM Kristensen","year":"2002","unstructured":"Kristensen, L.M., Mailund, T.: A generalised sweep-line method for safety properties. In: Eriksson, L.-H., Lindsay, P.A. (eds.) FME 2002. LNCS, vol. 2391, pp. 549\u2013567. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45614-7_31"},{"issue":"3","key":"18_CR20","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10703-006-0006-1","volume":"29","author":"LM Kristensen","year":"2006","unstructured":"Kristensen, L.M., Schmidt, K., Valmari, A.: Question-guided stubborn set methods for state properties. Form. Methods Syst. Des. 29(3), 215\u2013251 (2006)","journal-title":"Form. Methods Syst. Des."},{"issue":"3","key":"18_CR21","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10009-005-0201-1","volume":"8","author":"K Schmidt","year":"2006","unstructured":"Schmidt, K.: Automated generation of a progress measure for the sweep-line method. STTT 8(3), 195\u2013203 (2006)","journal-title":"STTT"},{"key":"18_CR22","unstructured":"Kummer, O., Wienberg, F.: Renew - the reference net workshop. In: Petri Net Newsletter, pp. 12\u201316 (2000)"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-540-79230-7_4","volume-title":"Web Services and Formal Methods","author":"N Lohmann","year":"2008","unstructured":"Lohmann, N., Kopp, O., Leymann, F., Reisig, W.: Analyzing BPEL4Chor: verification and participant synthesis. In: Dumas, M., Heckel, R. (eds.) WS-FM 2007. LNCS, vol. 4937, pp. 46\u201360. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79230-7_4"},{"issue":"1","key":"18_CR24","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.datak.2007.06.006","volume":"64","author":"N Lohmann","year":"2008","unstructured":"Lohmann, N., Massuthe, P., Stahl, C., Weinberg, D.: Analyzing interacting WS-BPEL processes using flexible model generation. Data Knowl. Eng. 64(1), 38\u201354 (2008)","journal-title":"Data Knowl. Eng."},{"issue":"1","key":"18_CR25","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1504\/IJBPIM.2009.026986","volume":"4","author":"N Lohmann","year":"2009","unstructured":"Lohmann, N., Verbeek, E., Ouyang, C., Stahl, C.: Comparing and evaluating Petri net semantics for BPEL. IJBPIM 4(1), 60\u201373 (2009)","journal-title":"IJBPIM"},{"key":"18_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-319-57861-3_7","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"B Meis","year":"2017","unstructured":"Meis, B., Bergenthum, R., Desel, J.: travis - an online tool for the synthesis and analysis of Petri nets with final states. In: van der Aalst, W., Best, E. (eds.) PETRI NETS 2017. LNCS, vol. 10258, pp. 101\u2013111. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57861-3_7"},{"issue":"C","key":"18_CR27","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/j.is.2015.09.005","volume":"56","author":"R Mrasek","year":"2016","unstructured":"Mrasek, R., M\u00fclleand, J., B\u00f6hm, K., Becker, M., Allmann, C.: Property specification, process verification, and reporting - a case study with vehicle-commissioning processes. Inf. Syst. 56(C), 326\u2013346 (2016)","journal-title":"Inf. Syst."},{"key":"18_CR28","unstructured":"Niewiadomski, A., Wolf, K.: LoLA as abstract planning engine of PlanICS. In: Proceedings of the PNSEi. CEUR, vol. 1160, pp. 349\u2013350 (2014)"},{"key":"18_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-13675-7_16","volume-title":"Applications and Theory of Petri Nets","author":"O Oanea","year":"2010","unstructured":"Oanea, O., Wimmel, H., Wolf, K.: New algorithms for deciding the Siphon-Trap property. In: Lilius, J., Penczek, W. (eds.) PETRI NETS 2010. LNCS, vol. 6128, pp. 267\u2013286. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13675-7_16"},{"key":"18_CR30","unstructured":"Oddoux, D., Gastin, P.: LTL 2 BA: fast translation from LTL formulae to B\u00fcchi automata. http:\/\/www.lsv.fr\/~gastin\/ltl2ba\/"},{"key":"18_CR31","unstructured":"Schmidt, K.: LoLA wird Pfadfinder. In: Proceedings of the AWPN, CEUR Workshop Proceedings, p. 26 (1999)"},{"key":"18_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/3-540-48745-X_4","volume-title":"Application and Theory of Petri Nets 1999","author":"K Schmidt","year":"1999","unstructured":"Schmidt, K.: Stubborn sets for standard properties. In: Donatelli, S., Kleijn, J. (eds.) ICATPN 1999. LNCS, vol. 1639, pp. 46\u201365. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48745-X_4"},{"issue":"7","key":"18_CR33","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s002360050002","volume":"36","author":"K Schmidt","year":"2000","unstructured":"Schmidt, K.: How to calculate symmetries of Petri nets. Acta Inf. 36(7), 545\u2013590 (2000)","journal-title":"Acta Inf."},{"key":"18_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/3-540-46419-0_22","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K Schmidt","year":"2000","unstructured":"Schmidt, K.: Integrating low level symmetries into reachability analysis. In: Graf, S., Schwartzbach, M. (eds.) TACAS 2000. LNCS, vol. 1785, pp. 315\u2013330. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-46419-0_22"},{"key":"18_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/3-540-44988-4_27","volume-title":"Application and Theory of Petri Nets 2000","author":"K Schmidt","year":"2000","unstructured":"Schmidt, K.: LoLA: a low level analyser. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, pp. 465\u2013474. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44988-4_27"},{"key":"18_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/3-540-36577-X_35","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K Schmidt","year":"2003","unstructured":"Schmidt, K.: Using Petri net invariants in state space construction. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 473\u2013488. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36577-X_35"},{"key":"18_CR37","doi-asserted-by":"crossref","unstructured":"Stahl, C., Reisig, W., Krstic, M.: Hazard detection in a GALS wrapper: a case study. In: Proceedings of the ACSD, pp. 234\u2013243. IEEE (2005)","DOI":"10.1109\/ACSD.2005.20"},{"issue":"2","key":"18_CR38","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"RE Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"18_CR39","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"RE Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. J. ACM 22(2), 215\u2013225 (1975)","journal-title":"J. ACM"},{"key":"18_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/3-540-53863-1_36","volume-title":"Advances in Petri Nets 1990","author":"A Valmari","year":"1991","unstructured":"Valmari, A.: Stubborn sets for reduced state space generation. In: Rozenberg, G. (ed.) ICATPN 1989. LNCS, vol. 483, pp. 491\u2013515. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-53863-1_36"},{"key":"18_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/3-540-65306-6_21","volume-title":"Lectures on Petri Nets I: Basic Models","author":"A Valmari","year":"1998","unstructured":"Valmari, A.: The state explosion problem. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1996. LNCS, vol. 1491, pp. 429\u2013528. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-65306-6_21"},{"key":"18_CR42","doi-asserted-by":"crossref","unstructured":"van der Aalst, W.M.P., et al.: ProM: the process mining toolkit. In: Proceedings of the BPMDemos. CEUR, vol. 489 (2009)","DOI":"10.1007\/978-0-387-39940-9_1477"},{"key":"18_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/3-540-57208-2_31","volume-title":"CONCUR 1993","author":"B Vergauwen","year":"1993","unstructured":"Vergauwen, B., Lewi, J.: A linear local model checking algorithm for CTL. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 447\u2013461. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57208-2_31"},{"key":"18_CR44","doi-asserted-by":"crossref","unstructured":"Wimmel, H., Wolf, K.: Applying CEGAR to the Petri net state equation. Log. Methods Comput. Sci. 8(3) (2012)","DOI":"10.2168\/LMCS-8(3:27)2012"},{"key":"18_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-662-53401-4_13","volume-title":"Transactions on Petri Nets and Other Models of Concurrency XI","author":"K Wolf","year":"2016","unstructured":"Wolf, K.: Running LoLA 2.0 in a model checking competition. In: Koutny, M., Desel, J., Kleijn, J. (eds.) Transactions on Petri Nets and Other Models of Concurrency XI. LNCS, vol. 9930, pp. 274\u2013285. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53401-4_13"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91268-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T08:55:32Z","timestamp":1751619332000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-91268-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319912677","9783319912684"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91268-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"8 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PETRI NETS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applications and Theory of Petri Nets and Concurrency","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bratislava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"39","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/interes.institute\/petrinets2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}