Abstract
Linda tuple spaces are flat and unstructured, in the sense that they do not allow for expressing preferences of tuples; for example, we could be interested in indicating tuples that should be returned more frequently w.r.t. other ones, or even tuples with a low relevance that should be taken under consideration only if there is no tuple with a higher importance. In this paper we investigate, in a process algebraic setting, how probabilities and priorities can be introduced in the Linda coordination model in order to support a more sophisticated data retrieval mechanism. As far as probabilities are concerned, we show that the Linda pattern-matching data retrieval makes it necessary to deal with weights instead of just pure probabilities, as instead can be done in standard process algebras. Regarding priorities, we present two possible ways for adding them to Linda; in the first one the order of priorities is statically fixed, in the second one it is dynamically instantiated when a data-retrieval operation is executed.
Work partially supported by MEFISTO Progetto “Metodi Formali per la Sicurezza e il Tempo”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bravetti, M.: Specification and Analysis of Stochastic Real-Time Systems. PhD thesis, Dottorato di Ricerca in Informatica. Università di Bologna, Padova, Venezia, Available at (February 2002), http://www.cs.unibo.it/~bravetti/
Bravetti, M., Bernardo, M.: Compositional asymmetric cooperations for process algebras with probabilities, priorities, and time. In: Proc. of the 1st Int. Workshop on Models for Time-Critical Systems, MTCS 2000, State College (PA). Electronic Notes in Theoretical Computer Science, vol. 39(3). Elsevier, Amsterdam (2000)
Bravetti, M., Gorrieri, R., Lucchi, R., Zavattaro, G.: Web Services for E-commerce: guaranteeing security access and quality of service. In: Proc. of ACM Symposium on Applied Computing (SAC 2004), ACM Press, New York (2004)
Busi, N., Gorrieri, R., Lucchi, R., Zavattaro, G.: Secspaces: a data-driven coordination model for environments open to untrusted agents. In: 1st International Workshop on Foundations of Coordination Languages and Software Architectures. ENTCS, vol. 68.3 (2002)
Scientific Computing Associates. Linda: User’s guide and reference manual. Scientific Computing Associates (1995)
Minsky, N., Minsky, Y., Ungureanu, V.: Safe Tuplespace-Based Coordination in Multi Agent Systems. Journal of Applied Artificial Intelligence 15(1) (2001)
De Nicola, R., Ferrari, G., Pugliese, R.: KLAIM: A Kernel Language for Agents Interaction and Mobility. IEEE Transactions on Software Engineering 24(5), 315–330 (1998); Special Issue: Mobility and Network Aware Computing
Di Pierro, A., Hankin, C., Wiklicky, H.: Probabilistic Klaim. In: Proc. of 7th International Conference on Coordination Models and Languages (Coordination 2004). LNCS. Springer, Heidelberg (2004)
Rowstron, A., Wood, A.: Solving the Linda multiple rd problem using the copy-collect primitive. Science of Computer Programming 31(2-3), 335–358 (1998)
Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (1995)
Tofts, C.M.N.: Processes with probabilities, priority and time. Formal Aspects of Computing 6, 534–564 (1994)
van Glabbeek, R.J., Smolka, S.A., Steffen, B.: Reactive, Generative and Stratified Models of Probabilistic Processes. Information and Computation 121, 59–80 (1995)
Vitek, J., Bryce, C., Oriol, M.: Coordinating Processes with Secure Spaces. Science of Computer Programming 46, 163–193 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bravetti, M., Gorrieri, R., Lucchi, R., Zavattaro, G. (2004). Probabilistic and Prioritized Data Retrieval in the Linda Coordination Model. 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_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-24634-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21044-3
Online ISBN: 978-3-540-24634-3
eBook Packages: Springer Book Archive