A product transition graph of size at most |T|^2 enables polynomial-time fixed-point pruning followed by backtracking search to decide livelock freedom or detect livelocks for all ring sizes in unidirectional protocols.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Practical Livelock Analysis in Parameterized Unidirectional Rings
A product transition graph of size at most |T|^2 enables polynomial-time fixed-point pruning followed by backtracking search to decide livelock freedom or detect livelocks for all ring sizes in unidirectional protocols.