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 > Formal Languages and Automata Theory

arXiv:2209.10323v1 (cs)
[Submitted on 21 Sep 2022]

Title:Avoid One's Doom: Finding Cliff-Edge Configurations in Petri Nets

Authors:Giann Karlo Aguirre-Samboní (INRIA and LMF, CNRS and ENS Paris-Saclay, Université Paris-Saclay), Stefan Haar (INRIA and LMF, CNRS and ENS Paris-Saclay, Université Paris-Saclay), Loïc Paulevé (Univ. Bordeaux, Bordeaux INP, CNRS, LaBRI, UMR5800), Stefan Schwoon (INRIA and LMF, CNRS and ENS Paris-Saclay, Université Paris-Saclay), Nick Würdemann (Department of Computing Science, University of Oldenburg)
View PDF
Abstract: A crucial question in analyzing a concurrent system is to determine its long-run behaviour, and in particular, whether there are irreversible choices in its evolution, leading into parts of the reachability space from which there is no return to other parts. Casting this problem in the unifying framework of safe Petri nets, our previous work has provided techniques for identifying attractors, i.e. terminal strongly connected components of the reachability space, whose attraction basins we wish to determine. Here, we provide a solution for the case of safe Petri nets. Our algorithm uses net unfoldings and provides a map of all of the system's configurations (concurrent executions) that act as cliff-edges, i.e. any maximal extension for those configurations lies in some basin that is considered fatal. The computation turns out to require only a relatively small prefix of the unfolding, just twice the depth of Esparza's complete prefix.
Comments: In Proceedings GandALF 2022, arXiv:2209.09333. This work was supported by the DIGICOSME grant ESCAPE DIGICOSME RD 242-ESCAPE-15203 and by the French Agence Nationale pour la Recherche (ANR) in the scope of the project ''BNeDiction'' (grant number ANR-20-CE45-0001)
Subjects: Formal Languages and Automata Theory (cs.FL); Data Structures and Algorithms (cs.DS)
Cite as: arXiv:2209.10323 [cs.FL]
  (or arXiv:2209.10323v1 [cs.FL] for this version)
  https://doi.org/10.48550/arXiv.2209.10323
Journal reference: EPTCS 370, 2022, pp. 178-193
Related DOI: https://doi.org/10.4204/EPTCS.370.12

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Wed, 21 Sep 2022 12:46:44 UTC (33 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
cs.FL
< prev   |   next >
new | recent | 2022-09
Change to browse by:
cs
cs.DS

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?)