Nets, sequential components and concurrency relations

DOI10.1016/0304-3975(84)90014-8MaRDI QIDQ797994zbMATH OpenOpenAlexFDO

Authors Ryszard Janicki

Publication date 1984

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

Full work available at URL https://doi.org/10.1016/0304-3975(84)90014-8

zbMATH Keywords

concurrencydecompositiondensitiesfinite state machinesmarking classPetri netssequential components

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Transformations (93B17) System identification (93B30)

Review text

Two approaches to the notion of concurrency on the system level are discussed. One starts with a given decomposition of a net into sequential components. In the other one the concurrency relation is defined from a given marking class. It is shown that the postulate about a common element for every global system state and every sequential component under minor additional conditions imply the decomposability of the net into finite state machines.

Recommendations

• Publication:5753511
• scientific article; zbMATH DE number 4012518
• scientific article; zbMATH DE number 1512623
• Net models for concurrent object behaviour
• Sequential and concurrent behaviour in Petri net theory
• scientific article; zbMATH DE number 4128403
• CONCUR 2005 – Concurrency Theory
• scientific article; zbMATH DE number 3915634
• Sequentialization and procedural complexity in automata networks

Cites work

• scientific article; zbMATH DE number 3810936 (Why is no real title available?)
• scientific article; zbMATH DE number 3825184 (Why is no real title available?)
• scientific article; zbMATH DE number 3986627 (Why is no real title available?)
• scientific article; zbMATH DE number 3677208 (Why is no real title available?)
• scientific article; zbMATH DE number 3684903 (Why is no real title available?)
• scientific article; zbMATH DE number 3703980 (Why is no real title available?)
• scientific article; zbMATH DE number 3742637 (Why is no real title available?)
• scientific article; zbMATH DE number 3744562 (Why is no real title available?)
• scientific article; zbMATH DE number 3755835 (Why is no real title available?)
• scientific article; zbMATH DE number 3463159 (Why is no real title available?)
• scientific article; zbMATH DE number 3483531 (Why is no real title available?)
• scientific article; zbMATH DE number 3594628 (Why is no real title available?)
• scientific article; zbMATH DE number 3624773 (Why is no real title available?)
• scientific article; zbMATH DE number 795666 (Why is no real title available?)
• Mathematical aspects of net theory
• Net theory and applications. Proceedings of the Advanced Course on General Net Theory of Processes and Systems, Hamburg, October 8-19, 1979. Ed. by Wilfried Brauer

Cited in

(14)

• On a fast decomposition method in some models of concurrent computations
• Efficient algorithms for three reachability problems in safe Petri nets
• Transforming sequential systems into concurrent systems
• scientific article; zbMATH DE number 3990881 (Why is no real title available?)
• scientific article; zbMATH DE number 4035158 (Why is no real title available?)
• Nets, Terms and Formulas
• scientific article; zbMATH DE number 1263852 (Why is no real title available?)
• scientific article; zbMATH DE number 845927 (Why is no real title available?)
• Automatic decomposition of Petri nets into automata networks -- a synthetic account
• scientific article; zbMATH DE number 4189180 (Why is no real title available?)
• CONCUR 2005 – Concurrency Theory
• Coupling asynchrony and interrupts: Place Chart Nets
• Automata and concurrency
• Accelerating the computation of dead and concurrent places using reductions

This page was built for publication: Nets, sequential components and concurrency relations

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