Guarded Transitions

Guarded Transitions is a formal modeling construct in timing semantics that consists of state transitions activated only when associated logical conditions, or guards, are satisfied, thereby enabling precise control over the temporal ordering and execution of actions in concurrent and reactive systems.

39

Publications

3.3K

Citations

83

Authors

52

Institutions

Publications per year

2017–2026

0

Authors

83

  1. EW
    Edsger W. Dijkstra

    Eindhoven University of Technology, Netherlands

    3 publications · 2K citations

    3

    h-index

  2. KS
    Klaus Schneider

    University of Kaiserslautern, Germany

    2 publications · 32 citations

    2

    h-index

  3. NF
    Nissim Francez

    Technion – Israel Institute of Technology, Israel

    2 publications · 103 citations

    2

    h-index

  4. RS
    Rishiyur S. Nikhil

    Massachusetts Institute of Technology, United States

    2 publications · 29 citations

    2

    h-index

  5. JB
    Jens Brandt

    University of Kaiserslautern, Germany

    2 publications · 32 citations

    2

    h-index

1–5 of 83

Venues

  1. ACM SIGDA Newsletter

    2 publications · 29 citations

    2

    h-index

  2. Annals of Pure and Applied Logic

    2 publications · 98 citations

    2

    h-index

  3. Science of Computer Programming

    2 publications · 222 citations

    2

    h-index

  4. Journal of Symbolic Computation

    1 publications · 15 citations

    1

    h-index

  5. 1

    h-index

1–5