Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

On the Expressiveness of Absolute-Time Coordination Languages

  • Conference paper
Coordination Models and Languages (COORDINATION 2004)

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

Included in the following conference series:

Abstract

Although very simple and elegant, Linda-style coordination models lack the notion of time, and are therefore not able to precisely model real-life coordination applications. Nevertheless, industrial proposals such as TSpaces and JavaSpaces, inspired from Linda, have incorporated time constructs.

This paper aims at a systematic study of the introduction of absolute time in coordination models. It builds upon previous work to study the expressiveness of Linda extended with a wait mechanism and Linda primitives extended to support the duration of tuples and the duration of the suspension of communication operations.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

Similar content being viewed by others

References

  1. Andreoli, J.-M., Pareschi, R.: Linear Objects: Logical Processes with Built-in Inheritance. New Generation Computing 9(3-4), 445–473 (1991)

    Article  MATH  Google Scholar 

  2. Arbab, F., Herman, I., Spilling, P.: An Overview of Manifold and its Implementation. Concurrency: practice and experience 5(1), 23–70 (1993)

    Article  Google Scholar 

  3. Banatre, J., LeMetayer, D.: Programming by Multiset Transformation. Communications of the ACM 36(1), 98–111 (1991)

    Article  Google Scholar 

  4. Berry, G., Gonthier, G.: The Esterel Synchronous Programming Language: Design, Semantics, Implementation. Science of Computer Programming 19 (1992)

    Google Scholar 

  5. De Boer, F.S., Gabbrielli, M., Meo, M.C.: A Timed Concurrent Constraint Language. Information and Computation 161(1), 45–83 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  6. Brogi, A., Ciancarini, P.: The Concurrent Language Shared Prolog. ACM Transactions on Programming Languages and Systems 13(1), 99–123 (1991)

    Article  Google Scholar 

  7. Busi, N., Gorrieri, R., Zavattaro, G.: Process Calculi for Coordination: from Linda to JavaSpaces. In: Rus, T. (ed.) AMAST 2000. LNCS, vol. 1816, p. 198. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  8. Busi, N., Zavattaro, G.: Expired Data Collection in Shared Dataspaces. Theoretical Computer Science 298, 529–556 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  9. Carriero, N., Gelernter, D.: Linda in Context. Communications of the ACM 32(4), 444–458 (1989)

    Article  Google Scholar 

  10. Caspi, P., Halbwachs, N., Pilaud, P., Plaice, J.: Lustre: a Declarative Language for Programming Synchronous Systems. In: Proc. POPL 1987. ACM Press, New York (1987)

    Google Scholar 

  11. Ciancarini, P.: Distributed Programming with Logic Tuple Spaces. New Generation Computing 12(3), 251–284 (1994)

    Article  MATH  Google Scholar 

  12. Ciancarini, P., Rossi, D.: Jada: Coordination and Communication for Java Agents. In: Tschudin, C.F., Vitek, J. (eds.) MOS 1996. LNCS, vol. 1222, pp. 213–228. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  13. de Boer, F.S., Palamidessi, C.: Embedding as a Tool for Language Comparison. Information and Computation 108(1), 128–157 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  14. Freeman, E., Hupfer, S., Arnold, K.: JavaSpaces: Principles, Patterns, and Practice. Addison-Wesley, Reading (1999)

    Google Scholar 

  15. Gelernter, D., Carriero, N.: Coordination Languages and Their Significance. Communications of the ACM 35(2), 97–107 (1992)

    Article  Google Scholar 

  16. Harel, D.: Statecharts: a Visual Formalism for Complex Systems. Science of Computer Programming 8 (1987)

    Google Scholar 

  17. Horita, E., de Bakker, J.W., Rutten, J.J.M.M.: Fully abstract denotational models for nonuiform concurrent languages. Information and computation 115(1), 125–178 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  18. De Bosschere, K., Linden, I., Jacquet, J.-M., Brogi, A.: On the Expressiveness of Relative-timed Coordination Models. Electronic Notes in Theoretical Computer Science (2003) (to appear)

    Google Scholar 

  19. Jacquet, J.-M., De Bosschere, K.: On the Semantics of μLog. Future Generation Computer Systems 10, 93–135 (1994)

    Article  Google Scholar 

  20. Jacquet, J.-M., De Bosschere, K., Brogi, A.: On Timed Coordination Languages. In: Porto, A., Roman, G.-C. (eds.) COORDINATION 2000. LNCS, vol. 1906, pp. 81–98. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  21. Linden, I., Jacquet, J.-M.: On the Expressiveness of Absolute-time Coordination Languages. Technical report, Institute of Informatics, University of Namur (2003)

    Google Scholar 

  22. Maraninchi, F.: Operational and Compositional Semantics of Synchronous Automaton Composition. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, Springer, Heidelberg (1992)

    Google Scholar 

  23. Gelernter, D., Carriero, N., Zuck, L.: Bauhaus Linda. In: Ciancarini, P., Nierstrasz, O., Yonezawa, A. (eds.) Object based models and languages for concurrent systems. LNCS, vol. 924, pp. 66–76. Springer, Heidelberg (1994)

    Google Scholar 

  24. De Nicola, R., Ferrari, G., Pugliese, R.: KLAIM: a Kernel Language for Agents Interaction and Mobility. IEEE Transactions on Software Engineering (1998)

    Google Scholar 

  25. Nielsen, M., Palamidessi, C., Valencia, F.D.: On the Expressive Power of Temporal Concurrent Constraint Programming Languages. In: Proceedings of the 4th international ACM SIGPLAN conference on Principles and practice of declarative programming, pp. 156–167. ACM, New York (2002)

    Google Scholar 

  26. Papadopolous, G.A., Arbab, F.: Coordination Models and Languages. Advances in Computers 48 (1998)

    Google Scholar 

  27. Rowstron, A., Wood, A.: A Set of Tuple Space Primitives for Distributed Coordination. In: Proc. 30th Hawaii International Conference on System Sciences, vol. 1, pp. 379–388. IEEE Press, Los Alamitos (1997)

    Chapter  Google Scholar 

  28. Saraswat, V., Jagadeesan, R., Gupta, V.: Programming in Timed Concurrent Constraint Languages. In: Mayoh, B., Tougu, E., Penjam, J. (eds.) Computer and System Sciences. NATO, vol. ASI-131. Springer, Heidelberg (1994)

    Google Scholar 

  29. Saraswat, V., Jagadeesan, R., Gupta, V.: Timed Default Concurrent Constraint Programming. Journal of Symbolic Computation 11 (1996)

    Google Scholar 

  30. Saraswat, V.A.: Concurrent Constraint Programming Languages. The MIT Press, Cambridge (1993)

    Google Scholar 

  31. Shapiro, E.Y.: Embeddings among Concurrent Programming Languages. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 486–503. Springer, Heidelberg (1992)

    Google Scholar 

  32. Smolka, G.: The Oz Programming Model. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol. 1000, pp. 324–343. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  33. Tini, S.: On the Expressiveness of Timed Concurrent Constraint Programming. Electronics Notes in Theoretical Computer Science (1999)

    Google Scholar 

  34. Tolksdorf, R.: Coordinating Services in Open Distributed Systems with LAURA. In: Hankin, C., Ciancarini, P. (eds.) COORDINATION 1996. LNCS, vol. 1061. Springer, Heidelberg (1996)

    Google Scholar 

  35. Wyckoff, P., McLaughry, S.W., Lehman, T.J., Ford, D.A.: TSpaces. IBM Systems Journal 37(3) (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, University of Namur, Belgium

    I. Linden & J. -M. Jacquet

Authors
  1. I. Linden
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. -M. Jacquet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Sistemi e Informatica, Università di Firenze, Italy

    Rocco De Nicola

  2. Department of Computer Science, University of Pisa, Italy

    Gian-Luigi Ferrari

  3. Microsoft Corporation, 98052-6399, Redmont, WA, USA

    Greg Meredith

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Linden, I., Jacquet, J.M. (2004). On the Expressiveness of Absolute-Time Coordination Languages. In: De Nicola, R., Ferrari, GL., Meredith, G. (eds) Coordination Models and Languages. COORDINATION 2004. Lecture Notes in Computer Science, vol 2949. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24634-3_18

Download citation

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

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-24634-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation