{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T08:50:59Z","timestamp":1744707059891,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642285394"},{"type":"electronic","value":"9783642285400"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","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-28540-0_9","type":"book-chapter","created":{"date-parts":[[2012,3,8]],"date-time":"2012-03-08T14:48:22Z","timestamp":1331218102000},"page":"121-135","source":"Crossref","is-referenced-by-count":4,"title":["Weighted Probabilistic Equivalence Preserves \u03c9-Regular Properties"],"prefix":"10.1007","author":[{"given":"Arpit","family":"Sharma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Ash, R.B., Doleans-Dade, C.A.: Probability and Measure Theory. Academic Press (2000)"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-60045-0_48","volume-title":"Computer Aided Verification","author":"A. Aziz","year":"1995","unstructured":"Aziz, A., Singhal, V., Balarin, F.: It Usually Works: The Temporal Logic of Stochastic Systems. In: Wolper, P. (ed.) CAV 1995. LNCS, vol.\u00a0939, pp. 155\u2013165. Springer, Heidelberg (1995)"},{"key":"9_CR3","unstructured":"Baier, C., Katoen, J.-P.: Principles of Model Checking. MIT Press (2008)"},{"issue":"2","key":"9_CR4","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.ic.2005.03.001","volume":"200","author":"C. Baier","year":"2005","unstructured":"Baier, C., Katoen, J.-P., Hermanns, H., Wolf, V.: Comparative branching-time semantics for Markov chains. Inf. Comput.\u00a0200(2), 149\u2013214 (2005)","journal-title":"Inf. Comput."},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jlap.2007.02.002","volume":"72","author":"M. Bernardo","year":"2007","unstructured":"Bernardo, M.: Non-bisimulation-based Markovian behavioral equivalences. J. Log. Algebr. Program.\u00a072(1), 3\u201349 (2007)","journal-title":"J. Log. Algebr. Program."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Buchholz, P.: Exact and ordinary lumpability in finite Markov chains. J. of Appl. Prob., 59\u201375 (1994)","DOI":"10.2307\/3215235"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Desharnais, J., Edalat, A., Panangaden, P.: A logical characterization of bisimulation for labeled Markov processes. In: LICS, pp. 478\u2013487 (1998)","DOI":"10.1109\/LICS.1998.705681"},{"key":"9_CR8","unstructured":"Feller, W.: An Introduction to Probability Theory and Its Applications, vol.\u00a01. John Wiley and Sons (1968)"},{"key":"9_CR9","first-page":"130","volume":"121","author":"R.J.V. Glabbeek","year":"1990","unstructured":"Glabbeek, R.J.V., Smolka, S.A., Steffen, B.: Reactive, generative and stratified models of probabilistic processes. Information and Computation\u00a0121, 130\u2013141 (1990)","journal-title":"Information and Computation"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-540-78929-1_18","volume-title":"Hybrid Systems: Computation and Control","author":"T. Han","year":"2008","unstructured":"Han, T., Katoen, J.-P., Mereacre, A.: Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains. In: Egerstedt, M., Mishra, B. (eds.) HSCC 2008. LNCS, vol.\u00a04981, pp. 244\u2013258. Springer, Heidelberg (2008)"},{"issue":"5","key":"9_CR11","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/BF01211866","volume":"66","author":"H. Hansson","year":"1994","unstructured":"Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Asp. Comput.\u00a066(5), 512\u2013535 (1994)","journal-title":"Formal Asp. Comput."},{"issue":"3","key":"9_CR12","doi-asserted-by":"crossref","first-page":"211","DOI":"10.3233\/FI-1992-17304","volume":"17","author":"D.T. Huynh","year":"1992","unstructured":"Huynh, D.T., Tian, L.: On some equivalence relations for probabilistic processes. Fundam. Inform.\u00a017(3), 211\u2013234 (1992)","journal-title":"Fundam. Inform."},{"key":"9_CR13","first-page":"186","volume-title":"LICS","author":"C. Jones","year":"1989","unstructured":"Jones, C., Plotkin, G.: A probabilistic powerdomain of evaluations. In: LICS, pp. 186\u2013195. IEEE Press, Piscataway (1989)"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Jonsson, B., Larsen, K.G.: Specification and refinement of probabilistic processes. In: LICS, pp. 266\u2013277 (1991)","DOI":"10.1109\/LICS.1991.151651"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BFb0039071","volume-title":"CONCUR \u201990","author":"C.-C. Jou","year":"1990","unstructured":"Jou, C.-C., Smolka, S.A.: Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 367\u2013383. Springer, Heidelberg (1990)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Katoen, J.-P., Khattri, M., Zapreev, I.S.: A Markov reward model checker. In: QEST, pp. 243\u2013244. IEEE CS Press (2005)","DOI":"10.1109\/QEST.2005.2"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-85778-5_15","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"J.-P. Katoen","year":"2008","unstructured":"Katoen, J.-P., Mereacre, A.: Model Checking HML on Piecewise-Constant Inhomogeneous Markov Chains. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol.\u00a05215, pp. 203\u2013217. Springer, Heidelberg (2008)"},{"key":"9_CR18","unstructured":"Kemeny, J., Snell, J.: Finite Markov chains. VanNostrand (1969)"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: Prism 2.0: A tool for probabilistic model checking. In: QEST, pp. 322\u2013323. IEEE Computer Society Press (2004)","DOI":"10.1109\/QEST.2004.1348048"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. In: POPL, pp. 344\u2013352 (1989)","DOI":"10.1145\/75277.75307"},{"issue":"10","key":"9_CR21","doi-asserted-by":"publisher","first-page":"1629","DOI":"10.1109\/TCAD.2005.852033","volume":"24","author":"G. Norman","year":"2005","unstructured":"Norman, G., Parker, D., Kwiatkowska, M., Shukla, S.: Evaluating the reliability of NAND multiplexing with PRISM. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems\u00a024(10), 1629\u20131637 (2005)","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"9_CR22","unstructured":"Segala, R.: Modelling and Verification of Randomized Distributed Real Time Systems. PhD thesis, MIT (1995)"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1007\/978-3-642-29709-0_28","volume-title":"PSI 2011","author":"A. Sharma","year":"2012","unstructured":"Sharma, A., Katoen, J.-P.: Weighted Lumpability on Markov Chains. In: Voronkov, A. (ed.) PSI 2011. LNCS, vol.\u00a07162, pp. 322\u2013339. Springer, Heidelberg (2012)"},{"key":"9_CR24","volume-title":"Automata Logics, and Infinite Games: A Guide to Current Research","author":"W. Thomas","year":"2002","unstructured":"Thomas, W., Wilke, T.: Automata Logics, and Infinite Games: A Guide to Current Research. Springer, Heidelberg (2002)"},{"issue":"5","key":"9_CR25","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/BF01211867","volume":"6","author":"C.M.N. Tofts","year":"1994","unstructured":"Tofts, C.M.N.: Processes with probablities, priority and time. Formal Asp. Comput.\u00a06(5), 536\u2013564 (1994)","journal-title":"Formal Asp. Comput."},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/BFb0035395","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C.M.N. Tofts","year":"1997","unstructured":"Tofts, C.M.N.: Compositional Performance Analysis. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol.\u00a01217, pp. 290\u2013305. Springer, Heidelberg (1997)"},{"issue":"2","key":"9_CR27","first-page":"259","volume":"153","author":"V. Wolf","year":"2006","unstructured":"Wolf, V., Baier, C., Majster-Cederbaum, M.E.: Trace machines for observing continuous-time Markov chains. ENTCS\u00a0153(2), 259\u2013277 (2006)","journal-title":"ENTCS"}],"container-title":["Lecture Notes in Computer Science","Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28540-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T18:32:23Z","timestamp":1742668343000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28540-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642285394","9783642285400"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28540-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}