Skip to main content

A Causal Semantics for Timed Default Concurrent Constraint Programming

  • Conference paper
  • First Online:
Algebraic Methodology and Software Technology (AMAST 2000)

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

  • 274 Accesses

Abstract

We define a causal semantics for Timed Default Concurrent Constraint Programming which permits associating each output with its cause. We show by an example how this information can simplify program debugging. We prove that the classic operational semantics of the language can be recovered from our causal semantics, and we prove that our causal semantics and the causal semantics of Concurrent Constraint Programming coincide for programs belonging to both languages.

Research partially supported by ESPRIT Working Group COTIC, Project Number 23677, and by MURST progetto TOSCA.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berry, G.: The Constructive Semantics of Pure Esterel. Version 3.0, 1999. URL: http://www.inria.fr/meije/personnel/Gerard.Berry.html.

  2. Berry, G. and Gonthier, G.: The Esterel Synchronous Programming Language: Design, Semantics, Implementation. Science of Computer Programming 19, 1992.

    Google Scholar 

  3. Boudol, G. and Castellani, I.: A non-Interleaving Semantics for CCS based on Proved Transitions. Fundamenta Informaticae 11(4), 1988.

    Google Scholar 

  4. Degano, P., De Nicola, R. and Montanari, U.: Partial Ordering Derivations for CCS. In FCT’ 85, Springer LNCS 199, 1985.

    Google Scholar 

  5. Degano, P. and Priami, C.: Proved Trees. In ICALP’ 92, Springer LNCS 623, 1992.

    Google Scholar 

  6. Fromherz, M. and Saraswat, V.A.: Model-based Computing: Using Concurrent Constraint Programming for Modeling and Model Compilation. In CP’ 95, Springer LNCS 976, 1995.

    Google Scholar 

  7. Gupta, V., Jagadeesan, R. and Saraswat, V.A.: Truly Concurrent Constraint Programming. To appear in Theoretical Computer Science.

    Google Scholar 

  8. Halbwachs, N.: Synchronous Programming of Reactive Systems. The Kluver Academic Publishers, 1993.

    Google Scholar 

  9. Halbwachs, N., Lagnier, F. and Raymond, P.: Synchronous Observers and the Verification of Reactive Systems. In AMAST’ 93, 1993.

    Google Scholar 

  10. Halbwachs, N., Lagnier, F. and Ratel, C.: Programming and Verifying Real-Time Systems by Means of the Synchronous Data-Flow Language LUSTRE. IEEE Transactions on Software Engineering 18(9), 1992.

    Google Scholar 

  11. Harel, D. and Pnueli, A.: On the Development of Reactive Systems. In Logic and Models of Concurrent Systems, NATO, ASI-13, Springer, 1985.

    Google Scholar 

  12. Mc Millan, K.L.: Symbolic Model Checking. The Kluwer Academic Publishers, 1993.

    Google Scholar 

  13. Plotkin, G.: A Structural Approach to Operational Semantics. Technical Report DAIMI FN-19, University of Aarhus, 1981.

    Google Scholar 

  14. Pnueli, A.: How Vital is Liveness? Verifying Timing Properties of Reactive and Hybrid Systems. In CONCUR’ 92, Springer LNCS 630, 1992.

    Chapter  Google Scholar 

  15. Saraswat, V.A.: Concurrent Constraint Programming. The MIT Press, 1993.

    Google Scholar 

  16. Saraswat, V.A., Rinard, M. and Panangaden, P.: Semantics Foundation of Concurrent Constraint Programming. In POPL’ 91, ACM Press, 1991.

    Google Scholar 

  17. Saraswat, V.A., Jagadeesan, R. and Gupta, V.: Default Timed Concurrent Constraint Programming. In POPL’ 95, ACM Press, 1995.

    Google Scholar 

  18. Saraswat, V.A., Jagadeesan, R. and Gupta, V.: Timed Default Concurrent Contraint Programming. Journal of Symbolic Computation 11, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tini, S., Maggiolo-Schettini, A. (2000). A Causal Semantics for Timed Default Concurrent Constraint Programming. In: Rus, T. (eds) Algebraic Methodology and Software Technology. AMAST 2000. Lecture Notes in Computer Science, vol 1816. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45499-3_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-45499-3_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67530-3

  • Online ISBN: 978-3-540-45499-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics