Metraipolis › archive › dc_63a7cbc681f7

Testing and Learning Symbolic Finite State Machines — arXiv:2609.25603

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.25603
License (as archived)
CC0-1.0
Archived
2026-10-08T15:16:15.284Z
SHA-256 of the archived text
7eb2b7b4582ede45e115caf8cb48c7dc0c3ddbc6d3ab05cd699de2fe45657fc9
Stable URL of this page
https://metraipolis.com/documento/dc_63a7cbc681f7

How to cite

Testing and Learning Symbolic Finite State Machines — arXiv:2609.25603 — arXiv (en), https://arxiv.org/abs/2609.25603 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_63a7cbc681f7 (Metraipolis archive dc_63a7cbc681f7, sha256 7eb2b7b4582ede45e115caf8cb48c7dc0c3ddbc6d3ab05cd699de2fe45657fc9)
BibTeX
@misc{dc63a7cbc681f7,
  title = {Testing and Learning Symbolic Finite State Machines — arXiv:2609.25603},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.25603},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_63a7cbc681f7; sha256 7eb2b7b4582ede45e115caf8cb48c7dc0c3ddbc6d3ab05cd699de2fe45657fc9},
  year = {2026}
}

Archived text

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

Symbolic finite state machines (SFSMs) describe input/output behaviour using guards and output assignments with possibly infinite data domains. We study deterministic and completely specified SFSMs whose guards and output assignments depend only on the current input. We define finite representative input sets that contain witnesses for relevant guard overlaps and separating witnesses for output assignments that differ on those overlaps. Our main theorem shows that language equivalence of the finite instantiations implies language equivalence over the full input domain. This result transfers complete testing methods for deterministic finite state machines (DFSMs) to SFSMs, provided finite sets of admissible guards and output assignments and an upper bound on the number of distinguishable reachable states are known. Under these assumptions, a DFSM learner with complete testing can learn a finite instantiation, which is then lifted to an equivalent SFSM. We establish a bound on the size of representative input sets and give an SMT construction whose correctness and termination hold under stated solver assumptions.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-23 in cs.SE).
Categorie arXiv: Formal Languages and Automata Theory (cs.FL) ; Software Engineering (cs.SE).
Pagina del lavoro: https://arxiv.org/abs/2609.25603 — 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-08T14:42:48.189Z dalla pagina https://arxiv.org/catchup/cs.SE/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).