On the semantics of tuple-based coordination models

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On the semantics of tuple-based coordination models

Full text

Pdf (1.16 MB)

Source

Symposium on Applied Computing archive
Proceedings of the 1999 ACM symposium on Applied computing table of contents

San Antonio, Texas, United States

Pages: 175 - 182

Year of Publication: 1999

ISBN:1-58113-086-4

Author

Andrea Omicini

LIA - Laboratorio di Informatica Avanzata, DEIS - Università di Bologna, Viale Risorgimento, 2 40138 - Bologna, Italy

Sponsors

SIGADA: ACM Special Interest Group on Ada Programming Language
SIGCUE: ACM Special Interest Group on Computer Uses In Education
SIGAPP: ACM Special Interest Group on Applied Computing
SIGBIO: ACM Special Interest Group on Biomedical Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 20, Citation Count: 8

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/298151.298229 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Farhad Arbab, The IWIM Model for Coordination of Concurrent Activities, Proceedings of the First International Conference on Coordination Languages and Models, p.34-56, April 15-17, 1996
	2	Antonio Brogi , Paolo Ciancarini, The concurrent language, Shared Prolog, ACM Transactions on Programming Languages and Systems (TOPLAS), v.13 n.1, p.99-123, Jan. 1991 [doi>10.1145/114005.102807]
	3	N. Busi , R. Gorrieri , G. Zavattaro, On the Turing Equivalence of Linda Coordination Primitives, University of Bologna, 1997
	4	Nicholas Carriero , David Gelernter, How to write parallel programs: a guide to the perplexed, ACM Computing Surveys (CSUR), v.21 n.3, p.323-357, Sep. 1989 [doi>10.1145/72551.72553]
	5	Nicholas Carriero , David Gelernter, Tuple analysis and partial evaluation strategies in the Linda precompiler, Selected papers of the second workshop on Languages and compilers for parallel computing, p.114-125, May 1990, Urbana, Illinois, United States
	6	Nicholas Carriero , David Gelernter, A Foundation for Advanced Compile-time Analysis of Linda Programs, Proceedings of the Fourth International Workshop on Languages and Compilers for Parallel Computing, p.389-404, August 07-09, 1991
	7	N. Carriero and D. Gelernter. Linda and message passing: Wha~ have we learned? Technical Report vAL~U/r>cS/aR-se4, Yale University, August 1993.
	8	Paolo Ciancarini, Distributed programming with logic tuple spaces, New Generation Computing, v.12 n.3, p.251-284, 1994 [doi>10.1007/BF03037345]
	9	Paolo Ciancarini , Keld K. Jensen , Daniel Yankelevich, On the Operational Sematics of a Coordination Language, Selected papers from the ECOOP'94 Workshop on Models and Languages for Coordination of Parallelism and Distribution, Object-Based Models and Languages for Concurrent Systems, p.77-106, July 05, 1994
	10	Paolo Ciancarini , Adreas Knoche , Robert Tolksdorf , Fabio Vitali, PageSpace: an architecture to coordinate distributed applications on the Web, Computer Networks and ISDN Systems, v.28 n.7-11, p.941-952, May 1996
	11	R. Englemore and T. Morgan, editors. Blackboard Stlstems. Addison- Wesley, Reading, Mass., 1988.
	12	David Gelernter, Generative communication in Linda, ACM Transactions on Programming Languages and Systems (TOPLAS), v.7 n.1, p.80-112, Jan. 1985 [doi>10.1145/2363.2433]
	13	David Gelernter , Nicholas Carriero, Coordination languages and their significance, Communications of the ACM, v.35 n.2, p.97-107, Feb. 1992 [doi>10.1145/129630.129635]
	14	David Gelernter , Lenore D. Zuck, On What Linda Is: Formal Description of Linda as a Reactive System, Proceedings of the Second International Conference on Coordination Languages and Models, p.187-204, September 01-03, 1997
	15	IBM. T spaces, 1998. http://ww~.almaden.ibm.com/ TSpaces.
	16	Satoshi Matsuoka , Satoru Kawai, Using tuple space communication in distributed object-oriented languages, ACM SIGPLAN Notices, v.23 n.11, p.276-284, Nov. 1988
	17	R. Milner, A Calculus of Communicating Systems, Springer-Verlag New York, Inc., Secaucus, NJ, 1982
	18	Naftaly H. Minsky , Jerrold Leichter, Law-Governed Linda as a Coordination Model, Selected papers from the ECOOP'94 Workshop on Models and Languages for Coordination of Parallelism and Distribution, Object-Based Models and Languages for Concurrent Systems, p.125-146, July 05, 1994
	19	Andrea Omicini , Enrico Denti , Antonio Natali, Agent Coordination and Control through Logic Theories, Proceedings of the 4th Congress of the Italian Association for Artificial Intelligence on Topics in Artificial Intelligence, p.439-450, October 11-13, 1995
	20	Andrea Omicini , Franco Zambonelli, Tuple centres for the coordination of Internet agents, Proceedings of the 1999 ACM symposium on Applied computing, p.183-190, February 28-March 02, 1999, San Antonio, Texas, United States [doi>10.1145/298151.298231]
	21	G.A. Papadopoulos and F. Arbab. Coordination models and languages. A dvance~ in Computers, 46(The Engineering of Large Systems), August 1998.
	22	G. Plotkin. A structural ~pproach to operational semantics. Technical Report DAIMI FN-19, CS Department, Aarhus University, Denmark, 1981.
	23	A.I.T. Rowstron. Bulk Primitives in Linda Run. Time Systems. PhD thesis, The University of York, 1996.
	24	Scientific Computing Associates, Inc., New Haven, CT, USA. C-Linda Reference Manual, 1990.
	25	The JavaSpacesTM specification. Technical report, Sun Microsystems, 1998.
	26	Swedish Institute of Computer Science, Kista, Sweden. SIC- Stus Prolog Library, 1994.
	27	Peter Wegner, Coordination as Comstrainted Interaction (Extended Abstract), Proceedings of the First International Conference on Coordination Languages and Models, p.28-33, April 15-17, 1996
	28	Peter Wegner, Why interaction is more powerful than algorithms, Communications of the ACM, v.40 n.5, p.80-91, May 1997 [doi>10.1145/253769.253801]

