Automatic Decomposition of Petri Nets into Automata Networks – A Synthetic Account

DOI10.1007/978-3-030-51831-8_1zbMath1503.68190OpenAlexW3036249540MaRDI QIDQ5100747

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

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)

Related Items (4)

Accelerating the computation of dead and concurrent places using reductions ⋮ Decomposing monolithic processes in a process algebra with multi-actions ⋮ On the combination of polyhedral abstraction and SMT-based model checking for Petri nets ⋮ Efficient algorithms for three reachability problems in safe Petri nets

Uses Software

• NUPN_INFO
• CAESAR
• caesar.bdd

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A concurrency-preserving translation from time Petri nets to networks of timed automata
• Nets, sequential components and concurrency relations
• State space reduction for process algebra specifications
• Distribution and synchronized automata
• Distributing finite automata through Petri net synthesis
• Nested-unit Petri nets
• On Distributability of Petri Nets
• Petri Net Distributability
• 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

This page was built for publication: Automatic Decomposition of Petri Nets into Automata Networks – A Synthetic Account