{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:52:08Z","timestamp":1725511928404},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540712084"},{"type":"electronic","value":"9783540712091"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71209-1_14","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T22:56:34Z","timestamp":1183589794000},"page":"155-169","source":"Crossref","is-referenced-by-count":7,"title":["Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations"],"prefix":"10.1007","author":[{"given":"Lijun","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Holger","family":"Hermanns","sequence":"additional","affiliation":[]},{"given":"Friedrich","family":"Eisenbrand","sequence":"additional","affiliation":[]},{"given":"David N.","family":"Jansen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","volume-title":"Network Flows: theory, algorithms, and applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: theory, algorithms, and applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/3-540-61474-5_75","volume-title":"Computer Aided Verification","author":"A. Aziz","year":"1996","unstructured":"Aziz, A., et al.: Verifying Continuous Time Markov Chains. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.\u00a01102, pp. 269\u2013276. Springer, Heidelberg (1996)"},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1006\/jcss.1999.1683","volume":"60","author":"C. Baier","year":"2000","unstructured":"Baier, C., Engelen, B., Majster-Cederbaum, M.E.: Deciding Bisimilarity and Similarity for Probabilistic Processes. J. Comput. Syst. Sci.\u00a060(1), 187\u2013231 (2000)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"14_CR4","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1109\/TSE.2003.1205180","volume":"29","author":"C. Baier","year":"2003","unstructured":"Baier, C., et al.: Model-Checking Algorithms for Continuous-Time Markov Chains. IEEE Trans. Software Eng.\u00a029(6), 524\u2013541 (2003)","journal-title":"IEEE Trans. Software Eng."},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.ipl.2003.10.001","volume":"89","author":"C. Baier","year":"2004","unstructured":"Baier, C., Hermanns, H., Katoen, J.-P.: Probabilistic weak simulation is decidable in polynomial time. Inf. Process. Lett.\u00a089(3), 123\u2013130 (2004)","journal-title":"Inf. Process. Lett."},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/3-540-46002-0","volume-title":"CONCUR 2002 - Concurrency Theory","author":"J.-P. Katoen","year":"2002","unstructured":"Katoen, J.-P., et al.: Simulation for Continuous-Time Markov Chains. In: Brim, L., et al. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 338\u2013354. Springer, Heidelberg (2002)"},{"issue":"2","key":"14_CR7","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., et al.: Comparative branching-time semantics for Markov chains. Inf. Comput\u00a0200(2), 149\u2013214 (2005)","journal-title":"Inf. Comput"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/BFb0032035","volume-title":"Automata, Languages and Programming","author":"J. Cheriyan","year":"1990","unstructured":"Cheriyan, J., Hagerup, T., Mehlhorn, K.: Can a Maximum Flow be Computed in \n                    \n                      \n                    \n                    $\\mathcal{O}(nm)$\n                   Time? In: Paterson, M. (ed.) ICALP 1990. LNCS, vol.\u00a0443, pp. 235\u2013248. Springer, Heidelberg (1990)"},{"issue":"5","key":"14_CR9","doi-asserted-by":"publisher","first-page":"1512","DOI":"10.1145\/186025.186051","volume":"16","author":"E.M. Clarke","year":"1994","unstructured":"Clarke, E.M., Grumberg, O., Long, D.E.: Model Checking and Abstraction. ACM Transactions on Programming Languages and Systems\u00a016(5), 1512\u20131542 (1994)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1","key":"14_CR10","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G. Gallo","year":"1989","unstructured":"Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. SIAM J. Comput.\u00a018(1), 30\u201355 (1989)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"14_CR11","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1023\/A:1027328830731","volume":"31","author":"R. Gentilini","year":"2003","unstructured":"Gentilini, R., Piazza, C., Policriti, A.: From Bisimulation to Simulation: Coarsest Partition Problems. J. Autom. Reasoning\u00a031(1), 73\u2013103 (2003)","journal-title":"J. Autom. Reasoning"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0054350","volume-title":"Algorithm Theory - SWAT\u201998","author":"A.V. Goldberg","year":"1998","unstructured":"Goldberg, A.V.: Recent Developments in Maximum Flow Algorithms. In: Arnborg, S. (ed.) SWAT 1998. LNCS, vol.\u00a01432, pp. 1\u201310. Springer, Heidelberg (1998)"},{"issue":"4","key":"14_CR13","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A.V. Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM\u00a035(4), 921\u2013940 (1988)","journal-title":"J. ACM"},{"issue":"5","key":"14_CR14","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/BF01211866","volume":"6","author":"H. Hansson","year":"1994","unstructured":"Hansson, H., Jonsson, B.: A Logic for Reasoning about Time and Reliability. Formal Asp. Comput.\u00a06(5), 512\u2013535 (1994)","journal-title":"Formal Asp. Comput."},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing Simulations on Finite and Infinite Graphs. In: FOCS, pp. 453\u2013462 (1995)","DOI":"10.1109\/SFCS.1995.492576"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1007\/3-540-54430-5_99","volume-title":"CONCUR \u201991","author":"B. Jonsson","year":"1991","unstructured":"Jonsson, B.: Simulations Between Specifications of Distributed Systems. In: Groote, J.F., Baeten, J.C.M. (eds.) CONCUR 1991. LNCS, vol.\u00a0527, pp. 346\u2013360. Springer, Heidelberg (1991)"},{"key":"14_CR17","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":"14_CR18","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"14_CR19","unstructured":"Parker, D.: Implementation of Symbolic Model Checking for Probabilistic Systems. University of Birmingham (2002)"},{"key":"14_CR20","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71209-1_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:43:09Z","timestamp":1619516589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71209-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540712084","9783540712091"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71209-1_14","relation":{},"subject":[]}}