Advanced Search
CS Search Google Search
Subscribers, please login

Published Articles >> Table of Contents >> Abstract

Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05)   pp. 399-406
On P Systems with Bounded Parallelism

Full Article Text: Download PDF of full textBuy this article

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SYNASC.2005.51
Send link to a friend

Abstract
A framework that describes the evolution of P systems with bounded parallelism is defined by introducing basic formal features that can be then integrated into a structural operational semantics. This approach investigates a generic strategy of selecting membranes and rules and applying the rules. P systems with boundary rules are used to illustrate the case and an example dealing with an evolution strategy involving bounded parallelism is discussed.
Additional Information

Citation:  Francesco Bernardini, Francisco J. Romero-Campero, Marian Gheorghe, Mario J. Pérez-Jiménez, Maurice Margenstern, Sergey Verlan, Natalio Krasnogor, "On P Systems with Bounded Parallelism," synasc, pp. 399-406,  Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05),  2005

Similar Articles

Abstract Contents
Abstract
Citation




Free access to

  • Abstracts
  • Selected PDFs

Electronic subscribers login to:

  • Access HTML/PDFs of full text articles

Subscription information

Get a Web account

PDFs require Adobe Acrobat Reader.

Peer Review Notice

Give us Feedback