A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
We study the problem of automatically proving parameterized mutual exclusion algorithms mutually exclusive. In our first contribution we show that the problem remains undecidable even for a very weak model of computation. In this model agents have no identities but can iterate over all agents. This iteration, however, is executed in an arbitrary sequence which is only guaranteed to contain every agent at least once. Further, we show that checking if a set of configurations describable indoi:10.5281/zenodo.4094708 fatcat:pdzvwxzaabbfjdnslwqmuprhkq