{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:18Z","timestamp":1759637658616,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642306419"},{"type":"electronic","value":"9783642306426"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30642-6_3","type":"book-chapter","created":{"date-parts":[[2012,8,11]],"date-time":"2012-08-11T08:01:39Z","timestamp":1344672099000},"page":"18-30","source":"Crossref","is-referenced-by-count":12,"title":["General Quantitative Specification Theories with Modalities"],"prefix":"10.1007","author":[{"given":"Sebastian S.","family":"Bauer","sequence":"first","affiliation":[]},{"given":"Uli","family":"Fahrenberg","sequence":"additional","affiliation":[]},{"given":"Axel","family":"Legay","sequence":"additional","affiliation":[]},{"given":"Claus","family":"Thrane","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Aliprantis, C.D., Border, K.C.: Infinite Dimensional Analysis: A Hitchhiker\u2019s Guide. Springer (2007)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-22993-0_9","volume-title":"Mathematical Foundations of Computer Science 2011","author":"S.S. Bauer","year":"2011","unstructured":"Bauer, S.S., Fahrenberg, U., Juhl, L., Larsen, K.G., Legay, A., Thrane, C.: Quantitative Refinement for Weighted Modal Transition Systems. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol.\u00a06907, pp. 60\u201371. Springer, Heidelberg (2011)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Bauer, S.S., Juhl, L., Larsen, K.G., Legay, A., Srba, J.: Extending modal transition systems with structured labels. Math. Struct. CS (2012)","DOI":"10.1017\/S0960129511000697"},{"issue":"9","key":"3_CR4","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/1995376.1995396","volume":"54","author":"P. Bouyer","year":"2011","unstructured":"Bouyer, P., Fahrenberg, U., Larsen, K.G., Markey, N.: Quantitative analysis of real-time systems using priced timed automata. CACM\u00a054(9), 78\u201387 (2011)","journal-title":"CACM"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. ACM Trans. Comp. Logic\u00a011(4) (2010)","DOI":"10.1145\/1805950.1805953"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"David, A., Larsen, K.G., Legay, A., Nyman, U., W\u0105sowski, A.: Timed I\/O automata: A complete specification theory for real-time systems. In: HSCC, pp. 91\u2013100. ACM (2010)","DOI":"10.1145\/1755952.1755967"},{"issue":"2","key":"3_CR7","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1109\/TSE.2008.106","volume":"35","author":"L. de Alfaro","year":"2009","unstructured":"de Alfaro, L., Faella, M., Stoelinga, M.: Linear and branching system metrics. IEEE Trans. Soft. Eng.\u00a035(2), 258\u2013273 (2009)","journal-title":"IEEE Trans. Soft. Eng."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01768705","volume":"8","author":"A. Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., Mycielski, J.: Positional strategies for mean payoff games. Int. J. Game Th.\u00a08, 109\u2013113 (1979)","journal-title":"Int. J. Game Th."},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-23283-1_9","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2011","author":"U. Fahrenberg","year":"2011","unstructured":"Fahrenberg, U., Juhl, L., Larsen, K.G., Srba, J.: Energy Games in Multiweighted Automata. In: Cerone, A., Pihlajasaari, P. (eds.) ICTAC 2011. LNCS, vol.\u00a06916, pp. 95\u2013115. Springer, Heidelberg (2011)"},{"key":"3_CR10","unstructured":"Fahrenberg, U., Legay, A., Thrane, C.: The quantitative linear-time\u2013branching-time spectrum. In: FSTTCS. LIPIcs, vol.\u00a013, pp. 103\u2013114 (2011)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/978-3-642-24485-8_36","volume-title":"Model Driven Engineering Languages and Systems","author":"U. Fahrenberg","year":"2011","unstructured":"Fahrenberg, U., Legay, A., W\u0105sowski, A.: Vision Paper: Make a Difference! (Semantically). In: Whittle, J., Clark, T., K\u00fchne, T. (eds.) MODELS 2011. LNCS, vol.\u00a06981, pp. 490\u2013500. Springer, Heidelberg (2011)"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Fahrenberg, U., Thrane, C., Larsen, K.G.: Distances for weighted transition systems: Games and properties. In: QAPL. EPTCS, vol.\u00a057, pp. 134\u2013147 (2011)","DOI":"10.4204\/EPTCS.57.10"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-44685-0_29","volume-title":"CONCUR 2001 - Concurrency Theory","author":"P. Godefroid","year":"2001","unstructured":"Godefroid, P., Huth, M., Jagadeesan, R.: Abstraction-Based Model Checking Using Modal Transition Systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 426\u2013440. Springer, Heidelberg (2001)"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-68863-1_8","volume-title":"Formal Methods for Open Object-Based Distributed Systems","author":"A. Gruler","year":"2008","unstructured":"Gruler, A., Leucker, M., Scheidemann, K.: Modeling and Model Checking Software Product Lines. In: Barthe, G., de Boer, F.S. (eds.) FMOODS 2008. LNCS, vol.\u00a05051, pp. 113\u2013131. Springer, Heidelberg (2008)"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-540-30579-8_16","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"O. Grumberg","year":"2005","unstructured":"Grumberg, O., Lange, M., Leucker, M., Shoham, S.: Don\u2019t Know in the \u03bc-Calculus. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol.\u00a03385, pp. 233\u2013249. Springer, Heidelberg (2005)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/11603009_18","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"T.A. Henzinger","year":"2005","unstructured":"Henzinger, T.A., Majumdar, R., Prabhu, V.S.: Quantifying Similarities Between Timed Systems. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol.\u00a03829, pp. 226\u2013241. Springer, Heidelberg (2005)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Juhl, L., Larsen, K.G., Srba, J.: Modal transition systems with weight intervals. J. Logic Alg. Prog. (2012)","DOI":"10.1016\/j.jlap.2012.03.008"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/3-540-52148-8_19","volume-title":"Automatic Verification Methods for Finite State Systems","author":"K.G. Larsen","year":"1990","unstructured":"Larsen, K.G.: Modal Specifications. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol.\u00a0407, pp. 232\u2013246. Springer, Heidelberg (1990)"},{"issue":"28","key":"3_CR19","doi-asserted-by":"publisher","first-page":"3358","DOI":"10.1016\/j.tcs.2011.04.003","volume":"412","author":"K.G. Larsen","year":"2011","unstructured":"Larsen, K.G., Fahrenberg, U., Thrane, C.: Metrics for weighted transition systems: Axiomatization and complexity. Th. Comp. Sci.\u00a0412(28), 3358\u20133369 (2011)","journal-title":"Th. Comp. Sci."},{"key":"3_CR20","unstructured":"Munkres, J.R.: Topology. Prentice Hall (2000)"},{"key":"3_CR21","unstructured":"Nyman, U.: Modal Transition Systems as the Basis for Interface Theories and Product Lines. PhD thesis, Aalborg University (September 2008)"},{"issue":"1","key":"3_CR22","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10703-006-0014-1","volume":"29","author":"J.I. Rasmussen","year":"2006","unstructured":"Rasmussen, J.I., Larsen, K.G., Subramani, K.: On using priced timed automata to achieve optimal scheduling. Formal Meth. Syst. Design\u00a029(1), 97\u2013114 (2006)","journal-title":"Formal Meth. Syst. Design"},{"issue":"7","key":"3_CR23","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/j.jlap.2010.07.010","volume":"79","author":"C. Thrane","year":"2010","unstructured":"Thrane, C., Fahrenberg, U., Larsen, K.G.: Quantitative simulations of weighted transition systems. J. Logic Alg. Prog.\u00a079(7), 689\u2013703 (2010)","journal-title":"J. Logic Alg. Prog."},{"issue":"1","key":"3_CR24","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1111\/j.1749-6632.1996.tb49160.x","volume":"806","author":"F. van Breugel","year":"1996","unstructured":"van Breugel, F.: A theory of metric labelled transition systems. Annals of the New York Academy of Sciences\u00a0806(1), 69\u201387 (1996)","journal-title":"Annals of the New York Academy of Sciences"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/11539452_14","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"F. van Breugel","year":"2005","unstructured":"van Breugel, F.: A Behavioural Pseudometric for Metric Labelled Transition Systems. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 141\u2013155. Springer, Heidelberg (2005)"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0030814","volume-title":"Computing and Combinatorics","author":"U. Zwick","year":"1995","unstructured":"Zwick, U., Paterson, M.: The Complexity of Mean Payoff Games. In: Li, M., Du, D.-Z. (eds.) COCOON 1995. LNCS, vol.\u00a0959, pp. 1\u201310. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30642-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T19:23:23Z","timestamp":1676575403000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-30642-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642306419","9783642306426"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30642-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}