P systems, petri nets, and program machines

  • Authors:
  • Pierluigi Frisco

  • Affiliations:
  • Department of Computer Science, School of Engineering, Computer Science and Mathematics, University of Exeter, Exeter, U.K

  • Venue:
  • WMC'05 Proceedings of the 6th international conference on Membrane Computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Some features capturing the computational completeness of P systems with maximal parallelism, priorities or zero-test using symbol objects are studied through Petri nets. The obtained results are not limited to P systems.