Faster Synchronization in P Systems

Dinneen, M.J.; Kim, Y.B.; Nicolescu, R.

dc.contributor.author	Dinneen, M.J.	en
dc.contributor.author	Kim, Y.B.	en
dc.contributor.author	Nicolescu, R.	en
dc.date.accessioned	2012-01-16T03:19:43Z	en
dc.date.available	2012-01-16T03:19:43Z	en
dc.date.issued	2010	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-395 (2010)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/10548	en
dc.description.abstract	In the eld of molecular computing, in particular P systems, synchronization is an important requirement for composing or sequentially linking together conge- nial P system activities. We provide a deterministic algorithm to the Firing Squad Synchronization Problem, for digraph-based P systems, which runs in 3e+11 steps, where e is the eccentricity of the initiator. Our algorithm uses a convenient frame- work, called simple P modules, which embraces the essential features of several popular types of P systems	en
dc.publisher	Department of Computer Science, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	CDMTCS Research Report Series	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial	en
dc.title	Faster Synchronization in P Systems	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research::280000 Information, Computing and Communication Sciences	en
dc.rights.holder	The author(s)	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en