The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate Reactions

  • Yuri Gurevich ,
  • James K. Huggins

Computer Science Logics, Selected papers from CSL'95, Springer Lecture Notes in Computer Science |

We give an evolving algebra (= abstract state machine) solution for the well-known railroad crossing problem, and we use the occasion to experiment with computations where agents perform instantaneous actions in continuous time and some agents fire at the moment they are enabled.