Abstract
We introduce a multi-step semantics MTS-mp for LinCa which demands maximum progress in each step, i.e. which will only allow transitions that are labeled with maximal (in terms of set inclusion) subsets of the set of enabled actions. We compare MTS-mp with the original ITS-semantics for LinCa specified in [CJY94] and with a slight modification of the original MTS-semantics specified in [CJY94]. Given a LinCa-process and a Tuple Space configuration, the possible transitions under our MTS-mp-semantics are always a subset of the possible transitions under the presented MTS-semantics for LinCa.
We compare the original ITS-semantics and the presented MTS-semantics with our MTS-mp-semantics, and as a major result, we will show that under MTS-mp neither termination nor divergence of LinCa processes is decidable. In contrast to this [BGLZ04], in the original semantics for LLinCa [CJY94] termination is decidable.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bravetti, M., Gorrieri, R., Lucchi, R., Zavattaro, G.: Adding Quantitative Information to Tuple Space Coordination Languages, Bologna, Italy (July 2004)
de Boer, F.S., Gabbrielli, M., Meo, M.C.: A Timed Linda Language. In: Porto, A., Roman, G.-C. (eds.) COORDINATION 2000. LNCS, vol. 1906, pp. 299–304. Springer, Heidelberg (2000)
Busi, N., Gorrieri, R., Zavattaro, G.: On the Expressiveness of Linda Coordination Primitives. Information and Computation 156(1-2), 90–121 (2000)
Busi, N., Zavattaro, G.: Prioritized and Parallel Reactions in Shared Data Space Coordination Languages. In: Jacquet, J.-M., Picco, G.P. (eds.) COORDINATION 2005. LNCS, vol. 3454, pp. 204–219. Springer, Heidelberg (2005)
Ciancarini, P., Jensen, K.K., Yankelevich, D.: On the Operational Semantics of a Coordination Language. In: Tokoro, M., Pareschi, R. (eds.) ECOOP 1994. LNCS, vol. 821, pp. 77–106. Springer, Heidelberg (1994)
Minksy, M.L.: Computation: finite and infinite machines. Prentice Hall, Englewoof Cliffs (1967)
Sheperdson, J.C., Sturgis, J.E.: Computability of recursive functions. Journal of the ACM 10, 217–255 (1963)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Majster-Cederbaum, M., Minnameier, C. (2006). Termination and Divergence Are Undecidable Under a Maximum Progress Multi-step Semantics for LinCa. In: Barkaoui, K., Cavalcanti, A., Cerone, A. (eds) Theoretical Aspects of Computing - ICTAC 2006. ICTAC 2006. Lecture Notes in Computer Science, vol 4281. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11921240_5
Download citation
DOI: https://doi.org/10.1007/11921240_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48815-6
Online ISBN: 978-3-540-48816-3
eBook Packages: Computer ScienceComputer Science (R0)