Timed Automata Semantics
Timed Automata Semantics is a formal model of computation that specifies the behavior of timed automata by extending finite-state automata with clock variables and timing constraints to capture the temporal evolution of systems.
298
Publications
9.3K
Citations
635
Authors
302
Institutions
Publications per year
2017–2026
26
Parents
298
A timed model for communicating sequential processes
G. M. Reed, A. W. Roscoe · Theoretical Computer Science · 1988 · 284 citations
Eugène Asarin, Paul Caspi, Oded Maler · Journal of the ACM · 2002 · 207 citations
Alexandre David, Kim G. Larsen, Axel Legay et al. · 2010 · 173 citations · Full text
1–5 of 298
635
14
h-index
12
h-index
8
h-index
6
h-index
6
h-index
1–5 of 635
302

Centre National de la Recherche Scientifique
Paris, France
22 h-index
71 publications
2.4K citations

École Normale Supérieure Paris-Saclay
Gif-sur-Yvette, France
15 h-index
33 publications
1.1K citations
Aalborg University
Aalborg, Denmark
14 h-index
53 publications
2.7K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
8 h-index
16 publications
1.1K citations
Mälardalen University
Västerås, Sweden
8 h-index
26 publications
563 citations
University of Sfax
Sfax, Tunisia
8 h-index
24 publications
421 citations
University of Castilla-La Mancha
Ciudad Real, Spain
6 h-index
22 publications
561 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
6 h-index
16 publications
384 citations
1–8 of 302
ENTCS · 17 publications · 461 citations
13
h-index
11 publications · 889 citations
11
h-index
8 publications · 304 citations
8
h-index
7 publications · 120 citations
7
h-index
7 publications · 249 citations
7
h-index
1–5