On nested depth first search

G. J. Holzmann; D. Peled; M. Yannakakis

On nested depth first search

G. J. Holzmann, D. Peled, M. Yannakakis

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We show in this paper that the algorithm for solving the model checking problem with a nested depth-first search can interfere with algorithms that support partial order reduction. We introduce a revised version of the algorithm that guarantees compatibility. The change also improves the performance of the nested depth-first search algorithm when partial order reduction is not used.

Original language	American English
Title of host publication	Second SPIN Workshop, 1996, AMS DIMACS series
Editors	Jean-Charles Grégoire, Gerard J. Holzmann, Peled. Doron A.
State	Published - 1996

Bibliographical note

Place of conference:Piscataway, NJ, USA

Cite this

@inproceedings{4ecb72cf133d4254ab6125760edeb81c,

title = "On nested depth first search",

abstract = "We show in this paper that the algorithm for solving the model checking problem with a nested depth-first search can interfere with algorithms that support partial order reduction. We introduce a revised version of the algorithm that guarantees compatibility. The change also improves the performance of the nested depth-first search algorithm when partial order reduction is not used.",

author = "Holzmann, {G. J.} and D. Peled and M. Yannakakis",

note = "Place of conference:Piscataway, NJ, USA",

year = "1996",

language = "American English",

editor = "Jean-Charles Gr{\'e}goire and Holzmann, {Gerard J.} and {Doron A.}, Peled.",

booktitle = "Second SPIN Workshop, 1996, AMS DIMACS series",

}

TY - GEN

T1 - On nested depth first search

AU - Holzmann, G. J.

AU - Peled, D.

AU - Yannakakis, M.

N1 - Place of conference:Piscataway, NJ, USA

PY - 1996

Y1 - 1996

N2 - We show in this paper that the algorithm for solving the model checking problem with a nested depth-first search can interfere with algorithms that support partial order reduction. We introduce a revised version of the algorithm that guarantees compatibility. The change also improves the performance of the nested depth-first search algorithm when partial order reduction is not used.

AB - We show in this paper that the algorithm for solving the model checking problem with a nested depth-first search can interfere with algorithms that support partial order reduction. We introduce a revised version of the algorithm that guarantees compatibility. The change also improves the performance of the nested depth-first search algorithm when partial order reduction is not used.

UR - http://spinroot.com/gerard/pdf/inprint/spin96.pdf

M3 - Conference contribution

BT - Second SPIN Workshop, 1996, AMS DIMACS series

A2 - Grégoire, Jean-Charles

A2 - Holzmann, Gerard J.

A2 - Doron A., Peled.

ER -

On nested depth first search

Abstract

Bibliographical note

Other files and links

Fingerprint

Cite this