Some Basic Techniques allowing Petri Net Synthesis: Complexity and Algorithmic Issues release_n2ck6dlqqnavvlv3tjtrf4p7by

by Raymond Devillers, Ronny Tredup

Released as a article .

2021  

Abstract

In Petri net synthesis we ask whether a given transition system A can be implemented by a Petri net N. Depending on the level of accuracy, there are three ways how N can implement A: an embedding, the least accurate implementation, preserves only the diversity of states of A; a language simulation already preserves exactly the language of A; a realization, the most accurate implementation, realizes the behavior of A exactly. However, whatever the sought implementation, a corresponding net does not always exist. In this case, it was suggested to modify the input behavior – of course as little as possible. Since transition systems consist of states, events and edges, these components appear as a natural choice for modifications. In this paper we show that the task of converting an unimplementable transition system into an implementable one by removing as few states or events or edges as possible is NP-complete – regardless of what type of implementation we are aiming for; we also show that the corresponding parameterized problems are W[2]-hard, where the number of removed components is considered as the parameter; finally, we show there is no c-approximation algorithm for neither of these problems, for every constant c≥ 1.
In text/plain format

Archived Files and Locations

application/pdf  317.7 kB
file_2vq7smnnjjbsfnaewjv2bgtdaq
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2021-12-07
Version   v1
Language   en ?
arXiv  2112.03605v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 86d82c04-a1f3-4e4b-a514-2967b53f37ae
API URL: JSON