Attractors of network dynamics represent the long-term behaviours of the modelled system. Understanding the basin of an attractor, comprising all those states from which the evolution will eventually lead into that attractor, is therefore crucial for understanding the response and differentiation capabilities of a dynamical system. Building on our previous results[2] allowing to find attractors via Petri net Unfoldings, we exploit further the unfolding technique for a backward exploration of the state space, starting from a known attractor, and show how all strong or weak basins of attractions can be explicitly computed.
CITATION STYLE
Haar, S., Paulevé, L., & Schwoon, S. (2020). Drawing the Line: Basin Boundaries in Safe Petri Nets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12314 LNBI, pp. 321–336). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-60327-4_17
Mendeley helps you to discover research relevant for your work.