search

mirelon / membrane_computing

0 stars 0 forks source link

Check similar known result #56

Closed mirelon closed 10 years ago

mirelon commented 10 years ago

"the reviewer considers that this result and the proof method are very similar to the known result; the universality of Petri nets with inhibitor arcs (see, for example, “Petri Net Theory and the Modeling of Systems” by J.L. Peterson in 1981). This fact may spoil the novelty of this theorem."

mirelon commented 10 years ago

“A Complete Model for Representing the Coordination of Asynchronous Processes” by T. Agerwala, Hopkins Computer Research Report Number 32, 1974.

mirelon commented 10 years ago

The reviewer considers that sequential P systems with inhibitors are equivalent to Petri nets with inhibitor arcs, regarding accepting vectors of natural number. If possible, Theorem 2 should be obtained as a corollary of the universality of Petri nets with inhibitor arcs. Otherwise, at least, these references should be referred.

mirelon commented 10 years ago

In addition, as a stronger result, it is shown that a multiset rewriting system with inhibitors (called reaction automaton) in sequential manner accepts any recursively enumerable language (of strings) in “Reaction Automata Working in Sequential Manner” by F. Okubo, RAIRO Theoretical Informatics and Applications, DOI:10.1051/ita/2013047.

mirelon commented 10 years ago

Confirmed similar proof to accepting case in http://www.jklp.org/public/profession/books/pn/7.htm#7.3