  In article "Sequential abstract state machines capture sequential
algorithms", one of us axiomatized sequential algorithms by means of three
postulates: sequential time, abstract state, and bounded exploration
postulates. Here we give a more abstract version of the bounded exploration
postulate which is closer in spirit to the abstract state postulate. In the
presence of the sequential time and abstract state postulates, our postulate is
equivalent to the original bounded exploration postulate.
