Checking system boundedness using ordinary differential equations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3885321 (Why is no real title available?)
- scientific article; zbMATH DE number 1193339 (Why is no real title available?)
- scientific article; zbMATH DE number 46153 (Why is no real title available?)
- scientific article; zbMATH DE number 47171 (Why is no real title available?)
- scientific article; zbMATH DE number 3466042 (Why is no real title available?)
- scientific article; zbMATH DE number 3297399 (Why is no real title available?)
- An Algorithm for the General Petri Net Reachability Problem
- Analyzing Reachability for Some Petri Nets With Fast Growing Markings
- Boundedness undecidability for synchronized nets
- Differential Petri nets: representing continuous systems in a discrete-event world
- Discrete, Continuous, and Hybrid Petri Nets
- Free Choice Petri Nets
- Incremental construction of coverability graphs
- Modeling and monitoring of E-commerce workflows
- On liveness and boundedness of asymmetric choice nets
- Parallel methods for integrating ordinary differential equations
- Parallel program schemata
- Petri nets and regular languages
- Solving Ordinary Differential Equations I
- Static Analysis of Concurrent Programs Using Ordinary Differential Equations
Cited in
(2)
This page was built for publication: Checking system boundedness using ordinary differential equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q454908)