Automatic decomposition of Petri nets into automata networks -- a synthetic account

DOI10.1007/978-3-030-51831-8_1zbMATH Open1503.68190OpenAlexW3036249540MaRDI QIDQ5100747FDOQ5100747

Authors Pierre Bouvier, Hubert Garavel, Hernán Ponce de León

Publication date 1 September 2022

Published in Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-51831-8_1

Mathematics Subject Classification ID

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

Recommendations

• Decomposition of Petri nets
• scientific article; zbMATH DE number 3890742
• Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
• Composition/décomposition de réseaux de Pétri et de leurs graphes de couverture
• Distributing finite automata through Petri net synthesis

Cites work

• scientific article; zbMATH DE number 47952 (Why is no real title available?)
• scientific article; zbMATH DE number 1302042 (Why is no real title available?)
• scientific article; zbMATH DE number 1956602 (Why is no real title available?)
• A concurrency-preserving translation from time Petri nets to networks of timed automata
• Distributing finite automata through Petri net synthesis
• Distribution and synchronized automata
• Free Choice Petri Nets
• Gradient-based variable ordering of decision diagrams for systems with structural units
• Hierarchical conformance checking of process models based on event logs
• Nested-unit Petri nets
• Nets, sequential components and concurrency relations
• On Distributability of Petri Nets
• On communicating automata with bounded channels
• Petri net distributability
• State space reduction for process algebra specifications

Cited in

(6)

• scientific article; zbMATH DE number 3890742 (Why is no real title available?)
• Accelerating the computation of dead and concurrent places using reductions
• Decomposing monolithic processes in a process algebra with multi-actions
• Efficient algorithms for three reachability problems in safe Petri nets
• On the combination of polyhedral abstraction and SMT-based model checking for Petri nets
• Decomposing monolithic processes in a process algebra with multi-actions

Describes a project that uses

Uses Software

• NUPN_INFO
• CAESAR
• caesar.bdd

This page was built for publication: Automatic decomposition of Petri nets into automata networks -- a synthetic account

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5100747)