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

Towards Automated Verification of P Systems Using Spin

This paper presents an approach to P systems verification using the Spin model checker. A tool which implements the proposed approach has been developed and can automatically transform P system specifications from P-Lingua into Promela, the language accepted by the well known model checker Spin. The properties expected for the P system are specified using some patterns, representing high level descriptions of frequently asked questions, formulated in natural language. These properties are automatically translated into LTL specifications for the Promela model and the Spin model checker is run against them. In case a counterexample is received, the Spin trace is decoded and expressed as a P system computation. The tool has been tested on a number of examples and the results obtained are presented in the paper

Search-based testing using state-based fitness

Abstract , in order to find input parameters for a given path in a state machine which satisfy some given constraints for each transition. The approach level was adapted to correspond to all followed transitions from the machine path (instead of only critical branches like in structural testing [2]); the normalized branch level was derived from the predicate of the first unsatisfied transition constraint, using the same transformations as in structural search-based testin

Message from the A-MOST 2021 Workshop Chairs

yesWe are pleased to welcome you to the 17th edition of the Advances in Model-Based Testing Workshop (A-MOST 2021), collocated with the IEEE International Conference on Software Testing, Verification and Validation (ICST 2021)

Annual Innovative Engineering Research Conference Book of Abstracts

Ye

A modified membrane-inspired algorithm based on particle swarm optimization for mobile robot path planning

YesTo solve the multi-objective mobile robot path planning in a dangerous environment with dynamic obstacles, this paper proposes a modified membraneinspired algorithm based on particle swarm optimization (mMPSO), which combines membrane systems with particle swarm optimization. In mMPSO, a dynamic double one-level membrane structure is introduced to arrange the particles with various dimensions and perform the communications between particles in different membranes; a point repair algorithm is presented to change an infeasible path into a feasible path; a smoothness algorithm is proposed to remove the redundant information of a feasible path; inspired by the idea of tightening the fishing line, a moving direction adjustment for each node of a path is introduced to enhance the algorithm performance. Extensive experiments conducted in different environments with three kinds of grid models and five kinds of obstacles show the effectiveness and practicality of mMPSO.National Natural Science Foundation of China (61170016, 61373047), the Program for New Century Excellent Talents in University (NCET-11-0715) and SWJTU supported project (SWJTU12CX008); grant of the Romanian National Authority for Scientific Research, CNCSUEFISCDI, project number PN-II-ID-PCE- 2011-3-0688

P colonies and kernel P systems

YesP colonies, tissue-like P systems with very simple components, have received constant attention from the membrane computing community and in the last years several new variants of the model have been considered. Another P system model, namely kernel P system, integrating the most successfully used features of membrane systems, has recently attracted interest and some important developments have been reported. In this paper we study connections among several classes of P colonies and kernel P systems, by showing how the behaviour of these P colony systems can be represented as kernel P systems. An example illustrates the way it is modelled by using P colonies and kernel P systems and some properties of it are formally proved in the latter approach.Grant No. K 120558 of the NKFIH—National Research, Development, and Innovation Office, Hungary; Romanian National Authority for Scientific Research, CNCS-UEFISCDI (Project No. PN-III-P4-ID-PCE-2016-0210)

Message from A-MOST 2020 Chairs

yesWelcome to the 16th edition of the Advances in Model-Based Testing Workshop (A-MOST 2020) held on March 23rd, 2020 in Porto as part of ICST 2020, the IEEE International Conference on Software Testing, Verification and Validation

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

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