The STUDIA UNIVERSITATIS BABEŞ-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

At the first view there are no similarities between P systems and Petri nets, but this paper describes a connection between them. Petri nets can describe a very large domain of systems. P systems represent a computational model that describe the interaction between chemical processes and their membranes. The dP automata are a class of membrane systems that tries to combine a number of P systems and makes them to communicate. The behavior of such an automaton is made in an nondeterministically maximally parallel way. The objects are moving inside each P system and also between the P systems from the automaton.This paper will use on the modeling process a place transitions network (PTN). Graphical symbols from PTN will be used to describe the behavior of a dP automaton(dPA). The properties from the PTN will be define for the dP automata providing that an automaton is having the same expressing power as a Petri net.

Key words and phrases. dP automata, Petri nets, P systems.