Eliminating redundant interleavings during concurrent program verification

Antti Valmari

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

27 Citations (Scopus)

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 briefly discussed.
Original languageEnglish
Title of host publicationPARLE '89 - Parallel Architectures and Languages Europe
Subtitle of host publicationParallel Languages
EditorsEddy Odijk, Martin Rem, Jean-Claude Syre
Place of PublicationBerlin
PublisherSpringer
Pages89-103
Volume2
ISBN (Electronic)978-3-540-46184-5
ISBN (Print)978-3-540-51285-1
DOIs
Publication statusPublished - 1989
MoE publication typeA4 Article in a conference publication
EventPARLE '89 - Parallel Architectures and Languages Europe - Eindhoven, Netherlands
Duration: 12 Jun 198916 Jun 1989

Publication series

SeriesLecture Notes in Computer Science
Volume366
ISSN0302-9743

Conference

ConferencePARLE '89 - Parallel Architectures and Languages Europe
Country/TerritoryNetherlands
CityEindhoven
Period12/06/8916/06/89

Fingerprint

Dive into the research topics of 'Eliminating redundant interleavings during concurrent program verification'. Together they form a unique fingerprint.

Cite this