Target-oriented Petri net synthesis
type: Item
instance of: scholarly article
title: Target-oriented Petri Net Synthesis
zbMATH Open document ID: 1497.68327
DOI: 10.3233/FI-2020-1949
author: Eike Best
author: Raymond Devillers
author: Evgeny Erofeev
author: Harro Wimmel
published in: Fundamenta Informaticae
publication date: 2021-05-20T00:00:00Z
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 7350061
zbMATH Keywords: choice-freeness
zbMATH Keywords: persistence
zbMATH Keywords: Petri nets
zbMATH Keywords: synthesis
describes a project that uses: APT
describes a project that uses: GitHub
MaRDI profile type: MaRDI publication profile
cites work: Polynomial algorithms for the synthesis of bounded nets
cites work: Petri net synthesis
cites work: Partial (set) 2-structures. II: State spaces of concurrent systems
cites work: Applying regions
cites work: Q3219122
cites work: Logic Synthesis for Asynchronous Controllers and Interfaces
cites work: Lectures on Concurrency and Petri Nets
cites work: Distributing finite automata through Petri net synthesis
cites work: Petri Net Synthesis for Restricted Classes of Nets
cites work: A decomposition theorem for finite persistent transition systems
cites work: Synthesis of Persistent Systems
cites work: Synthesis and reengineering of persistent systems
cites work: Bounded choice-free Petri net synthesis: algorithmic issues
cites work: Presynthesis of bounded choice-free or fork-attribution nets
cites work: The synthesis problem for elementary net systems is NP-complete
cites work: A graph-theoretical characterisation of state separation
cites work: A geometric characterisation of event/state separation
cites work: Analysis of Petri nets and transition systems
cites work: Proof tree preserving interpolation
cites work: A new polynomial-time algorithm for linear programming
cites work: Over-approximative Petri net synthesis for restricted subclasses of nets
cites work: Q4947407
cites work: Properties of Conflict-Free and Persistent Petri Nets
cites work: Factorisation of Petri net solvable transition systems
cites work: Marked directed graphs
cites work: Synchronisationsgraphen
cites work: Characterisation of the state spaces of marked graph Petri nets
cites work: State space axioms for T-systems
cites work: Conditions for Petri net solvable binary words
cites work: Characterising Petri net solvable binary words
cites work: Generating all minimal Petri net unsolvable binary words
cites work: An efficient characterization of Petri net solvable binary words
cites work: Analysis and synthesis of weighted marked graph Petri nets
cites work: Analysis and synthesis of weighted marked graph Petri nets: exact and approximate methods
cites work: Free Choice Petri Nets
cites work: Simultaneous Petri Net Synthesis
cites work: The label splitting problem
cites work: A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
cites work: Relabelling LTS for Petri net synthesis via solving separation problems
cites work: Properties of Plain, Pure, and Safe Petri Nets
Recommended article: Simultaneous Petri Net Synthesis
Recommended article: Synthesis of bounded choice-free Petri nets
Recommended article: Petri Net Synthesis for Restricted Classes of Nets
Recommended article: Bounded choice-free Petri net synthesis: algorithmic issues
Recommended article: Petri net synthesis
description: scientific article; zbMATH DE number 7350061