When to move to transfer nets. On the limits of Petri nets as models for process calculi
From MaRDI portal
(Redirected from Publication:3460877)
Recommendations
Cites work
- A distributed operational semantics of CCS based on condition/event systems
- Asynchronous traces and open Petri nets
- Computability of Recursive Functions
- Expired data collection in shared dataspaces.
- scientific article; zbMATH DE number 1629939 (Why is no real title available?)
- scientific article; zbMATH DE number 1223710 (Why is no real title available?)
- scientific article; zbMATH DE number 559221 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- Monotonic extensions of Petri nets: forward and backward search revisited
- On the expressive power of recursion, replication and iteration in process calculi
- On the Expressive Power of Restriction and Priorities in CCS with Replication
- On the expressiveness of Linda coordination primitives.
- On the Relationship between π-Calculus and Finite Place/Transition Petri Nets
- Reachability problems in BioAmbients
- Solving the Linda multiple rd problem using the copy-collect primitive
This page was built for publication: When to move to transfer nets. On the limits of Petri nets as models for process calculi
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460877)