Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues

DOI10.3233/FI-222136OpenAlexW4307165717MaRDI QIDQ5044399

Raymond Devillers, Ronny Tredup

Publication date: 31 October 2022

Published in: Fundamenta Informaticae (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (1)

On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets

Uses Software

• Petrify
• Genet
• Synet
• GitHub
• APT

Cites Work

• Unnamed Item
• Petri net synthesis
• Distributing finite automata through Petri net synthesis
• Relabelling LTS for Petri net synthesis via solving separation problems
• Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable
• Synthesis and reengineering of persistent systems
• Process Mining
• Structure in Approximation Classes
• The Label Splitting Problem
• Reducibility among Combinatorial Problems
• Polynomial algorithms for the synthesis of bounded nets
• Parameterized Algorithms

This page was built for publication: Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues