Automata-based Equivalence Checking

Automata-Based Equivalence Checking is a formal method within the domain of equivalence checking that employs finite automata as the primary computational model to represent and compare the behavioral or structural equivalence of systems, distinguishing it from other techniques by its reliance on automata-theoretic representations and language containment or bisimulation algorithms.

52

Publications

2.1K

Citations

112

Authors

65

Institutions

Publications per year

2017–2026

4

Authors

112

  1. DP
    Damien Pous

    École Normale Supérieure de Lyon, France

    6 publications · 300 citations

    6

    h-index

  2. FB
    Filippo Bonchi

    University of Pisa, Italy

    4 publications · 261 citations

    4

    h-index

  3. DQ
    Daowen Qiu

    Sun Yat-sen University, China

    2 publications · 108 citations

    2

    h-index

  4. SD
    Srinivas Devadas

    Massachusetts Institute of Technology, United States

    2 publications · 103 citations

    2

    h-index

  5. DM
    Dávid Molnár

    Microsoft (United States), United States

    2 publications · 183 citations

    2

    h-index

1–5 of 112

Venues

  1. Theoretical Computer Science

    5 publications · 254 citations

    5

    h-index

  2. Information and Computation

    4 publications · 109 citations

    4

    h-index

  3. Journal of Computer and System Sciences

    3 publications · 130 citations

    3

    h-index

  4. ACM SIGPLAN Notices

    3 publications · 160 citations

    3

    h-index

  5. Electronic Notes in Theoretical Computer Science

    ENTCS · 2 publications · 36 citations

    2

    h-index

1–5