We investigated the feasibility of using stochastic Petri nets (SPNs) to describe the behaviours of automated storage/retrieval systems as well as to evaluate the performance of different control policies of such systems. SPNs have been studied in the past 2 decades, and have become a powerful tool in modelling concurrent and distributed systems that exhibit synchronization and contention of shared resources. It appeared that some important characteristics of AS/RS could be well modelled with SPNs. The SPN is a graph-based tool suitable for modelling systems (manufacturing, computer, biological, etc.). It can be used to model a system at different levels of abstraction. In this study, the efficiency, control rules, bay assignment, and many other performance issues associated with AS/RS have been studied in detail using SPN models. SPNs are shown to be equivalent to the stochastic processes in which embedded Markov chains can be recognized. In addition, a stochastic Petri net package, SPNP, was adopted to solve the reachability trees from which an embedded Markov chain was generated. Finally, the performance of those systems of our interest was evaluated. The unique features and flexibility of SPNs are presented. Furthermore, the SPN models for different control algorithms of an AS/RS are discussed with examples.