Complexity analysis of continuous Petri nets
From MaRDI portal
Publication:5300871
DOI10.1007/978-3-642-38697-8_10zbMATH Open1381.68201OpenAlexW2248088805MaRDI QIDQ5300871FDOQ5300871
Authors: Estíbaliz Fraca, Serge Haddad 
Publication date: 28 June 2013
Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38697-8_10
Recommendations
Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (16)
- Complexity analysis of continuous Petri nets
- Continuous Petri Nets: Expressive Power and Decidability Issues
- Discrete parameters in Petri nets
- Hybrid and hybrid adaptive Petri nets: on the computation of a reachability graph
- Title not available (Why is that?)
- The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets
- Complexity results for problems of communication-free Petri nets and related formalisms
- On the Computational Power of Timed Differentiable Petri Nets
- Checking system boundedness using ordinary differential equations
- Asymptotic continuous Petri nets
- Logics for continuous reachability in Petri nets and vector addition systems with states
- The logical view on continuous Petri nets
- Continuous Petri nets: expressive power and decidability issues
- Steady-state performance evaluation of continuous mono-T-semiflow Petri nets
- Title not available (Why is that?)
- Membrane Computing
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)
