Bounded Petri nets of finite dimension have only finitely many reachable markings. - Manfred Droste; R. M. Shortt (Bull. EATCS, 1992)

Topology for Computations of Concurrent Automata. - Dietrich Kuske; R. M. Shortt (Int. J. Algebra Comput., 1998)

Continuous Petri Nets and Transition Systems. - Manfred Droste; R. M. Shortt (Unifying Petri Nets, 2001)

From Petri Nets to Automata with Concurrency. - Manfred Droste; R. M. Shortt (Appl. Categorical Struct., 2002)