Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Logic in Computer Science

arXiv:2310.01000v1 (cs)
[Submitted on 2 Oct 2023]

Title:(Un)Decidability Bounds of the Synthesis Problem for Petri Games

Authors:Paul Hannibal
View PDF
Abstract:Petri games are a multi-player game model for the automatic synthesis of distributed systems, where the players are represented as tokens on a Petri net and are grouped into environment players and system players. As long as the players move in independent parts of the net, they do not know of each other; when they synchronize at a joint transition, each player gets informed of the entire causal history of the other players.
We show that the synthesis problem for two-player Petri games under a global safety condition is NP-complete and it can be solved within a non-deterministic exponential upper bound in the case of up to 4 players. Furthermore, we show the undecidability of the synthesis problem for Petri games with at least 6 players under a local safety condition.
Comments: In Proceedings GandALF 2023, arXiv:2309.17318
Subjects: Logic in Computer Science (cs.LO)
Cite as: arXiv:2310.01000 [cs.LO]
  (or arXiv:2310.01000v1 [cs.LO] for this version)
  https://doi.org/10.48550/arXiv.2310.01000
Journal reference: EPTCS 390, 2023, pp. 115-131
Related DOI: https://doi.org/10.4204/EPTCS.390.8

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Mon, 2 Oct 2023 08:59:41 UTC (65 KB)
Full-text links:

Access Paper:

license icon view license
Current browse context:
cs.LO
< prev   |   next >
new | recent | 2023-10
Change to browse by:
cs

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)