On rank functions for heaps

Motivated by work of Stembridge, we study rank functions for Viennotʹs heaps of pieces. We produce a simple and sufficient criterion for a heap to be a ranked poset and apply the results to the heaps arising from fully commutative words in Coxeter groups.