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

DOI10.3233/fi-222161arXiv2203.09233MaRDI QIDQ6070613

Raymond Devillers, Ronny Tredup

Publication date: 23 November 2023

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

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

zbMATH Keywords

complexitysynthesisPetri netBoolean typesedge-removalevent-removallabel-splittingstate-removal

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Petri net synthesis
• A survey of Petri net methods for controlled discrete event systems
• The synthesis problem for elementary net systems is NP-complete
• Distributing finite automata through Petri net synthesis
• Contextual nets
• Trace nets and process automata
• The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs
• Relabelling LTS for Petri net synthesis via solving separation problems
• The complexity of Boolean state separation
• The complexity of the label-splitting-problem for flip-flop-nets
• Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable
• Step semantics of Boolean nets
• Theory and applications of models of computation. 15th annual conference, TAMC 2019, Kitakyushu, Japan, April 13--16, 2019. Proceedings
• Process Mining
• Deriving Petri nets from finite transition systems
• Flip-flop nets
• The Label Splitting Problem
• Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues
• Polynomial algorithms for the synthesis of bounded nets

This page was built for publication: On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets