Transition Systems
Transition Systems is a formal model of computation that consists of a set of states, a transition relation specifying state-to-state dynamics, and an initial state, distinguished from other computational models by its explicit representation of discrete state changes over time used in the analysis of both finite automata and system behaviors in model checking.
1K
Publications
50.7K
Citations
1.8K
Authors
671
Institutions
Publications per year
2017–2026
105
1K
Thomas A. Henzinger · 2002 · 1.9K citations
On the synthesis of a reactive module
Amir Pnueli, Roni Rosner · 1989 · 1.4K citations · Full text
Model-checking for real-time systems
Rajeev Alur, Costas Courcoubetis, David L. Dill · 2002 · 894 citations
1–5 of 1K
1.8K
15
h-index
13
h-index
11
h-index
11
h-index
10
h-index
1–5 of 1.8K
671

Centre National de la Recherche Scientifique
Paris, France
23 h-index
68 publications
4.3K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
21 h-index
59 publications
2.9K citations

Imperial College London
London, United Kingdom
20 h-index
56 publications
3.8K citations

Aarhus University
Aarhus, Denmark
19 h-index
41 publications
1.8K citations
Centrum Wiskunde & Informatica
Amsterdam, The Netherlands
17 h-index
40 publications
2.4K citations
Aalborg University
Aalborg, Denmark
16 h-index
55 publications
2.8K citations

University of Pisa
Pisa, Italy
16 h-index
50 publications
1.5K citations

University of Twente
Enschede, The Netherlands
16 h-index
31 publications
1.9K citations
1–8 of 671
ENTCS · 61 publications · 1.7K citations
23
h-index
28 publications · 1.7K citations
20
h-index
31 publications · 2.4K citations
20
h-index
TSE · 17 publications · 1.6K citations
16
h-index
19 publications · 514 citations
14
h-index
1–5