{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T12:19:49Z","timestamp":1763727589786,"version":"3.40.3"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030309411"},{"type":"electronic","value":"9783030309428"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-30942-8_38","type":"book-chapter","created":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T23:03:06Z","timestamp":1569193386000},"page":"651-669","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["$$L^*$$-Based Learning of Markov Decision Processes"],"prefix":"10.1007","author":[{"given":"Martin","family":"Tappler","sequence":"first","affiliation":[]},{"given":"Bernhard K.","family":"Aichernig","sequence":"additional","affiliation":[]},{"given":"Giovanni","family":"Bacci","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Eichlseder","sequence":"additional","affiliation":[]},{"given":"Kim G.","family":"Larsen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,23]]},"reference":[{"key":"38_CR1","doi-asserted-by":"publisher","unstructured":"Aichernig, B.K., Mostowski, W., Mousavi, M.R., Tappler, M., Taromirad, M.: Model learning and model-based testing. In: Bennaceur et al. [9], pp. 74\u2013100. \nhttps:\/\/doi.org\/10.1007\/978-3-319-96562-8_3","DOI":"10.1007\/978-3-319-96562-8_3"},{"key":"38_CR2","doi-asserted-by":"publisher","unstructured":"Aichernig, B.K., Tappler, M.: Efficient active automata learning via mutation testing. J. Autom. Reasoning (2018). \nhttps:\/\/doi.org\/10.1007\/s10817-018-9486-0","DOI":"10.1007\/s10817-018-9486-0"},{"key":"38_CR3","doi-asserted-by":"publisher","unstructured":"Aichernig, B.K., Tappler, M.: Probabilistic black-box reachability checking (extended version). Formal Methods Syst. Des. (2019). \nhttps:\/\/doi.org\/10.1007\/s10703-019-00333-0","DOI":"10.1007\/s10703-019-00333-0"},{"issue":"2","key":"38_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.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87\u2013106 (1987). \nhttps:\/\/doi.org\/10.1016\/0890-5401(87)90052-6","journal-title":"Inf. Comput."},{"key":"38_CR5","unstructured":"Bacci, G., Bacci, G., Larsen, K.G., Mardare, R.: MDPDist library. \nhttp:\/\/people.cs.aau.dk\/~giovbacci\/tools\/bisimdist.zip\n\n. Accessed 28 June 2019"},{"key":"38_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-40313-2_9","volume-title":"Mathematical Foundations of Computer Science 2013","author":"G Bacci","year":"2013","unstructured":"Bacci, G., Bacci, G., Larsen, K.G., Mardare, R.: Computing behavioral distances, compositionally. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol. 8087, pp. 74\u201385. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-40313-2_9"},{"key":"38_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-642-40196-1_23","volume-title":"Quantitative Evaluation of Systems","author":"G Bacci","year":"2013","unstructured":"Bacci, G., Bacci, G., Larsen, K.G., Mardare, R.: The BisimDist library: efficient computation of bisimilarity distances for Markovian models. In: Joshi, K., Siegle, M., Stoelinga, M., D\u2019Argenio, P.R. (eds.) QEST 2013. LNCS, vol. 8054, pp. 278\u2013281. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-40196-1_23"},{"key":"38_CR8","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"key":"38_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96562-8","volume-title":"Machine Learning for Dynamic Software Analysis: Potentials and Limits","year":"2018","unstructured":"Bennaceur, A., H\u00e4hnle, R., Meinke, K. (eds.): Machine Learning for Dynamic Software Analysis: Potentials and Limits. LNCS, vol. 11026. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-96562-8"},{"issue":"6","key":"38_CR10","doi-asserted-by":"publisher","first-page":"1268","DOI":"10.1137\/S009753979326091X","volume":"25","author":"F Bergadano","year":"1996","unstructured":"Bergadano, F., Varricchio, S.: Learning behaviors of automata from multiplicity and equivalence queries. SIAM J. Comput. 25(6), 1268\u20131280 (1996). \nhttps:\/\/doi.org\/10.1137\/S009753979326091X","journal-title":"SIAM J. Comput."},{"key":"38_CR11","doi-asserted-by":"publisher","unstructured":"Bernardo, M., Issarny, V. (eds.): Formal Methods for Eternal Networked Software Systems - 11th International School on Formal Methods for the Design of Computer, Communication and Software Systems, SFM 2011, Bertinoro, Italy, 13\u201318 June 2011, Advanced Lectures. LNCS, vol. 6659. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-21455-4","DOI":"10.1007\/978-3-642-21455-4"},{"key":"38_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-58473-0_144","volume-title":"Grammatical Inference and Applications","author":"RC Carrasco","year":"1994","unstructured":"Carrasco, R.C., Oncina, J.: Learning stochastic regular grammars by means of a state merging method. In: Carrasco, R.C., Oncina, J. (eds.) ICGI 1994. LNCS, vol. 862, pp. 139\u2013152. Springer, Heidelberg (1994). \nhttps:\/\/doi.org\/10.1007\/3-540-58473-0_144"},{"issue":"1","key":"38_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1051\/ita:1999102","volume":"33","author":"RC Carrasco","year":"1999","unstructured":"Carrasco, R.C., Oncina, J.: Learning deterministic regular grammars from stochastic samples in polynomial time. ITA 33(1), 1\u201320 (1999). \nhttps:\/\/doi.org\/10.1051\/ita:1999102","journal-title":"ITA"},{"issue":"2","key":"38_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00165-016-0355-5","volume":"28","author":"S Cassel","year":"2016","unstructured":"Cassel, S., Howar, F., Jonsson, B., Steffen, B.: Active learning for extended finite state machines. Formal Aspects Comput. 28(2), 233\u2013263 (2016). \nhttps:\/\/doi.org\/10.1007\/s00165-016-0355-5","journal-title":"Formal Aspects Comput."},{"key":"38_CR15","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-662-48395-4_5","volume-title":"Topics in Grammatical Inference","author":"J Castro","year":"2016","unstructured":"Castro, J., Gavald\u00e0, R.: Learning probability distributions generated by finite-state machines. In: Heinz, J., Sempere, J.M. (eds.) Topics in Grammatical Inference, pp. 113\u2013142. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-48395-4_5"},{"key":"38_CR16","doi-asserted-by":"publisher","unstructured":"Chen, Y., Nielsen, T.D.: Active learning of Markov decision processes for system verification. In: 11th International Conference on Machine Learning and Applications, ICMLA, Boca Raton, FL, USA, 12\u201315 December 2012, vol. 2, pp. 289\u2013294. IEEE (2012). \nhttps:\/\/doi.org\/10.1109\/ICMLA.2012.158","DOI":"10.1109\/ICMLA.2012.158"},{"key":"38_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/978-3-642-24372-1_40","volume-title":"Automated Technology for Verification and Analysis","author":"L Feng","year":"2011","unstructured":"Feng, L., Han, T., Kwiatkowska, M.Z., Parker, D.: Learning-based compositional verification for synchronous probabilistic systems. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 511\u2013521. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-24372-1_40"},{"key":"38_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-319-41540-6_25","volume-title":"Computer Aided Verification","author":"P Fiter\u0103u-Bro\u015ftean","year":"2016","unstructured":"Fiter\u0103u-Bro\u015ftean, P., Janssen, R., Vaandrager, F.: Combining model learning and model checking to analyze TCP implementations. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9780, pp. 454\u2013471. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-41540-6_25"},{"key":"38_CR19","doi-asserted-by":"publisher","unstructured":"Forejt, V., Kwiatkowska, M.Z., Norman, G., Parker, D.: Automated verification techniques for probabilistic systems. In: Bernardo and Issarny [11], pp. 53\u2013113. \nhttps:\/\/doi.org\/10.1007\/978-3-642-21455-4_3","DOI":"10.1007\/978-3-642-21455-4_3"},{"key":"38_CR20","unstructured":"Fu, J., Topcu, U.: Probably approximately correct MDP learning and control with temporal logic constraints. In: Fox, D., Kavraki, L.E., Kurniawati, H. (eds.) Robotics: Science and Systems X, University of California, Berkeley, USA, 12\u201316 July 2014 (2014). \nhttp:\/\/www.roboticsproceedings.org\/rss10\/p39.html"},{"issue":"301","key":"38_CR21","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13\u201330 (1963). \nhttp:\/\/www.jstor.org\/stable\/2282952","journal-title":"J. Am. Stat. Assoc."},{"key":"38_CR22","doi-asserted-by":"publisher","unstructured":"Howar, F., Steffen, B.: Active automata learning in practice - an annotated bibliography of the years 2011 to 2016. In: Bennaceur et al. [9], pp. 123\u2013148. \nhttps:\/\/doi.org\/10.1007\/978-3-319-96562-8_5","DOI":"10.1007\/978-3-319-96562-8_5"},{"key":"38_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-540-45069-6_31","volume-title":"Computer Aided Verification","author":"H Hungar","year":"2003","unstructured":"Hungar, H., Niese, O., Steffen, B.: Domain-specific optimization in automata learning. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 315\u2013327. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/978-3-540-45069-6_31"},{"key":"38_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-319-11164-3_26","volume-title":"Runtime Verification","author":"M Isberner","year":"2014","unstructured":"Isberner, M., Howar, F., Steffen, B.: The TTT algorithm: a redundancy-free approach to active automata learning. In: Bonakdarpour, B., Smolka, S.A. (eds.) RV 2014. LNCS, vol. 8734, pp. 307\u2013322. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-11164-3_26"},{"key":"38_CR25","unstructured":"Khalili, A., Tacchella, A.: Learning nondeterministic Mealy machines. In: Clark, A., Kanazawa, M., Yoshinaka, R. (eds.) Proceedings of the 12th International Conference on Grammatical Inference, ICGI 2014, Kyoto, Japan, 17\u201319 September 2014. JMLR Workshop and Conference Proceedings, vol. 34, pp. 109\u2013123. JMLR.org (2014). \nhttp:\/\/jmlr.org\/proceedings\/papers\/v34\/khalili14a.html"},{"issue":"3","key":"38_CR26","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/1481506.1481511","volume":"36","author":"MZ Kwiatkowska","year":"2008","unstructured":"Kwiatkowska, M.Z., Norman, G., Parker, D.: Analysis of a gossip protocol in PRISM. SIGMETRICS Perform. Eval. Rev. 36(3), 17\u201322 (2008). \nhttps:\/\/doi.org\/10.1145\/1481506.1481511","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"key":"38_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-642-22110-1_47","volume-title":"Computer Aided Verification","author":"MZ Kwiatkowska","year":"2011","unstructured":"Kwiatkowska, M.Z., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 585\u2013591. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-22110-1_47"},{"key":"38_CR28","doi-asserted-by":"publisher","unstructured":"Mao, H., Chen, Y., Jaeger, M., Nielsen, T.D., Larsen, K.G., Nielsen, B.: Learning Markov decision processes for model checking. In: Fahrenberg, U., Legay, A., Thrane, C.R. (eds.) Proceedings Quantities in Formal Methods, QFM 2012, Paris, France, 28 August 2012. EPTCS, vol. 103, pp. 49\u201363 (2012). \nhttps:\/\/doi.org\/10.4204\/EPTCS.103.6","DOI":"10.4204\/EPTCS.103.6"},{"issue":"2","key":"38_CR29","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10994-016-5565-9","volume":"105","author":"H Mao","year":"2016","unstructured":"Mao, H., Chen, Y., Jaeger, M., Nielsen, T.D., Larsen, K.G., Nielsen, B.: Learning deterministic probabilistic automata from a model checking perspective. Mach. Learn. 105(2), 255\u2013299 (2016). \nhttps:\/\/doi.org\/10.1007\/s10994-016-5565-9","journal-title":"Mach. Learn."},{"key":"38_CR30","doi-asserted-by":"publisher","unstructured":"Margaria, T., Niese, O., Raffelt, H., Steffen, B.: Efficient test-based model generation for legacy reactive systems. In: Ninth IEEE International High-Level Design Validation and Test Workshop 2004, pp. 95\u2013100. IEEE Computer Society (2004). \nhttps:\/\/doi.org\/10.1109\/HLDVT.2004.1431246","DOI":"10.1109\/HLDVT.2004.1431246"},{"key":"38_CR31","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","volume":"9","author":"A Nerode","year":"1958","unstructured":"Nerode, A.: Linear automaton transformations. Proc. Am. Math. Soc. 9, 541\u2013544 (1958)","journal-title":"Proc. Am. Math. Soc."},{"issue":"6","key":"38_CR32","doi-asserted-by":"publisher","first-page":"561","DOI":"10.3233\/JCS-2006-14604","volume":"14","author":"G Norman","year":"2006","unstructured":"Norman, G., Shmatikov, V.: Analysis of probabilistic contract signing. J. Comput. Secur. 14(6), 561\u2013589 (2006). \nhttp:\/\/content.iospress.com\/articles\/journal-of-computer-security\/jcs268","journal-title":"J. Comput. Secur."},{"issue":"2","key":"38_CR33","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1006\/inco.1993.1021","volume":"103","author":"RL Rivest","year":"1993","unstructured":"Rivest, R.L., Schapire, R.E.: Inference of finite automata using homing sequences. Inf. Comput. 103(2), 299\u2013347 (1993). \nhttps:\/\/doi.org\/10.1006\/inco.1993.1021","journal-title":"Inf. Comput."},{"key":"38_CR34","unstructured":"de Ruiter, J., Poll, E.: Protocol state fuzzing of TLS implementations. In: Jung, J., Holz, T. (eds.) 24th USENIX Security Symposium, USENIX Security 15, Washington, D.C., USA, 12\u201314 August 2015, pp. 193\u2013206. USENIX Association (2015). \nhttps:\/\/www.usenix.org\/conference\/usenixsecurity15\/technical-sessions\/presentation\/de-ruiter"},{"key":"38_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-05089-3_14","volume-title":"FM 2009: Formal Methods","author":"M Shahbaz","year":"2009","unstructured":"Shahbaz, M., Groz, R.: Inferring Mealy machines. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol. 5850, pp. 207\u2013222. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-05089-3_14"},{"key":"38_CR36","doi-asserted-by":"publisher","unstructured":"Steffen, B., Howar, F., Merten, M.: Introduction to active automata learning from a practical perspective. In: Bernardo and Issarny [11], pp. 256\u2013296. \nhttps:\/\/doi.org\/10.1007\/978-3-642-21455-4_8","DOI":"10.1007\/978-3-642-21455-4_8"},{"key":"38_CR37","doi-asserted-by":"publisher","unstructured":"Tappler, M.: Evaluation material for $${L}^*$$-based learning of Markov decision processes. \nhttps:\/\/doi.org\/10.6084\/m9.figshare.7960928.v1","DOI":"10.6084\/m9.figshare.7960928.v1"},{"key":"38_CR38","unstructured":"Tappler, M., Aichernig, B.K., Bacci, G., Eichlseder, M., Larsen, K.G.: $$L^*$$-based learning of Markov decision processes (extended version). CoRR \narXiv:1906.12239\n\n (2019), \nhttp:\/\/arxiv.org\/abs\/1906.12239"},{"key":"38_CR39","doi-asserted-by":"publisher","unstructured":"Tappler, M., Aichernig, B.K., Bloem, R.: Model-based testing IoT communication via active automata learning. In: 2017 IEEE International Conference on Software Testing, Verification and Validation, ICST 2017, Tokyo, Japan, 13\u201317 March 2017, pp. 276\u2013287. IEEE Computer Society (2017). \nhttps:\/\/doi.org\/10.1109\/ICST.2017.32","DOI":"10.1109\/ICST.2017.32"},{"issue":"3","key":"38_CR40","first-page":"103","volume":"17","author":"J Tretmans","year":"1996","unstructured":"Tretmans, J.: Test generation with inputs, outputs and repetitive quiescence. Softw. Concepts Tools 17(3), 103\u2013120 (1996)","journal-title":"Softw. Concepts Tools"},{"key":"38_CR41","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00992862","volume":"8","author":"W Tzeng","year":"1992","unstructured":"Tzeng, W.: Learning probabilistic automata and Markov chains via queries. Mach. Learn. 8, 151\u2013166 (1992). \nhttps:\/\/doi.org\/10.1007\/BF00992862","journal-title":"Mach. Learn."},{"issue":"11","key":"38_CR42","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"LG Valiant","year":"1984","unstructured":"Valiant, L.G.: A theory of the learnable. Commun. ACM 27(11), 1134\u20131142 (1984). \nhttps:\/\/doi.org\/10.1145\/1968.1972","journal-title":"Commun. ACM"},{"key":"38_CR43","doi-asserted-by":"publisher","unstructured":"Volpato, M., Tretmans, J.: Approximate active learning of nondeterministic input output transition systems. ECEASST 72 (2015). \nhttps:\/\/doi.org\/10.14279\/tuj.eceasst.72.1008","DOI":"10.14279\/tuj.eceasst.72.1008"},{"key":"38_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-540-70952-7_9","volume-title":"Formal Methods: Applications and Technology","author":"TAC Willemse","year":"2007","unstructured":"Willemse, T.A.C.: Heuristics for ioco-based test-based modelling. In: Brim, L., Haverkort, B., Leucker, M., van de Pol, J. (eds.) FMICS 2006. LNCS, vol. 4346, pp. 132\u2013147. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-70952-7_9"}],"container-title":["Lecture Notes in Computer Science","Formal Methods \u2013 The Next 30 Years"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30942-8_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,5]],"date-time":"2020-05-05T06:11:24Z","timestamp":1588659084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30942-8_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030309411","9783030309428"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30942-8_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/formalmethods2019.inesctec.pt\/","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":"129","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":"44","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":"7","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":"34% - 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":"4","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":"5,5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}