REWRITING LOGIC-BASED SEMANTICS OF P SYSTEMS AND THE MAXIMAL CONCURRENCY
2009 ◽
Vol 20
(03)
◽
pp. 395-410
Keyword(s):
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.
1998 ◽
Vol 15
◽
pp. 369-387
◽
2007 ◽
Vol 372
(2-3)
◽
pp. 125-135
◽
1970 ◽
Vol 28
◽
pp. 310-311
1990 ◽
2019 ◽
2019 ◽
Keyword(s):