{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:22:23Z","timestamp":1742970143677,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030614690"},{"type":"electronic","value":"9783030614706"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-61470-6_29","type":"book-chapter","created":{"date-parts":[[2020,10,26]],"date-time":"2020-10-26T18:03:12Z","timestamp":1603735392000},"page":"491-506","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Case Study of Policy Synthesis for Swarm Robotics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4072-1000","authenticated-orcid":false,"given":"Paul","family":"Piho","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4914-9255","authenticated-orcid":false,"given":"Jane","family":"Hillston","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,27]]},"reference":[{"issue":"1","key":"29_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2005.07.022","volume":"345","author":"C Baier","year":"2005","unstructured":"Baier, C., Hermanns, H., Katoen, J., Haverkort, B.R.: Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes. Theor. Comput. Sci. 345(1), 2\u201326 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.peva.2017.08.007","volume":"116","author":"E Bartocci","year":"2017","unstructured":"Bartocci, E., Bortolussi, L., Br\u00e1zdil, T., Milios, D., Sanguinetti, G.: Policy learning in continuous-time Markov decision processes using Gaussian processes. Perform. Eval. 116, 84\u2013100 (2017)","journal-title":"Perform. Eval."},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/3-540-61604-7_63","volume-title":"CONCUR 1996: Concurrency Theory","author":"M Bernardo","year":"1996","unstructured":"Bernardo, M., Gorrieri, R.: Extended Markovian process algebra. In: Montanari, U., Sassone, V. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 315\u2013330. Springer, Heidelberg (1996). \nhttps:\/\/doi.org\/10.1007\/3-540-61604-7_63"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.ic.2016.01.004","volume":"247","author":"L Bortolussi","year":"2016","unstructured":"Bortolussi, L., Milios, D., Sanguinetti, G.: Smoothed model checking for uncertain continuous-time Markov chains. Inf. Comput. 247, 235\u2013253 (2016)","journal-title":"Inf. Comput."},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-319-47151-8_11","volume-title":"Hybrid Systems Biology","author":"L Bortolussi","year":"2016","unstructured":"Bortolussi, L., Policriti, A., Silvetti, S.: Logic-based multi-objective design of chemical reaction networks. In: Cinquemani, E., Donz\u00e9, A. (eds.) HSB 2016. LNCS, vol. 9957, pp. 164\u2013178. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-47151-8_11"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-319-89963-3_23","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Bortolussi","year":"2018","unstructured":"Bortolussi, L., Silvetti, S.: Bayesian statistical parameter synthesis for linear temporal properties of stochastic models. In: Beyer, D., Huisman, M. (eds.) TACAS 2018. LNCS, vol. 10806, pp. 396\u2013413. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-89963-3_23"},{"issue":"4","key":"29_CR7","first-page":"17:1","volume":"9","author":"M Brambilla","year":"2014","unstructured":"Brambilla, M., Brutschy, A., Dorigo, M., Birattari, M.: Property-driven design for robot swarms: a design method based on prescriptive modeling and model checking. ACM Trans. Auton. Adapt. Syst. 9(4), 17:1\u201317:28 (2014)","journal-title":"ACM Trans. Auton. Adapt. Syst."},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-319-24953-7_12","volume-title":"Automated Technology for Verification and Analysis","author":"Y Butkova","year":"2015","unstructured":"Butkova, Y., Hatefi, H., Hermanns, H., Kr\u010d\u00e1l, J.: Optimal continuous time Markov decisions. In: Finkbeiner, B., Pu, G., Zhang, L. (eds.) ATVA 2015. LNCS, vol. 9364, pp. 166\u2013182. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-24953-7_12"},{"issue":"6","key":"29_CR9","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00236-016-0265-2","volume":"54","author":"M \u010ce\u0161ka","year":"2016","unstructured":"\u010ce\u0161ka, M., Dannenberg, F., Paoletti, N., Kwiatkowska, M., Brim, L.: Precise parameter synthesis for stochastic biochemical systems. Acta Informatica 54(6), 589\u2013623 (2016). \nhttps:\/\/doi.org\/10.1007\/s00236-016-0265-2","journal-title":"Acta Informatica"},{"issue":"1","key":"29_CR10","doi-asserted-by":"publisher","first-page":"5:1","DOI":"10.1145\/2522968.2522973","volume":"46","author":"R De Nicola","year":"2013","unstructured":"De Nicola, R., Latella, D., Loreti, M., Massink, M.: A uniform definition of stochastic process calculi. ACM Comput. Surv. 46(1), 5:1\u20135:35 (2013)","journal-title":"ACM Comput. Surv."},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-319-39519-7_8","volume-title":"Coordination Models and Languages","author":"V Galpin","year":"2016","unstructured":"Galpin, V.: Modelling ambulance deployment with Carma. In: Lluch Lafuente, A., Proen\u00e7a, J. (eds.) COORDINATION 2016. LNCS, vol. 9686, pp. 121\u2013137. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-39519-7_8"},{"issue":"2","key":"29_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3155338","volume":"28","author":"V Galpin","year":"2018","unstructured":"Galpin, V., Zon, N., Wilsdorf, P., Gilmore, S.: Mesoscopic modelling of pedestrian movement using CARMA and its tools. ACM Trans. Model. Comput. Simul. 28(2), 1\u201326 (2018)","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"29_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-319-10696-0_21","volume-title":"Quantitative Evaluation of Systems","author":"A Georgoulas","year":"2014","unstructured":"Georgoulas, A., Hillston, J., Milios, D., Sanguinetti, G.: Probabilistic programming process algebra. In: Norman, G., Sanders, W. (eds.) QEST 2014. LNCS, vol. 8657, pp. 249\u2013264. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-10696-0_21"},{"key":"29_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511569951","volume-title":"A Compositional Approach to Performance Modelling","author":"J Hillston","year":"1996","unstructured":"Hillston, J.: A Compositional Approach to Performance Modelling. Cambridge University Press, New York (1996)"},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-46029-2_13","volume-title":"Computer Performance Evaluation: Modelling Techniques and Tools","author":"M Kwiatkowska","year":"2002","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: PRISM: probabilistic symbolic model checker. In: Field, T., Harrison, P.G., Bradley, J., Harder, U. (eds.) TOOLS 2002. LNCS, vol. 2324, pp. 200\u2013204. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-46029-2_13"},{"key":"29_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-16612-9_11","volume-title":"Runtime Verification","author":"A Legay","year":"2010","unstructured":"Legay, A., Delahaye, B., Bensalem, S.: Statistical model checking: an overview. In: Barringer, H., et al. (eds.) RV 2010. LNCS, vol. 6418, pp. 122\u2013135. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-16612-9_11"},{"issue":"2","key":"29_CR17","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1019633424543","volume":"13","author":"K Lerman","year":"2002","unstructured":"Lerman, K., Galstyan, A.: Mathematical model of foraging in a group of robots: effect of interference. Auton. Robots 13(2), 127\u2013141 (2002). \nhttps:\/\/doi.org\/10.1023\/A:1019633424543","journal-title":"Auton. Robots"},{"key":"29_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-34096-8_4","volume-title":"Formal Methods for the Quantitative Evaluation of Collective Adaptive Systems","author":"M Loreti","year":"2016","unstructured":"Loreti, M., Hillston, J.: Modelling and analysis of collective adaptive systems with CARMA and its tools. In: Bernardo, M., De Nicola, R., Hillston, J. (eds.) SFM 2016. LNCS, vol. 9700, pp. 83\u2013119. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-34096-8_4"},{"issue":"5","key":"29_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3342355","volume":"52","author":"M Luckcuck","year":"2019","unstructured":"Luckcuck, M., Farrell, M., Dennis, L.A., Dixon, C., Fisher, M.: Formal specification and verification of autonomous robotic systems: a survey. ACM Comput. Surv. 52(5), 1\u201314 (2019)","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"29_CR20","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1109\/TPDS.2019.2943339","volume":"31","author":"H Lv","year":"2020","unstructured":"Lv, H., Hillston, J., Piho, P., Wang, H.: An attribute-based availability model for large scale IaaS clouds with CARMA. IEEE Trans. Parallel Distrib. Syst. 31(3), 733\u2013748 (2020)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"6","key":"29_CR21","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1007\/s10514-016-9577-x","volume":"41","author":"L Soriano\u00a0Marcolino","year":"2016","unstructured":"Soriano\u00a0Marcolino, L., Tavares\u00a0dos\u00a0Passos, Y., Fonseca\u00a0de\u00a0Souza, \u00c1.A., dos Santos\u00a0Rodrigues, A., Chaimowicz, L.: Avoiding target congestion on the navigation of robotic swarms. Auton. Robots 41(6), 1297\u20131320 (2016). \nhttps:\/\/doi.org\/10.1007\/s10514-016-9577-x","journal-title":"Auton. Robots"},{"key":"29_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-319-99154-2_22","volume-title":"Quantitative Evaluation of Systems","author":"P Piho","year":"2018","unstructured":"Piho, P., Hillston, J.: Policy synthesis for collective dynamics. In: McIver, A., Horvath, A. (eds.) QEST 2018. LNCS, vol. 11024, pp. 356\u2013372. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-99154-2_22"},{"key":"29_CR23","doi-asserted-by":"publisher","first-page":"15","DOI":"10.5334\/jors.151","volume":"5","author":"C Rackauckas","year":"2017","unstructured":"Rackauckas, C., Nie, Q.: DifferentialEquations.jl \u2013 a performant and feature-rich ecosystem for solving differential equations in Julia. J. Open Res. Softw. 5, 15 (2017)","journal-title":"J. Open Res. Softw."},{"issue":"1","key":"29_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11721-018-0161-1","volume":"13","author":"A Schroeder","year":"2018","unstructured":"Schroeder, A., Trease, B., Arsie, A.: Balancing robot swarm cost and interference effects by varying robot quantity and size. Swarm Intell. 13(1), 1\u201319 (2018). \nhttps:\/\/doi.org\/10.1007\/s11721-018-0161-1","journal-title":"Swarm Intell."},{"key":"29_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-030-03424-5_18","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation. Distributed Systems","author":"N Zon","year":"2018","unstructured":"Zon, N., Gilmore, S.: Data-driven modelling and simulation of urban transportation systems using Carma. In: Margaria, T., Steffen, B. (eds.) ISoLA 2018, Part III. LNCS, vol. 11246, pp. 274\u2013287. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-030-03424-5_18"}],"container-title":["Lecture Notes in Computer Science","Leveraging Applications of Formal Methods, Verification and Validation: Engineering Principles"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61470-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,26]],"date-time":"2020-10-26T18:15:00Z","timestamp":1603736100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-61470-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030614690","9783030614706"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61470-6_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"27 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISoLA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Leveraging Applications of Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rhodes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isola2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/isola-conference.org\/isola2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}