In this paper we introduce a class of Petri nets, called catalytic Petri nets, and a suitable firing strategy where transitions are fired only when they use tokens from specific places, called catalytic places. By establishing a one-to-one relationship with catalytic membrane systems, we can prove that the class of catalytic Petri nets with at least two catalytic places is Turing complete.

Trovami (UniCASearch)


Titolo: Catalytic Petri Nets are Turing Complete
Autori: 
PINNA, GIOVANNI MICHELE
mostra contributor esterni 
Data di pubblicazione: 2012
Rivista: 
LECTURE NOTES IN COMPUTER SCIENCE  
Abstract: In this paper we introduce a class of Petri nets, called catalytic Petri nets, and a suitable firing strategy where transitions are fired only when they use tokens from specific places, called catalytic places. By establishing a one-to-one relationship with catalytic membrane systems, we can prove that the class of catalytic Petri nets with at least two catalytic places is Turing complete.
Handle: http://hdl.handle.net/11584/27912
ISBN: 978-3-642-28331-4
Tipologia:4.1 Contributo in Atti di convegno

File in questo prodotto:
Non ci sono file associati a questo prodotto.
Utilizza questo identificativo per citare o creare un link a questo documento:
http://hdl.handle.net/11584/27912
  • Citazioni
  • ND

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
 
 
 
Powered by IRIS-about IRIS-Utilizzo dei cookie
Logo CINECA  Copyright © 2020