Symmetry-Preserving Finite Synthesis and Amalgamation
summary
Claims a concrete construction of finite groupoids avoiding coset cycles up to any fixed n and uses them to produce symmetry-preserving finite realizations of amalgamation specifications by addressing two obstruction types (parallel identifications and relation-twisting cycles). Produces finite solutions that extend given partial automorphisms (an EPA extension with controllable n-acyclic local overlap), yields finite hypergraph coverings for guarded-logics applications, and notes construction sizes are enormous but effective.
AI-written summary · about
chapters (5)
- 0:00Start
- 9:29(1) reduced products with groupoids
- 12:16obstructions: wrong kind of cycles (2)
- 20:36applications (1): hypergraph coverings
- 28:20some related references
related talks
24mSynthesis of Parametric Locally Symmetric Protocols from Abstract Temporal Specifications
19mSolving Infinite-State Games via Acceleration
27mParameterized Infinite-State Reactive Synthesis
20mSPORE: Combining Symmetry and Partial Order Reduction
16mCyclic Message Histories for Automated Safety Verification of Distributed Algorithms
23mA Synthetic Reconstruction of Multiparty Session Types
33mGeometry of Secure Computation
21mEnabling Bounded Verification of Doubly-Unbounded Distributed Agreement-Based S...