A Short Note on Reversibility in P

Alhazov Artiom; Morita Kenichi

Articolul precedent

Articolul urmator

299

SM ISO690:2012

ALHAZOV, Artiom, MORITA, Kenichi. A Short Note on Reversibility in P. In: Brainstorming Week on Membrane Computing, 2-6 februarie 2009, Sevilla. Sevilla, Spania: Fénix Editora, 2009, Ediția a 7-a, pp. 23-28.

EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core

Brainstorming Week on Membrane Computing
Ediția a 7-a, 2009

Masa rotundă "Seventh Brainstorming Week on Membrane Computing"
Sevilla, Spania, 2-6 februarie 2009

A Short Note on Reversibility in P

Pag. 23-28

Alhazov Artiom, Morita Kenichi

Hiroshima University

Disponibil în IBN: 16 mai 2021

Descarcă PDF

Rezumat

Membrane computing is a formal framework of distributed parallel computing. In this paper we study the reversibility and maximal parallelism of P systems from the computability point of view. The notions of reversible and strongly reversible systems are considered. The universality is shown for one class and a negative conjecture is stated for a more restricted class of reversible P systems. For one class of strongly reversible P systems, a very strong limitation is found, and it is shown that this limitation does not hold for a less restricted class.

Cerif XML Export

<?xml version='1.0' encoding='utf-8'?>
<CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'>
<cfResPubl>
<cfResPublId>ibn-ResPubl-129961</cfResPublId>
<cfResPublDate>2009</cfResPublDate>
<cfVol>Ediția a 7-a</cfVol>
<cfStartPage>23</cfStartPage>
<cfISBN></cfISBN>
<cfURI>https://ibn.idsi.md/ro/vizualizare_articol/129961</cfURI>
<cfTitle cfLangCode='EN' cfTrans='o'>A Short Note on Reversibility in P</cfTitle>
<cfAbstr cfLangCode='EN' cfTrans='o'><p>Membrane computing is a formal framework of distributed parallel computing. In this paper we study the reversibility and maximal parallelism of P systems from the computability point of view. The notions of reversible and strongly reversible systems are considered. The universality is shown for one class and a negative conjecture is stated for a more restricted class of reversible P systems. For one class of strongly reversible P systems, a very strong limitation is found, and it is shown that this limitation does not hold for a less restricted class.</p></cfAbstr>
<cfResPubl_Class>
<cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId>
<cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId>
<cfStartDate>2009T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfResPubl_Class>
<cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId>
<cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId>
<cfStartDate>2009T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfPers_ResPubl>
<cfPersId>ibn-person-13033</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2009T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-88916</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2009T24:00:00</cfStartDate>
</cfPers_ResPubl>
</cfResPubl>
<cfPers>
<cfPersId>ibn-Pers-13033</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-13033-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2009T24:00:00</cfStartDate>
<cfFamilyNames>Alhazov</cfFamilyNames>
<cfFirstNames>Artiom</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-88916</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-88916-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2009T24:00:00</cfStartDate>
<cfFamilyNames>Morita</cfFamilyNames>
<cfFirstNames>Kenichi</cfFirstNames>
</cfPersName_Pers>
</cfPers>
</CERIF>