FIFO NETS: A NEW MODEL OF PARALLEL COMPUTATION.

A. Finkel; G. Memmi

FIFO NETS: A NEW MODEL OF PARALLEL COMPUTATION.

A. Finkel
, G. Memmi

Thales Group

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

Résumé

A new model of parallel computation, namely the FIFO nets is introduced. After giving some basic definitions, it is recalled that it is possible to simulate effectively Petri nets and coloured Petri nets. In addition, one abbreviation is given, increasing the descriptive power of the model of parallel computation. Then it is shown how a class of FIFO nets, the alphabetic FIFO nets, can simulate a program machine. By this way, it is proved that FIFO nets have the same algorithmic power as a Turing machine.

langue originale	Anglais
titre	Lecture Notes in Computer Science
Editeur	Springer Verlag
Pages	111-121
Nombre de pages	11
ISBN (imprimé)	3540119736
état	Publié - 1 déc. 1982
Modification externe	Oui

Série de publications

Nom	Lecture Notes in Computer Science
ISSN (imprimé)	0302-9743

Autres fichiers et liens

Lien vers la publication dans Scopus

Contient cette citation

@inproceedings{9c059be5100c491284789369ee4e9aef,

title = "FIFO NETS: A NEW MODEL OF PARALLEL COMPUTATION.",

abstract = "A new model of parallel computation, namely the FIFO nets is introduced. After giving some basic definitions, it is recalled that it is possible to simulate effectively Petri nets and coloured Petri nets. In addition, one abbreviation is given, increasing the descriptive power of the model of parallel computation. Then it is shown how a class of FIFO nets, the alphabetic FIFO nets, can simulate a program machine. By this way, it is proved that FIFO nets have the same algorithmic power as a Turing machine.",

author = "A. Finkel and G. Memmi",

year = "1982",

month = dec,

day = "1",

language = "English",

isbn = "3540119736",

series = "Lecture Notes in Computer Science",

publisher = "Springer Verlag",

pages = "111--121",

booktitle = "Lecture Notes in Computer Science",

}

TY - GEN

T1 - FIFO NETS

T2 - A NEW MODEL OF PARALLEL COMPUTATION.

AU - Finkel, A.

AU - Memmi, G.

PY - 1982/12/1

Y1 - 1982/12/1

N2 - A new model of parallel computation, namely the FIFO nets is introduced. After giving some basic definitions, it is recalled that it is possible to simulate effectively Petri nets and coloured Petri nets. In addition, one abbreviation is given, increasing the descriptive power of the model of parallel computation. Then it is shown how a class of FIFO nets, the alphabetic FIFO nets, can simulate a program machine. By this way, it is proved that FIFO nets have the same algorithmic power as a Turing machine.

AB - A new model of parallel computation, namely the FIFO nets is introduced. After giving some basic definitions, it is recalled that it is possible to simulate effectively Petri nets and coloured Petri nets. In addition, one abbreviation is given, increasing the descriptive power of the model of parallel computation. Then it is shown how a class of FIFO nets, the alphabetic FIFO nets, can simulate a program machine. By this way, it is proved that FIFO nets have the same algorithmic power as a Turing machine.

UR - https://www.scopus.com/pages/publications/0020227235

M3 - Conference contribution

AN - SCOPUS:0020227235

SN - 3540119736

T3 - Lecture Notes in Computer Science

SP - 111

EP - 121

BT - Lecture Notes in Computer Science

PB - Springer Verlag

ER -

FIFO NETS: A NEW MODEL OF PARALLEL COMPUTATION.

Résumé

Série de publications

Autres fichiers et liens

Empreinte digitale

Contient cette citation