{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:43:04Z","timestamp":1725745384901},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642406621"},{"type":"electronic","value":"9783642406638"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40663-8_19","type":"book-chapter","created":{"date-parts":[[2013,8,19]],"date-time":"2013-08-19T21:03:57Z","timestamp":1376946237000},"page":"199-210","source":"Crossref","is-referenced-by-count":0,"title":["Approximation of Large Probabilistic Networks by Structured Population Protocols"],"prefix":"10.1007","author":[{"given":"Michel","family":"de Rougemont","sequence":"first","affiliation":[]},{"given":"Mathieu","family":"Tracol","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1023\/B:MCAP.0000017712.55431.96","volume":"6","author":"A. Agapie","year":"2004","unstructured":"Agapie, A., H\u00f6ns, R., \u00fchlenbein, H.: Markov Chain Analysis for One-Dimensional Asynchronous Cellular Automata. Methodology and Computing in Applied Probability\u00a06(2), 181\u2013201 (2004)","journal-title":"Methodology and Computing in Applied Probability"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/11502593_8","volume-title":"Distributed Computing in Sensor Systems","author":"D. Angluin","year":"2005","unstructured":"Angluin, D., Aspnes, J., Chan, M., Fischer, M.J., Jiang, H., Peralta, R.: Stably computable properties of network graphs. In: Prasanna, V.K., Iyengar, S.S., Spirakis, P.G., Welsh, M. (eds.) DCOSS 2005. LNCS, vol.\u00a03560, pp. 63\u201374. Springer, Heidelberg (2005)"},{"issue":"4","key":"19_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","volume":"18","author":"D. Angluin","year":"2006","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distributed Computing\u00a018(4), 235\u2013253 (2006)","journal-title":"Distributed Computing"},{"key":"19_CR4","first-page":"315","volume":"314","author":"J. Aspnes","year":"2007","unstructured":"Aspnes, J., Ruppert, E.: An introduction to population protocols. Chemistry\u00a0314, 315 (2007)","journal-title":"Chemistry"},{"issue":"8","key":"19_CR5","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1016\/j.jcss.2006.03.006","volume":"72","author":"C.L. Barrett","year":"2006","unstructured":"Barrett, C.L., Hunt, H.B., Marathe, M.V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.: Complexity of reachability problems for finite discrete dynamical systems. Journal of Computer and System Sciences\u00a072(8), 1317\u20131345 (2006)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"19_CR6","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. JACM\u00a042(4), 857\u2013907 (1995)","journal-title":"JACM"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"de Rougemont, M., Tracol, M.: Statistical analysis for probabilistic processes. In: Proc. IEEE Logic in Computer Science, pp. 299\u2013308 (2009)","DOI":"10.1109\/LICS.2009.36"},{"key":"19_CR8","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)"},{"issue":"4","key":"19_CR9","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1137\/S0036144599354707","volume":"41","author":"R. Durrett","year":"1999","unstructured":"Durrett, R.: Stochastic spatial models. Siam Review\u00a041(4), 677\u2013718 (1999)","journal-title":"Siam Review"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-65306-6_20","volume-title":"Lectures on Petri Nets I: Basic Models","author":"J. Esparza","year":"1998","unstructured":"Esparza, J.: Decidability and complexity of Petri net problems-an introduction. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol.\u00a01491, pp. 374\u2013385. Springer, Heidelberg (1998)"},{"issue":"6","key":"19_CR11","doi-asserted-by":"publisher","first-page":"2251","DOI":"10.1137\/070703776","volume":"39","author":"E. Fischer","year":"2010","unstructured":"Fischer, E., Magniez, F., de Rougemont, M.: Approximate satisfiability and equivalence. SIAM J. Comput.\u00a039(6), 2251\u20132281 (2010)","journal-title":"SIAM J. Comput."},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-02658-4_27","volume-title":"Computer Aided Verification","author":"T.A. Henzinger","year":"2009","unstructured":"Henzinger, T.A., Mateescu, M., Wolf, V.: Sliding window abstraction for infinite markov chains. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol.\u00a05643, pp. 337\u2013352. Springer, Heidelberg (2009)"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1145\/313451.313558","volume-title":"Proceedings of the 5th Annual ACM\/IEEE International Conference on Mobile Computing and Networking","author":"J.M. Kahn","year":"1999","unstructured":"Kahn, J.M., Katz, R.H., Pister, K.S.J.: Next century challenges: mobile networking for Smart Dust. In: Proceedings of the 5th Annual ACM\/IEEE International Conference on Mobile Computing and Networking, pp. 271\u2013278. ACM, New York (1999)"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-32943-2_18","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2012","author":"S. Peyronnet","year":"2012","unstructured":"Peyronnet, S., De Rougemont, M., Strozecki, Y.: Approximate verification and enumeration problems. In: Roychoudhury, A., D\u2019Souza, M. (eds.) ICTAC 2012. LNCS, vol.\u00a07521, pp. 228\u2013242. Springer, Heidelberg (2012)"},{"key":"19_CR15","doi-asserted-by":"publisher","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, Inc., New York (1994)"},{"issue":"1","key":"19_CR16","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1006\/jcss.1995.1009","volume":"50","author":"K. Sutner","year":"1995","unstructured":"Sutner, K.: On the computational complexity of finite cellular automata. Journal of Computer and System Sciences\u00a050(1), 87\u201397 (1995)","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: Automatic verification of probabilistic concurrent finite state programs. In: FOCS 1984, pp. 327\u2013338 (1985)","DOI":"10.1109\/SFCS.1985.12"},{"key":"19_CR18","first-page":"2","volume":"9","author":"S. Wolfram","year":"1983","unstructured":"Wolfram, S.: Cellular automata. Los Alamos Science\u00a09, 2\u201321 (1983)","journal-title":"Los Alamos Science"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40663-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T14:41:11Z","timestamp":1558017671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40663-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642406621","9783642406638"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40663-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}