Imagen de Portada

Resolving CAP Through Automata-Theoretic Economic Design: A Unified Mathematical Framework for Real-Time Partition-Tolerant Systems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Wright, Craig S
Formato:	Preprint
Publicado:	2025
Materias:	Computer Science and Game Theory Distributed, Parallel, and Cluster Computing Formal Languages and Automata Theory Information Retrieval General Economics Economics 68M14, 91A05, 68Q85 C.2.4; D.2.4; F.1.1
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Tool-Assisted Conformance Checking to Reference Process Models
por: Rumpe, Bernhard, et al.
Publicado: (2025)

Dynamic Symbolic Execution for Semantic Difference Analysis of Component and Connector Architectures
por: Grahl, Johanna, et al.
Publicado: (2025)

Light Cone Consistency: Toward a Unified Theory of Consistency in Message-Passing Systems
por: Landers, Rob, et al.
Publicado: (2026)

The Algebra of Nondeterministic Finite Automata
por: Gorrieri, Roberto
Publicado: (2023)

Beyond Winning Strategies: Admissible and Admissible Winning Strategies for Quantitative Reachability Games
por: Muvvala, Karan, et al.
Publicado: (2024)

Parameterized Verification of Timed Networks with Clock Invariants
por: André, Étienne, et al.
Publicado: (2024)

Contract-based Verification of Digital Twins
por: Naeem, Muhammad, et al.
Publicado: (2025)

Tight Verification of Probabilistic Robustness in Bayesian Neural Networks
por: Batten, Ben, et al.
Publicado: (2024)

Parameterized Verification of Disjunctive Timed Networks
por: André, Étienne, et al.
Publicado: (2023)

Dynamically Reprogrammable Runtime Monitors for Bounded-time MTL
por: Hebballi, Chirantan, et al.
Publicado: (2026)

Hypernode Automata
por: Bartocci, Ezio, et al.
Publicado: (2023)

Good-for-MDP State Reduction for Stochastic LTL Planning
por: Weinhuber, Christoph, et al.
Publicado: (2025)

GOL in GOL in HOL: Verified Circuits in Conway's Game of Life
por: Myreen, Magnus O., et al.
Publicado: (2025)

Institutional Noise, Strategic Deviation, and Intertemporal Collapse: A Formal Model of Miner Behaviour under Protocol Uncertainty
por: Wright, Craig Steven
Publicado: (2025)

PROV-AGENT: Unified Provenance for Tracking AI Agent Interactions in Agentic Workflows
por: Souza, Renan, et al.
Publicado: (2025)

Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
por: Guillon, Bruno, et al.
Publicado: (2025)

Learn, Check, Test -- Security Testing Using Automata Learning and Model Checking
por: Marksteiner, Stefan, et al.
Publicado: (2025)

Model-bounded monitoring of hybrid systems
por: Waga, Masaki, et al.
Publicado: (2021)

Complex Event Recognition with Symbolic Register Transducers: Extended Technical Report
por: Alevizos, Elias, et al.
Publicado: (2024)

On Transition Constructions for Automata -- A Categorical Perspective
por: Cruchten, Mike
Publicado: (2024)

Input-Erasing Two-Way Finite Automata
por: Meduna, Alexander, et al.
Publicado: (2025)

Computing the Bandwidth of Meager Timed Automata
por: Asarin, Eugene, et al.
Publicado: (2024)

The Autonomy of the Lightning Network: A Mathematical and Economic Proof of Structural Decoupling from BTC
por: Wright, Craig Steven
Publicado: (2025)

A LOCAL View of the Polynomial Hierarchy
por: Reiter, Fabian
Publicado: (2023)

Jump Complexity of Deterministic Finite Automata with Translucent Letters
por: Fazekas, Szilárd Zsolt, et al.
Publicado: (2025)

Determination of the fifth Busy Beaver value
por: The bbchallenge Collaboration, et al.
Publicado: (2025)

Credibility Trilemma in Polymatroidal Service Markets
por: Lovén, Lauri, et al.
Publicado: (2026)

Positional $ω$-regular languages
por: Casares, Antonio, et al.
Publicado: (2024)

The $μ\mathcal{G}$ Language for Programming Graph Neural Networks
por: Belenchia, Matteo, et al.
Publicado: (2024)

Decidability of membership problems for flat rational subsets of $\mathrm{GL}(2,\mathbb{Q})$ and singular matrices
por: Diekert, Volker, et al.
Publicado: (2019)

Decomposition of Automata recognizing Ideals
por: Berry, Mathias, et al.
Publicado: (2026)

Learning Automata with Name Allocation
por: Frank, Florian, et al.
Publicado: (2025)

Walking on Words
por: Pratt-Hartmann, Ian
Publicado: (2022)

Tight Bounds for the Number of Absent Subsequences
por: Adamson, Duncan, et al.
Publicado: (2024)

Alternating Nominal Automata with Name Allocation
por: Frank, Florian, et al.
Publicado: (2024)

Nominal Tree Automata With Name Allocation
por: Prucker, Simon, et al.
Publicado: (2024)

Presheaf automata
por: Struth, Georg, et al.
Publicado: (2024)

Computational methods for Dynamic Answer Set Programming
por: Hahn, Susana
Publicado: (2025)

Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata (Full Version)
por: Nakano, Keisuke, et al.
Publicado: (2024)

Quantitative Assurance and Synthesis of Controllers from Activity Diagrams
por: Ye, Kangfeng, et al.
Publicado: (2024)