par Abdulla, Parosh Aziz;Delzanno, Giorgio 
;Van Begin, Laurent
Référence Lecture notes in computer science, 5391 LNCS, page (78-94)
Publication Publié, 2009
;Van Begin, Laurent Référence Lecture notes in computer science, 5391 LNCS, page (78-94)
Publication Publié, 2009
Article révisé par les pairs
| Résumé : | 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. © 2009 Springer Berlin Heidelberg. |
