The paper “Verification of Hypertorus Communication Grids by Infinite Petri Nets and Process Algebra” by Zaitsev, Shmeleva and Groote has been published in IEEE/CAA Automata Sinica. The paper explains how communication grids in the form of hyper toruses can be verified using both Petri Nets and mCRL2 in an efficient manner.