Computing the maximum bisimulation with spiking neural P systems

Authors:
Rodica Ceterchi;Alexandru I. Tomescu
Affiliations:
Faculty of Mathematics and Computer Science, University of Bucharest, Bucharest, Romania;Faculty of Mathematics and Computer Science, University of Bucharest, Bucharest, Romania and Dipartimento di Matematica e Informatica, Università di Udine, Udine, Italy
Venue:
Computation, cooperation, and life
Year:
2011

Three partition refinement algorithms

SIAM Journal on Computing
CCS expressions finite state processes, and three problems of equivalence

Information and Computation
Operational and algebraic semantics of concurrent processes

Handbook of theoretical computer science (vol. B)
Parallel Algorithms for Relational Coarsest Partition Problems

IEEE Transactions on Parallel and Distributed Systems
Model checking

Model checking
An efficient algorithm for computing bisimulation equivalence

Theoretical Computer Science
Spiking Neural P Systems

Fundamenta Informaticae
Implementing Sorting Networks with Spiking Neural P Systems

Fundamenta Informaticae
An incremental bisimulation algorithm

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Simulating the bitonic sort using P systems

WMC'07 Proceedings of the 8th international conference on Membrane computing
Solving numerical NP-complete problems with spiking neural P systems

WMC'07 Proceedings of the 8th international conference on Membrane computing

Hi-index	0.00

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.