FIFO nets: A new model of parallel computation

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We introduce a new model of parallel computation, namely the FIFO nets. First, we introduce some basic definitions. A restriction of this model has the power of the Turing machine. Monogeneous Fifo nets are then introduced. The coverability tree is a procedure to decide whether a monogeneous net is bounded or not. At last, regularity is decidable for monogeneous nets.

Original languageEnglish
Title of host publicationTheoretical Computer Science - 6th Gl-Conference
EditorsArmin B. Cremers, Hans-Peter Kriegel
PublisherSpringer Verlag
Pages111-121
Number of pages11
ISBN (Print)9783540119739
DOIs
Publication statusPublished - 1 Jan 1982
Externally publishedYes
Event6th GI-Conference on Theoretical Computer Science, 1983 - Dortmund, Germany
Duration: 5 Jan 19837 Jan 1983

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume145 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th GI-Conference on Theoretical Computer Science, 1983
Country/TerritoryGermany
CityDortmund
Period5/01/837/01/83

Fingerprint

Dive into the research topics of 'FIFO nets: A new model of parallel computation'. Together they form a unique fingerprint.

Cite this