Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues

DOI10.3233/FI-222135OpenAlexW4307166649MaRDI QIDQ5044398

Publication date: 31 October 2022

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

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

Mathematics Subject Classification ID

Computer science (68-XX)

Uses Software

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Fundamentals of parameterized complexity
Petri net synthesis
Partial (set) 2-structures. I: Basic notions and the representation problems
A decomposition theorem for finite persistent transition systems
A survey of Petri net methods for controlled discrete event systems
The synthesis problem for elementary net systems is NP-complete
Sufficient conditions for the marked graph realisability of labelled transition systems
Bounded choice-free Petri net synthesis: algorithmic issues
Distributing finite automata through Petri net synthesis
The synthesis problem of Petri nets
The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs
Synthesis of weighted marked graphs from constrained labelled transition systems: a geometric approach
Synthesis of Petri nets with restricted place-environments: classical and parameterized
Theory and applications of models of computation. 16th international conference, TAMC 2020, Changsha, China, October 18--20, 2020. Proceedings
Synthesis of structurally restricted \(b\)-bounded Petri nets: complexity results
Marked directed graphs
Synthesis of Live and Bounded Persistent Systems
Process Mining
Deriving Petri nets from finite transition systems
Free Choice Petri Nets
Reducibility among Combinatorial Problems
Polynomial algorithms for the synthesis of bounded nets
On the Reversibility of Well-Behaved Weighted Choice-Free Systems
Analysis and Synthesis of Weighted Marked Graph Petri Nets: Exact and Approximate Methods
Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets
Parameterized Algorithms
Hard tiling problems with simple tiles

This page was built for publication: Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues