Author(s): G.M. Pinna | A. Saba
Journal: Scientific Annals of Computer Science
ISSN 1843-8121
Volume: 18;
Start page: 99;
Date: 2008;
VIEW PDF
DOWNLOAD PDF 
Original page
ABSTRACT
Membrane systems have many similarities with classical concurrency models. In particular notions like parallelism, causality and concurrency seem to belong to membrane computing, though they are not yet regarded as central or cornerstone notions. Recently the interest in comparing membrane systems and other models for concurrency has grown. In this paper we propose a translation of membrane system into zero safe nets and then we show how to associate an event automaton to the 1-unfolding of these nets. Thus we propose an event based view of computations of a membrane system.
Journal: Scientific Annals of Computer Science
ISSN 1843-8121
Volume: 18;
Start page: 99;
Date: 2008;
VIEW PDF
DOWNLOAD PDF Original pageABSTRACT
Membrane systems have many similarities with classical concurrency models. In particular notions like parallelism, causality and concurrency seem to belong to membrane computing, though they are not yet regarded as central or cornerstone notions. Recently the interest in comparing membrane systems and other models for concurrency has grown. In this paper we propose a translation of membrane system into zero safe nets and then we show how to associate an event automaton to the 1-unfolding of these nets. Thus we propose an event based view of computations of a membrane system.