We define the SMT-based bounded model checking (BMC) method for Weighted Interpreted Systems and for the existential fragment of the Weighted Epistemic Computation Tree Logic. We implemented the new BMC algorithm and compared it with the SATbased BMC method for the same systems and the same property language on several benchmarks for multi-agent systems.

This paper continues our systematic study of an RNAediting computational model of Genetic Algorithms (GA). This model is constructed based on several genetic editing characteristics that are gleaned from the RNA editing system as observed in several organisms. We have expanded the traditional Genetic Algorithm with artificial editing mechanisms as proposed in [11] and [12]. The incorporation of...

Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time how to apply BMC to parametric verification of time Petri nets with discrete-time semantics. The properties are expressed by formulas of the logic PRTECTL a parametric extension of the existential fragment of Computatio...

In this paper, we describe a model of physical computation that allows us to understand how embodied intelligent agents can simultaneously be considered to be objects operating under the laws of nature (or physics) and information processing devices. Using this type of analysis has two major advantages. First, it allows us to make concrete those issues relating to the relative merits of using a...

Recently hybridized approaches that exploit agent-based computation and evolutionary computation have challenged conventional assumptions about the creative power of digital design tools. A simple artificial ant system that can generate digital painterly and pencil sketching renderings starting from a digital photograph will be presented as one example of how design might be conceptually revisi...

Direct-sequence Code-division multiple-access (DS-CDMA) has emerged as proper format for communication systems. As a result of multiple-access interference (MAI), inter-symbol interference (ISI), narrowband interference (NBI) and nonlinearities in channels, DS-CDMA systems can suffer deterioration in performance . New techniques to suppress narrow-band and multiple-access interference for sprea...

This paper proposes a self-organized service negotiation method for CDM in intelligent and automatic manners. It mainly includes three phases: semantic-based capacity evaluation for the CDM sponsor, trust computation of the CDM organization, and negotiation selection of the decision-making service provider (DMSP). In the first phase, the CDM sponsor produces the formal semantic description of t...

0. Introduction Turing’s 1950 article “Computing machinery and intelligence” has contributed to shaping a tradition which assigns algorithms and computing machines a central role in the study of human cognition. Turing asked there whether machines can simulate human intelligent behavior, and illustrated how his earlier analysis of computation processes contributes to circumscribe the meaning of...

Persistent Turing Machines (PTMs) are multitape machines with a persistent worktape preserved between interactions, whose inputs and outputs are dynamically generated streams of tokens (strings). They are a minimal extension of Turing Machines (TMs) that express interactive behavior. They provide a natural model for sequential interactive computation such as single-user databases and intelligen...