P Systems, Petri Nets, and Program Machines

15 years 8 months ago

Download www.macs.hw.ac.uk

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.

Pierluigi Frisco

Real-time Traffic

Computational Completeness | Maximal Parallelism | MEMBRANE 2005 | Symbol Objects |

claim paper

» Modular petri net based modeling analysis and synthesis of dedicated production systems

» Using UML state machines and petri nets for the quantitative investigation of ETCS

» A structural approach to quasistatic schedulability analysis of communicating concurrent p...

» Continuous Petri Nets Expressive Power and Decidability Issues

» Using petri nets to specify and execute missions for autonomous underwater vehicles

» Working with the Past Integrating History in Petri Nets

» A Class of Composable and Preemptible Highlevel Petri Nets with an Application to MultiTas...

» The DownwardClosure of Petri Net Languages

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	MEMBRANE
Authors	Pierluigi Frisco

Comments (0)

Sciweavers

P Systems, Petri Nets, and Program Machines

Computational Completeness | Maximal Parallelism | MEMBRANE 2005 | Symbol Objects |

Explore & Download

Productivity Tools

Sciweavers