Complexity analysis of continuous Petri nets
From MaRDI portal
Publication:2805416
Recommendations
Cited in
(28)- Continuous Petri Nets: Expressive Power and Decidability Issues
- Discrete parameters in Petri nets
- Separators in Continuous Petri Nets
- Finding cut-offs in leaderless rendez-vous protocols is easy
- Directed reachability for infinite-state systems
- scientific article; zbMATH DE number 4024806 (Why is no real title available?)
- Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations
- Context-free commutative grammars with integer counters and resets
- Complexity results for problems of communication-free Petri nets and related formalisms
- Checking system boundedness using ordinary differential equations
- Individuals, populations and fluid approximations: a Petri net based perspective
- Separators in continuous Petri nets
- Asymptotic continuous Petri nets
- \(\omega\)-Petri nets: algorithms and complexity
- Logics for continuous reachability in Petri nets and vector addition systems with states
- Applications and Theory of Petri Nets 2005
- scientific article; zbMATH DE number 7407775 (Why is no real title available?)
- The logical view on continuous Petri nets
- Complexity analysis of continuous Petri nets
- Steady-state performance evaluation of continuous mono-T-semiflow Petri nets
- Continuous Petri nets: expressive power and decidability issues
- Decidability and complexity of action-based temporal planning over dense time
- scientific article; zbMATH DE number 1973130 (Why is no real title available?)
- Linear equations with ordered data
- Membrane Computing
- Fast termination and workflow nets
- Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
- Population protocols: beyond runtime analysis
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 Q2805416)
