Structural liveness of conservative Petri nets
From MaRDI portal
Cites work
- A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application
- Bounds on the automata size for Presburger arithmetic
- Computation in networks of passively mobile finite-state sensors
- Existence of home states in Petri nets is decidable
- Free Choice Petri Nets
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3582425 (Why is no real title available?)
- scientific article; zbMATH DE number 7650344 (Why is no real title available?)
- Minimal solutions of linear diophantine systems : bounds and algorithms
- On deadlockability, liveness and reversibility in subclasses of weighted Petri nets
- On the home-space problem for Petri nets and its Ackermannian complexity
- Parameterized Analysis of Immediate Observation Petri Nets
- Petri Net Primer
- Reachability in vector addition systems is Ackermann-complete
- Reachability in vector addition systems is primitive-recursive in fixed dimension
- Some complexity results for polynomial ideals
- Structural Liveness of Immediate Observation Petri Nets
- Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable
- The complexity of the word problems for commutative semigroups and polynomial ideals
- The computational power of population protocols
- The covering and boundedness problems for vector addition systems
- The reachability problem for Petri nets is not primitive recursive
- The semilinear home-space problem is Ackermann-complete for Petri nets
- Understanding Petri Nets
This page was built for publication: Structural liveness of conservative Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6889879)
