For the most recent entries see the Petri Nets Newsletter.

Algorithmic Verification of Home Spaces in P/T Systems.

Johnen, C.

In: Proc. of the 12th IMACS World Conf., 1988, Paris; Vol. 3, pages 491-493. 1988.

Also in: Breedveld, P.; et al.: IMAC 1990: Modelling and Simulation of Systems., pages 107-109. J.C. Baltzer AG, Scientific Publishing Co., 1990.

Also as: Rapport de Recherche 335. Univ. de Paris-Sud, Centre d'Orsay, France, February 1987.

Abstract: Home spaces ie sets of markings which can be reached from every reachability marking are an important notion for net analysis. The existence of a particular home space is equivalent to the liveness property. The author presents an algorithm which quickly verifies a home space in a strongly bounded Place/Transition system.

Keywords: algorithmic verification (of) home space; predicate/transition system; liveness; bounded Place/Transition system.


Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography