Complexity analysis of continuous Petri nets
From MaRDI portal
Publication:5300871
Recommendations
Cited in
(17)- Logics for continuous reachability in Petri nets and vector addition systems with states
- Separators in continuous Petri nets
- Discrete parameters in Petri nets
- Complexity analysis of continuous Petri nets
- Continuous Petri nets: expressive power and decidability issues
- Steady-state performance evaluation of continuous mono-T-semiflow Petri nets
- Hybrid and hybrid adaptive Petri nets: on the computation of a reachability graph
- scientific article; zbMATH DE number 4024806 (Why is no real title available?)
- Continuous Petri Nets: Expressive Power and Decidability Issues
- The logical view on continuous Petri nets
- The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets
- Asymptotic continuous Petri nets
- Complexity results for problems of communication-free Petri nets and related formalisms
- scientific article; zbMATH DE number 1973130 (Why is no real title available?)
- Membrane Computing
- Checking system boundedness using ordinary differential equations
- On the Computational Power of Timed Differentiable Petri Nets
This page was built for publication: Complexity analysis of continuous Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300871)