4,548 research outputs found
Formal Verification of P Systems with Active Membranes through Model Checking
Formal verification of P systems using model checking has
attracted a significant amount of research in recent years. However, up
to now only P systems with static structure have been considered. This
paper makes significant advances in this area by considering P systems
with active membranes, in particular P systems with division rules. The
paper presents a theoretical framework for addressing this problem and
reports on a complex case study involving a well-known NP-complete
problem solved using P systems with membrane division rules. This is
implemented in Promela and non trivial properties are verified using
Spin.Ministerio de Ciencia e Innovación TIN2009–13192Junta de Andalucía P08-TIC-0420
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
Investigating modularity in the analysis of process algebra models of biochemical systems
Compositionality is a key feature of process algebras which is often cited as
one of their advantages as a modelling technique. It is certainly true that in
biochemical systems, as in many other systems, model construction is made
easier in a formalism which allows the problem to be tackled compositionally.
In this paper we consider the extent to which the compositional structure which
is inherent in process algebra models of biochemical systems can be exploited
during model solution. In essence this means using the compositional structure
to guide decomposed solution and analysis.
Unfortunately the dynamic behaviour of biochemical systems exhibits strong
interdependencies between the components of the model making decomposed
solution a difficult task. Nevertheless we believe that if such decomposition
based on process algebras could be established it would demonstrate substantial
benefits for systems biology modelling. In this paper we present our
preliminary investigations based on a case study of the pheromone pathway in
yeast, modelling in the stochastic process algebra Bio-PEPA
Towards an Integrated Approach for Model Simulation, Property Extraction and Veri cation of P Systems
This paper presents an integrated approach for model simulation, property
extraction and formal veri cation of P systems, illustrated on a tissue P system with
active membranes solving the 3-colouring problem. The paper focuses on this problem
and reports the invariants and the properties extracted and veri ed using a series of tools
(Daikon, MeCoSim, Maple, Spin, ProB) and languages (P{Lingua, Promela, Event-B).
Appropriate tools and integration plugins, which facilitate and even automate the steps
involved in the aforementioned approach, have also been developed. The case study chosen
is complex (it involves an exponential growth of the number of states through the use of
membrane division rules) and the properties obtained are non-trivial.Ministerio de Ciencia e Innovación TIN2009–13192Junta de Andalucía P08–TIC–0420
An integrated model checking toolset for kernel P systems
P systems are the computational models introduced in the context of membrane computing, a computational paradigm within the more general area of unconventional computing. Kernel P (kP) systems are defined to unify the specification of different variants of P systems, motivated by challenging theoretical aspects and the need to model different problems. kP systems are supported by a software framework, called kPWORKBENCH, which integrates a set of related simulation and verification methodologies and tools. In this paper, we present an extension to kPWORKBENCH with a new model checking framework supporting the formal verification of kP system models. This framework supports both LTL and CTL properties. To make the property specification an easier task, we propose a property language, composed of natural language statements. We demonstrate our proposed methodology with an example
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
3-Col problem modelling using simple kernel P systems
This paper presents the newly introduced class of (simple) kernel P systems ((s)kP systems) and investigates
through a 3-colouring problem case study the expressive power and efficiency of kernel P systems. It
describes two skP systems that model the problem and analyses them in terms of efficiency and complexity.
The skP models prove to be more succinct (in terms of number of rules, objects, number of cells and
execution steps) than the corresponding tissue P system, available in the literature, that solves the same
problem, at the expense of a greater length of the rules.Ministerio de Ciencia e Innovación TIN2009–13192Junta de Andalucía P08-TIC-0420
Using A Kernel P System to Solve The 3-Col Problem
The newly introduced Kernel P systems offer an unitary and
elegant way of integrating established features of existing P system variants
with new elements with potential value for formal modelling. This
paper presents a case study illustrating the expressive power and efficiency
of kernel P systems on the 3-Col problem. The use of model
checking (in particular of Spin) for formal verification of kernel P systems
is also discussed and illustrated in this case.Ministerio de Ciencia e Innovación TIN2009–13192Junta de Andalucía P08–TIC–0420
- …