Partial-order Reduction

Partial-Order Reduction is a state-space reduction technique in model checking that exploits the independence of concurrent transitions to avoid redundant exploration of equivalent interleavings, thereby reducing computational complexity while preserving relevant behavioral properties of concurrent systems.

231

Publications

10.9K

Citations

467

Authors

225

Institutions

Publications per year

2017–2026

45

Authors

467

  1. DP
    Doron Peled

    Bar-Ilan University, Israel

    6 publications · 624 citations

    7

    h-index

  2. WP
    Wojciech Penczek

    Institute of Computer Science, Poland

    7 publications · 366 citations

    7

    h-index

  3. KS
    Konstantinos Sagonas

    Uppsala University, Sweden

    6 publications · 439 citations

    6

    h-index

  4. GG
    Ganesh Gopalakrishnan

    University of Utah, United States

    5 publications · 173 citations

    5

    h-index

  5. LB
    Luboš Brim

    Masaryk University, Czechia

    4 publications · 109 citations

    4

    h-index

1–5 of 467

Venues

  1. Electronic Notes in Theoretical Computer Science

    ENTCS · 7 publications · 255 citations

    7

    h-index

  2. Proceedings of the ACM on Programming Languages

    PACMPL · 7 publications · 320 citations

    7

    h-index

  3. 6

    h-index

  4. ACM SIGPLAN Notices

    6 publications · 282 citations

    6

    h-index

  5. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 6 publications · 117 citations

    6

    h-index

1–5