{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T18:53:48Z","timestamp":1794423228206,"version":"4.9.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642307928","type":"print"},{"value":"9783642307935","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30793-5_11","type":"book-chapter","created":{"date-parts":[[2012,6,8]],"date-time":"2012-06-08T07:34:33Z","timestamp":1339140873000},"page":"169-185","source":"Crossref","is-referenced-by-count":7,"title":["Defining Distances for All Process Semantics"],"prefix":"10.1007","author":[{"given":"David","family":"Romero Hern\u00e1ndez","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"de Frutos Escrig","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-13754-9_3","volume-title":"Time for Verification","author":"P. \u010cern\u00fd","year":"2010","unstructured":"\u010cern\u00fd, P., Henzinger, T.A., Radhakrishna, A.: Quantitative Simulation Games. In: Manna, Z., Peled, D. (eds.) Time for Verification. LNCS, vol.\u00a06200, pp. 42\u201360. Springer, Heidelberg (2010)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-642-15375-4_18","volume-title":"CONCUR 2010 - Concurrency Theory","author":"P. \u010cern\u00fd","year":"2010","unstructured":"\u010cern\u00fd, P., Henzinger, T.A., Radhakrishna, A.: Simulation Distances. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 253\u2013268. Springer, Heidelberg (2010)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-540-89330-1_8","volume-title":"Programming Languages and Systems","author":"X. Chen","year":"2008","unstructured":"Chen, X., Deng, Y.: Game Characterizations of Process Equivalences. In: Ramalingam, G. (ed.) APLAS 2008. LNCS, vol.\u00a05356, pp. 107\u2013121. Springer, Heidelberg (2008)"},{"issue":"2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1109\/TSE.2008.106","volume":"35","author":"L. Alfaro de","year":"2009","unstructured":"de Alfaro, L., Faella, M., Stoelinga, M.: Linear and branching system metrics. IEEE Trans. Software Eng.\u00a035(2), 258\u2013273 (2009)","journal-title":"IEEE Trans. Software Eng."},{"key":"11_CR5","first-page":"243","volume":"249","author":"D. Frutos-Escrig de","year":"2009","unstructured":"de Frutos-Escrig, D., Gregorio-Rodr\u00edguez, C., Palomino, M.: On the unification of process semantics: equational semantics. ENTCS\u00a0249, 243\u2013267 (2009)","journal-title":"ENTCS"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-95891-8_27","volume-title":"SOFSEM 2009: Theory and Practice of Computer Science","author":"D. Frutos Escrig de","year":"2009","unstructured":"de Frutos Escrig, D., Gregorio Rodr\u00edguez, C., Palomino, M.: On the Unification of Process Semantics: Observational Semantics. In: Nielsen, M., Ku\u010dera, A., Miltersen, P.B., Palamidessi, C., T\u016fma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol.\u00a05404, pp. 279\u2013290. Springer, Heidelberg (2009)"},{"key":"11_CR7","unstructured":"Fahrenberg, U., Legay, A., Thrane, C.R.: The quantitative linear-time\u2013branching-time spectrum. In: Chakraborty, S., Kumar, A. (eds.) FSTTCS. LIPIcs, vol.\u00a013, pp. 103\u2013114. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/11562436_24","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2005","author":"A. Kiehn","year":"2005","unstructured":"Kiehn, A., Arun-Kumar, S.: Amortised Bisimulations. In: Wang, F. (ed.) FORTE 2005. LNCS, vol.\u00a03731, pp. 320\u2013334. Springer, Heidelberg (2005)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-540-95891-8_35","volume-title":"SOFSEM 2009: Theory and Practice of Computer Science","author":"G. L\u00fcttgen","year":"2009","unstructured":"L\u00fcttgen, G., Vogler, W.: Safe Reasoning with Logic LTS. In: Nielsen, M., Ku\u010dera, A., Miltersen, P.B., Palamidessi, C., T\u016fma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol.\u00a05404, pp. 376\u2013387. Springer, Heidelberg (2009)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/3-540-58131-6_54","volume-title":"Results and Trends in Theoretical Computer Science","author":"M. Nielsen","year":"1994","unstructured":"Nielsen, M., Clausen, C.: Bisimulation, Games, and Logic. In: Karhum\u00e4ki, J., Rozenberg, G., Maurer, H.A. (eds.) Results and Trends in Theoretical Computer Science. LNCS, vol.\u00a0812, pp. 289\u2013306. Springer, Heidelberg (1994)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/3-540-60915-6_5","volume-title":"Logics for Concurrency","author":"C. Stirling","year":"1996","unstructured":"Stirling, C.: Modal and Temporal Logics for Processes. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol.\u00a01043, pp. 149\u2013237. Springer, Heidelberg (1996)"},{"issue":"1","key":"11_CR12","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1093\/jigpal\/7.1.103","volume":"7","author":"C. Stirling","year":"1999","unstructured":"Stirling, C.: Bisimulation, modal logic and model checking games. Logic Journal of the IGPL\u00a07(1), 103\u2013124 (1999)","journal-title":"Logic Journal of the IGPL"},{"issue":"7","key":"11_CR13","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/j.jlap.2010.07.010","volume":"79","author":"C.R. Thrane","year":"2010","unstructured":"Thrane, C.R., Fahrenberg, U., Larsen, K.G.: Quantitative analysis of weighted transition systems. J. Log. Algebr. Program.\u00a079(7), 689\u2013703 (2010)","journal-title":"J. Log. Algebr. Program."},{"key":"11_CR14","unstructured":"van Glabbeek, R.: The linear time-branching time spectrum I: the semantics of concrete, sequential processes. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, ch. 1, pp. 3\u201399. Elsevier (2001)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/BFb0036949","volume-title":"Automata, Languages and Programming","author":"G. Winskel","year":"1983","unstructured":"Winskel, G.: Synchronisation Trees. In: D\u00edaz, J. (ed.) ICALP 1983. LNCS, vol.\u00a0154, pp. 695\u2013711. Springer, Heidelberg (1983)"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30793-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T23:25:05Z","timestamp":1556839505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30793-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642307928","9783642307935"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30793-5_11","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-30793-5","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}