Computability of Recursive Functions
Journal of the ACM (JACM)
On the expressiveness of Linda coordination primitives
Information and Computation - Special issue on EXPRESS 1997
On the Operational Sematics of a Coordination Language
ECOOP '94 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
COORDINATION '00 Proceedings of the 4th International Conference on Coordination Languages and Models
Computation: finite and infinite machines
Computation: finite and infinite machines
Prioritized and parallel reactions in shared data space coordination languages
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
| Hi-index | 0.00 |
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.