Checking system boundedness using ordinary differential equations

DOI10.1016/j.ins.2011.10.018zbMath1277.68180MaRDI QIDQ454908

Qi-Wei Ge, Zuohua Ding, Hui Shen

Publication date: 10 October 2012

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2011.10.018

zbMATH Keywords

boundedness; ordinary differential equation; Petri net; coverability graph

Mathematics Subject Classification ID

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

Robustness of deadlock control for a class of Petri nets with unreliable resources

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Boundedness undecidability for synchronized nets
• Modeling and monitoring of E-commerce workflows
• Petri nets and regular languages
• On liveness and boundedness of asymmetric choice nets
• Incremental construction of coverability graphs
• Parallel program schemata
• Solving Ordinary Differential Equations I
• Static Analysis of Concurrent Programs Using Ordinary Differential Equations
• An Algorithm for the General Petri Net Reachability Problem
• Differential Petri nets: representing continuous systems in a discrete-event world
• Discrete, Continuous, and Hybrid Petri Nets
• Free Choice Petri Nets
• Analyzing Reachability for Some Petri Nets With Fast Growing Markings
• Parallel methods for integrating ordinary differential equations