For the most recent entries see the Petri Nets Newsletter.

Eliminating Redundant Interleavings During Concurrent Program Verification.

Valmari, Antti

In: Odijk, E.; et al.: Lecture Notes in Computer Science, Vol. 366; PARLE'89, Proceedings of the Conference on Parallel Architectures and Languages Europe, 1989, Eindhoven, Netherlands; Vol. 2, pages 89-103. Berlin, Germany: Springer-Verlag, 1989.

Abstract: The paper presents a way of reducing the number of interleavings of concurrent actions that are investigated when concurrent systems are analysed or verified by exhaustive simulation or related methods. Eliminating redundant interleavings can lead to significant savings of analysis effort. The theory behind the method is developed in an abstract framework. Elementary Petri nets and shared variable multi-process programs are then used as application examples. The relation of the method to other reduction methods is discussed.

Keywords: redundant interleaving; concurrent program verification; elementary net; shared variable multi-process program.


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

Back to the Petri Nets Bibliography