The gurevich's thesis stipulates that sequential abstract state machines (asms) capture the essence of sequential algorithms. On another side, the bulk-synchronous parallel (bsp) bridging model is a well known model for hpc algorithm design. It provides a conceptual bridge between the physical implementation of the machine and the abstraction available to a programmer of that machine. The assumptions of the bsp model are thus provide portable and scalable performance predictions on hpc systems. We follow gurevich's thesis and extend the sequential postulates in order to intuitively and realistically characterise the bsp algorithms.