Specializing anti-unification for interaction models composition via gate connections
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915661164314624 |
|---|---|
| author | Nguetoum, Joel Bannour, Boutheina Gall, Pascale Le Mahe, Erwan |
| author_facet | Nguetoum, Joel Bannour, Boutheina Gall, Pascale Le Mahe, Erwan |
| contents | Interaction models describe distributed systems as algebraic terms, with gates marking interaction points between local views. Composing local models into a coherent global one requires aligning these gates while respecting the algebraic laws of interaction operators. We specialize anti-unification (or generalization) via a special constant-preserving variant, which preserves designated constants while generalizing the remaining structure. We develop a dedicated rule-based procedure for computing these generalizations, prove its termination, soundness, and completeness, extend it modulo equational theories, and integrate it into a standard anti-unification framework. A prototype tool demonstrates the approach's ability to recompose global interactions from partial views. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_07595 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Specializing anti-unification for interaction models composition via gate connections Nguetoum, Joel Bannour, Boutheina Gall, Pascale Le Mahe, Erwan Formal Languages and Automata Theory Symbolic Computation Interaction models describe distributed systems as algebraic terms, with gates marking interaction points between local views. Composing local models into a coherent global one requires aligning these gates while respecting the algebraic laws of interaction operators. We specialize anti-unification (or generalization) via a special constant-preserving variant, which preserves designated constants while generalizing the remaining structure. We develop a dedicated rule-based procedure for computing these generalizations, prove its termination, soundness, and completeness, extend it modulo equational theories, and integrate it into a standard anti-unification framework. A prototype tool demonstrates the approach's ability to recompose global interactions from partial views. |
| title | Specializing anti-unification for interaction models composition via gate connections |
| topic | Formal Languages and Automata Theory Symbolic Computation |
| url | https://arxiv.org/abs/2512.07595 |