Metraipolis › archive › dc_c0980e43e84d

Semi-automated Verification of Symbolic Invariants In Extended Symmetric Nets — arXiv:2609.34891

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.34891
License (as archived)
CC0-1.0
Archived
2026-10-07T23:02:18.313Z
SHA-256 of the archived text
89fad2f780276595dd5724b40a5a40c3e8bac7b7873f72b7616a506c963f63d7
Stable URL of this page
https://metraipolis.com/documento/dc_c0980e43e84d

How to cite

Semi-automated Verification of Symbolic Invariants In Extended Symmetric Nets — arXiv:2609.34891 — arXiv (en), https://arxiv.org/abs/2609.34891 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c0980e43e84d (Metraipolis archive dc_c0980e43e84d, sha256 89fad2f780276595dd5724b40a5a40c3e8bac7b7873f72b7616a506c963f63d7)
BibTeX
@misc{dcc0980e43e84d,
  title = {Semi-automated Verification of Symbolic Invariants In Extended Symmetric Nets — arXiv:2609.34891},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.34891},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c0980e43e84d; sha256 89fad2f780276595dd5724b40a5a40c3e8bac7b7873f72b7616a506c963f63d7},
  year = {2026}
}

Archived text

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

Structural analysis is central to Petri Net (PN) research, complementing state-space methods while avoiding their combinatorial issues. It is well studied for classical PNs but much less for High-Level Petri Nets (HLPN). Symmetric Nets (SN), a common HLPN formalism, use compact annotations to encode behavioral symmetries, allowing symbolic reachability graphs and associated lumped Markov chains for stochastic SN. In the past two decades, specific structural techniques for SN have emerged, notably the SNexpression tool, which implements a calculus for symbolic structural relations such as conflict and causality. We propose using this calculus to semi-automatically verify symbolic structural invariants, currently possible only for restricted SN subclasses, for an extended SN formalism (ESN) closed under key functional operators. We focus on flows and outline, at least in theory, how to construct a flow-generating family. We also sketch a framework for formally verifying a wider range of invariant properties. Representative examples illustrate the main concepts.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-29 in cs.SE).
Categorie arXiv: Symbolic Computation (cs.SC) ; Software Engineering (cs.SE).
Pagina del lavoro: https://arxiv.org/abs/2609.34891 — 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-07T22:39:35.237Z dalla pagina https://arxiv.org/catchup/cs.SE/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).