Skip to main content
SpringerLink
Log in

A Timed Linda Language

  • Conference paper
  • First Online:
Coordination Languages and Models (COORDINATION 2000)

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

Included in the following conference series:

Abstract

We introduce a Timed Linda language (T-Linda) which is obtained by a natural timed interpretation of the usual constructs of the Linda model and by adding a simple primitive which allows one to specify time-outs. Parallel execution of processes follows the scheduling policy of interleaving, however maximal parallelism is assumed for actions depending on time. We define the operational semantics of T-Linda by means of a transition system (a denotational model is defined in [4]).

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

Access this chapter

Log in via an institution
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.

References

  1. L Bettini, R. De Nicola, G.-L. Ferrari and R. Pugliese. Interactive Mobile Agents in X-Klaim. In Proc. of the Seventh IEEE International Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE’98), pp. 110–115, IEEE Computer Society, 1998.

    Google Scholar 

  2. F. S. de Boer, M. Gabbrielli, and M. C. Meo. A Timed Concurrent Constraint Language. Information and Computation, 2000. To appear.

    Google Scholar 

  3. P. Bremond-Gregoire and I. Lee. A Process Algebra of Communicating Shared Resources with Dense Time and Priorities. Theoretical Computer Science 189, 1997.

    Google Scholar 

  4. F. S. de Boer, M. Gabbrielli, and M. C. Meo. A denotational semantics for Timed Linda. Draft.

    Google Scholar 

  5. N. Busi, R. Gorrieri, and G. Zavattaro. Process Calculi for Coordination: from Linda to JavaSpaces. Proc. of 8-th International Conference on Algebraic Metodology and Software Technology. Lecture Notes in Computer Science. Springer-Verlag, 2000. To appear.

    Google Scholar 

  6. N. Busi, R. Gorrieri and G. Zavattaro. A Process Algebraic View of Linda Coordination Primitives. Theoretical Computer Science, 192(2):167–199, 1998.

    Article  MathSciNet  MATH  Google Scholar 

  7. R. De Nicola and R. Pugliese. Linda based Applicative and Imperative Process Algebras. To appear in Theoretical Computer Science, 2000.

    Google Scholar 

  8. D. Gelernter. Generative communication in Linda. ACM Transcations on Programming Languages and Systems, 70(1): 80–112, 1985.

    Article  MATH  Google Scholar 

  9. J.F. Groote. Transition system specifications with negative premises. Theoretical Computer Scince, 118: 263–299, 1993.

    Article  MathSciNet  MATH  Google Scholar 

  10. M. Hennessy and T. Regan. A temporal process algebra. Information and Computation, 117: 221–239, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  11. V.A. Saraswat, M. Rinard, and P. Panangaden. Semantic Foundation of Concurrent Constraint Programming. In Proc. Eighteenth ACM Symposium on Principles of Programming Languages, pages 333–353. ACM Press, 1991.

    Google Scholar 

  12. V.A. Saraswat, R. Jagadeesan, and V. Gupta Timed Default Concurrent Constraint Programming. Journal of Symbolic Computation, 22(5–6):475–520, 1996.

    Article  MathSciNet  MATH  Google Scholar 

  13. Sun Microsystem, Inc. JavaSpaces Specifications, 1998.

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universiteit Utrecht, The Netherlands

    Frank S. de Boer

  2. Universitá di Udine, Italy

    Maurizio Gabbrielli

  3. Universitá di L’Aquila, Italy

    Maria Chiara Meo

Authors
  1. Frank S. de Boer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maurizio Gabbrielli
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maria Chiara Meo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Informática, Universidade Nova de Lisboa, Monte de Caparica, 2825-114, Caparica, Portugal

    António Porto

  2. Department of Computer Science, Washington University in St. Louis, Box 1045, One Brookings Drive, St. Louis, MO, 63130, USA

    Gruia-Catalin Roman

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Boer, F.S., Gabbrielli, M., Meo, M.C. (2000). A Timed Linda Language. In: Porto, A., Roman, GC. (eds) Coordination Languages and Models. COORDINATION 2000. Lecture Notes in Computer Science, vol 1906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45263-X_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-45263-X_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41020-1

  • Online ISBN: 978-3-540-45263-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation