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

Authors

635

  1. PB
    Patricia Bouyer

    Centre National de la Recherche Scientifique, France

    16 publications · 756 citations

    14

    h-index

  2. KG
    Kim G. Larsen

    Aalborg University, Denmark

    13 publications · 755 citations

    12

    h-index

  3. PP
    Paul Pettersson

    Uppsala University, Sweden

    8 publications · 273 citations

    8

    h-index

  4. CS
    Cristina Seceleanu

    Mälardalen University, Sweden

    6 publications · 121 citations

    6

    h-index

  5. BB
    Béatrice Bérard

    Centre National de la Recherche Scientifique, France

    6 publications · 121 citations

    6

    h-index

1–5 of 635

Venues

  1. Electronic Notes in Theoretical Computer Science

    ENTCS · 17 publications · 461 citations

    13

    h-index

  2. Theoretical Computer Science

    11 publications · 889 citations

    11

    h-index

  3. Formal Methods in System Design

    8 publications · 304 citations

    8

    h-index

  4. IFAC Proceedings Volumes

    7 publications · 120 citations

    7

    h-index

  5. Information and Computation

    7 publications · 249 citations

    7

    h-index

1–5