Time complexity in rewriting is naturally understood as the number of steps needed to reduce terms normal forms. Establishing bounds this measure a well-known problem community. A vast majority techniques find such consist modifying termination proofs order recover information. This has been done for instance with semantic interpretations, recursive path orders, and dependency pairs. In paper, ...

Auctions are proposed as a distributed negotiation mean, particularly useful in multiagent systems where both cooperative and self-interested agents compete for resources and services. The aim of this paper is to show how auction mechanisms on the Internet can be easily implemented by using programmable tuple spaces. Tuple spaces are shared repositories of information that follow the Linda mode...

The tuplespace system is a popular cooperative communication paradigm in service-oriented computing. Tuple matching in existing tuplespace systems is either type-based or object-based. It requires that both tuple writers and readers adhere to the same approach of information organization (i.e., same terminologies or class hierarchy). Further, it examines the value of the tuple contents only. As...

Inspired by recent works in computational systems biology and existing literature proposing nature-inspired approaches for the coordination of today complex distributed systems, this paper proposes a mechanism to leverage exact computational modelling of chemical reactions for achieving self-organisation in system coordination. We conceive the notion of biochemical tuple spaces. In this model: ...

Linda is a language for programming parallel applications whose most notable feature is a distributed shared memory called tuple space. While suitable for a wide variety of programs, one shortcoming of the language as commonly defined and implemented is a lack of support for writing programs that can tolerate failures in the underlying computing platform. This paper describes FT-Linda, a versio...

A k-tuple coloring of a graph G assigns a set of k colors to each vertex of G such that if two vertices are adjacent, the corresponding sets of colors are disjoint. The k-tuple chromatic number of G, χk(G), is the smallest t so that there is a k-tuple coloring of G using t colors. It is well known that χ(G2H) = max{χ(G), χ(H)}. In this paper, we show that there exist graphs G and H such that χk...

In this paper, we present a linguistic interval 2-tuple representation model and new linguistic interval 2tuple aggregation operators, i.e., linguistic interval 2-tuple power average (LI2TPA) operator, linguistic interval 2-tuple weighted power average (LI2TWPA) operator and linguistic interval 2-tuple power ordered weighted average (LI2TPOWA) operator. Some desired properties of the developed ...