CITED BY 8

	George A. Papadopoulos, Special track on coordination models, languages and applications, Proceedings of the 1999 ACM symposium on Applied computing, p.132-133, February 28-March 02, 1999, San Antonio, Texas, United States
	Paolo Ciancarini , Andrea Omicini , Franco Zambonelli, Coordination technologies for internet agents, Nordic Journal of Computing, v.6 n.3, p.215-240, Fall 1999
	Mirko Viroli, Comparing semantic frameworks for coordination: on the conformance issue for coordination media, Proceedings of the 2003 ACM symposium on Applied computing, March 09-12, 2003, Melbourne, Florida
	Andrea Omicini , Franco Zambonelli, Coordination for Internet Application Development, Autonomous Agents and Multi-Agent Systems, v.2 n.3, p.251-269, September 1999
	Gerhard Weiß, Agent orientation in software engineering, The Knowledge Engineering Review, v.16 n.4, p.349-373, December 2001
	Andrea Omicini, Formal ReSpecT in the A&A Perspective, Electronic Notes in Theoretical Computer Science (ENTCS), v.175 n.2, p.97-117, June, 2007
	Mirko Viroli , Andrea Omicini, Coordination as a Service, Fundamenta Informaticae, v.73 n.4, p.507-534, December 2006
	Franco Zambonelli , Andrea Omicini, Challenges and Research Directions in Agent-Oriented Software Engineering, Autonomous Agents and Multi-Agent Systems, v.9 n.3, p.253-283, November 2004