Nets, sequential components and concurrency relations

DOI10.1016/0304-3975(84)90014-8zbMATH Open0546.68039OpenAlexW1995726142MaRDI QIDQ797994FDOQ797994

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

Recommendations

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

zbMATH Keywords

decompositiondensitiesconcurrencyPetri netsfinite state machinesmarking classsequential components

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Mathematical aspects of net theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (14)

• Accelerating the computation of dead and concurrent places using reductions
• Title not available (Why is that?)
• Transforming sequential systems into concurrent systems
• Efficient algorithms for three reachability problems in safe Petri nets
• Automata and concurrency
• Title not available (Why is that?)
• Nets, Terms and Formulas
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Coupling asynchrony and interrupts: Place Chart Nets
• CONCUR 2005 – Concurrency Theory
• Automatic Decomposition of Petri Nets into Automata Networks – A Synthetic Account
• On a fast decomposition method in some models of concurrent computations

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)