Skip to main content
SpringerLink
Log in

The railroad crossing problem: An experiment with instantaneous actions and immediate reactions

  • Conference paper
  • First Online:
Book cover Computer Science Logic (CSL 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1092))

Included in the following conference series:

Abstract

We give an evolving algebra solution for the well-known railroad crossing problem and use the occasion to experiment with agents that perform instantaneous actions in continuous time and in particular with agents that fire at the moment they are enabled.

Partially supported by NSF grant CCR-95-04375 and ONR grant N00014-94-1-1182.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Egon Börger, Annotated Bibliography on Evolving Algebras, in “Specification and Validation Methods”, ed. E. Börger, Oxford University Press, 1995, 37–51.

    Google Scholar 

  2. Egon Börger, Yuri Gurevich and Dean Rosenzweig: The Bakery Algorithm: Yet Another Specification and Verification, in “Specification and Validation Methods”, ed. E. Börger, Oxford University Press, 1995.

    Google Scholar 

  3. Yuri Gurevich, “Evolving Algebra 1993: Lipari Guide”, in “Specification and Validation Methods”, Ed. E. Börger, Oxford University Press, 1995, 9–36.

    Google Scholar 

  4. Yuri Gurevich and James K. Huggins, “The Railroad Crossing Problem: An Evolving Algebra Solution,” LITP 95/63, Janvier 1996, Centre National de la Recherche Scientifique Paris, France.

    Google Scholar 

  5. Yuri Gurevich, James K. Huggins, and Raghu Mani, “The Generalized Railroad Crossing Problem: An Evolving Algebra Based Solution,” University of Michigan EECS Department Technical Report CSE-TR-230-95.

    Google Scholar 

  6. Constance Heitmeyer and Nancy Lynch: The Generalized Railroad Crossing: A Case Study in Formal Verification of Real-Time Systems, Proc., Real-Time Systems Symp., San Juan, Puerto Rico, Dec., 1994, IEEE.

    Google Scholar 

  7. Ernst-Rüdiger Olderog, Anders P. Ravn and Jens Ulrik Skakkebaek, “Refining System Requirements to Program Specifications”, to appear.

    Google Scholar 

  8. Robin Milner. A private discussion, Aug. 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. EECS Department, University of Michigan, 48109-2122, Ann Arbor, MI, USA

    Yuri Gurevich & James K. Huggins

Authors
  1. Yuri Gurevich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. James K. Huggins
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hans Kleine Büning

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gurevich, Y., Huggins, J.K. (1996). The railroad crossing problem: An experiment with instantaneous actions and immediate reactions. In: Kleine Büning, H. (eds) Computer Science Logic. CSL 1995. Lecture Notes in Computer Science, vol 1092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61377-3_43

Download citation

  • DOI: https://doi.org/10.1007/3-540-61377-3_43

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61377-0

  • Online ISBN: 978-3-540-68507-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation