{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:59:10Z","timestamp":1762459150736,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642548291"},{"type":"electronic","value":"9783642548307"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54830-7_19","type":"book-chapter","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T13:30:31Z","timestamp":1395408631000},"page":"289-303","source":"Crossref","is-referenced-by-count":9,"title":["Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules"],"prefix":"10.1007","author":[{"given":"Pedro R.","family":"D\u2019Argenio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Gebler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matias David","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1994.1040","volume":"111","author":"L. Aceto","year":"1994","unstructured":"Aceto, L., Bloom, B., Vaandrager, F.: Turning SOS rules into equations. Inf. Comput.\u00a0111(1), 1\u201352 (1994)","journal-title":"Inf. Comput."},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/978-3-642-40206-7_5","volume-title":"Proc.\u00a0CALCO 2013","author":"L. Aceto","year":"2013","unstructured":"Aceto, L., Goriac, E.-I., Ingolfsdottir, A., Mousavi, M.R., Reniers, M.A.: Exploiting algebraic laws to improve mechanized axiomatizations. In: Heckel, R. (ed.) CALCO 2013. LNCS, vol.\u00a08089, pp. 36\u201350. Springer, Heidelberg (2013)"},{"key":"19_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139195003","volume-title":"Process Algebra: Equational Theories of Communicating Processes","author":"J.C.M. Baeten","year":"2009","unstructured":"Baeten, J.C.M., Basten, T., Reniers, M.A.: Process Algebra: Equational Theories of Communicating Processes. Cambridge University Press, New York (2009)"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(87)90052-1","volume":"51","author":"J.C.M. Baeten","year":"1987","unstructured":"Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: On the consistency of Koomen\u2019s fair abstraction rule. TCS\u00a051, 129\u2013176 (1987)","journal-title":"TCS"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/3-540-48224-5_31","volume-title":"Automata, Languages and Programming","author":"E. Bandini","year":"2001","unstructured":"Bandini, E., Segala, R.: Axiomatizations for probabilistic bisimulation. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 370\u2013381. Springer, Heidelberg (2001)"},{"key":"19_CR6","unstructured":"Bartels, F.: On Generalised Coinduction and Probabilistic Specification Formats. Ph.D. thesis, VU University Amsterdam (2004)"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/200836.200876","volume":"42","author":"B. Bloom","year":"1995","unstructured":"Bloom, B., Istrail, S., Meyer, A.R.: Bisimulation can\u2019t be traced. J. ACM\u00a042, 232\u2013268 (1995)","journal-title":"J. ACM"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/3-540-62950-5_64","volume-title":"Rewriting Techniques and Applications","author":"E. Contejean","year":"1997","unstructured":"Contejean, E., March\u00e9, C., Rabehasaina, L.: Rewrite systems for natural, integral, and rational arithmetic. In: Comon, H. (ed.) RTA 1997. LNCS, vol.\u00a01232, pp. 98\u2013112. Springer, Heidelberg (1997)"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/978-3-642-28729-9_30","volume-title":"Foundations of Software Science and Computational Structures","author":"P.R. D\u2019Argenio","year":"2012","unstructured":"D\u2019Argenio, P.R., Lee, M.D.: Probabilistic transition system specification: Congruence and full abstraction of bisimulation. In: Birkedal, L. (ed.) FOSSACS 2012. LNCS, vol.\u00a07213, pp. 452\u2013466. Springer, Heidelberg (2012)"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Desharnais, J., Jagadeesan, R., Gupta, V., Panangaden, P.: The metric analogue of weak bisimulation for probabilistic processes. In: Proc.\u00a0LICS 2002, pp. 413\u2013422. IEEE (2002)","DOI":"10.1109\/LICS.2002.1029849"},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1093\/comjnl\/bxs120","volume":"56","author":"M. Gazda","year":"2013","unstructured":"Gazda, M., Fokkink, W.: Turning GSOS rules into equations for linear time-branching time semantics. The Computer Journal\u00a056(1), 34\u201344 (2013)","journal-title":"The Computer Journal"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Gebler, D., Tini, S.: Compositionality of approximate bisimulation for probabilistic systems. In: Proc.\u00a0EXPRESS\/SOS 2013. EPTCS, vol.\u00a0120, pp. 32\u201346 (2013)","DOI":"10.4204\/EPTCS.120.4"},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/947886.947887","volume":"17","author":"J.A. Goguen","year":"1982","unstructured":"Goguen, J.A., Meseguer, J.: Completeness of many-sorted equational logic. SIGPLAN Not.\u00a017(1), 9\u201317 (1982)","journal-title":"SIGPLAN Not."},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","volume":"100","author":"J.F. Groote","year":"1992","unstructured":"Groote, J.F., Vaandrager, F.: Structured operational semantics and bisimulation as a congruence. Inf. Comput.\u00a0100, 202\u2013260 (1992)","journal-title":"Inf. Comput."},{"issue":"4-6","key":"19_CR15","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1007\/s00165-012-0242-7","volume":"24","author":"M. Hennessy","year":"2012","unstructured":"Hennessy, M.: Exploring probabilistic bisimulations, part I. Formal Aspects of Computing\u00a024(4-6), 749\u2013768 (2012)","journal-title":"Formal Aspects of Computing"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K.G. Larsen","year":"1991","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inf. Comput.\u00a094, 1\u201328 (1991)","journal-title":"Inf. Comput."},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Lee, M.D., Gebler, D., D\u2019Argenio, P.R.: Tree rules in probabilistic transition system specifications with negative and quantitative premises. In: Proc.\u00a0EXPRESS\/SOS 2012. EPTCS, vol.\u00a089, pp. 115\u2013130 (2012)","DOI":"10.4204\/EPTCS.89.9"},{"key":"19_CR18","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall (1989)"},{"issue":"3","key":"19_CR19","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.tcs.2006.12.019","volume":"373","author":"M.R. Mousavi","year":"2007","unstructured":"Mousavi, M.R., Reniers, M.A., Groote, J.F.: SOS formats and meta-theory: 20 years after. Theor. Comput. Sci.\u00a0373(3), 238\u2013272 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Plotkin, G.: A structural approach to operational semantics. Report DAIMI FN-19, Aarhus University (1981), reprinted in J. Log. Algebr. Program, 60-61, 17\u2013139 (2004)","DOI":"10.1016\/j.jlap.2004.05.001"},{"key":"19_CR21","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. Ph.D. thesis, MIT (1995)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54830-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T03:46:50Z","timestamp":1746157610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54830-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642548291","9783642548307"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54830-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}