{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T10:33:16Z","timestamp":1718188396989},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,3,22]],"date-time":"2012-03-22T00:00:00Z","timestamp":1332374400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form Methods Syst Des"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10703-012-0147-3","type":"journal-article","created":{"date-parts":[[2012,3,22]],"date-time":"2012-03-22T22:12:10Z","timestamp":1332454330000},"page":"356-376","source":"Crossref","is-referenced-by-count":7,"title":["Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation"],"prefix":"10.1007","volume":"40","author":[{"given":"Silvia","family":"Crafa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Ranzato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,3,22]]},"reference":[{"key":"147_CR1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1006\/jcss.1999.1683","volume":"60","author":"C Baier","year":"2000","unstructured":"Baier C, Engelen B, Majster-Cederbaum M (2000) Deciding bisimilarity and similarity for probabilistic processes. J Comput Syst Sci 60:187\u2013231","journal-title":"J Comput Syst Sci"},{"key":"147_CR2","first-page":"238","volume-title":"Proc 4th ACM POPL","author":"P Cousot","year":"1977","unstructured":"Cousot P, Cousot R (1977) Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proc 4th ACM POPL, pp 238\u2013252"},{"key":"147_CR3","first-page":"269","volume-title":"Proc 6th ACM POPL","author":"P Cousot","year":"1979","unstructured":"Cousot P, Cousot R (1979) Systematic design of program analysis frameworks. In: Proc 6th ACM POPL, pp 269\u2013282"},{"key":"147_CR4","series-title":"Springer LNCS","first-page":"295","volume-title":"Proc ICALP\u201911","author":"S Crafa","year":"2011","unstructured":"Crafa S, Ranzato F (2011) Probabilistic bisimulation and simulation algorithms by abstract interpretation. In: Proc ICALP\u201911. Springer LNCS, vol 6756, pp 295\u2013306"},{"key":"147_CR5","unstructured":"Desharnais J (1999) Labelled Markov processes. PhD thesis, McGill Univ"},{"key":"147_CR6","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1006\/inco.2001.2962","volume":"179","author":"J Desharnais","year":"2002","unstructured":"Desharnais J, Edalat A, Panangaden P (2002) Bisimulation for labelled Markov processes. Inf Comput 179:163\u2013193","journal-title":"Inf Comput"},{"key":"147_CR7","series-title":"Springer LNCS","first-page":"356","volume-title":"Proc 8th SAS","author":"R Giacobazzi","year":"2001","unstructured":"Giacobazzi R, Quintarelli E (2001) Incompleteness, counterexamples and refinements in abstract model checking. In: Proc 8th SAS. Springer LNCS, vol 2126, pp 356\u2013373"},{"key":"147_CR8","series-title":"Springer LNCS","first-page":"771","volume-title":"Proc 24th ICALP","author":"R Giacobazzi","year":"1997","unstructured":"Giacobazzi R, Ranzato F (1997) Refining and compressing abstract domains. In: Proc 24th ICALP. Springer LNCS, vol 1256, pp 771\u2013781"},{"key":"147_CR9","first-page":"453","volume-title":"Proc 36th FOCS","author":"MR Henzinger","year":"1995","unstructured":"Henzinger MR, Henzinger TA, Kopke PW (1995) Computing simulations on finite and infinite graphs. In: Proc 36th FOCS, pp 453\u2013462"},{"issue":"1","key":"147_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"KG Larsen","year":"1991","unstructured":"Larsen KG, Skou A (1991) Bisimulation through probabilistic testing. Inf Comput 94(1):1\u201328","journal-title":"Inf Comput"},{"issue":"6","key":"147_CR11","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige R, Tarjan RE (1987) Three partition refinement algorithms. SIAM J Comput 16(6):973\u2013989","journal-title":"SIAM J Comput"},{"key":"147_CR12","series-title":"Springer LNCS","first-page":"287","volume-title":"Proc FOSSACS\u201907","author":"A Parma","year":"2007","unstructured":"Parma A, Segala R (2007) Logical characterizations of bisimulations for discrete probabilistic systems. In: Proc FOSSACS\u201907. Springer LNCS, vol 4423, pp 287\u2013301"},{"key":"147_CR13","first-page":"171","volume-title":"Proc IEEE LICS\u201907","author":"F Ranzato","year":"2007","unstructured":"Ranzato F, Tapparo F (2007) A new efficient simulation equivalence algorithm. In: Proc IEEE LICS\u201907, pp 171\u2013180"},{"issue":"1","key":"147_CR14","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1093\/logcom\/exl035","volume":"17","author":"F Ranzato","year":"2007","unstructured":"Ranzato F, Tapparo F (2007) Generalized strong preservation by abstract interpretation. J Log Comput 17(1):157\u2013197","journal-title":"J Log Comput"},{"issue":"1","key":"147_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ic.2009.06.002","volume":"208","author":"F Ranzato","year":"2010","unstructured":"Ranzato F, Tapparo F (2010) An efficient simulation algorithm based on abstract interpretation. Inf Comput 208(1):1\u201322","journal-title":"Inf Comput"},{"issue":"2","key":"147_CR16","first-page":"250","volume":"2","author":"R Segala","year":"1995","unstructured":"Segala R, Lynch N (1995) Probabilistic simulations for probabilistic processes. Nord J Comput 2(2):250\u2013273","journal-title":"Nord J Comput"},{"key":"147_CR17","first-page":"130","volume-title":"Proc IEEE LICS\u201990","author":"RJ Glabbeek van","year":"1990","unstructured":"van Glabbeek RJ, Smolka S, Steffen B, Tofts C (1990) Reactive, generative and stratified models for probabilistic processes. In: Proc IEEE LICS\u201990, pp 130\u2013141"},{"key":"147_CR18","series-title":"Springer LNCS","first-page":"248","volume-title":"Proc CONCUR\u201908","author":"L Zhang","year":"2008","unstructured":"Zhang L (2008) A space-efficient probabilistic simulation algorithm. In: Proc CONCUR\u201908. Springer LNCS, vol 5201, pp 248\u2013263"},{"key":"147_CR19","unstructured":"Zhang L (2009) Decision algorithms for probabilistic simulations. PhD thesis, Univ des Saarlandes"},{"key":"147_CR20","doi-asserted-by":"crossref","unstructured":"Zhang L, Hermanns H, Eisenbrand F, Jansen DN (2008) Flow faster: efficient decision algorithms for probabilistic simulations. Log Methods Comput Sci 4(4)","DOI":"10.2168\/LMCS-4(4:6)2008"}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-012-0147-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10703-012-0147-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-012-0147-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T23:23:58Z","timestamp":1561505038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10703-012-0147-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,22]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["147"],"URL":"https:\/\/doi.org\/10.1007\/s10703-012-0147-3","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"value":"0925-9856","type":"print"},{"value":"1572-8102","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,22]]}}}