  Abstract State Machines (ASMs) provide a model of computations on structures
rather than strings. Blass, Gurevich and Shelah showed that deterministic
PTIME-bounded ASMs define the choiceless fragment of PTIME, but cannot capture
PTIME. In this article deterministic PSPACE-bounded ASMs are introduced, and it
is proven that they cannot capture PSPACE. The key for the proof is a
characterisation by partial fixed-point formulae over the St\"ark/Nanchen logic
for deterministic ASMs and a construction of transitive structures, in which
such formulae must hold. This construction exploits that the decisive support
theorem for choiceless polynomial time holds under slightly weaker assumptions.
