Petri Net Reductions for Counting Markings

DOI10.1007/978-3-319-94111-0_4MaRDI QIDQ5883572zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Computing Petri net languages by reductions
• Generalized Petri Net Reduction Method
• Stubborn versus structural reductions for Petri nets
• Efficient reachability graph representation of Petri nets with unbounded counters
• scientific article; zbMATH DE number 1696467

Cites work

• scientific article; zbMATH DE number 3980500 (Why is no real title available?)
• scientific article; zbMATH DE number 4033100 (Why is no real title available?)
• scientific article; zbMATH DE number 3722109 (Why is no real title available?)
• scientific article; zbMATH DE number 1302046 (Why is no real title available?)
• scientific article; zbMATH DE number 1956602 (Why is no real title available?)
• scientific article; zbMATH DE number 1852166 (Why is no real title available?)
• 0/1 vertex and facet enumeration with BDDs
• Algebraic and geometric ideas in the theory of discrete optimization
• Effective lattice point counting in rational convex polytopes
• Hierarchical Set Decision Diagrams and Regular Models
• The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
• Transactions on Petri Nets and Other Models of Concurrency XI

Cited in

(8)

• Accelerating the computation of dead and concurrent places using reductions
• Computing Petri net languages by 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

Describes a project that uses

Uses Software

• LattE
• TINA

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)