Abstract
We use spiking neural P systems to produce in linear time a partition of the nodes of a graph, which is coarser than the maximum bisimulation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
van Benthem, J.: Model correspondence theory. PhD thesis, Universiteit van Amsterdam, Instituut voor Logica en Grondslagenonderzo ek van Exacte Wetenschappen (1976)
Milner, R.: Operational and Algebraic Semantics of Concurrent Processes. In: Handbook of Theoretical Computer Science, vol. B, Formal Models and Sematics (B), pp. 1201–1242 (1990)
Aczel, P.: Non-Well-Founded Sets. CSLI Lecture Notes, vol. 14. CSLI, Stanford (1988)
Clarke, E., Grumberg, O., Peled, D.: Model Checking. The MIT Press, Cambridge (1999)
Kanellakis, P.C., Smolka, S.A.: CCS expressions, finite state processes, and three problems of equivalence. Information and Computation 86(1), 43–68 (1990)
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–196. Academic Press, New York (1971)
Paige, R., Tarjan, R.E., Bonic, R.: A linear time solution to the single function coarsest partition problem. Theoretic. Comput. Sci. 40, 67–84 (1985)
Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973–989 (1987)
Dovier, A., Piazza, C., Policriti, A.: An efficient algorithm for computing bisimulation equivalence. Theor. Comput. Sci. 311(1-3), 221–256 (2004)
Rajasekaran, S., Lee, I.: Parallel Algorithms for Relational Coarsest Partition Problems. IEEE Trans. Parallel Distrib. Syst. 9(7), 687–699 (1998)
Saha, D.: An Incremental Bisimulation Algorithm. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 204–215. Springer, Heidelberg (2007)
The P Systems Webpage, http://ppage.psystems.eu/
Ceterchi, R., Sburlan, D.: Simulating boolean circuits with P systems. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2003. LNCS, vol. 2933, pp. 104–122. Springer, Heidelberg (2004)
Ionescu, M., Sburlan, D.: Some applications of spiking neural P systems. Computing and Informatics 27(3+), 515–528 (2008)
Ceterchi, R., Pérez-Jiménez, M.J.: On simulating a class of parallel architectures. Int. J. Found. Comput. Sci. 17(1), 91–110 (2006)
Ceterchi, R., Pérez-Jiménez, M.J., Tomescu, A.I.: Simulating the bitonic sort using P systems. In: Eleftherakis, G., Kefalas, P., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2007. LNCS, vol. 4860, pp. 172–192. Springer, Heidelberg (2007)
Ceterchi, R., Tomescu, A.I.: Implementing Sorting Networks with Spiking Neural P Systems. Fundam. Inform. 87(1), 35–48 (2008)
Ionescu, M., Păun, G., Yokomori, T.: Spiking Neural P Systems. Fundam. Inform. 71(2-3), 279–308 (2006)
Leporati, A., Zandron, C., Ferretti, C., Mauri, G.: Solving numerical NP-complete problems with spiking neural P systems. In: Eleftherakis, G., Kefalas, P., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2007. LNCS, vol. 4860, pp. 336–352. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ceterchi, R., Tomescu, A.I. (2011). Computing the Maximum Bisimulation with Spiking Neural P Systems. In: Kelemen, J., Kelemenová, A. (eds) Computation, Cooperation, and Life. Lecture Notes in Computer Science, vol 6610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20000-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-20000-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19999-8
Online ISBN: 978-3-642-20000-7
eBook Packages: Computer ScienceComputer Science (R0)