Efficient algorithms for three reachability problems in safe Petri nets

DOI10.1007/978-3-030-76983-3_17zbMath1489.68153OpenAlexW3170262536MaRDI QIDQ2117182

Hubert Garavel, Pierre Bouvier

Publication date: 21 March 2022

Full work available at URL: https://hal.inria.fr/hal-03286069/file/Bouvier-Garavel-21-a.pdf

Mathematics Subject Classification ID

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

Related Items (1)

Accelerating the computation of dead and concurrent places using reductions

Uses Software

• NUPN_INFO
• CAESAR
• caesar.bdd

Cites Work

• Complexity results for 1-safe nets
• Nets, sequential components and concurrency relations
• State space reduction for process algebra specifications
• Nested-unit Petri nets
• Free Choice Petri Nets
• Automatic Decomposition of Petri Nets into Automata Networks – A Synthetic Account

This page was built for publication: Efficient algorithms for three reachability problems in safe Petri nets