Automata and concurrency

DOI10.1016/0304-3975(83)90113-5zbMATH Open0541.68035OpenAlexW2020588945MaRDI QIDQ794437FDOQ794437

Authors: Lutz Priese 

Publication date: 1983

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(83)90113-5

Recommendations

• scientific article
• From Petri nets to automata with concurrency
• On a fast decomposition method in some models of concurrent computations
• scientific article; zbMATH DE number 3922334
• Nets, sequential components and concurrency relations

zbMATH Keywords

simulationmodular decompositionconcurrencymodular Petri netsNets of asynchronous parallel automata

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Title not available (Why is that?)
• Towards a Theory of Universal Speed-Independent Modules
• Über Möglichkeiten zur Simulation Endlicher Automaten durch eine Art Sequentieller Netzwerke aus einfachen Bausteinen
• A Combinatorial Approach to Self-Correction
• Reversible Automaten und Einfache Universelle 2‐Dimensionale Thue‐Systeme
• Title not available (Why is that?)
• Some extended semaphore primitives
• On reduction of asynchronous systems
• A comparison of two synchronizing concepts
• Comments on: A comparison of two synchronizing concepts by P. B. Hansen
• Title not available (Why is that?)
• Towards a Precise Characterization of the Complexity of Universal and Nonuniversal Turing Machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• Arithmetische Prädikate über einem Bereich endlicher Automaten
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the aggregation of preferences
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Theory of Asynchronous Control Networks

Cited In (18)

• A theory of bipolar synchronization scheme
• A uniform approach to true-concurrency and interleaving semantics for Petri nets
• Universal Totalistic Asynchonous Cellular Automaton and Its Possible Implementation by DNA
• Second-order finite automata
• Title not available (Why is that?)
• Fluctuation-driven computing on number-conserving cellular automata
• Automata for true concurrency properties
• A defect localization scheme for cellular nanocomputers
• Construction universality in purely asynchronous cellular automata
• Computing by Swarm Networks
• A universal Brownian cellular automaton with 3 states and 2 rules
• Title not available (Why is that?)
• Title not available (Why is that?)
• A physically universal Turing machine
• Turing-completeness of asynchronous non-camouflage cellular automata
• Concurrency-degreees for \(P/T\)-nets
• Second-Order Finite Automata
• On a fast decomposition method in some models of concurrent computations

This page was built for publication: Automata and concurrency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794437)