A timed linda language

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1906, Issue , 2000, Pages 299-304

  de Boer, Frank S ^a   Gabbrielli, Maurizio ^b   Meo, Maria Chiara ^c  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF UDINE   (Italy)

^c UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DENOTATIONAL MODELS; LINDA MODEL; OPERATIONAL SEMANTICS; PARALLEL EXECUTIONS; SCHEDULING POLICIES; TIME-OUTS; TIMED LINDA LANGUAGES; TRANSITION SYSTEM;

SEMANTICS;

EID: 33845991169     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45263-x_19     Document Type: Conference Paper

References (14)

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.
2. F. S. de Boer, M. Gabbrielli, and M. C. Meo. A Timed Concurrent Constraint Language. Information and Computation, 2000. To appear.
3. P. Bremond-Gregoire and I. Lee. A Process Algebra of Communicating Shared Resources with Dense Time and Priorities. Theoretical Computer Science 189, 1997.
4. F. S. de Boer, M. Gabbrielli, and M. C. Meo. A denotational semantics for Timed Linda. Draft.
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.
6. N. Busi, R. Gorrieri and G. Zavattaro. A Process Algebraic View of Linda Coordination Primitives. Theoretical Computer Science, 192 (2): 167-199, 1998.
7. R. De Nicola and R. Pugliese. Linda based Applicative and Imperative Process Algebras. To appear in Theoretical Computer Science, 2000.
8. D. Gelernter. Generative communication in Linda. ACM Transcations on Programming Languages and Systems, 70 (1): 80-112, 1985.
9. J. F. Groote. Transition system specifications with negative premises. Theoretical Computer Scince, 118: 263-299, 1993.
10. M. Hennessy and T. Regan. A temporal process algebra. Information and Computation, 117: 221-239, 1995.
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.
12. V. A. Saraswat, R. Jagadeesan, and V. Gupta Timed Default Concurrent Constraint Programming. Journal of Symbolic Computation, 22 (5-6): 475-520, 1996.
13. Sun Microsystem, Inc. JavaSpaces Specifications, 1998.
14. P. Wyckoff, S. W. McLaughry, T. J. Lehman, and D. A. Ford. TSpaces. IBM Systems Journal, 37 (3), 1998.