Formal Methods in Software Engineering

Rewriting Logic-Based Semantics of P Systems and the Maximal Concurrency

Year2009
TypeJournal
StatusPublished
AuthorsDorel Lucanu

Links

Abstract

We use distributed labeled transition systems and their modal logics in order to compare the concurrency degrees of the P systems and their encoding as rewrite theories in rewriting logic. We show that the maximal concurrency given by the maximal parallel rewriting semantics of the P systems can be expressed in rewriting logic only by interleaving semantics. The maximal concurrency of the membrane interactions is only partially captured.

 

BibTeX

@article{DBLP:journals/ijfcs/Lucanu09, author = {Dorel Lucanu}, title = {Rewriting Logic-Based Semantics of P Systems and the Maximal Concurrency}, journal = {Int. J. Found. Comput. Sci.}, volume = {20}, number = {3}, year = {2009}, pages = {395-410}, ee = {http://dx.doi.org/10.1142/S0129054109006644}, bibsource = {DBLP, http://dblp.uni-trier.de}, url = {http://www.worldscinet.com/ijfcs/20/2003/S01290541092003.html[IJFCS]}, note = {ISI Impact Factor 0,512, ISI Influence Factor 0,313} }