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
Parents
198
On the synthesis of a reactive module
Amir Pnueli, Roni Rosner · 1989 · 1.4K citations · Full text
Alternating-time temporal logic
Rajeev Alur, Thomas A. Henzinger, Orna Kupferman · Journal of the ACM · 2002 · 1.4K citations
“Sometimes” and “not never” revisited
E. Allen Emerson, Joseph Y. Halpern · Journal of the ACM · 1986 · 996 citations · Full text
Symbolic Model Checking for Real-Time Systems
Thomas A. Henzinger, Xavier Nicollin, Joseph Sifakis et al. · Information and Computation · 1994 · 830 citations · Full text
E. Allen Emerson · 1990 · 824 citations
1–5 of 198
270
13
h-index
9
h-index
6
h-index
5
h-index
5
h-index
1–5 of 270
145
The University of Texas at Austin
Austin, United States
11 h-index
13 publications
4.6K citations
Stanford University
Stanford, United States
7 h-index
7 publications
1.5K citations
University of Pennsylvania
Philadelphia, United States
7 h-index
14 publications
3.6K citations
Hebrew University of Jerusalem
Jerusalem, Israel
6 h-index
6 publications
2.2K citations

Rice University
Houston, United States
6 h-index
6 publications
796 citations

Centre National de la Recherche Scientifique
Paris, France
6 h-index
8 publications
129 citations

Cornell University
Ithaca, United States
5 h-index
10 publications
4.3K citations

Weizmann Institute of Science
Rehovot, Israel
5 h-index
9 publications
4.1K citations
1–8 of 145
9 publications · 170 citations
9
h-index
6 publications · 1.2K citations
6
h-index
6 publications · 237 citations
6
h-index
TOCL · 6 publications · 192 citations
6
h-index
JACM · 5 publications · 4.1K citations
5
h-index
1–5