{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:28:17Z","timestamp":1743157697595,"version":"3.40.3"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030129873"},{"type":"electronic","value":"9783030129880"}],"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-12988-0_5","type":"book-chapter","created":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:50:09Z","timestamp":1548982209000},"page":"75-83","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Benchmark Library for Parametric Timed Model Checking"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8473-9555","authenticated-orcid":false,"given":"\u00c9tienne","family":"Andr\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,2]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/3-540-44585-4_46","volume-title":"Computer Aided Verification","author":"Y Abdedda\u00efm","year":"2001","unstructured":"Abdedda\u00efm, Y., Maler, O.: Job-shop scheduling using timed automata. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 478\u2013492. Springer, Heidelberg (2001). \n                    https:\/\/doi.org\/10.1007\/3-540-44585-4_46"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-540-49382-2_22","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"L Aceto","year":"1998","unstructured":"Aceto, L., Bouyer, P., Burgue\u00f1o, A., Larsen, K.G.: The power of reachability testing for timed automata. In: Arvind, V., Ramanujam, S. (eds.) FSTTCS 1998. LNCS, vol. 1530, pp. 245\u2013256. Springer, Heidelberg (1998). \n                    https:\/\/doi.org\/10.1007\/978-3-540-49382-2_22"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Alur, R., Henzinger, T.A., Vardi, M.Y.: Parametric real-time reasoning. In: Kosaraju, S.R., Johnson, D.S., Aggarwal, A. (eds.) Proceedings of the Twenty-fifth Annual ACM Symposium on Theory of Computing, STOC 1993, pp. 592\u2013601. ACM, New York (1993)","DOI":"10.1145\/167088.167242"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Andr\u00e9, \u00c9.: Observer patterns for real-time systems. In: Liu, Y., Martin, A. (eds.) 18th IEEE International Conference on Engineering of Complex Computer Systems, ICECCS 2013, pp. 125\u2013134. IEEE Computer Society, July 2013. \n                    https:\/\/doi.org\/10.1109\/ICECCS.2013.26","DOI":"10.1109\/ICECCS.2013.26"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Andr\u00e9, \u00c9.: What\u2019s decidable about parametric timed automata? Int. J. Softw. Tools Technol. Transf. (2018, to appear). \n                    https:\/\/doi.org\/10.1007\/s10009-017-0467-0","DOI":"10.1007\/s10009-017-0467-0"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Andr\u00e9, \u00c9., Chatain, Th., De Smet, O., Fribourg, L., Ruel, S.: Synth\u00e8se de contraintes temporis\u00e9es pour une architecture d\u2019automatisation en r\u00e9seau. In: Lime, D., Roux, O.H. (eds.) Actes du 7\u00e8me colloque sur la mod\u00e9lisation des syst\u00e8mes r\u00e9actifs, MSR 2009. Journal Europ\u00e9en des Syst\u00e8mes Automatis\u00e9s, vol. 43, pp. 1049\u20131064. Herm\u00e8s, November 2009","DOI":"10.3166\/jesa.43.1049-1064"},{"issue":"5","key":"5_CR7","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1142\/S0129054109006905","volume":"20","author":"\u00c9 Andr\u00e9","year":"2009","unstructured":"Andr\u00e9, \u00c9., Chatain, T., Encrenaz, E., Fribourg, L.: An inverse method for parametric timed automata. Int. J. Found. Comput. Sci. 20(5), 819\u2013836 (2009). \n                    https:\/\/doi.org\/10.1142\/S0129054109006905","journal-title":"Int. J. Found. Comput. Sci."},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-319-25423-4_21","volume-title":"Formal Engineering Methods","author":"\u00c9 Andr\u00e9","year":"2015","unstructured":"Andr\u00e9, \u00c9., Coti, C., Nguyen, H.G.: Enhanced distributed behavioral cartography of parametric timed automata. In: Butler, M., Conchon, S., Za\u00efdi, F. (eds.) ICFEM 2015. LNCS, vol. 9407, pp. 319\u2013335. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-25423-4_21"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-32759-9_6","volume-title":"Formal Methods","author":"\u00c9 Andr\u00e9","year":"2012","unstructured":"Andr\u00e9, \u00c9., Fribourg, L., K\u00fchne, U., Soulat, R.: IMITATOR 2.5: a tool for analyzing robustness in scheduling problems. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 33\u201336. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-32759-9_6"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Andr\u00e9, \u00c9., Hasuo, I., Waga, M.: Offline timed pattern matching under uncertainty. In: Lin, A.W., Sun, J. (eds.) Proceedings of the 23rd International Conference on Engineering of Complex Computer Systems, ICECCS 2018. IEEE (2018, to appear)","DOI":"10.1109\/ICECCS2018.2018.00010"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00151-3_3","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"\u00c9 Andr\u00e9","year":"2018","unstructured":"Andr\u00e9, \u00c9., Lime, D., Ramparison, M.: TCTL model checking lower\/upper-bound parametric timed automata without invariants. In: Jansen, D., Prabhakar, P. (eds.) FORMATS 2018. LNCS, vol. 11022. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-030-00151-3_3"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Andr\u00e9, \u00c9., Lime, D., Ramparison, M.: Timed automata with parametric updates. In: Juh\u00e1s, G., Chatain, T., Grosu, R. (eds.) Proceedings of the 18th International Conference on Application of Concurrency to System Design, ACSD 2018, pp. 21\u201329. IEEE (2018, to appear). \n                    https:\/\/doi.org\/10.1109\/ACSD.2018.000-2","DOI":"10.1109\/ACSD.2018.000-2"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-319-60225-7_2","volume-title":"Formal Techniques for Distributed Objects, Components, and Systems","author":"\u00c9 Andr\u00e9","year":"2017","unstructured":"Andr\u00e9, \u00c9., Lin, S.-W.: Learning-based compositional parameter synthesis for event-recording automata. In: Bouajjani, A., Silva, A. (eds.) FORTE 2017. LNCS, vol. 10321, pp. 17\u201332. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-60225-7_2"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"984","DOI":"10.1007\/978-3-642-39799-8_70","volume-title":"Computer Aided Verification","author":"\u00c9 Andr\u00e9","year":"2013","unstructured":"Andr\u00e9, \u00c9., Liu, Y., Sun, J., Dong, J.S., Lin, S.-W.: PSyHCoS: parameter synthesis for hierarchical concurrent real-time systems. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 984\u2013989. Springer, Heidelberg (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-642-39799-8_70"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-662-47666-6_6","volume-title":"Automata, Languages, and Programming","author":"N Bene\u0161","year":"2015","unstructured":"Bene\u0161, N., Bezd\u011bk, P., Larsen, K.G., Srba, J.: Language emptiness of continuous-time parametric timed automata. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 69\u201381. Springer, Heidelberg (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-662-47666-6_6"},{"issue":"2","key":"5_CR16","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10703-009-0074-0","volume":"35","author":"L Bozzelli","year":"2009","unstructured":"Bozzelli, L., La Torre, S.: Decision problems for lower\/upper bound parametric timed automata. Formal Methods Syst. Des. 35(2), 121\u2013151 (2009). \n                    https:\/\/doi.org\/10.1007\/s10703-009-0074-0","journal-title":"Formal Methods Syst. Des."},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/3-540-44618-4_12","volume-title":"CONCUR 2000 \u2014 Concurrency Theory","author":"F Cassez","year":"2000","unstructured":"Cassez, F., Larsen, K.: The impressive power of stopwatches. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 138\u2013152. Springer, Heidelberg (2000). \n                    https:\/\/doi.org\/10.1007\/3-540-44618-4_12"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-319-17524-9_29","volume-title":"NASA Formal Methods","author":"X Chen","year":"2015","unstructured":"Chen, X., Schupp, S., Makhlouf, I.B., \u00c1brah\u00e1m, E., Frehse, G., Kowalewski, S.: A benchmark suite for hybrid systems reachability analysis. In: Havelund, K., Holzmann, G., Joshi, R. (eds.) NFM 2015. LNCS, vol. 9058, pp. 408\u2013414. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-17524-9_29"},{"issue":"1","key":"5_CR19","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10703-008-0061-x","volume":"34","author":"R Chevallier","year":"2009","unstructured":"Chevallier, R., Encrenaz-Tiph\u00e8ne, E., Fribourg, L., Xu, W.: Timed verification of the generic architecture of a memory circuit using parametric timed automata. Formal Methods Syst. Des. 34(1), 59\u201381 (2009). \n                    https:\/\/doi.org\/10.1007\/s10703-008-0061-x","journal-title":"Formal Methods Syst. Des."},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"Claris\u00f3, R., Cortadella, J.: Verification of concurrent systems with parametric delays using octahedra. In: Proceedings of the Fifth International Conference on Application of Concurrency to System Design, ACSD 2005, pp. 122\u2013131. IEEE Computer Society (2005). \n                    https:\/\/doi.org\/10.1109\/ACSD.2005.34","DOI":"10.1109\/ACSD.2005.34"},{"issue":"1","key":"5_CR21","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.scico.2006.03.009","volume":"64","author":"R Claris\u00f3","year":"2007","unstructured":"Claris\u00f3, R., Cortadella, J.: The octahedron abstract domain. Sci. Comput. Program. 64(1), 115\u2013139 (2007). \n                    https:\/\/doi.org\/10.1016\/j.scico.2006.03.009","journal-title":"Sci. Comput. Program."},{"key":"5_CR22","unstructured":"Collomb-Annichini, A., Sighireanu, M.: Parameterized reachability analysis of the IEEE 1394 root contention protocol using TReX. In: Proceedings of the Real-Time Tools Workshop, RT-TOOLS 2001 (2001)"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/BFb0035403","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"PR D\u2019Argenio","year":"1997","unstructured":"D\u2019Argenio, P.R., Katoen, J.-P., Ruys, T.C., Tretmans, J.: The bounded retransmission protocol must be on time!. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol. 1217, pp. 416\u2013431. Springer, Heidelberg (1997). \n                    https:\/\/doi.org\/10.1007\/BFb0035403"},{"issue":"3","key":"5_CR24","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10009-007-0062-x","volume":"10","author":"G Frehse","year":"2008","unstructured":"Frehse, G.: PHAVer: algorithmic verification of hybrid systems past HyTech. Int. J. Softw. Tools Technol. Transf. 10(3), 263\u2013279 (2008). \n                    https:\/\/doi.org\/10.1007\/s10009-007-0062-x","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-642-22110-1_30","volume-title":"Computer Aided Verification","author":"G Frehse","year":"2011","unstructured":"Frehse, G., et al.: SpaceEx: scalable verification of hybrid systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 379\u2013395. Springer, Heidelberg (2011). \n                    https:\/\/doi.org\/10.1007\/978-3-642-22110-1_30"},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-60630-0_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"TA Henzinger","year":"1995","unstructured":"Henzinger, T.A., Ho, P.-H., Wong-Toi, H.: A user guide to HyTech. In: Brinksma, E., Cleaveland, W.R., Larsen, K.G., Margaria, T., Steffen, B. (eds.) TACAS 1995. LNCS, vol. 1019, pp. 41\u201371. Springer, Heidelberg (1995). \n                    https:\/\/doi.org\/10.1007\/3-540-60630-0_3"},{"key":"5_CR27","unstructured":"Hoxha, B., Abbas, H., Fainekos, G.E.: Benchmarks for temporal logic requirements for automotive systems. In: Frehse, G., Althoff, M. (eds.) Proceedings of the 1st and 2nd International Workshops on Applied veRification for Continuous and Hybrid Systems, ARCH@CPSWeek 2014\/ARCH@CPSWeek 2015. EPiC Series in Computing, vol. 34, pp. 25\u201330. EasyChair (2014). \n                    http:\/\/www.easychair.org\/publications\/paper\/250954"},{"key":"5_CR28","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S1567-8326(02)00037-1","volume":"52\u201353","author":"T Hune","year":"2002","unstructured":"Hune, T., Romijn, J., Stoelinga, M., Vaandrager, F.W.: Linear parametric model checking of timed automata. J. Logic Algebraic Program. 52\u201353, 183\u2013220 (2002). \n                    https:\/\/doi.org\/10.1016\/S1567-8326(02)00037-1","journal-title":"J. Logic Algebraic Program."},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-642-36742-7_28","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Jovanovi\u0107","year":"2013","unstructured":"Jovanovi\u0107, A., Lime, D., Roux, O.H.: Integer parameter synthesis for timed automata. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 401\u2013415. Springer, Heidelberg (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-642-36742-7_28"},{"issue":"5","key":"5_CR30","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1109\/TSE.2014.2357445","volume":"41","author":"A Jovanovi\u0107","year":"2015","unstructured":"Jovanovi\u0107, A., Lime, D., Roux, O.H.: Integer parameter synthesis for timed automata. IEEE Trans. Softw. Eng. 41(5), 445\u2013461 (2015)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-29072-5_6","volume-title":"Transactions on Petri Nets and Other Models of Concurrency V","author":"M Knapik","year":"2012","unstructured":"Knapik, M., Penczek, W.: Bounded model checking for parametric timed automata. In: Jensen, K., Donatelli, S., Kleijn, J. (eds.) Transactions on Petri Nets and Other Models of Concurrency V. LNCS, vol. 6900, pp. 141\u2013159. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-29072-5_6"},{"issue":"7","key":"5_CR32","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1016\/j.ic.2007.01.004","volume":"205","author":"MZ Kwiatkowska","year":"2007","unstructured":"Kwiatkowska, M.Z., Norman, G., Sproston, J., Wang, F.: Symbolic model checking for probabilistic timed automata. Inf. Comput. 205(7), 1027\u20131077 (2007)","journal-title":"Inf. Comput."},{"key":"5_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-319-68690-5_15","volume-title":"Formal Methods and Software Engineering","author":"J Li","year":"2017","unstructured":"Li, J., Sun, J., Gao, B., Andr\u00e9, \u00c9.: Classification-based parameter synthesis for parametric timed automata. In: Duan, Z., Ong, L. (eds.) ICFEM 2017. LNCS, vol. 10610, pp. 243\u2013261. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-68690-5_15"},{"key":"5_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-00768-2_6","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Lime","year":"2009","unstructured":"Lime, D., Roux, O.H., Seidner, C., Traonouez, L.-M.: Romeo: a parametric model-checker for petri nets with stopwatches. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 54\u201357. Springer, Heidelberg (2009). \n                    https:\/\/doi.org\/10.1007\/978-3-642-00768-2_6"},{"key":"5_CR35","doi-asserted-by":"publisher","first-page":"49","DOI":"10.4204\/EPTCS.145.6","volume":"145","author":"Youcheng Sun","year":"2014","unstructured":"Lipari, G., Sun, Y., Andr\u00e9, \u00c9., Fribourg, L.: Toward parametric timed interfaces for real-time components. In: Andre, E., Frehse, G. (eds.) 1st International Workshop on Synthesis of Continuous Parameters, SynCoP 2014. Electronic Proceedings in Theoretical Computer Science, vol. 145, pp. 49\u201364, April 2014. \n                    https:\/\/doi.org\/10.4204\/EPTCS.145.6","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"Nguyen, H.G., Petrucci, L., van de Pol, J.: Layered and collecting NDFS with subsumption for parametric timed automata. In: Lin, A.W., Sun, J. (eds.) Proceedings of the 23rd International Conference on Engineering of Complex Computer Systems, ICECCS 2018. IEEE, December 2018 (to appear)","DOI":"10.1109\/ICECCS2018.2018.00009"},{"key":"5_CR37","doi-asserted-by":"publisher","unstructured":"Palencia Guti\u00e9rrez, J.C., Gonz\u00e1lez Harbour, M.: Schedulability analysis for tasks with static and dynamic offsets. In: Proceedings of the 19th IEEE Real-Time Systems Symposium, RTSS 1998, pp. 26\u201337. IEEE Computer Society (1998). \n                    https:\/\/doi.org\/10.1109\/REAL.1998.739728","DOI":"10.1109\/REAL.1998.739728"},{"key":"5_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-662-46681-0_48","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"O Sankur","year":"2015","unstructured":"Sankur, O.: Symbolic quantitative robustness analysis of timed automata. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 484\u2013498. Springer, Heidelberg (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-662-46681-0_48"},{"key":"5_CR39","unstructured":"Sun, Y., Andr\u00e9, \u00c9., Lipari, G.: Verification of two real-time systems using parametric timed automata. In: Quinton, S., Vardanega, T. (eds.) Proceedings of the 6th International Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems, WATERS 2015, July 2015"},{"key":"5_CR40","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-319-05416-2_14","volume-title":"Formal Techniques for Safety-Critical Systems","author":"Y Sun","year":"2014","unstructured":"Sun, Y., Soulat, R., Lipari, G., Andr\u00e9, \u00c9., Fribourg, L.: Parametric schedulability analysis of fixed priority real-time distributed systems. In: Artho, C., \u00d6lveczky, P.C. (eds.) FTSCS 2013. CCIS, vol. 419, pp. 212\u2013228. Springer, Cham (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-319-05416-2_14"},{"issue":"17","key":"5_CR41","first-page":"3273","volume":"15","author":"LM Traonouez","year":"2009","unstructured":"Traonouez, L.M., Lime, D., Roux, O.H.: Parametric model-checking of stopwatch Petri nets. J. Univers. Comput. Sci. 15(17), 3273\u20133304 (2009)","journal-title":"J. Univers. Comput. Sci."},{"issue":"6","key":"5_CR42","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/s10009-006-0019-5","volume":"8","author":"E Wandeler","year":"2006","unstructured":"Wandeler, E., Thiele, L., Verhoef, M., Lieverse, P.: System architecture evaluation using modular performance analysis: a case study. Int. J. Softw. Tools Technol. Transf. 8(6), 649\u2013667 (2006). \n                    https:\/\/doi.org\/10.1007\/s10009-006-0019-5","journal-title":"Int. J. Softw. Tools Technol. Transf."}],"container-title":["Communications in Computer and Information Science","Formal Techniques for Safety-Critical Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-12988-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:50:23Z","timestamp":1558396223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-12988-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030129873","9783030129880"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-12988-0_5","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"2 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FTSCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Formal Techniques for Safety-Critical Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gold Coast, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"16 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ftscs2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ftscs.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":"22","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"10","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":"45% - 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":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2","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"}}]}}