{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T04:11:20Z","timestamp":1750824680876,"version":"3.41.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319646343"},{"type":"electronic","value":"9783319646350"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-64635-0_8","type":"book-chapter","created":{"date-parts":[[2017,7,31]],"date-time":"2017-07-31T04:22:56Z","timestamp":1501474976000},"page":"95-110","source":"Crossref","is-referenced-by-count":5,"title":["Boolean Network Models of Collective Dynamics of Open and Closed Large-Scale Multi-agent Systems"],"prefix":"10.1007","author":[{"given":"Predrag T.","family":"To\u0161i\u0107","sequence":"first","affiliation":[]},{"given":"Carlos","family":"Ordonez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,1]]},"reference":[{"issue":"9\u201310","key":"8_CR1","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1080\/08839510290030516","volume":"16","author":"S Bandini","year":"2002","unstructured":"Bandini, S., Manzoni, S., Simone, C.: Heterogeneous agents situated in heterogeneous spaces. Appl. Artif. Intell. Int. J. 16(9\u201310), 831\u2013852 (2002). Taylor & Francis","journal-title":"Appl. Artif. Intell. Int. J."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Barrett, C., et al.: Gardens of Eden and fixed points in sequential dynamical systems. In: Discrete Mathematics & Theoretical Computer Science (DMTCS), vol. AA, pp. 95\u2013110 (2001)","DOI":"10.46298\/dmtcs.2294"},{"issue":"1\u20133","key":"8_CR3","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0304-3975(02)00395-X","volume":"295","author":"C Barrett","year":"2003","unstructured":"Barrett, C., et al.: Reachability problems for sequential dynamical systems with threshold functions. Theoret. Comput. Sci. 295(1\u20133), 41\u201364 (2003)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"8_CR4","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1080\/09540090600639339","volume":"18","author":"N Davey","year":"2006","unstructured":"Davey, N., Calcraft, L., Adams, R.: High capacity, small world associative memory models. Connect. Sci. 18(3), 247\u2013264 (2006)","journal-title":"Connect. Sci."},{"key":"8_CR5","first-page":"577","volume":"3","author":"P Floreen","year":"1989","unstructured":"Floreen, P., Orponen, P.: On the computational complexity of analyzing hopfield nets. Complex Syst. 3, 577\u2013587 (1989)","journal-title":"Complex Syst."},{"issue":"10","key":"8_CR6","doi-asserted-by":"crossref","first-page":"1291","DOI":"10.1089\/cmb.2010.0069","volume":"18","author":"A Graudenzi","year":"2011","unstructured":"Graudenzi, A., et al.: Dynamical properties of a Boolean model of gene regulatory network with memory. J. Comput. Biol. 18(10), 1291\u20131303 (2011). https:\/\/doi.org\/10.1089\/cmb.2010.0069","journal-title":"J. Comput. Biol."},{"key":"8_CR7","series-title":"Understanding Complex Systems","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-24004-1","volume-title":"Social Self-Organization","author":"D Helbing","year":"2012","unstructured":"Helbing, D.: Social Self-Organization. Understanding Complex Systems. Springer, Heidelberg (2012)"},{"key":"8_CR8","doi-asserted-by":"crossref","first-page":"2554","DOI":"10.1073\/pnas.79.8.2554","volume":"79","author":"J Hopfield","year":"1982","unstructured":"Hopfield, J.: Neural networks and physical systems with emergent\\collective computational abilities. Proc. Nat. Acad. Sci. 79, 2554\u20132558 (1982)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"8_CR9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"J Hopfield","year":"1985","unstructured":"Hopfield, J., Tank, D.: Neural computation of decisions in optimization problems. Biol. Cybern. 52, 141\u2013152 (1985)","journal-title":"Biol. Cybern."},{"issue":"1\u20132","key":"8_CR10","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0167-2789(84)90257-4","volume":"10","author":"SA Kauffman","year":"1984","unstructured":"Kauffman, S.A.: Emergent properties in random complex automata. Phys. D: Nonlin. Phenom. 10(1\u20132), 145\u2013156 (1984)","journal-title":"Phys. D: Nonlin. Phenom."},{"issue":"1\u20133","key":"8_CR11","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0012-365X(00)00115-1","volume":"226","author":"H Mortveit","year":"2001","unstructured":"Mortveit, H., Reidys, C.: Discrete sequential dynamical systems. Discrete Math. 226(1\u20133), 281\u2013295 (2001)","journal-title":"Discrete Math."},{"issue":"1","key":"8_CR12","first-page":"94","volume":"1","author":"P Orponen","year":"1994","unstructured":"Orponen, P.: Computational complexity of neural networks: a survey. Nord. J. Comput. 1(1), 94\u2013110 (1994)","journal-title":"Nord. J. Comput."},{"issue":"12","key":"8_CR13","doi-asserted-by":"crossref","first-page":"2727","DOI":"10.1162\/089976603322518731","volume":"15","author":"J Sima","year":"2003","unstructured":"Sima, J., Orponen, P.: General-purpose computation with neural networks: a survey of complexity theoretic results. Neural Comput. 15(12), 2727\u20132778 (2003)","journal-title":"Neural Comput."},{"key":"8_CR14","unstructured":"To\u0161i\u0107, P.T., et al.: Modeling a system of UAVs on a mission, invited session on agent-based computing. In: Proceedings of 7th World Multiconference on Systemics, Cybernetics, and Informatics (SCI 2003), pp. 508\u2013514 (2003)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/11560319_18","volume-title":"Unconventional Computation","author":"PT To\u0161i\u0107","year":"2005","unstructured":"To\u0161i\u0107, P.T., Agha, G.A.: On computational complexity of counting fixed points in symmetric Boolean graph automata. In: Calude, C.S., Dinneen, M.J., P\u0103un, G., P\u00e9rez-J\u00edmenez, M.J., Rozenberg, G. (eds.) UC 2005. LNCS, vol. 3699, pp. 191\u2013205. Springer, Heidelberg (2005). doi: 10.1007\/11560319_18"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"To\u0161i\u0107, P.T.: Cellular automata for distributed computing: models of agent interaction and their implications. In: Proceedings of International Conference Systems, Man & Cybernetics (SMC 2005), pp. 3204\u20133209. IEEE (2005)","DOI":"10.1109\/ICSMC.2005.1571639"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/11758532_38","volume-title":"Computational Science \u2013 ICCS 2006","author":"PT To\u0161i\u0107","year":"2006","unstructured":"To\u0161i\u0107, P.T.: On modeling and analyzing sparsely networked large-scale multi-agent systems with cellular and graph automata. In: Alexandrov, V.N., Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2006. LNCS, vol. 3993, pp. 272\u2013280. Springer, Heidelberg (2006). doi: 10.1007\/11758532_38"},{"issue":"5","key":"8_CR18","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1142\/S0129054106004339","volume":"17","author":"PT To\u0161i\u0107","year":"2006","unstructured":"To\u0161i\u0107, P.T.: On the complexity of counting fixed points and gardens of Eden in sequential & synchronous dynamical systems. Int. J. Found. Comput. Sci. (IJFCS) 17(5), 1179\u20131203 (2006). World Scientific","journal-title":"Int. J. Found. Comput. Sci. (IJFCS)"},{"issue":"3","key":"8_CR19","doi-asserted-by":"crossref","first-page":"66","DOI":"10.4018\/jncr.2010070105","volume":"1","author":"PT To\u0161i\u0107","year":"2010","unstructured":"To\u0161i\u0107, P.T.: Cellular automata communication models: comparative analysis of parallel, sequential and asynchronous ca with simple threshold update rules. Int. J. Nat. Comput. Res. (IJNCR) 1(3), 66\u201384 (2010)","journal-title":"Int. J. Nat. Comput. Res. (IJNCR)"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"To\u0161i\u0107, P.T.: On the complexity of enumerating possible dynamics of sparsely connected Boolean network automata with simple update rules. In: Discete Mathematics and Theoretical Computer Science (DMTCS), pp. 125\u2013144 (2010)","DOI":"10.46298\/dmtcs.2757"},{"issue":"2","key":"8_CR21","doi-asserted-by":"crossref","first-page":"217","DOI":"10.5506\/APhysPolBSupp.4.217","volume":"4","author":"PT To\u0161i\u0107","year":"2011","unstructured":"To\u0161i\u0107, P.T.: Modeling large-scale multi-agent systems with sequential and genuinely asynchronous cellular automata. Acta Phys. Pol. B (Proc. Suppl.) 4(2), 217\u2013236 (2011). Polish Academy of Sciences","journal-title":"Acta Phys. Pol. B (Proc. Suppl.)"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-319-47103-7_7","volume-title":"Brain Informatics and Health","author":"PT To\u0161i\u0107","year":"2016","unstructured":"To\u0161i\u0107, P.T.: On simple models of associative memory: network density is not required for provably complex behavior. In: Ascoli, G.A., Hawrylycz, M., Ali, H., Khazanchi, D., Shi, Y. (eds.) BIH 2016. LNCS, vol. 9919, pp. 61\u201371. Springer, Cham (2016). doi: 10.1007\/978-3-319-47103-7_7"},{"key":"8_CR23","unstructured":"To\u0161i\u0107, P.T.: On phase transitions in dynamics of cellular and graph automata models of sparsely interconnected multi-agent systems. In: ACM Proceedings Autonomous Agents & Multi-agent Systems (AAMAS 2017), Sao Paulo, Brazil, May 2017"},{"key":"8_CR24","unstructured":"To\u0161i\u0107, P.T., Agha, G.: Understanding and modeling agent autonomy in dynamic multi-agent, multi-task environments. In: Proceedings of First European Workshop on Multi-Agent Systems (EUMAS 2003), Oxford, England, UK (2003)"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-35236-2_10","volume-title":"Active Media Technology","author":"PT To\u0161i\u0107","year":"2012","unstructured":"To\u0161i\u0107, P.T., Ordonez, C.: Distributed protocols for multi-agent coalition formation: a negotiation perspective. In: Huang, R., Ghorbani, A.A., Pasi, G., Yamaguchi, T., Yen, N.Y., Jin, B. (eds.) AMT 2012. LNCS, vol. 7669, pp. 93\u2013102. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-35236-2_10"},{"issue":"3","key":"8_CR26","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/s10619-012-7116-0","volume":"31","author":"J Garcia","year":"2013","unstructured":"Garcia, J., Ordonez, C., To\u0161i\u0107, P.T.: Efficiently repairing and measuring replica consistency in distributed databases. Distr. Parallel Databases 31(3), 377\u2013411 (2013)","journal-title":"Distr. Parallel Databases"},{"key":"8_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/1-4020-3389-3_2","volume-title":"Multi-Robot Systems: From Swarms to Intelligent Automata","author":"L Vig","year":"2005","unstructured":"Vig, L., Adams, J.A.: Issues in multi-robot coalition formation. In: Parker, L.E., Schneider, F.E., Schultz, A.C. (eds.) Multi-Robot Systems: From Swarms to Intelligent Automata, vol. 3. Springer, Dordrecht (2005). doi: 10.1007\/1-4020-3389-3_2"},{"key":"8_CR28","unstructured":"Zhang, M.: Large-scale agent-based social simulation - a study on epidemic prediction and control. Ph.D. dissertation, TU Delft, The Netherlands (2016)"}],"container-title":["Lecture Notes in Computer Science","Industrial Applications of Holonic and Multi-Agent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-64635-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T18:52:22Z","timestamp":1750791142000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-64635-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319646343","9783319646350"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-64635-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}