Synchronizing automata preserving a chain of partial orders

We present a new class of automata which strictly contains the class of aperiodic automata and shares with the latter certain synchronization properties. In particular, every strongly connected automaton in this new class is synchronizing and has a synchronizing word of length where n is the number of states of the automaton.