Skip to main content
SpringerLink
Log in

The Generalized Railroad Crossing: Its symbolic analysis in CLP (\(\mathcal{R}\))

  • Posters
  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming — CP96 (CP 1996)

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

Abstract

The symbolic simulation and analysis method for hybrid systems presented in [2] is illustrated by means of the benchmark problem ”The Generalized Railroad Crossing” [1].

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

References

  1. C. Heitmeyer, R. Jeffords, and B. Labaw. A Benchmark for Comparing Different Approaches for Specifying and Verifying Real-Time Systems. In Proc. of the 10th Int. Workshop on Real-Time Operating Systems and Software, May 1993.

    Google Scholar 

  2. L. Urbina. Analysis of Hybrid Systems in CLP(567-01). This volume.

    Google Scholar 

Download references

Authors
  1. Luis Urbina
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Eugene C. Freuder

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Urbina, L. (1996). The Generalized Railroad Crossing: Its symbolic analysis in CLP (\(\mathcal{R}\)). In: Freuder, E.C. (eds) Principles and Practice of Constraint Programming — CP96. CP 1996. Lecture Notes in Computer Science, vol 1118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61551-2_118

Download citation

  • DOI: https://doi.org/10.1007/3-540-61551-2_118

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61551-4

  • Online ISBN: 978-3-540-70620-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation