Timed Automata

Timed Automata is a formal model of computation that extends finite automata with continuous clock variables to capture the behavior of real-time systems, enabling the specification and verification of temporal constraints in hybrid and embedded systems.

1.2K

Publications

58.9K

Citations

2.1K

Authors

735

Institutions

Publications per year

2017–2026

127

Authors

2.1K

  1. KG
    Kim G. Larsen

    Aalborg University, Denmark

    54 publications · 2.8K citations

    29

    h-index

  2. PB
    Patricia Bouyer

    Centre National de la Recherche Scientifique, France

    35 publications · 1.5K citations

    23

    h-index

  3. PP
    Paul Pettersson

    Uppsala University, Sweden

    31 publications · 1.6K citations

    22

    h-index

  4. ST
    Stavros Tripakis

    University of California, Berkeley, United States

    15 publications · 858 citations

    14

    h-index

  5. SY
    Sergio Yovine

    Verimag, France

    13 publications · 2.5K citations

    13

    h-index

1–5 of 2.1K

Venues

  1. Theoretical Computer Science

    32 publications · 8.5K citations

    22

    h-index

  2. Electronic Notes in Theoretical Computer Science

    ENTCS · 51 publications · 1.2K citations

    21

    h-index

  3. IEEE Transactions on Automatic Control

    23 publications · 1.5K citations

    20

    h-index

  4. IEEE Transactions on Software Engineering

    TSE · 20 publications · 2.3K citations

    16

    h-index

  5. BRICS Report Series

    23 publications · 870 citations

    15

    h-index

1–5