57 research outputs found
Recommended from our members
Testing a deterministic implementation against a non-controllable non-deterministic stream X-machine
A stream X-machine is a type of extended finite state machine with an associated development approach that consists of building a system from a set of trusted components. One of the great benefits of using stream X-machines for the purpose of specification is the existence of test generation techniques that produce test suites that are guaranteed to determine correctness as long as certain well-defined conditions hold. One of the conditions that is traditionally assumed to hold is controllability: this insists that all paths through the stream X-machine are feasible. This restrictive condition has recently been weakened for testing from a deterministic stream X-machine. This paper shows how controllability can be replaced by a weaker condition when testing
a deterministic system against a non-deterministic stream X-machine. This paper therefore develops a new, more general, test generation algorithm for testing from a non-deterministic stream X-machine
Testing Identifiable Kernel P Systems Using an X-machine Approach
This paper presents a testing approach for kernel P systems (kP systems),
based on the X-machine testing framework and the concept of cover automaton. The
testing methodology ensures that the implementation conforms the speci cations, under
certain conditions, such as the identi ably concept in the context of kernel P systems
X-Machine Based Testing for Cloud Services
In this article we present a tool designed for cloud service testing, able to generate test cases from a formal specification of the service, in form of a deterministic stream X-machine (DSXM) model. The paper summarizes the theoretical foundations of X-machine based testing and illustrates the usage of the developed tool on some examples. It shows in detail how the specification should be written, which are the design for test conditions it should satisfy, in order to assure the generation of high quality test suites for the cloud service
Learning cover context-free grammars from structural data
We consider the problem of learning an unknown context-free grammar when the
only knowledge available and of interest to the learner is about its structural
descriptions with depth at most The goal is to learn a cover
context-free grammar (CCFG) with respect to , that is, a CFG whose
structural descriptions with depth at most agree with those of the
unknown CFG. We propose an algorithm, called , that efficiently learns
a CCFG using two types of queries: structural equivalence and structural
membership. We show that runs in time polynomial in the number of
states of a minimal deterministic finite cover tree automaton (DCTA) with
respect to . This number is often much smaller than the number of states
of a minimum deterministic finite tree automaton for the structural
descriptions of the unknown grammar
Testing timed systems modeled by stream X-machines
Stream X-machines have been used to specify real systems where complex data structures. They are a variety of extended finite state machine where a shared memory is used to represent communications between the components of systems. In this paper we introduce an extension of the Stream X-machines formalism in order to specify systems that present temporal requirements. We add time in two different ways. First, we consider that (output) actions take time to be performed. Second, our formalism allows to specify timeouts. Timeouts represent the time a system can wait for the environment to react without changing its internal state. Since timeous affect the set of available actions of the system, a relation focusing on the functional behavior of systems, that is, the actions that they can perform, must explicitly take into account the possible timeouts. In this paper we also propose a formal testing methodology allowing to systematically test a system with respect to a specification. Finally, we introduce a test derivation algorithm. Given a specification, the derived test suite is sound and complete, that is, a system under test successfully passes the test suite if and only if this system conforms to the specification
Design and implementation of membrane controllers for trajectory tracking of nonholonomic wheeled mobile robots
YesThis paper proposes a novel trajectory tracking control approach for nonholonomic wheeled mobile robots. In this approach, the
integration of feed-forward and feedback controls is presented to design the kinematic controller of wheeled mobile robots, where the control law
is constructed on the basis of Lyapunov stability theory, for generating the precisely desired velocity as the input of the dynamic model of wheeled
mobile robots; a proportional-integral-derivative based membrane controller is introduced to design the dynamic controller of wheeled mobile
robots to make the actual velocity follow the desired velocity command. The proposed approach is defined by using an enzymatic numerical
membrane system to integrate two proportional-integral-derivative controllers, where neural networks and experts’ knowledge are applied to
tune parameters. Extensive experiments conducted on the simulated wheeled mobile robots show the effectiveness of this approach.The work of XW and GZ is supported by the National Natural Science Foundation of China (61170016, 61373047). The work of MG, FI and RL was supported by a grant of the Romanian National Authority for Scientific Research, CNCS-UEFISCDI (project number: PN-II-ID-PCE-2011-3-0688)
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
Recommended from our members
kPWorkbench: A software suit for membrane systems
YesMembrane computing is a new natural computing paradigm inspired by the functioning and structure of biological cells, and has been successfully applied to many different areas, from biology to engineering. In this paper, we present kPWorkbench, a software framework developed to support membrane computing and its applications. kPWorkbench offers unique features, including modelling, simulation, agent-based high performance simulation and verification, which allow modelling and computational analysis of membrane systems. The kPWorkbench formal verification component provides the opportunity to analyse the behaviour of a model and validate that important system requirements are met and certain behaviours are observed. The platform also features a property language based on natural language statements to facilitate property specification.EPSR
Leveraging Semantic Web Service Descriptions for Validation by Automated Functional Testing
Recent years have seen the utilisation of Semantic Web Service descriptions for automating a wide range of service-related activities, with a primary focus on service discovery, composition, execution and mediation. An important area which so far has received less attention is service validation, whereby advertised services are proven to conform to required behavioural specifications. This paper proposes a method for validation of service-oriented systems through automated functional testing. The method leverages ontology-based and rule-based descriptions of service inputs, outputs, preconditions and effects (IOPE) for constructing a stateful EFSM specification. The specification is subsequently utilised for functional testing and validation using the proven Stream X-machine (SXM) testing methodology. Complete functional test sets are generated automatically at an abstract level and are then applied to concrete Web services, using test drivers created from the Web service descriptions. The testing method comes with completeness guarantees and provides a strong method for validating the behaviour of Web services
Enabling Proactive Adaptation through Just-in-time Testing of Conversational Services
Service-based applications (SBAs) will increasingly be composed of third-party services available over the Internet. Reacting to failures of those third-party services by dynamically adapting the SBAs will become a key enabler for ensuring reliability. Determining when to adapt an SBA is especially challenging in the presence of conversational (aka. stateful) services. A conversational service might fail in the middle of an invocation sequence, in which case adapting the SBA might be costly; e.g., due to the necessary state transfer to an alternative service. In this paper we propose just-in-time testing of conversational services as a novel approach to detect potential problems and to proactively trigger adaptations, thereby preventing costly compensation activities. The approach is based on a framework for online testing and a formal test-generation method which guarantees functional correctness for conversational services. The applicability of the approach is discussed with respect to its underlying assumptions and its performance. The benefits of the approach are demonstrated using a realistic example
- …