Petri Net Reductions for Counting Markings
From MaRDI portal
Publication:5883572
DOI10.1007/978-3-319-94111-0_4OpenAlexW2808332118MaRDI QIDQ5883572FDOQ5883572
Authors: Bernard Berthomieu, Didier Le Botlan, Silvano Dal Zilio 
Publication date: 21 March 2023
Published in: Model Checking Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.02973
Recommendations
Cites Work
- Effective lattice point counting in rational convex polytopes
- Algebraic and geometric ideas in the theory of discrete optimization
- Title not available (Why is that?)
- Transactions on Petri Nets and Other Models of Concurrency XI
- Title not available (Why is that?)
- 0/1 vertex and facet enumeration with BDDs
- The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hierarchical Set Decision Diagrams and Regular Models
Cited In (8)
- Computing Petri net languages by reductions
- Accelerating the computation of dead and concurrent places using reductions
- Stubborn versus structural reductions for Petri nets
- On the combination of polyhedral abstraction and SMT-based model checking for Petri nets
- Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns
- On the complexity of proving polyhedral reductions
- Automated polyhedral abstraction proving
- Automated Technology for Verification and Analysis
Uses Software
This page was built for publication: Petri Net Reductions for Counting Markings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5883572)
