Metraipolis › archive › dc_a552a66f5ce2

A Practical Approach To Verifying Structural Invariants In Colored Petri Nets — arXiv:2609.34928

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.34928
License (as archived)
CC0-1.0
Archived
2026-10-08T00:43:55.606Z
SHA-256 of the archived text
799af2cc3b0db7364ce7f8b8d60b03aec750dae1e2c0c1882a5be499bcf9d2b7
Stable URL of this page
https://metraipolis.com/documento/dc_a552a66f5ce2

How to cite

A Practical Approach To Verifying Structural Invariants In Colored Petri Nets — arXiv:2609.34928 — arXiv (en), https://arxiv.org/abs/2609.34928 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a552a66f5ce2 (Metraipolis archive dc_a552a66f5ce2, sha256 799af2cc3b0db7364ce7f8b8d60b03aec750dae1e2c0c1882a5be499bcf9d2b7)
BibTeX
@misc{dca552a66f5ce2,
  title = {A Practical Approach To Verifying Structural Invariants In Colored Petri Nets — arXiv:2609.34928},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.34928},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a552a66f5ce2; sha256 799af2cc3b0db7364ce7f8b8d60b03aec750dae1e2c0c1882a5be499bcf9d2b7},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.34928. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Structural analysis is a core method in Petri Net (PN) research, offering a perspective complementary to state-space techniques while avoiding many of their limitations. It is well studied for classical PNs but far less for High-Level Petri Nets (HLPN). Symmetric Nets (SN), a common HLPN formalism, use compact annotations to encode behavioral symmetries, enabling the construction of a symbolic reachability graph (and a lumped Markov chain in stochastic SN) and the execution of symbolic discrete-event simulations. During the past two decades, structural techniques tailored to SN have been developed, notably supported by the SNexpression tool. This tool implements a formal calculus designed for the computation of symbolic structural relations, including, but not limited to, conflict relations and causal dependencies. Here, we focus on using this calculus to verify semi-automatically symbolic structural invariants, a task currently feasible only for certain restricted SN subclasses. We focus specifically on (semi)flows and briefly discuss an approach through which a flow generative family can be generated, at least theoretically. We further briefly outline a framework for the formal verification of a broader class of invariant properties. An extended formulation of the SN formalism is employed, which demonstrably satisfies the closure property with respect to fundamental functional operators. The core concepts are elucidated by means of representative examples throughout the exposition.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in cs.FL).
Categorie arXiv: Symbolic Computation (cs.SC) ; Formal Languages and Automata Theory (cs.FL).
Pagina del lavoro: https://arxiv.org/abs/2609.34928 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T00:18:14.664Z dalla pagina https://arxiv.org/catchup/cs.FL/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).