2 Citations (Scopus)

Abstract

Petri nets and neural networks share a number of analogies. Investigations of their relationships can be sorted into two categories: (a) the modeling of neural activities with Petri nets, and (b) the neural simulation of Petri nets. The work presented in this paper belongs to the second category. Unlike divide-and-conquer approaches, the proposed method settles the extraneous skeleton of simulators. Inherent distinctions of Petri nets are characterized by the individual constituents of simulators. The constructed simulators thus reveal a consistently uniform structure on a macroscopic level. Compared with those generated by the divide-and-conquer approaches, ours look much portable and are empirically economic. Furthermore, in a fully parallel machine with enough nodes the overall time complexity of the neural simulator will be constant.

Original languageEnglish
Pages (from-to)183-207
Number of pages25
JournalParallel Computing
Volume25
Issue number2
DOIs
Publication statusPublished - 1999 Jan 1

Fingerprint

Petri nets
Petri Nets
Simulator
Simulators
Divide and conquer
Simulation
Parallel Machines
Skeleton
Time Complexity
Analogy
Economics
Neural Networks
Neural networks
Vertex of a graph
Modeling

Keywords

  • Aggregator
  • Associator
  • Competer
  • Equivalence proof
  • Formatter
  • Latcher
  • Neural simulators
  • Petri nets

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computer Graphics and Computer-Aided Design
  • Artificial Intelligence

Cite this

Neural simulation of Petri nets. / Chen, S. W.; Fang, C. Y.; Chang, K. E.

In: Parallel Computing, Vol. 25, No. 2, 01.01.1999, p. 183-207.

Research output: Contribution to journalArticle

@article{bcf24488926d44a2adda575cfb468032,
title = "Neural simulation of Petri nets",
abstract = "Petri nets and neural networks share a number of analogies. Investigations of their relationships can be sorted into two categories: (a) the modeling of neural activities with Petri nets, and (b) the neural simulation of Petri nets. The work presented in this paper belongs to the second category. Unlike divide-and-conquer approaches, the proposed method settles the extraneous skeleton of simulators. Inherent distinctions of Petri nets are characterized by the individual constituents of simulators. The constructed simulators thus reveal a consistently uniform structure on a macroscopic level. Compared with those generated by the divide-and-conquer approaches, ours look much portable and are empirically economic. Furthermore, in a fully parallel machine with enough nodes the overall time complexity of the neural simulator will be constant.",
keywords = "Aggregator, Associator, Competer, Equivalence proof, Formatter, Latcher, Neural simulators, Petri nets",
author = "Chen, {S. W.} and Fang, {C. Y.} and Chang, {K. E.}",
year = "1999",
month = "1",
day = "1",
doi = "10.1016/S0167-8191(98)00107-0",
language = "English",
volume = "25",
pages = "183--207",
journal = "Parallel Computing",
issn = "0167-8191",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - Neural simulation of Petri nets

AU - Chen, S. W.

AU - Fang, C. Y.

AU - Chang, K. E.

PY - 1999/1/1

Y1 - 1999/1/1

N2 - Petri nets and neural networks share a number of analogies. Investigations of their relationships can be sorted into two categories: (a) the modeling of neural activities with Petri nets, and (b) the neural simulation of Petri nets. The work presented in this paper belongs to the second category. Unlike divide-and-conquer approaches, the proposed method settles the extraneous skeleton of simulators. Inherent distinctions of Petri nets are characterized by the individual constituents of simulators. The constructed simulators thus reveal a consistently uniform structure on a macroscopic level. Compared with those generated by the divide-and-conquer approaches, ours look much portable and are empirically economic. Furthermore, in a fully parallel machine with enough nodes the overall time complexity of the neural simulator will be constant.

AB - Petri nets and neural networks share a number of analogies. Investigations of their relationships can be sorted into two categories: (a) the modeling of neural activities with Petri nets, and (b) the neural simulation of Petri nets. The work presented in this paper belongs to the second category. Unlike divide-and-conquer approaches, the proposed method settles the extraneous skeleton of simulators. Inherent distinctions of Petri nets are characterized by the individual constituents of simulators. The constructed simulators thus reveal a consistently uniform structure on a macroscopic level. Compared with those generated by the divide-and-conquer approaches, ours look much portable and are empirically economic. Furthermore, in a fully parallel machine with enough nodes the overall time complexity of the neural simulator will be constant.

KW - Aggregator

KW - Associator

KW - Competer

KW - Equivalence proof

KW - Formatter

KW - Latcher

KW - Neural simulators

KW - Petri nets

UR - http://www.scopus.com/inward/record.url?scp=0033075436&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033075436&partnerID=8YFLogxK

U2 - 10.1016/S0167-8191(98)00107-0

DO - 10.1016/S0167-8191(98)00107-0

M3 - Article

AN - SCOPUS:0033075436

VL - 25

SP - 183

EP - 207

JO - Parallel Computing

JF - Parallel Computing

SN - 0167-8191

IS - 2

ER -