No abstract

This paper proposes a novel versatile genetic algorithm (GA) for solving the graph distribution problem. The new GA is based mainly on an inspirational idea that exploits the Newton’s universal gravitation law to introduce a novel GA fitness function. By this,the new GA preserves the workload balancing property between the different sites of the graph network and reduces the inter-processors communications overhead. Moreover, three main variants of the novel GA are developed. The two first; centralized and distributed variants, are developed to conduct a graph distribution over homogeneous architectures. The third variant is a distributed one devoted for heterogeneous architectures where the impact of the auto-adaptation features of the GA emerges. The results obtained and the comparative studies show the effectiveness of the proposed methods.

No abstract

The timed automata are extensively used in different fields of formal validation in particular the model checking one. In this paper the authors are interested by a class of TA called durational actions timed automata (daTA) and the zones graph which represents an exact finite state abstraction based on what called Zones. The authors present a novel approach to construct a zone graph, based on the maximality semantics called maximality-based zone graph (MZG) by a local construction approach and they define timed maximality bisimulation relation for real-time model based on the maximality semantics. The authors propose a new method for distributed state space generation of maximality-based zone graph based on DHT structure. They also describe an implementation of this construction (DTaMaZG tool). The experiments given at the end of this article has shown good results especially when comparing with other works that have already proceed in the distributed generation of MLTS (Maximality based Labeled Transition Systems).

This paper proposes a new hierarchical design method for the specification and the verification of multi agent systems (MAS). For this purpose, the authors propose the model of Refinable Recursive Petri Nets (RRPN) under a maximality semantics. In this model, a notion of undefined transitions is considered. The underlying semantics model is the Abstract Maximality-based Labeled Transition System (AMLTS). Hence, the model supports a definition of a hierarchical design methodology. The example of goods transportation is used for illustrating the approach. For the system assessment, the properties are expressed in CTL logic and verified using the verification environment FOCOVE (Formal Concurrency Verification Environment).