Specifically the paper entitled Time, Clocks and the Ordering of Events in a Distributed System. [1]
This is basically the seminal paper on distributed systems and should be required reading for anyone considering playing with distributed locking mechanisms.
[1] http://research.microsoft.com/en-us/um/people/lamport/pubs/t...
For instance, the issue around the usage of fencing tokens to reject any late usage of a lock is unclear just because the protected resource and its access are themselves unspecified. Is the resource distributed or not? If distributed, does the resource has a mean to ensure that tokens are increasing over all the nodes? Does the resource have a mean to rollback any effects done by a client which session is interrupted by a timeout?
Likewise for the timing arguments. It seems clear to everyone that timeouts provide only some protection rather than a guarantee. A more precise timeline of the worst case scenario will help to estimate that protection given the misc timeout values and clock shifts.
TLA+ seems pretty good at this. Why would this be a waste of effort?
> ... The good thing is that distributed systems are, unlike other fields of programming, pretty mathematically exact, or they are not, so a given set of properties can be guaranteed by an algorithm or the algorithm may fail to guarantee them under certain assumptions. In this analysis I’ll analyze ..
Saw no mathematics in your article.