{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:56:08Z","timestamp":1762458968457,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642287282"},{"type":"electronic","value":"9783642287299"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-28729-9_30","type":"book-chapter","created":{"date-parts":[[2012,3,22]],"date-time":"2012-03-22T20:47:40Z","timestamp":1332449260000},"page":"452-466","source":"Crossref","is-referenced-by-count":11,"title":["Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation"],"prefix":"10.1007","author":[{"given":"Pedro Rub\u00e9n","family":"D\u2019Argenio","sequence":"first","affiliation":[]},{"given":"Matias David","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Aceto, L., Fokkink, W., Verhoef, C.: Conservative extension in structural operational semantics. In: Current Trends in Theor. Comput. Sci., pp. 504\u2013524. World Scientific (2001)","DOI":"10.1016\/B978-044482830-9\/50021-7"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Aceto, L., Fokkink, W., Verhoef, C.: Structural operational semantics. In: Handbook of Process Algebra, pp. 197\u2013292. Elsevier (2001)","DOI":"10.1016\/B978-044482830-9\/50021-7"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BFb0039053","volume-title":"CONCUR 1990","author":"J.C.M. Baeten","year":"1990","unstructured":"Baeten, J.C.M., Bergstra, J.A.: Process Algebra with a Zero Object. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 83\u201398. Springer, Heidelberg (1990)"},{"issue":"2","key":"30_CR4","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1995.1135","volume":"121","author":"J.C.M. Baeten","year":"1995","unstructured":"Baeten, J.C.M., Bergstra, J.A., Smolka, S.A.: Axiomatizing probabilistic processes: ACP with generative probabilities. Inf. Comput.\u00a0121(2), 234\u2013255 (1995)","journal-title":"Inf. Comput."},{"key":"30_CR5","unstructured":"Baier, C.: On Algorithmics Verification Methods for Probabilistic Systems. Habilitation thesis, University of Mannheim (1999)"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Bartels, F.: GSOS for probabilistic transition systems. Electr. Notes Theor. Comput. Sci.\u00a065(1) (2002)","DOI":"10.1016\/S1571-0661(04)80358-X"},{"key":"30_CR7","unstructured":"Bartels, F.: On Generalised Coinduction and Probabilistic Specification Formats. PhD thesis, Vrije Universiteit (2004)"},{"issue":"1","key":"30_CR8","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(1), 232\u2013268 (1995)","journal-title":"J. ACM"},{"issue":"5","key":"30_CR9","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1145\/234752.234756","volume":"43","author":"R. Bol","year":"1996","unstructured":"Bol, R., Groote, J.F.: The meaning of negative premises in transition system specifications. J. ACM\u00a043(5), 863\u2013914 (1996)","journal-title":"J. ACM"},{"issue":"2","key":"30_CR10","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/S0304-3975(96)00292-7","volume":"177","author":"P.R. D\u2019Argenio","year":"1997","unstructured":"D\u2019Argenio, P.R., Verhoef, C.: A general conservative extension theorem in process algebras with inequalities. Theor. Comput. Sci.\u00a0177(2), 351\u2013380 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Fokkink, W., van Glabbeek, R.J.: Ntyft\/ntyxt rules reduce to ntree rules. Inf. Comput.\u00a0126(1) (1996)","DOI":"10.1006\/inco.1996.0030"},{"issue":"2","key":"30_CR12","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0304-3975(93)90111-6","volume":"118","author":"J.F. Groote","year":"1993","unstructured":"Groote, J.F.: Transition system specifications with negative premises. Theor. Comput. Sci.\u00a0118(2), 263\u2013299 (1993)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"30_CR13","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(2), 202\u2013260 (1992)","journal-title":"Inf. Comput."},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Jonsson, B., Larsen, K.G., Yi, W.: Probabilistic extensions of process algebras. In: Handbook of Process Algebra, pp. 685\u2013710. Elsevier (2001)","DOI":"10.1016\/B978-044482830-9\/50029-1"},{"issue":"38","key":"30_CR15","doi-asserted-by":"publisher","first-page":"5043","DOI":"10.1016\/j.tcs.2011.03.023","volume":"412","author":"B. Klin","year":"2011","unstructured":"Klin, B.: Bialgebras for structural operational semantics: An introduction. Theor. Comput. Sci.\u00a0412(38), 5043\u20135069 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-31982-5_4","volume-title":"Foundations of Software Science and Computational Structures","author":"R. Lanotte","year":"2005","unstructured":"Lanotte, R., Tini, S.: Probabilistic Congruence for Semistochastic Generative Processes. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 63\u201378. Springer, Heidelberg (2005)"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Lanotte, R., Tini, S.: Probabilistic bisimulation as a congruence. ACM Trans. Comput. Log.\u00a010(2) (2009)","DOI":"10.1145\/1462179.1462181"},{"issue":"1","key":"30_CR18","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), 1\u201328 (1991)","journal-title":"Inf. Comput."},{"key":"30_CR19","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Inc. (1989)"},{"issue":"3","key":"30_CR20","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":"#cr-split#-30_CR21.1","unstructured":"Plotkin, G.: A structural approach to operational semantics. Report DAIMI FN-19, Aarhus University (1981)"},{"key":"#cr-split#-30_CR21.2","doi-asserted-by":"crossref","unstructured":"reprinted in J. Log. Algebr. Program. 60-61, 17-139 (2004)","DOI":"10.1016\/j.jlap.2004.05.001"},{"key":"30_CR22","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis. MIT (1995)"},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"Turi, D., Plotkin, G.D.: Towards a mathematical operational semantics. In: LICS, pp. 280\u2013291 (1997)","DOI":"10.1109\/LICS.1997.614955"},{"key":"30_CR24","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.jlap.2004.03.007","volume":"60-61","author":"R.J. Glabbeek van","year":"2004","unstructured":"van Glabbeek, R.J.: The meaning of negative premises in transition system specifications II. J. Log. Algebr. Program.\u00a060-61, 229\u2013258 (2004)","journal-title":"J. Log. Algebr. Program."},{"issue":"1","key":"30_CR25","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/inco.1995.1123","volume":"121","author":"R.J. Glabbeek van","year":"1995","unstructured":"van Glabbeek, R.J., Smolka, S.A., Steffen, B.: Reactive, generative and stratified models of probabilistic processes. Inf. Comput.\u00a0121(1), 59\u201380 (1995)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28729-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T18:49:27Z","timestamp":1742755767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28729-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642287282","9783642287299"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28729-9_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}