Explanation of conventional solutions to the Firing Squad Synchronization problem

may I kindly ask you to give an overview of the conventional solutions to the Firing squad synchronization problem with number of states etc.

I want to get into the topic, understand the different approaches, but don’t know with what approaches / solutions to begin to get my foot into the door to begin with.

The wikipedia article doesn’t go into détail enough to understand the approaches, it just lists a few Approaches by name with number of states and time taken for synchronization, but you don’t really find those explained anywhere.

What is also not stated is, whether or not it is important with these algorithms if or that the synchronization process starts at a certain DFA or whether the algorithm works for an arbitrary first general.

The state of the topic being kind of underdocumented or even neglected is shown by the available tags to the topic on here and their minor count. There isn’t even a tag for the FSSP.

Thank you very much.

vonSpotz