On the Qualitative Analysis of Conformon P Systems

Authors:
Parosh Aziz Abdulla;Giorgio Delzanno;Laurent Begin
Affiliations:
University of Uppsala,;Università di Genova, Italy;Université Libre de Bruxelles, Belgium
Venue:
Membrane Computing
Year:
2009

Citing 8
Cited 0

Petri nets: an introduction

Petri nets: an introduction
Computing with membranes

Journal of Computer and System Sciences
Nested petri nets - a formalism for specification and verification of multi-agent distributed systems

Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Well-structured transition systems everywhere!

Theoretical Computer Science
Some Decidability Results for Nested Petri Nets

PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
General decidability theorems for infinite-state systems

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
The conformon-P system: a molecular and cell biology-inspired computability model

Theoretical Computer Science
On model-checking of p systems

UC'05 Proceedings of the 4th international conference on Unconventional Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study computational properties of conformon P systems, an extension of P systems in which symbol objects are labeled by their current amount of energy. We focus here our attention to decision problems like reachability and coverability of a configuration and give positive and negative results for the full model and for some of its fragments. Furthermore, we investigate the relation between conformon P systems and other concurrency models like nested Petri nets and constrained multiset rewriting systems .