Branching-time Logic

Branching-Time Logic is a temporal logic formalism that characterizes the behavior of concurrent systems by modeling time as a tree-like, branching structure where multiple future paths are possible from any given state.

198

Publications

18.6K

Citations

270

Authors

145

Institutions

Publications per year

2017–2026

14

Authors

270

  1. EA
    E. Allen Emerson

    The University of Texas at Austin, United States

    13 publications · 4.5K citations

    13

    h-index

  2. OK
    Orna Kupferman

    Hebrew University of Jerusalem, Israel

    9 publications · 2.6K citations

    9

    h-index

  3. TM
    Thomas Müller

    University of Freiburg, Germany

    6 publications · 152 citations

    6

    h-index

  4. RA
    Rajeev Alur

    University of Pennsylvania, United States

    5 publications · 2.2K citations

    5

    h-index

  5. MY
    Moshe Y. Vardi

    Rice University, United States

    5 publications · 754 citations

    5

    h-index

1–5 of 270

Venues

  1. Journal of Logic and Computation

    9 publications · 170 citations

    9

    h-index

  2. Information and Computation

    6 publications · 1.2K citations

    6

    h-index

  3. Synthese

    6 publications · 237 citations

    6

    h-index

  4. ACM Transactions on Computational Logic

    TOCL · 6 publications · 192 citations

    6

    h-index

  5. Journal of the ACM

    JACM · 5 publications · 4.1K citations

    5

    h-index

1–5