Specializing anti-unification for interaction models composition via gate connections

📅 2025-12-08
📈 Citations: 0
✨ Influential: 0
📄 PDF
🤖 AI Summary
This paper addresses the challenge of consistently synthesizing a global model from locally interacting components in distributed systems. To this end, it proposes an algebraic modeling and generalization framework based on gate composition. The core methodological innovation is a constant-preserving variant of anti-unification, integrated with rule-driven computation under equational theories, which guarantees termination, correctness, and completeness of the synthesis process. System behavior is modeled as algebraic terms; local views are aligned via gate mechanisms, and local interaction structures are generalized using the proposed anti-unification algorithm to reconstruct a global model satisfying algebraic laws (e.g., associativity, commutativity). Experimental evaluation with a prototype tool demonstrates that the approach effectively recovers semantically consistent global interaction behavior from heterogeneous local models, significantly enhancing composability and verifiability in distributed protocol modeling.

Technology Category

Constraint Satisfaction and Optimization: Distributed CSP/OptimizationSearch and Optimization: Distributed SearchMultiagent Systems: Distributed Problem Solving

Application Category

Graph Algorithms and Modeling for the Web: Efficient manipulation of static and dynamic Web-related graphsSemantics and Knowledge: Methods, algorithms and applications for the development of semantic models, knowledge graphs and other forms of structured data models with machine-interpretable semanticsSystems and Infrastructure for Web, Mobile and WoT: Experiences and lessons learnt from Web-based algorithms and system deployments
📝 Abstract
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.
Problem

Research questions and friction points this paper is trying to address.

Specializes anti-unification for composing interaction models
Aligns gates in distributed systems via constant-preserving generalization
Develops a rule-based procedure to recompose global interactions
Innovation

Methods, ideas, or system contributions that make the work stand out.

Specialized anti-unification for model composition
Constant-preserving generalization with rule-based procedure
Extended modulo equational theories for completeness
🔎 Similar Papers
No similar papers found.
💼 Related Jobs
No related jobs found.
J
Joel Nguetoum
Université Paris-Saclay, CEA, List, F-91120, Palaiseau, France
B
Boutheina Bannour
Université Paris-Saclay, CEA, List, F-91120, Palaiseau, France
Pascale Le Gall
Pascale Le Gall
CentraleSupélec Université Paris-Saclay
Formal methodsmodel-based testing
E
Erwan Mahe
Université Paris-Saclay, CEA, List, F-91120, Palaiseau, France