On the Approximation of the Resource Equivalences in Petri Nets with the Invisible Transitions
From MaRDI portal
Publication:5060067
Recommendations
- Resource equivalences in Petri nets
- scientific article; zbMATH DE number 1555184
- On minimality and equivalence of Petri nets
- On complexity of reachability of transition restricted Petri nets
- A Reachability Algorithm for General Petri Nets Based on Transition Invariants
- scientific article; zbMATH DE number 1432334
- Approximating Petri net reachability along context-free traces
- Approximate transient analysis for subclasses of deterministic and stochastic Petri nets
- Nonprimitive recursive complexity and undecidability for Petri net equivalences
- A notion of equivalence for stochastic Petri nets
Cites work
- scientific article; zbMATH DE number 1696467 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 2064225 (Why is no real title available?)
- scientific article; zbMATH DE number 1414283 (Why is no real title available?)
- A calculus of communicating systems
- Resource equivalences in Petri nets
This page was built for publication: On the Approximation of the Resource Equivalences in Petri Nets with the Invisible Transitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060067)