PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS
From MaRDI portal
Recommendations
- Decomposition of Petri nets
- Petri nets and semilinear sets (extended abstract)
- scientific article; zbMATH DE number 4213467
- Decomposition Theorems for Bounded Persistent Petri Nets
- Composition/décomposition de réseaux de Pétri et de leurs graphes de couverture
- Semi-commutations and Petri nets
- scientific article; zbMATH DE number 1973122
- scientific article; zbMATH DE number 1899812
- Semi-traces and processes of Petri nets
- Decompositional Petri Net Reductions
Cites work
- Decidable problems on the strong connectivity of Petri net reachability sets
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- Normal and sinkless Petri nets
- Normal Petri nets
- On structural conditions for weak persistency and semilinearity of Petri nets
- On the reachability problem for 5-dimensional vector addition systems
- On weak persistency of Petri nets
- Persistence of vector replacement systems is decidable
- Properties of Conflict-Free and Persistent Petri Nets
- Recent advances in formal languages and applications.
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- The covering and boundedness problems for vector addition systems
- The decidability of persistence for vector addition systems
Cited in
(7)- On structural conditions for weak persistency and semilinearity of Petri nets
- Factorisation of Petri net solvable transition systems
- Union decomposition of Petri net
- ON YEN'S PATH LOGIC FOR PETRI NETS
- Petri nets and semilinear sets (extended abstract)
- scientific article; zbMATH DE number 1232238 (Why is no real title available?)
- Completeness results for single-path Petri nets
This page was built for publication: PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3395130)
