Petri Nets Representing the Evolution of Elementary Cellular Automata

dc.contributor.authorBarragán Vite, Irving
dc.date.accessioned2017-07-03T20:55:29Z
dc.date.available2017-07-03T20:55:29Z
dc.date.issued2015
dc.description.abstractA 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.identifier.citationI. Barragán, J. C. S. Tuoh and J. Medinaes
dc.identifier.urihttps://repository.uaeh.edu.mx/bitstream/123456789/17938
dc.languagees
dc.subjectAutomatización y Optimización de Sistemas de Manufacturaes
dc.titlePetri Nets Representing the Evolution of Elementary Cellular Automataes
dc.typeArticle

Archivos

Bloque original

Mostrando 1 - 1 de 1
Cargando...
Miniatura
Nombre:
petri_nets_representing_the_evolution_of_elementary_cellular_automata.pdf
Tamaño:
868.04 KB
Formato:
Adobe Portable Document Format