Metraipolis › archive › dc_684445f582b3
Executable Specifications in Transition Algebra — arXiv:2611.06208
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.06208
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-05T18:31:52.888Z
- SHA-256 of the archived text
34e3536e9d919cca53967e3fc619e7f5667f660edde3d0670631efcd2de7ce9e- Stable URL of this page
https://metraipolis.com/documento/dc_684445f582b3
How to cite
Executable Specifications in Transition Algebra — arXiv:2611.06208 — arXiv (en), https://arxiv.org/abs/2611.06208 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_684445f582b3 (Metraipolis archive dc_684445f582b3, sha256 34e3536e9d919cca53967e3fc619e7f5667f660edde3d0670631efcd2de7ce9e)
BibTeX
@misc{dc684445f582b3,
title = {Executable Specifications in Transition Algebra — arXiv:2611.06208},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.06208},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_684445f582b3; sha256 34e3536e9d919cca53967e3fc619e7f5667f660edde3d0670631efcd2de7ce9e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.06208. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Transition Algebra can be viewed as an extension of many-sorted first-order logic by borrowing essential features from dynamic logic. This leads us to new, more expressive sentences that include transitions labelled with actions, which are built from terms using union, composition, and iteration operators. We define a suitable notion of Horn clause, develop a system of proof rules for reasoning about clauses, and subsequently show that the proof system is sound and complete. We then introduce a rewriting relation based on Horn clauses, capturing transitions along established paths expressed as actions. This rewriting relation is naturally extended to a narrowing procedure for solving queries, thereby laying foundation for logic programming in Transition Algebra. As usual, soundness for both rewriting and narrowing is straightforward, whereas completeness requires additional conditions. Finally, we provide a prototype tool that demonstrates the practical aspects and shows the effectiveness of the proposed method. Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.LO, nuovi lavori del giorno). Categorie arXiv: Logic in Computer Science (cs.LO). Pagina del lavoro: https://arxiv.org/abs/2611.06208 — 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-11-05T18:21:19.041Z dalla pagina https://arxiv.org/list/cs.LO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).