Target-oriented Petri Net Synthesis

DOI10.3233/FI-2020-1949zbMath1497.68327MaRDI QIDQ4988954

Evgeny Erofeev, Raymond Devillers, Harro Wimmel, Eike Best

Publication date: 20 May 2021

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

zbMATH Keywords

synthesispersistencePetri netschoice-freeness

Mathematics Subject Classification ID

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

Related Items (3)

Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues ⋮ A New Property of Choice-Free Petri Net Systems ⋮ Synthesis of (choice-free) reset nets

Uses Software

• GitHub
• APT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterisation of the state spaces of marked graph Petri nets
• Applying regions
• A new polynomial-time algorithm for linear programming
• Petri net synthesis
• Partial (set) 2-structures. II: State spaces of concurrent systems
• A decomposition theorem for finite persistent transition systems
• The synthesis problem for elementary net systems is NP-complete
• Over-approximative Petri net synthesis for restricted subclasses of nets
• Bounded choice-free Petri net synthesis: algorithmic issues
• Distributing finite automata through Petri net synthesis
• Relabelling LTS for Petri net synthesis via solving separation problems
• Synthesis and reengineering of persistent systems
• Analysis and synthesis of weighted marked graph Petri nets
• Factorisation of Petri net solvable transition systems
• A geometric characterisation of event/state separation
• An efficient characterization of Petri net solvable binary words
• Generating all minimal Petri net unsolvable binary words
• Presynthesis of bounded choice-free or fork-attribution nets
• State space axioms for T-systems
• Marked directed graphs
• Synchronisationsgraphen
• Characterising Petri Net Solvable Binary Words
• Petri Net Synthesis for Restricted Classes of Nets
• A Graph-Theoretical Characterisation of State Separation
• A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
• Properties of Conflict-Free and Persistent Petri Nets
• Simultaneous Petri Net Synthesis
• Logic Synthesis for Asynchronous Controllers and Interfaces
• Free Choice Petri Nets
• The Label Splitting Problem
• Properties of Plain, Pure, and Safe Petri Nets
• Polynomial algorithms for the synthesis of bounded nets
• Synthesis of Persistent Systems
• Analysis and Synthesis of Weighted Marked Graph Petri Nets: Exact and Approximate Methods
• Conditions for Petri Net Solvable Binary Words
• Proof Tree Preserving Interpolation
• Lectures on Concurrency and Petri Nets

This page was built for publication: Target-oriented Petri Net Synthesis