Accelerating the computation of dead and concurrent places using reductions

DOI10.1007/978-3-030-84629-9_3zbMath1490.68137arXiv2106.12813OpenAlexW3176282500MaRDI QIDQ832013

Silvano Dal Zilio, Didier Le Botlan, Nicolas Amat

Publication date: 24 March 2022

Full work available at URL: https://arxiv.org/abs/2106.12813

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• PNML
• TINA
• NUPN_INFO
• CAESAR
• caesar.bdd

Cites Work

• Unnamed Item
• Unnamed Item
• Nets, sequential components and concurrency relations
• Stubborn versus structural reductions for Petri nets
• On the combination of polyhedral abstraction and SMT-based model checking for Petri nets
• Efficient algorithms for three reachability problems in safe Petri nets
• Nested-unit Petri nets
• Reduction
• The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
• Automatic Decomposition of Petri Nets into Automata Networks – A Synthetic Account
• Structural Reductions Revisited
• Algebraic Methodology and Software Technology
• Petri Net Reductions for Counting Markings

This page was built for publication: Accelerating the computation of dead and concurrent places using reductions