Cited By
View all- Viroli M(2004)Verifying Properties of Coordination by Well-Structured Transition SystemsElectronic Notes in Theoretical Computer Science10.1016/j.entcs.2004.04.03297(67-96)Online publication date: Jul-2004
Comparing semantic frameworks for coordination: on the conformance issue for coordination media
Pages 394 - 401
Abstract
A fundamental issue in the engineering of coordination models is to design coordination abstractions that are correct with respect to the specification of the coordination model they implement. The traditional semantic framework for coordination is focused on describing the admissible evolutions over time of a coordinated system, and is particularly suitable for specifying the laws of a coordination model. On the other hand, formally describing run-time aspects of an implementation requires a different framework, capturing as fundamental idea the interactive behavior of a coordination medium.In this paper, these two frameworks are compared by tackling a crucial issue of coordination models, that is, the conformance of an implementation with respect to a specification. In particular, a definition of conformance is introduced that is shown to be compatible with the standard notion of implementation by horizontal refinement promoted in the context of process algebras.
References
[1]
F. Arbab, I. Herman, and P. Spilling. An overview of MANIFOLD and its implementation. Concurrency: Practice and Experience, 5(1):23--70, February 1993.]]
[2]
J. A. Bergstra, A. Ponse, and S. A. Smolka, editors. Handbook of Process Algebra. North-Holland, 2001.]]
[3]
M. M. Bonsangue, F. Arbab, J. W. de Bakker, J. J. M. M. Rutten, A. Scutella, and G. Zavattaro. A transition system semantics for the control-driven coordination language MANIFOLD. Theoretical Computer Science, 240(1):3--47, June 2000.]]
[4]
M. M. Bonsangue, J. N. Kok, and G. Zavattaro. Comparing coordination models and architectures using embeddings. Science of Computer Programming, to appear, 2002.]]
[5]
A. Brogi and J. Jacquet. On the expressiveness of coordination models. In P. Ciancarini and A. L. Wolf, editors, Coordination Languages and Models, volume 1594 of LNCS, pages 134--149. Springer-Verlag, 1999.]]
[6]
M. Broy and E.-R. Olderog. Trace-oriented models of concurrency. In Bergstra et al. {2}, chapter 2, pages 101--195.]]
[7]
N. Busi, R. Gorrieri, and G. Zavattaro. Three semantics of the output operation for asynchronous communication. In Coordination Languages and Models, volume 1282 of LNCS, pages 205--219. Springer-Verlag, 1997.]]
[8]
N. Busi, R. Gorrieri, and G. Zavattaro. A process algebraic view of Linda coordination primitives. Theoretical Computer Science, 192(2):167--199, 1998.]]
[9]
N. Busi, R. Gorrieri, and G. Zavattaro. On the expressiveness of Linda coordination primitives. Information and Computation, 156(1--2):90--121, Jan. 2000.]]
[10]
N. Busi, R. Gorrieri, and G. Zavattaro. Process calculi for Coordination: From Linda to JavaSpaces. In T. Rus, editor, Algebraic Methodology and Software Technology. 8th International Conference, AMAST 2000, volume 1816 of LNCS, pages 198--212. Springer-Verlag, 2000.]]
[11]
N. Busi and G. Zavattaro. On the serializability of transactions in JavaSpaces. In U. Montanari and V. Sassone, editors, ConCoord: International Workshop on Concurrency and Coordination, volume 54 of Electronic Notes in Theoretical Computer Science. Elsevier Science, July 2001.]]
[12]
P. Ciancarini. Coordination models and languages as software integrators. ACM Computing Surveys, 28(2):300--302, June 1996.]]
[13]
F. S. de Boer and C. Palamidessi. Embedding as a tool for language comparison. Information and Computation, 108(1):128--157, 1994.]]
[14]
L. Fiege, G. Mühl, and F. C. Gärtner. A modular approach to build structured event-based systems. In 2002 ACM Symposium on Applied Computing (SAC) 2002, pages 385--392, Madrid, Spain, 2002. ACM.]]
[15]
E. Freeman, S. Hupfer, and K. Arnold. JavaSpaces: Principles, Patterns, and Practice. Addison-Wesley, 1999.]]
[16]
D. Gelernter. Generative communication in Linda. ACM Transactions on Programming Languages and Systems, 7(1):80--112, January 1985.]]
[17]
D. Gelernter and L. Zuck. On what Linda is: Formal description of Linda as a reactive system. In Coordination Languages and Models, volume 1282 of LNCS, pages 187--219, Berlin (Germany), September 1997. Springer-Verlag.]]
[18]
R. v. Glabbeek. The linear time --- branching time spectrum I. The semantics of concrete, sequential processes. In Bergstra et al. {2}, chapter 1, pages 3--100.]]
[19]
R. Milner. Communication and Concurrency. Prentice Hall, 1989.]]
[20]
A. Omicini. On the semantics of tuple-based coordination models. In 1999 ACM Symposium on Applied Computing (SAC'99), San Antonio (TX), 28 Feb.--2 Mar. 1999.]]
[21]
A. Omicini and E. Denti. From tuple spaces to tuple centres. Science of Computer Programming, 41(3), 2001.]]
[22]
S. Orzan and J. van de Pol. Distribution of a simple shared dataspace architecture. In 1st International Workshop on Foundations of Coordination Languages and Software Architectures, volume 68(3) of Electronic Notes in Theoretical Computer Science. Elsevier Science B. V., 2002.]]
[23]
G. P. Picco, A. L. Murphy, and G.-C. Roman. LIME: Linda meets mobility. In Proceedings of the 1999 International Conference on Software Engineering (ICSE'99), pages 368--377. ACM, 1999. May 16--22, Los Angeles (CA), USA.]]
[24]
G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Department of Computer Science, AArhus University, Denmark, 1991.]]
[25]
A. Rowstron. Optimising the Linda in primitive: Understanding tuple space run-times. In Proceedings of the 2000 ACM Symposium on Applied Computing (SAC 2000), pages 227--232, Como (I). 19--21 March 2000. ACM.]]
[26]
M. Viroli, G. Moro, and A. Omicini. On observation as a coordination paradigm: An ontology and a formal framework. In 16th ACM Symposium on Applied Computing (SAC 2001), pages 166--175, Las Vegas (NV), 11--14 Mar. 2001. ACM. Track on Coordination Models, Languages and Applications.]]
[27]
M. Viroli and A. Omicini. Coordination as a service: Ontological and formal foundation. In 1st International Workshop on Foundations of Coordination Languages and Software Architectures, volume 68(3) of Electronic Notes in Theoretical Computer Science. Elsevier Science B. V., 2002.]]
[28]
M. Viroli and A. Omicini. Tuple-based models in the observation framework. In Coordination Languages and Models, volume 2315 of LNCS, pages 364--379. Springer-Verlag, 2002.]]
[29]
M. Viroli, A. Omicini, and A. Ricci. On the expressiveness of event-based coordination media. In H. R. Arabnia, editor, International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'02), pages 1414--1420, Las Vegas, NV, USA, 24--27 July 2002. CSREA Press.]]
Recommendations
Using mobile code to provide fault tolerance in tuple space based coordination languages
Special issue on coordination languages and architecturesTuple space based coordination languages suffer from poor fault tolerance to agent failure. Traditionally, transaction type mechanisms have been adopted in them to provide this type of fault tolerance. However, transactions change the semantics of the ...
A coordination model for the semantic web
SAC '06: Proceedings of the 2006 ACM symposium on Applied computingThe Semantic Web foresees a Web of machine-processable knowledge interacted with by clients in an operationalized manner. At Web scale, the coordination between clients will be vital for ensuring the success of their interactions. In this paper we ...
Formal modelling of a coordination system: from practice to theory, and back again
ESAW'06: Proceedings of the 7th international conference on Engineering societies in the agents world VIIIn this work, we report an experience that illustrates the interplay between formal methods and real software development. Starting from aWeb-enable Coordination Service (WCS) based on JavaSpaces technology which had been successfully used in an ...
Comments
Information & Contributors
Information
Published In
March 2003
1268 pages
ISBN:1581136242
DOI:10.1145/952532
- Conference Chair:
- Gary B. Lamont,
- Program Chairs:
- Hisham Haddad,
- George A. Papadopoulos,
- Publications Chair:
- Brajendra Panda
Copyright © 2003 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 09 March 2003
Check for updates
Author Tags
Qualifiers
- Article
Conference
SAC03
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,650 of 6,669 submissions, 25%
Upcoming Conference
SAC '25
- Sponsor:
- sigapp
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 184Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 25 Dec 2024
Other Metrics
Citations
Cited By
View all- Viroli M(2004)Verifying Properties of Coordination by Well-Structured Transition SystemsElectronic Notes in Theoretical Computer Science10.1016/j.entcs.2004.04.03297(67-96)Online publication date: Jul-2004
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in