乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:30:46Z","timestamp":1725535846917},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642032394"},{"type":"electronic","value":"9783642032400"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03240-0_8","type":"book-chapter","created":{"date-parts":[[2009,7,27]],"date-time":"2009-07-27T10:27:38Z","timestamp":1248690458000},"page":"53-68","source":"Crossref","is-referenced-by-count":0,"title":["Local Quantitative LTL Model Checking"],"prefix":"10.1007","author":[{"given":"Ji\u0159\u00ed","family":"Barnat","sequence":"first","affiliation":[]},{"given":"Lubo\u0161","family":"Brim","sequence":"additional","affiliation":[]},{"given":"Ivana","family":"\u010cern\u00e1","sequence":"additional","affiliation":[]},{"given":"Milan","family":"\u010ce\u0161ka","sequence":"additional","affiliation":[]},{"given":"Jana","family":"T\u016fmov\u00e1","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/3-540-61474-5_75","volume-title":"Computer Aided Verification","author":"A. Aziz","year":"1996","unstructured":"Aziz, A., Sanwal, K., Singhal, V., Brayton, R.K.: 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":"8_CR2","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/0196-6774(90)90021-6","volume":"15","author":"J. Aspnes","year":"1990","unstructured":"Aspnes, J., Herlihy, M.: Fast randomized consensus using shared memory. Journal of Algorithms\u00a015(1), 441\u2013460 (1990)","journal-title":"Journal of Algorithms"},{"key":"8_CR3","unstructured":"Baier, C.: On the Algorithmic Verification of Probabilistic Systems. Habilitation Thesis, Universit\u00e4t Mannheim (1998)"},{"key":"8_CR4","first-page":"230","volume-title":"1st International Conference on Quantitative Evaluation of Systems (QEST 2004)","author":"C. Baier","year":"2004","unstructured":"Baier, C., Gr\u00f6\u00dfer, M., Ciesinski, F.: Partial Order Reduction for Probabilistic Systems. In: 1st International Conference on Quantitative Evaluation of Systems (QEST 2004), pp. 230\u2013239. IEEE Computer Society, Los Alamitos (2004)"},{"key":"8_CR5","volume-title":"Proceedings of QEST 2008, Tool Paper","author":"J. Barnat","year":"2008","unstructured":"Barnat, J., Brim, L., \u010cern\u00e1, I., \u010ce\u0161ka, M., T\u016fmov\u00e1, J.: ProbDiVinE-MC: Multi-Core LTL Model Checker for Probabilistic Systems. In: Proceedings of QEST 2008, Tool Paper. IEEE, Los Alamitos (2008) (to appear), http:\/\/anna.fi.muni.cz\/probdivine"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.entcs.2008.02.001","volume":"198","author":"J. Barnat","year":"2008","unstructured":"Barnat, J., Chaloupka, J., van de Pol, J.: Improved Distributed Algorithms for SCC Decomposition. Electron. Notes Theor. Comput. Sci.\u00a0198(1), 63\u201377 (2008)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/3-540-60692-0_70","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"A. Bianco","year":"1995","unstructured":"Bianco, A., de Alfaro, L.: Model checking of probabilistic and nondeterministic systems. In: Thiagarajan, P.S. (ed.) FSTTCS 1995. LNCS, vol.\u00a01026, pp. 499\u2013513. Springer, Heidelberg (1995)"},{"key":"8_CR8","unstructured":"Jeannet, B., de Argenio, P., Larsen, K.G.: RAPTURE: A tool for verifying Markov Decision Processes. In: Proc. Tools Day \/ CONCUR 2002. Tech. Rep. FIMU-RS-2002-05. MU Brno, pp. 84\u201398 (2002)"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D. Chaum","year":"1988","unstructured":"Chaum, D.: The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology\u00a01, 65\u201375 (1988)","journal-title":"Journal of Cryptology"},{"key":"8_CR10","first-page":"131","volume-title":"Proc. of QEST 2006","author":"F. Ciesinski","year":"2006","unstructured":"Ciesinski, F., Baier, C.: LiQuor: A tool for Qualitative and Quantitative Linear Time analysis of Reactive Systems. In: Proc. of QEST 2006, pp. 131\u2013132. IEEE Computer Society, Los Alamitos (2006)"},{"issue":"4","key":"8_CR11","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1145\/210332.210339","volume":"42","author":"C. Courcoubetis","year":"1995","unstructured":"Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. Journal of the ACM\u00a042(4), 857\u2013907 (1995)","journal-title":"Journal of the ACM"},{"key":"8_CR12","unstructured":"de Alfaro, L.: Formal Verification of Stochastic Systems. PhD thesis, Stanford University, Department of Computer Science (1997)"},{"key":"8_CR13","volume-title":"Finite State Markovian Decision Processes","author":"C. Derman","year":"1970","unstructured":"Derman, C.: Finite State Markovian Decision Processes. Academic Press, Inc., Orlando (1970)"},{"key":"8_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0877-8","volume-title":"Measure theory","author":"J.L. Doob","year":"1994","unstructured":"Doob, J.L.: Measure theory. Springer, Heidelberg (1994)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Hansson, H., Jonsson, B.: A Framework for Reasoning about Time and Reliability. In: IEEE Real-Time Systems Symposium, pp. 102\u2013111 (1989)","DOI":"10.1109\/REAL.1989.63561"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/11691372_29","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Hinton","year":"2006","unstructured":"Hinton, A., Kwiatkowska, M., Norman, G., Parker, D.: PRISM: A tool for automatic verification of probabilistic systems. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol.\u00a03920, pp. 441\u2013444. Springer, Heidelberg (2006)"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Israeli, A., Jalfon, M.: Token management schemes and random walks yield self-stabilizating mutual exclusion. In: Proc. ACM Symposium on Principles of Distributed Computing, pp. 119\u2013131 (1990)","DOI":"10.1145\/93385.93409"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Itai, A., Rodeh, M.: Symmetry breaking in distributed networks. Information and Computation\u00a088(1) (1990)","DOI":"10.1016\/0890-5401(90)90004-2"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Lehmann, D., Rabin, M.: On the advantage of free choice: A symmetric and fully distributed solution to the dining philosophers problem (extended abstract). In: Proc. 8th Annual ACM Symposium on Principles of Programming Languages (POPL 1981), pp. 133\u2013138 (1981)","DOI":"10.1145\/567532.567547"},{"key":"8_CR20","unstructured":"ProbDiVinE homepage (2008), http:\/\/anna.fi.muni.cz\/probdivine"},{"key":"8_CR21","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes-Discrete Stochastic Dynamic Programming","author":"M.L. Puterman","year":"1994","unstructured":"Puterman, M.L.: Markov Decision Processes-Discrete Stochastic Dynamic Programming. John Wiley &Sons, New York (1994)"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/3-540-48778-6_16","volume-title":"Formal Methods for Real-Time and Probabilistic Systems","author":"M.Y. Vardi","year":"1999","unstructured":"Vardi, M.Y.: Probabilistic linear-time model checking: an overview of the automata-theoretic approach. In: Katoen, J.-P. (ed.) AMAST-ARTS 1999, ARTS 1999, and AMAST-WS 1999. LNCS, vol.\u00a01601, pp. 265\u2013276. Springer, Heidelberg (1999)"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y., Wolper, P.: Reasoning about infinite computation paths. In: Proceedings of 24th IEEE Symposium on Foundation of Computer Science, Tuscan, pp. 185\u2013194 (1983)","DOI":"10.1109\/SFCS.1983.51"}],"container-title":["Lecture Notes in Computer Science","Formal Methods for Industrial Critical Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03240-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,8]],"date-time":"2021-10-08T23:17:41Z","timestamp":1633735061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03240-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642032394","9783642032400"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03240-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}