Petri Nets Representing the Evolution of Elementary Cellular Automata

dc.contributor.author	Barragán Vite, Irving
dc.date.accessioned	2017-07-03T20:55:29Z
dc.date.available	2017-07-03T20:55:29Z
dc.date.issued	2015
dc.identifier.citation	I. Barragán, J. C. S. Tuoh and J. Medina	es
dc.identifier.uri	https://repository.uaeh.edu.mx/bitstream/123456789/17938
dc.description.abstract	A Petri net (PN) is a directed graph which consists of two kinds of nodes called places and transitions. Besides their graphical representation, PN possess a mathematical formalism based on the incidence matrix and the state equation. In this paper we show that PN can be used as a general tool to represent the evolution of any elementary cellular automaton (ECA). This is performed by matrix operations obtained from the state equation of the PN which represent the cellular automaton and the use of a logical operator. It is presented an algorithm to construct a PN for any ECA and we give some comparative examples between the evolution of markings of the PN and the evolution of the respective ECA.	es
dc.language	es
dc.subject	Automatización y Optimización de Sistemas de Manufactura	es
dc.title	Petri Nets Representing the Evolution of Elementary Cellular Automata	es
dc.type	Article