Automata and concurrency

DOI10.1016/0304-3975(83)90113-5MaRDI QIDQ794437zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• scientific article; zbMATH DE number 3874627
• 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

Cites work

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

Cited in

(18)

• On a fast decomposition method in some models of concurrent computations
• Universal totalistic asynchonous cellular automaton and its possible implementation by DNA
• Computing by Swarm Networks
• Construction universality in purely asynchronous cellular automata
• A theory of bipolar synchronization scheme
• Second-order finite automata
• Turing-completeness of asynchronous non-camouflage cellular automata
• Automata for true concurrency properties
• A defect localization scheme for cellular nanocomputers
• A universal Brownian cellular automaton with 3 states and 2 rules
• scientific article; zbMATH DE number 1839448 (Why is no real title available?)
• scientific article; zbMATH DE number 3846886 (Why is no real title available?)
• A uniform approach to true-concurrency and interleaving semantics for Petri nets
• A physically universal Turing machine
• scientific article; zbMATH DE number 3990881 (Why is no real title available?)
• Concurrency-degreees for \(P/T\)-nets
• Fluctuation-driven computing on number-conserving cellular automata
• Second-Order Finite Automata

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)