{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T13:40:17Z","timestamp":1741268417248,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642199998"},{"type":"electronic","value":"9783642200007"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20000-7_12","type":"book-chapter","created":{"date-parts":[[2011,6,21]],"date-time":"2011-06-21T07:27:21Z","timestamp":1308641241000},"page":"151-157","source":"Crossref","is-referenced-by-count":0,"title":["Computing the Maximum Bisimulation with Spiking Neural P Systems"],"prefix":"10.1007","author":[{"given":"Rodica","family":"Ceterchi","sequence":"first","affiliation":[]},{"given":"Alexandru I.","family":"Tomescu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"van Benthem, J.: Model correspondence theory. PhD thesis, Universiteit van Amsterdam, Instituut voor Logica en Grondslagenonderzo ek van Exacte Wetenschappen (1976)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Milner, R.: Operational and Algebraic Semantics of Concurrent Processes. In: Handbook of Theoretical Computer Science, vol. B, Formal Models and Sematics (B), pp. 1201\u20131242 (1990)","DOI":"10.1016\/B978-0-444-88074-1.50024-X"},{"key":"12_CR3","series-title":"CSLI Lecture Notes","volume-title":"Non-Well-Founded Sets","author":"P. Aczel","year":"1988","unstructured":"Aczel, P.: Non-Well-Founded Sets. CSLI Lecture Notes, vol.\u00a014. CSLI, Stanford (1988)"},{"key":"12_CR4","volume-title":"Model Checking","author":"E. Clarke","year":"1999","unstructured":"Clarke, E., Grumberg, O., Peled, D.: Model Checking. The MIT Press, Cambridge (1999)"},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"P.C. Kanellakis","year":"1990","unstructured":"Kanellakis, P.C., Smolka, S.A.: CCS expressions, finite state processes, and three problems of equivalence. Information and Computation\u00a086(1), 43\u201368 (1990)","journal-title":"Information and Computation"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"Theory of Machines and Computations","author":"J.E. Hopcroft","year":"1971","unstructured":"Hopcroft, J.E.: An nlogn algorithm for minimizing states in a finite automaton. In: Kohavi, Z., Paz, A. (eds.) Theory of Machines and Computations, pp. 189\u2013196. Academic Press, New York (1971)"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-3975(85)90159-8","volume":"40","author":"R. Paige","year":"1985","unstructured":"Paige, R., Tarjan, R.E., Bonic, R.: A linear time solution to the single function coarsest partition problem. Theoretic. Comput. Sci.\u00a040, 67\u201384 (1985)","journal-title":"Theoretic. Comput. Sci."},{"issue":"6","key":"12_CR8","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput.\u00a016(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"issue":"1-3","key":"12_CR9","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0304-3975(03)00361-X","volume":"311","author":"A. Dovier","year":"2004","unstructured":"Dovier, A., Piazza, C., Policriti, A.: An efficient algorithm for computing bisimulation equivalence. Theor. Comput. Sci.\u00a0311(1-3), 221\u2013256 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"12_CR10","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1109\/71.707548","volume":"9","author":"S. Rajasekaran","year":"1998","unstructured":"Rajasekaran, S., Lee, I.: Parallel Algorithms for Relational Coarsest Partition Problems. IEEE Trans. Parallel Distrib. Syst.\u00a09(7), 687\u2013699 (1998)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-540-77050-3_17","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"D. Saha","year":"2007","unstructured":"Saha, D.: An Incremental Bisimulation Algorithm. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 204\u2013215. Springer, Heidelberg (2007)"},{"key":"12_CR12","unstructured":"The P Systems Webpage, http:\/\/ppage.psystems.eu\/"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-540-24619-0_8","volume-title":"Membrane Computing","author":"R. Ceterchi","year":"2004","unstructured":"Ceterchi, R., Sburlan, D.: Simulating boolean circuits with P systems. In: Mart\u00edn-Vide, C., Mauri, G., P\u0103un, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2003. LNCS, vol.\u00a02933, pp. 104\u2013122. Springer, Heidelberg (2004)"},{"issue":"3+","key":"12_CR14","first-page":"515","volume":"27","author":"M. Ionescu","year":"2008","unstructured":"Ionescu, M., Sburlan, D.: Some applications of spiking neural P\u00a0systems. Computing and Informatics\u00a027(3+), 515\u2013528 (2008)","journal-title":"Computing and Informatics"},{"issue":"1","key":"12_CR15","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1142\/S0129054106003711","volume":"17","author":"R. Ceterchi","year":"2006","unstructured":"Ceterchi, R., P\u00e9rez-Jim\u00e9nez, M.J.: On simulating a class of parallel architectures. Int. J. Found. Comput. Sci.\u00a017(1), 91\u2013110 (2006)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-540-77312-2_11","volume-title":"Membrane Computing","author":"R. Ceterchi","year":"2007","unstructured":"Ceterchi, R., P\u00e9rez-Jim\u00e9nez, M.J., Tomescu, A.I.: Simulating the bitonic sort using P systems. In: Eleftherakis, G., Kefalas, P., P\u0103un, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2007. LNCS, vol.\u00a04860, pp. 172\u2013192. Springer, Heidelberg (2007)"},{"issue":"1","key":"12_CR17","first-page":"35","volume":"87","author":"R. Ceterchi","year":"2008","unstructured":"Ceterchi, R., Tomescu, A.I.: Implementing Sorting Networks with Spiking Neural P Systems. Fundam. Inform.\u00a087(1), 35\u201348 (2008)","journal-title":"Fundam. Inform."},{"issue":"2-3","key":"12_CR18","doi-asserted-by":"crossref","first-page":"279","DOI":"10.3233\/FUN-2006-712-308","volume":"71","author":"M. Ionescu","year":"2006","unstructured":"Ionescu, M., P\u0103un, G., Yokomori, T.: Spiking Neural P Systems. Fundam. Inform.\u00a071(2-3), 279\u2013308 (2006)","journal-title":"Fundam. Inform."},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-540-77312-2_21","volume-title":"Membrane Computing","author":"A. Leporati","year":"2007","unstructured":"Leporati, A., Zandron, C., Ferretti, C., Mauri, G.: Solving numerical NP-complete problems with spiking neural P systems. In: Eleftherakis, G., Kefalas, P., P\u0103un, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2007. LNCS, vol.\u00a04860, pp. 336\u2013352. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Computation, Cooperation, and Life"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20000-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T12:30:24Z","timestamp":1741264224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20000-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642199998","9783642200007"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20000-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}