Automata and concurrency
type: Item
instance of: scholarly article
title: Automata and concurrency
zbMATH Open document ID: 0541.68035
DOI: 10.1016/0304-3975(83)90113-5
author: Lutz Priese
published in: Theoretical Computer Science
publication date: 1983-01-01T00:00:00Z
review text: Nets of asynchronous parallel automata are defined. The author gives properties of these nets, e.g. compares them with Petri nets. He shows modular decomposition of Petri nets by nets over a given base.
reviewed by: Wlodzimierz Kwasowiec
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 3860402
zbMATH Keywords: modular Petri nets
zbMATH Keywords: simulation
zbMATH Keywords: concurrency
zbMATH Keywords: Nets of asynchronous parallel automata
zbMATH Keywords: modular decomposition
MaRDI profile type: Publication
full work available at URL: 0304-3975(83)90113-5
OpenAlex ID: W2020588945
cites work: Some extended semaphore primitives
cites work: A Theory of Asynchronous Control Networks
cites work: Comments on: ''A comparison of two synchronizing concepts'' by P. B. Hansen
cites work: Q5591919
cites work: A comparison of two synchronizing concepts
cites work: Q5535414
cites work: Q3902494
cites work: Towards a Theory of Universal Speed-Independent Modules
cites work: Q4137150
cites work: Q4132433
cites work: On reduction of asynchronous systems
cites work: Über Möglichkeiten zur Simulation Endlicher Automaten durch eine Art Sequentieller Netzwerke aus einfachen Bausteinen
cites work: Arithmetische Prädikate über einem Bereich endlicher Automaten
cites work: Q3928259
cites work: Reversible Automaten und Einfache Universelle 2‐Dimensionale Thue‐Systeme
cites work: Q4196294
cites work: Q3906427
cites work: Towards a Precise Characterization of the Complexity of Universal and Nonuniversal Turing Machines
cites work: A Combinatorial Approach to Self-Correction
cites work: On the aggregation of preferences
cites work: Q3206323
description: scientific article; zbMATH DE number 3860402