On minimal elements of upward-closed sets
From MaRDI portal
Recommendations
- Computing Minimal Elements of Upward-Closed Sets for Petri Nets
- scientific article; zbMATH DE number 7204383
- On the Efficient Computation of the Minimal Coverability Set for Petri Nets
- The residue of vector sets with applications to decidability problems in Petri nets
- On the efficient computation of the minimal coverability set of Petri nets
Cites work
- A multiparameter analysis of the boundedness problem for vector addition systems
- A theory of timed automata
- Bounds on Positive Integral Solutions of Linear Diophantine Equations
- scientific article; zbMATH DE number 1304329 (Why is no real title available?)
- Integer linear programming and the analysis of some Petri net problems
- Normal and sinkless Petri nets
- Normal Petri nets
- Parametric real-time reasoning
- The covering and boundedness problems for vector addition systems
- The residue of vector sets with applications to decidability problems in Petri nets
- Timing parameter characterization of real-time systems
Cited in
(8)- How many minimal upper bounds of minimal upper bounds
- Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks
- A new approach to upward-closed set backward reachability analysis
- Computing Minimal Elements of Upward-Closed Sets for Petri Nets
- scientific article; zbMATH DE number 1538050 (Why is no real title available?)
- On the length of strongly monotone descending chains over \(\mathbb{N}^d\)
- The semilinear home-space problem is Ackermann-complete for Petri nets
- On the home-space problem for Petri nets and its Ackermannian complexity
This page was built for publication: On minimal elements of upward-closed sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1019726)
