Cover Image

Practical Livelock Analysis in Parameterized Unidirectional Rings

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Farahat, Aly
Format:	Preprint
Published:	2026
Subjects:	Distributed, Parallel, and Cluster Computing Discrete Mathematics Formal Languages and Automata Theory Logic in Computer Science 68Q85 (Primary), 68W15 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

From Historical Puzzles to Grammatical Constraints: Circular Partitions, Generalized Run-Length Encodings, and Polynomial-Time Decidability
by: Khormali, Omid, et al.
Published: (2026)

Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences
by: Couvreur, Jean-Michel, et al.
Published: (2025)

Optimal Simultaneous Byzantine Agreement, Common Knowledge and Limited Information Exchange
by: van der Meyden, Ron
Published: (2025)

Weighted Automata and Logics Meet Computational Complexity
by: Kostolányi, Peter
Published: (2023)

Parameterized Broadcast Networks with Registers: from NP to the Frontiers of Decidability
by: Guillou, Lucie, et al.
Published: (2023)

Dissecting power of intersection of two context-free languages
by: Rukavicka, Josef
Published: (2020)

$Δ$-Nets: Interaction-Based System for Optimal Parallel $λ$-Reduction
by: Salvadori, Daniel Augusto Rizzi
Published: (2025)

Restivo Salemi property for $α$-power free languages with $α\geq 5$ and $k\geq 3$ letters
by: Rukavicka, Josef
Published: (2023)

Structure and computability of preimages in the Game of Life
by: Salo, Ville, et al.
Published: (2023)

A parallel wakeup problem and multi-room light switch strategies
by: Haslegrave, John, et al.
Published: (2026)

The speed of convergence in greedy Galois games
by: Shallit, Jeffrey
Published: (2026)

Algorithms for Parallel Shared-Memory Sparse Matrix-Vector Multiplication on Unstructured Matrices
by: Bergmans, Kobe, et al.
Published: (2025)

The reflection complexity of sequences over finite alphabets
by: Allouche, Jean-Paul, et al.
Published: (2024)

HistMSO: A Logic for Reasoning about Consistency Models with MONA
by: Coget, Isabelle, et al.
Published: (2026)

Dorst-Smeulders Coding for Arbitrary Binary Words
by: De Luca, Alessandro, et al.
Published: (2025)

Introducing q-deformed binomial coefficients of words
by: Renard, Antoine, et al.
Published: (2024)

Computing Inductive Invariants of Regular Abstraction Frameworks
by: Czerner, Philipp, et al.
Published: (2024)

The Algebra of Nondeterministic Finite Automata
by: Gorrieri, Roberto
Published: (2023)

The repetition threshold for ternary rich words
by: Currie, James D., et al.
Published: (2024)

Avoiding abelian and additive powers in rich words
by: Andrade, Jonathan, et al.
Published: (2024)

Digital Convexity and Combinatorics on Words
by: De Luca, Alessandro, et al.
Published: (2025)

Population Protocols Revisited: Parity and Beyond
by: Gąsieniec, Leszek, et al.
Published: (2025)

Pushing the Limit: Verified Performance-Optimal Causally-Consistent Database Transactions
by: Ghasemirad, Shabnam, et al.
Published: (2024)

Languages given by Finite Automata over the Unary Alphabet
by: Czerwiński, Wojciech, et al.
Published: (2023)

Amnesiac Flooding: Easy to break, hard to escape
by: Austin, Henry, et al.
Published: (2025)

Resolution of The Linear-Bounded Automata Question
by: Lin, Tianrong
Published: (2021)

Diagonalization of Polynomial-Time Deterministic Turing Machines via Nondeterministic Turing Machines
by: Lin, Tianrong
Published: (2021)

Deciding Serializability in Network Systems
by: Amir, Guy, et al.
Published: (2026)

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs
by: Casteigts, Arnaud, et al.
Published: (2023)

Simple, strict, proper, happy: A study of reachability in temporal graphs
by: Casteigts, Arnaud, et al.
Published: (2022)

Probabilistic automatic complexity of finite strings
by: Gill, Kenneth
Published: (2024)

OPTIMUM-DERAM: Highly Consistent, Scalable, and Secure Multi-Object Memory using RLNC
by: Nicolaou, Nicolas, et al.
Published: (2026)

Context Adaptive Cooperation
by: Albouy, Timothé, et al.
Published: (2023)

Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
by: Huseynzade, Rafig
Published: (2025)

A cornering strategy for synchronizing a DFA
by: Bradshaw, Peter, et al.
Published: (2024)

Runs, Squares, Palindromes, and Unbordered Factors of a Family of Binary Pattern Sequences with the All-One Pattern
by: Hendel, Russell Jay
Published: (2025)

Characterising resource management performance in Kubernetes
by: Medel, Víctor, et al.
Published: (2024)

Verifying Randomized Consensus Protocols with Common Coins
by: Gao, Song, et al.
Published: (2024)

State machines for large scale computer software and systems
by: Yodaiken, Victor
Published: (2016)

Population Protocols over Ordered Agents
by: Blondin, Michael, et al.
Published: (2026)