{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,11]],"date-time":"2026-10-11T02:56:01Z","timestamp":1791687361143,"version":"4.3.4"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3-5","license":[{"start":{"date-parts":[[2020,5,6]],"date-time":"2020-05-06T00:00:00Z","timestamp":1588723200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,6]],"date-time":"2020-05-06T00:00:00Z","timestamp":1588723200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s00236-020-00379-2","type":"journal-article","created":{"date-parts":[[2020,5,6]],"date-time":"2020-05-06T15:04:01Z","timestamp":1588777441000},"page":"465-512","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the probabilistic bisimulation spectrum with silent moves"],"prefix":"10.1007","volume":"57","author":[{"given":"Christel","family":"Baier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pedro R.","family":"D\u2019Argenio","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Holger","family":"Hermanns","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,5,6]]},"reference":[{"key":"379_CR1","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"key":"379_CR2","unstructured":"Bergstra, J.A., Klop, J.W., Olderog, E.: Failures without chaos: a new process semantics for fair abstraction. In: Wirsing, M. (ed.) Formal Description of Programming Concepts-III: Proceedings of the IFIP TC 2\/WG 2.2 Working Conference on Formal Description of Programming Concepts-III, Ebberup, Denmark, 25\u201328 Aug 1986, pp. 77\u2013104. North-Holland (1987)"},{"key":"379_CR3","doi-asserted-by":"crossref","unstructured":"Blute, R., Desharnais, J., Edalat, A., Panangaden, P.: Bisimulation for labelled Markov processes. In: 12th Annual IEEE Symposium on Logic in Computer Science (LICS), pp. 149\u2013158. IEEE Computer Society (1997)","DOI":"10.7146\/brics.v4i4.18783"},{"key":"379_CR4","unstructured":"Brengel, M.: Probabilistic weak transitions. Bachelor\u2019s thesis, Universit\u00e4t des Saarlandes, Fachrichtung Informatik (2013)"},{"issue":"1","key":"379_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1017\/S0960129511000454","volume":"22","author":"PR D\u2019Argenio","year":"2012","unstructured":"D\u2019Argenio, P.R., S\u00e1nchez Terraf, P., Wolovick, N.: Bisimulations for non-deterministic labelled Markov processes. Math. Struct. Comput. Sci. 22(1), 43\u201368 (2012). https:\/\/doi.org\/10.1017\/S0960129511000454","journal-title":"Math. Struct. Comput. Sci."},{"key":"379_CR6","unstructured":"de\u00a0Alfaro, L.: Formal verification of probabilistic systems. Ph.D. thesis, Stanford University, Department of Computer Science (1997)"},{"key":"379_CR7","doi-asserted-by":"crossref","unstructured":"Deng, Y., van Glabbeek, R.J., Hennessy, M., Morgan, C.: Testing finitary probabilistic processes. In: 20th International Conference on Concurrency Theory (CONCUR), Lecture Notes in Computer Science, vol. 5710, pp. 274\u2013288. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-04081-8_19"},{"key":"379_CR8","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.ic.2012.10.010","volume":"222","author":"Y Deng","year":"2013","unstructured":"Deng, Y., Hennessy, M.: On the semantics of Markov automata. Inf. Comput. 222, 139\u2013168 (2013). https:\/\/doi.org\/10.1016\/j.ic.2012.10.010","journal-title":"Inf. Comput."},{"issue":"2","key":"379_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.ic.2009.11.002","volume":"208","author":"J Desharnais","year":"2010","unstructured":"Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Weak bisimulation is sound and complete for pCTL*. Inf. Comput. 208(2), 203\u2013219 (2010). https:\/\/doi.org\/10.1016\/j.ic.2009.11.002","journal-title":"Inf. Comput."},{"key":"379_CR10","doi-asserted-by":"publisher","unstructured":"Eisentraut, C., Hermanns, H., Zhang, L.: On probabilistic automata in continuous time. In: Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, 11\u201314 July 2010, Edinburgh, United Kingdom, pp. 342\u2013351. IEEE Computer Society (2010). https:\/\/doi.org\/10.1109\/LICS.2010.41","DOI":"10.1109\/LICS.2010.41"},{"key":"379_CR11","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.jlamp.2018.09.006","volume":"102","author":"N Fischer","year":"2019","unstructured":"Fischer, N., van Glabbeek, R.: Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours. J. Log. Algebra Methods Program. 102, 64\u2013102 (2019). https:\/\/doi.org\/10.1016\/j.jlamp.2018.09.006","journal-title":"J. Log. Algebra Methods Program."},{"key":"379_CR12","doi-asserted-by":"crossref","unstructured":"Groote, J.F., Vaandrager, F.W.: An efficient algorithm for branching bisimulation and stuttering equivalence. In: 17th International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, vol. 443, pp. 626\u2013638. Springer, Berlin (1990)","DOI":"10.1007\/BFb0032063"},{"issue":"4\u20136","key":"379_CR13","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 Asp. Comput. 24(4\u20136), 749\u2013768 (2012). https:\/\/doi.org\/10.1007\/s00165-012-0242-7","journal-title":"Formal Asp. Comput."},{"issue":"2","key":"379_CR14","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.ic.2010.11.024","volume":"209","author":"H Hermanns","year":"2011","unstructured":"Hermanns, H., Parma, A., Segala, R., Wachter, B., Zhang, L.: Probabilistic logical characterization. Inf. Comput. 209(2), 154\u2013172 (2011). https:\/\/doi.org\/10.1016\/j.ic.2010.11.024","journal-title":"Inf. Comput."},{"key":"379_CR15","doi-asserted-by":"publisher","unstructured":"Lee, M.D., de\u00a0Vink, E.P.: Logical characterization of bisimulation for transition relations over probability distributions with internal actions. In: Faliszewski, P., Muscholl, A., Niedermeier, R. (eds.) 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, 22\u201326 Aug 2016-Krak\u00f3w, Poland, LIPIcs, vol.\u00a058, pp. 29:1\u201329:14. Schloss Dagstuhl\u2014Leibniz-Zentrum fuer Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2016.29","DOI":"10.4230\/LIPIcs.MFCS.2016.29"},{"key":"379_CR16","doi-asserted-by":"publisher","unstructured":"Liu, X., Yu, T., Zhang, W.: Logics for bisimulation and divergence. In: Baier, C., Lago, U.D. (eds.) Foundations of Software Science and Computation Structures\u201421st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, 14\u201320 April 2018, Proceedings, Lecture Notes in Computer Science, vol. 10803, pp. 221\u2013237. Springer, Berlin (2018). https:\/\/doi.org\/10.1007\/978-3-319-89366-2_12","DOI":"10.1007\/978-3-319-89366-2_12"},{"key":"379_CR17","volume-title":"Communication and Concurrency. PHI Series in Computer Science","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. PHI Series in Computer Science. Prentice Hall, Upper Saddle River (1989)"},{"key":"379_CR18","doi-asserted-by":"publisher","unstructured":"Park, D.M.R.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) Theoretical Computer Science, 5th GI-Conference, Karlsruhe, Germany, 23\u201325 March 1981, Proceedings, Lecture Notes in Computer Science, vol. 104, pp. 167\u2013183. Springer, Berlin (1981). https:\/\/doi.org\/10.1007\/BFb0017309","DOI":"10.1007\/BFb0017309"},{"key":"379_CR19","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"ML Puterman","year":"1994","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, New York (1994)"},{"key":"379_CR20","unstructured":"Segala, R.: Modeling and verification of randomized distributed real-time systems. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, USA (1995). http:\/\/hdl.handle.net\/1721.1\/36560"},{"key":"379_CR21","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-9(2:7)2013","author":"L Song","year":"2013","unstructured":"Song, L., Zhang, L., Godskesen, J.C.: Bisimulations meet PCTL equivalences for probabilistic automata. Log. Methods Comput. Sci. (2013). https:\/\/doi.org\/10.2168\/LMCS-9(2:7)2013","journal-title":"Log. Methods Comput. Sci."},{"key":"379_CR22","unstructured":"Stoelinga, M.: Alea jacta est: verification of probabilistic, real-time and parametric systems. Ph.D. thesis, University of Nijmegen, the Netherlands (2002)"},{"key":"379_CR23","doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J.: The linear time-branching time spectrum II. In: Best, E. (ed.) CONCUR \u201993, 4th International Conference on Concurrency Theory, Hildesheim, Germany, 23\u201326 Aug 1993, Proceedings, Lecture Notes in Computer Science, vol. 715, pp. 66\u201381. Springer, Berlin (1993). https:\/\/doi.org\/10.1007\/3-540-57208-2_6. An extended version is available at http:\/\/boole.stanford.edu\/pub\/spectrum.pdf.gz","DOI":"10.1007\/3-540-57208-2_6"},{"key":"379_CR24","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/b978-044482830-9\/50019-9","volume-title":"Handbook of Process Algebra","author":"RJ van Glabbeek","year":"2001","unstructured":"van Glabbeek, R.J.: The linear time-branching time spectrum I. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 3\u201399. North-Holland, Elsevier, Amsterdam (2001). https:\/\/doi.org\/10.1016\/b978-044482830-9\/50019-9"},{"issue":"4","key":"379_CR25","doi-asserted-by":"publisher","first-page":"371","DOI":"10.3233\/FI-2009-109","volume":"93","author":"RJ van Glabbeek","year":"2009","unstructured":"van Glabbeek, R.J., Luttik, B., Trcka, N.: Branching bisimilarity with explicit divergence. Fundam. Inform. 93(4), 371\u2013392 (2009). https:\/\/doi.org\/10.3233\/FI-2009-109","journal-title":"Fundam. Inform."},{"issue":"3","key":"379_CR26","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"RJ van Glabbeek","year":"1996","unstructured":"van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. J. ACM 43(3), 555\u2013600 (1996). https:\/\/doi.org\/10.1145\/233551.233556","journal-title":"J. ACM"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-020-00379-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-020-00379-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-020-00379-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,5]],"date-time":"2021-05-05T23:29:16Z","timestamp":1620257356000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-020-00379-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,6]]},"references-count":26,"journal-issue":{"issue":"3-5","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["379"],"URL":"https:\/\/doi.org\/10.1007\/s00236-020-00379-2","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,6]]},"assertion":[{"value":"9 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}