{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:17:06Z","timestamp":1762460226023,"version":"3.37.3"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030021481"},{"type":"electronic","value":"9783030021498"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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-030-02149-8_15","type":"book-chapter","created":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T17:25:34Z","timestamp":1538760334000},"page":"244-262","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algebraic Derivation of Until Rules and Application to Timer Verification"],"prefix":"10.1007","author":[{"given":"Jessica","family":"Ertel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland","family":"Gl\u00fcck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"M\u00f6ller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,6]]},"reference":[{"key":"15_CR1","unstructured":"Coq. https:\/\/coq.inria.fr\/ . Accessed 7 July 2015"},{"key":"15_CR2","unstructured":"IEC61131. http:\/\/webstore.iec.ch\/webstore\/webstore.nsf\/artnum\/048541!opendocument . Accessed 20 Mar 2018"},{"key":"15_CR3","unstructured":"The KIV system. http:\/\/www.isse.uni-augsburg.de\/en\/software\/kiv\/ . Accessed 20 Mar 2018"},{"key":"15_CR4","unstructured":"NuSMVExamples. http:\/\/nusmv.fbk.eu\/examples\/examples.html . Accessed 7 Aug 2018"},{"key":"15_CR5","unstructured":"Step7. http:\/\/w3.siemens.com\/mcms\/simatic-controller-software\/en\/step7\/Pages\/Default.aspx . Accessed 20 Mar 2018"},{"key":"15_CR6","unstructured":"Verification of pedestrian lights in MKA. http:\/\/rolandglueck.de\/Downloads\/Pedestrian_lights_verified.zip . Accessed 20 Mar 2018"},{"key":"15_CR7","unstructured":"VerifyThis 2015. http:\/\/verifythis2015.cost-ic0701.org\/results . Accessed 8 Aug 2018"},{"key":"15_CR8","unstructured":"VerifyThis 2017. http:\/\/www.pm.inf.ethz.ch\/research\/verifythis\/Archive\/2017.html . Accessed 8 Aug 2018"},{"issue":"2","key":"15_CR9","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR10","series-title":"Graduate Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1674-2","volume-title":"Refinement Calculus - A Systematic Introduction","author":"R-J Back","year":"1998","unstructured":"Back, R.-J., von Wright, J.: Refinement Calculus - A Systematic Introduction. Graduate Texts in Computer Science. Springer, New York (1998)"},{"key":"15_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-4129-7","volume-title":"Mathematical Logic for Computer Science","author":"M Ben-Ari","year":"2012","unstructured":"Ben-Ari, M.: Mathematical Logic for Computer Science, 3rd edn. Springer, London (2012)","edition":"3"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.jlamp.2017.04.001","volume":"90","author":"R Berghammer","year":"2017","unstructured":"Berghammer, R., Stucke, I., Winter, M.: Using relation-algebraic means and tool support for investigating and computing bipartitions. J. Log. Algebr. Meth. Prog. 90, 102\u2013124 (2017)","journal-title":"J. Log. Algebr. Meth. Prog."},{"key":"15_CR13","unstructured":"Birkhoff, G.: Lattice Theory, 3rd edn. American Mathematical Society, Providence (1967)"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-319-43144-4_29","volume-title":"Interactive Theorem Proving","author":"P Brunet","year":"2016","unstructured":"Brunet, P., Pous, D., Stucke, I.: Cardinalities of finite relations in Coq. In: Blanchette, J.C., Merz, S. (eds.) ITP 2016. LNCS, vol. 9807, pp. 466\u2013474. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-43144-4_29"},{"issue":"2","key":"15_CR15","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1109\/TII.2011.2182653","volume":"8","author":"H Carlsson","year":"2012","unstructured":"Carlsson, H., Svensson, B., Danielson, F., Lennartson, B.: Methods for reliable simulation-based PLC code verification. IEEE Trans. Ind. Inform. 8(2), 267\u2013278 (2012)","journal-title":"IEEE Trans. Ind. Inform."},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-319-57418-9_6","volume-title":"Relational and Algebraic Methods in Computer Science","author":"J Desharnais","year":"2017","unstructured":"Desharnais, J., M\u00f6ller, B.: Non-associative Kleene algebra and temporal logics. In: H\u00f6fner, P., Pous, D., Struth, G. (eds.) RAMICS 2017. LNCS, vol. 10226, pp. 93\u2013108. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57418-9_6"},{"key":"15_CR17","first-page":"93","volume":"1","author":"J Desharnais","year":"2004","unstructured":"Desharnais, J., M\u00f6ller, B., Struth, G.: Modal Kleene algebra and applications - a survey. J. Relat. Methods Comput. Sci. 1, 93\u2013131 (2004)","journal-title":"J. Relat. Methods Comput. Sci."},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-24771-5_10","volume-title":"Relational and Kleene-Algebraic Methods in Computer Science","author":"T Ehm","year":"2004","unstructured":"Ehm, T., M\u00f6ller, B., Struth, G.: Kleene modules. In: Berghammer, R., M\u00f6ller, B., Struth, G. (eds.) RelMiCS 2003. LNCS, vol. 3051, pp. 112\u2013123. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24771-5_10"},{"key":"15_CR19","unstructured":"Ertel, J.: Verifikation von SPS-Programmen MIT Kleene Algebra. Master\u2019s thesis, Institut of Informatics, University of Augsburg (2017)"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-319-02444-8_9","volume-title":"Automated Technology for Verification and Analysis","author":"Z \u00c9sik","year":"2013","unstructured":"\u00c9sik, Z., Fahrenberg, U., Legay, A., Quaas, K.: Kleene algebras and semimodules for energy problems. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 102\u2013117. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-02444-8_9"},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-319-24704-5_15","volume-title":"Relational and Algebraic Methods in Computer Science","author":"R Gl\u00fcck","year":"2015","unstructured":"Gl\u00fcck, R., Krebs, F.B.: Towards interactive verification of programmable logic controllers using modal Kleene algebra and KIV. In: Kahl, W., Winter, M., Oliveira, J.N. (eds.) RAMICS 2015. LNCS, vol. 9348, pp. 241\u2013256. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24704-5_15"},{"key":"15_CR22","volume-title":"Graphs, Dioids and Semirings","author":"M Gondran","year":"2008","unstructured":"Gondran, M., Minoux, M.: Graphs, Dioids and Semirings. Springer, Heidelberg (2008)"},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-319-57418-9_8","volume-title":"Relational and Algebraic Methods in Computer Science","author":"W Guttmann","year":"2017","unstructured":"Guttmann, W.: Stone relation algebras. In: H\u00f6fner, P., Pous, D., Struth, G. (eds.) RAMICS 2017. LNCS, vol. 10226, pp. 127\u2013143. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57418-9_8"},{"issue":"4\u20136","key":"15_CR24","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s00165-012-0245-4","volume":"24","author":"P H\u00f6fner","year":"2012","unstructured":"H\u00f6fner, P., M\u00f6ller, B.: Dijkstra, Floyd and Warshall meet Kleene. Formal Asp. Comput. 24(4\u20136), 459\u2013476 (2012)","journal-title":"Formal Asp. Comput."},{"issue":"4","key":"15_CR25","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1023\/A:1008271805106","volume":"6","author":"M Hollenberg","year":"1997","unstructured":"Hollenberg, M.: An equational axiomatization of dynamic negation and relational composition. J. Log. Lang. Inf. 6(4), 381\u2013401 (1997)","journal-title":"J. Log. Lang. Inf."},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BFb0028021","volume-title":"Computer Science Logic","author":"M Hollenberg","year":"1998","unstructured":"Hollenberg, M.: Equational axioms of test algebra. In: Nielsen, M., Thomas, W. (eds.) CSL 1997. LNCS, vol. 1414, pp. 295\u2013310. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0028021"},{"issue":"1","key":"15_CR27","first-page":"119","volume":"16","author":"M Jackson","year":"2006","unstructured":"Jackson, M., McKenzie, R.: Interpreting graph colorability in finite semigroups. IJAC 16(1), 119\u2013140 (2006)","journal-title":"IJAC"},{"issue":"7","key":"15_CR28","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1016\/j.infsof.2009.01.003","volume":"51","author":"E Jee","year":"2009","unstructured":"Jee, E., Yoo, J., Cha, S.D., Bae, D.-H.: A data flow-based structural testing technique for FBD programs. Inf. Softw. Technol. 51(7), 1131\u20131139 (2009)","journal-title":"Inf. Softw. Technol."},{"key":"15_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0090224","volume-title":"Varieties of Lattices","author":"P Jipsen","year":"1992","unstructured":"Jipsen, P., Rose, H.: Varieties of Lattices, 1st edn. Springer, Heidelberg (1992)","edition":"1"},{"key":"15_CR30","first-page":"5.1","volume":"71","author":"W Kahl","year":"2014","unstructured":"Kahl, W.: Graph transformation with symbolic attributes via monadic coalgebra homomorphisms. ECEASST 71, 5.1\u20135.17 (2014)","journal-title":"ECEASST"},{"issue":"1","key":"15_CR31","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0165-0114(97)00061-4","volume":"101","author":"Y Kawahara","year":"1999","unstructured":"Kawahara, Y., Furusawa, H.: An algebraic formalization of fuzzy relations. Fuzzy Sets Syst. 101(1), 125\u2013135 (1999)","journal-title":"Fuzzy Sets Syst."},{"issue":"2","key":"15_CR32","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D Kozen","year":"1994","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Inf. Comput. 110(2), 366\u2013390 (1994)","journal-title":"Inf. Comput."},{"issue":"3","key":"15_CR33","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/256167.256195","volume":"19","author":"D Kozen","year":"1997","unstructured":"Kozen, D.: Kleene algebra with tests. ACM Trans. Prog. Lang. Syst. 19(3), 427\u2013443 (1997)","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"15_CR34","unstructured":"Kr\u00f6ger, F., Merz, S.: Temporal Logic and State Systems. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2008)"},{"key":"15_CR35","unstructured":"Li, J., Qeriqi, A., Steffen, M., Yu, I.C.: Automatic translation from FBD-PLC-programs to NuSMV for model checking safety-critical control systems. In: NIK 2016. Bibsys Open Journal Systems, Norway (2016)"},{"key":"15_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-319-06251-8_20","volume-title":"Relational and Algebraic Methods in Computer Science","author":"T Litak","year":"2014","unstructured":"Litak, T., Mikul\u00e1s, S., Hidders, J.: Relational lattices. In: H\u00f6fner, P., Jipsen, P., Kahl, W., M\u00fcller, M.E. (eds.) RAMICS 2014. LNCS, vol. 8428, pp. 327\u2013343. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06251-8_20"},{"key":"15_CR37","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF02572645","volume":"31","author":"E Manes","year":"1985","unstructured":"Manes, E., Benson, D.: The inverse semigroup of a sum-ordered semiring. Semigroup Forum 31, 129\u2013152 (1985)","journal-title":"Semigroup Forum"},{"key":"15_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-21070-9_21","volume-title":"Relational and Algebraic Methods in Computer Science","author":"G Michels","year":"2011","unstructured":"Michels, G., Joosten, S., van der Woude, J., Joosten, S.: Ampersand. In: de Swart, H. (ed.) RAMICS 2011. LNCS, vol. 6663, pp. 280\u2013293. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21070-9_21"},{"key":"15_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/11784180_21","volume-title":"Algebraic Methodology and Software Technology","author":"B M\u00f6ller","year":"2006","unstructured":"M\u00f6ller, B., H\u00f6fner, P., Struth, G.: Quantales and temporal logics. In: Johnson, M., Vene, V. (eds.) AMAST 2006. LNCS, vol. 4019, pp. 263\u2013277. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11784180_21"},{"issue":"3","key":"15_CR40","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.jlamp.2015.01.001","volume":"84","author":"B M\u00f6ller","year":"2015","unstructured":"M\u00f6ller, B., Roocks, P.: An algebra of database preferences. J. Log. Algebr. Meth. Program. 84(3), 456\u2013481 (2015)","journal-title":"J. Log. Algebr. Meth. Program."},{"issue":"2","key":"15_CR41","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.jlap.2014.02.013","volume":"83","author":"JN Oliveira","year":"2014","unstructured":"Oliveira, J.N.: A relation-algebraic approach to the \u201cHoare logic\u201d of functional dependencies. J. Log. Algebr. Meth. Prog. 83(2), 249\u2013262 (2014)","journal-title":"J. Log. Algebr. Meth. Prog."},{"key":"15_CR42","doi-asserted-by":"crossref","unstructured":"Pavlovic, O., Ehrich, H.-D.: Model checking PLC software written in function block diagram. In: ICST 2010, CEUR Workshop Proceedings. IEEE Computer Society (2010)","DOI":"10.1109\/ICST.2010.10"},{"key":"15_CR43","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/BF00370685","volume":"50","author":"V Pratt","year":"1991","unstructured":"Pratt, V.: Dynamic algebras: examples, constructions, applications. Studia Logica 50, 571\u2013605 (1991)","journal-title":"Studia Logica"},{"issue":"1","key":"15_CR44","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/JRPROC.1949.232969","volume":"37","author":"CE Shannon","year":"1949","unstructured":"Shannon, C.E.: Communication in the presence of noise. Proc. IRE 37(1), 10\u201321 (1949)","journal-title":"Proc. IRE"},{"issue":"8","key":"15_CR45","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.scico.2007.11.004","volume":"74","author":"K Solin","year":"2009","unstructured":"Solin, K., von Wright, J.: Enabledness and termination in refinement algebra. Sci. Comput. Prog. 74(8), 654\u2013668 (2009)","journal-title":"Sci. Comput. Prog."},{"issue":"3","key":"15_CR46","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1017\/S0960129598002540","volume":"8","author":"B Karger von","year":"1998","unstructured":"von Karger, B.: Temporal algebra. Math. Struct. Comput. Sci. 8(3), 277\u2013320 (1998)","journal-title":"Math. Struct. Comput. Sci."},{"key":"15_CR47","doi-asserted-by":"crossref","unstructured":"Wan, H., Chen, G., Song, X., Gu, M.: Formalization and verification of PLC timers in Coq. In: Ahamed, S.I., et al. (eds.): Proceedings of the COMPSAC 2009, pp. 315\u2013323. IEEE Computer Society (2009)","DOI":"10.1109\/COMPSAC.2009.49"},{"key":"15_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-319-89960-2_4","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Wimmer","year":"2018","unstructured":"Wimmer, S., Lammich, P.: Verified model checking of timed automata. In: Beyer, D., Huisman, M. (eds.) TACAS 2018. LNCS, vol. 10805, pp. 61\u201378. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89960-2_4"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-02149-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T11:07:36Z","timestamp":1572001656000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-02149-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030021481","9783030021498"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02149-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"RAMiCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Relational and Algebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Groningen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","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":"29 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ramics2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ramics-conference.org\/","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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"70% - 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"}},{"value":"4.06","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4.17","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"1 full invited talk","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}