Decompositional Petri Net Reductions
From MaRDI portal
Recommendations
Cites work
- An Incremental and Modular Technique for Checking LTL∖X Properties of Petri Nets
- Computer Aided Verification
- Decompositional Petri Net Reductions
- Free Choice Petri Nets
- scientific article; zbMATH DE number 1646978 (Why is no real title available?)
- scientific article; zbMATH DE number 1696466 (Why is no real title available?)
- scientific article; zbMATH DE number 3980500 (Why is no real title available?)
- scientific article; zbMATH DE number 1354143 (Why is no real title available?)
- scientific article; zbMATH DE number 1744959 (Why is no real title available?)
- scientific article; zbMATH DE number 1852166 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- Slicing Petri Nets with an Application to Workflow Verification
Cited in
(13)- On the combination of polyhedral abstraction and SMT-based model checking for Petri nets
- Factorisation of Petri net solvable transition systems
- Simplification of CTL formulae for efficient model checking of Petri nets
- Union decomposition of Petri net
- scientific article; zbMATH DE number 1696466 (Why is no real title available?)
- PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS
- Decompositional Petri Net Reductions
- An Incremental and Modular Technique for Checking LTL∖X Properties of Petri Nets
- scientific article; zbMATH DE number 1852166 (Why is no real title available?)
- Structural reductions revisited
- scientific article; zbMATH DE number 5587264 (Why is no real title available?)
- CONCUR 2004 - Concurrency Theory
- Slicing Petri Nets with an Application to Workflow Verification
This page was built for publication: Decompositional Petri Net Reductions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605479)