On nested depth first search
DIMACS series in discrete mathematics and theoretical computer science1997pp. 23–31
Citations Over TimeTop 10% of 1997 papers
Abstract
Abstract We show in this paper that the algorithm for solving the model checkingproblem with a nested depth-first search proposed in [1] 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.
Related Papers
- → Accretion, mass wasting, and partitioned strain over the 26 Dec 2004 Mw9.2 rupture offshore Aceh, northern Sumatra(2007)37 cited
- Pennsylvanian foreland deformation of Wichita uplift, southwest Oklahoma(1986)
- → Fluvial Sheet Sandstone Development Above a Tectonically-Controlled Sequence Boundary: Canyon Creek Member, Erickson Sandstone (Campanian), Rock Springs Uplift, Wyoming: ABSTRACT(1994)
- Using DataGrid Control to Realize DataBase of Querying in VB6.0(2000)
- Susquehanna Chorale Spring Concert "Roots and Wings"(2017)