437 research outputs found
Search Based Software Engineering in Membrane Computing
This paper presents a testing approach for kernel P Systems (kP systems),
based on test data generation for a given scenario. This method uses Genetic Algorithms
to generate the input sets needed to trigger the given computation steps
Efficient Algorithms for Envy-Free Stick Division With Fewest Cuts
Given a set of n sticks of various (not necessarily different) lengths, what
is the largest length so that we can cut k equally long pieces of this length
from the given set of sticks? We analyze the structure of this problem and show
that it essentially reduces to a single call of a selection algorithm; we thus
obtain an optimal linear-time algorithm.
This algorithm also solves the related envy-free stick-division problem,
which Segal-Halevi, Hassidim, and Aumann (AAMAS, 2015) recently used as their
central primitive operation for the first discrete and bounded envy-free cake
cutting protocol with a proportionality guarantee when pieces can be put to
waste.Comment: v3 adds more context about the proble
Modelling of Multi-Agent Systems: Experiences with Membrane Computing and Future Challenges
Formal modelling of Multi-Agent Systems (MAS) is a challenging task due to
high complexity, interaction, parallelism and continuous change of roles and
organisation between agents. In this paper we record our research experience on
formal modelling of MAS. We review our research throughout the last decade, by
describing the problems we have encountered and the decisions we have made
towards resolving them and providing solutions. Much of this work involved
membrane computing and classes of P Systems, such as Tissue and Population P
Systems, targeted to the modelling of MAS whose dynamic structure is a
prominent characteristic. More particularly, social insects (such as colonies
of ants, bees, etc.), biology inspired swarms and systems with emergent
behaviour are indicative examples for which we developed formal MAS models.
Here, we aim to review our work and disseminate our findings to fellow
researchers who might face similar challenges and, furthermore, to discuss
important issues for advancing research on the application of membrane
computing in MAS modelling.Comment: In Proceedings AMCA-POP 2010, arXiv:1008.314
Test generation from P systems using model checking
This paper presents some testing approaches based on model checking and using different testing criteria. First, test sets are built from different Kripke structure representations. Second, various rule coverage criteria for transitional, non-deterministic, cell-like P systems, are considered in order to generate adequate test sets. Rule based coverage criteria (simple rule coverage, context-dependent rule coverage and variants) are defined and, for each criterion, a set of LTL (Linear Temporal Logic) formulas is provided. A codification of a P system as a Kripke structure and the sets of LTL properties are used in test generation: for each criterion, test cases are obtained from the counterexamples of the associated LTL formulas, which are automatically generated from the Kripke structure codification of the P system. The method is illustrated with an implementation using a specific model checker, NuSMV. (C) 2010 Elsevier Inc. All rights reserved
Kernel P Systems Modelling, Testing and Veri cation
A kernel P system (kP system, for short) integrates in a coherent and elegant
manner many of the P system features most successfully used for modelling various
applications and, consequently, it provides a framework for analyzing these models. In
this paper, we illustrate the modeling capabilities of kernel P systems by showing how
other classes of P systems can be represented with this formalism and providing a number
of kP system models for sorting algorithms. Furthermore, the problem of testing systems
modelled as kP systems is also discussed and a test generation method based on automata
is proposed. We also demonstrate how formal veri cation can be used to validate that
the given models work as desired
Factorisation in the semiring of finite dynamical systems
Finite dynamical systems (FDSs) are commonly used to model systems with a
finite number of states that evolve deterministically and at discrete time
steps. Considered up to isomorphism, those correspond to functional graphs. As
such, FDSs have a sum and product operation, which correspond to the direct sum
and direct product of their respective graphs; the collection of FDSs endowed
with these operations then forms a semiring. The algebraic structure of the
product of FDSs is particularly interesting. For instance, an FDS can be
factorised if and only if it is composed of two sub-systems running in
parallel. In this work, we further the understanding of the factorisation,
division, and root finding problems for FDSs. Firstly, an FDS is
cancellative if one can divide by it unambiguously, i.e. implies . We prove that an FDS is cancellative if and only if it has a fixpoint.
Secondly, we prove that if an FDS has a -th root (i.e. such that
), then it is unique. Thirdly, unlike integers, the monoid of FDS
product does not have unique factorisation into irreducibles. We instead
exhibit a large class of monoids of FDSs with unique factorisation. To obtain
our main results, we introduce the unrolling of an FDS, which can be viewed as
a space-time expansion of the system. This allows us to work with (possibly
infinite) trees, where the product is easier to handle than its counterpart for
FDSs
Model Checking Based Test Generation from P Systems Using P-Lingua
This paper presents an approach for P system testing, that uses model-
checking for automatic test generation and P-Lingua as specification language. This
approach is based on a transformation of the transitional, non-deterministic, cell-like
P system into a Kripke structure, which is further used for test generation, by adding
convenient temporal logic specifications. This paper extends our previous work in this
field to multi-membrane, transitional P system, having cooperative rules, communication between membranes and membrane dissolution. A tool, which takes as input a P
system specified in P-Lingua and translates it into the language accepted by the model
checker NuSMV was developed and used for test case generation. Some hints regarding
the automatic test generation using NuSMV and P-Lingua are also given
Efficient simulation of tissue-like P systems by transition cell-like P systems
In the framework of P systems, it is known that the construction of exponential
number of objects in polynomial time is not enough to efficiently solve NP-complete
problems. Nonetheless, it could be sufficient to create an exponential number of membranes
in polynomial time. Working with P systems whose membrane structure does not
increase in size, it is known that it is not possible to solve computationally hard problems
(unless P = NP), basically due to the impossibility of constructing exponential number of
membranes, in polynomial time, using only evolution, communication and dissolution
rules. In this paper we show how a family of recognizer tissue P systems with symport/
antiport rules which solves a decision problem can be efficiently simulated by a family of
basic recognizer P systems solving the same problem. This simulation allows us to transfer
the result about the limitations in computational power, from the model of basic cell-like P
systems to this kind of tissue-like P systems.Ministerio de Educación y Ciencia TIN2006-13425Junta de Andalucía TIC-58
- …