Rapport de Recherche 471. Univ. de Paris-Sud, Centre d'Orsay, France, March 1989.
Abstract: The authors present a proof of the reducibility of the home state problem to the reachability problem for well-structured labelled transition systems that include different models like vector addition systems, Petri nets and classes of communications finite state machines.
Keywords: home state problem; reachability problem; labelled transition system.
Back to the Petri Nets Bibliography