Nets, sequential components and concurrency relations
From MaRDI portal
Publication:797994
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
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)
- Accelerating the computation of dead and concurrent places using reductions
- Title not available (Why is no real title available?)
- Transforming sequential systems into concurrent systems
- Automatic decomposition of Petri nets into automata networks -- a synthetic account
- Efficient algorithms for three reachability problems in safe Petri nets
- Automata and concurrency
- Title not available (Why is no real title available?)
- Nets, Terms and Formulas
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Coupling asynchrony and interrupts: Place Chart Nets
- CONCUR 2005 – Concurrency Theory
- 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)