A systematic approach to generate test cases based on combinations of information

Software based systems incrementally provide critical services to users. Mobile telephone systems, for example, are used in circumstances in which the malfunctioning may have disastrous consequences. During the last years, software has been incorporated in devices used in daily life, such as audio and television. The diversity of systems in which software is incorporated is increasing. Thus, the software development process has to consider a variety of speci ¯cation techniques and models, incorporating also techniques from engineering sciences. In particular, the validation and veri¯cation processes have to be adapted to these new developments. For example, the testing based solely on the software speci¯cation is incomplete. First, there is an implicit objective to verify that the program works correctly (as in the testing model of the 1957{1978, [GH88]). Myers [Mye83] says that with the aim of demonstrating that a program does not fail, we can unconsciously select data that has a low probability of exposing faults. On the other hand, if the objective is to demonstrate that a program has faults, test data will have a higher probability of revealing them. In specification-based testing we select data for which the desired behavior for the system is defined. As stated by Boris Beizer [Bei95] testing should include both clean and dirty tests. Dirty tests are designed to \break" the software; clean tests are designed to demonstrate that software executes correctly. Specifications only provide clean tests.Eje: Ingeniería de Software y Base de DatosRed de Universidades con Carreras en Informática (RedUNCI

A systematic approach to generate test cases based on combinations of information

Software based systems incrementally provide critical services to users. Mobile telephone systems, for example, are used in circumstances in which the malfunctioning may have disastrous consequences. During the last years, software has been incorporated in devices used in daily life, such as audio and television. The diversity of systems in which software is incorporated is increasing. Thus, the software development process has to consider a variety of speci ¯cation techniques and models, incorporating also techniques from engineering sciences. In particular, the validation and veri¯cation processes have to be adapted to these new developments. For example, the testing based solely on the software speci¯cation is incomplete. First, there is an implicit objective to verify that the program works correctly (as in the testing model of the 1957{1978, [GH88]). Myers [Mye83] says that with the aim of demonstrating that a program does not fail, we can unconsciously select data that has a low probability of exposing faults. On the other hand, if the objective is to demonstrate that a program has faults, test data will have a higher probability of revealing them. In specification-based testing we select data for which the desired behavior for the system is defined. As stated by Boris Beizer [Bei95] testing should include both clean and dirty tests. Dirty tests are designed to \break" the software; clean tests are designed to demonstrate that software executes correctly. Specifications only provide clean tests.Eje: Ingeniería de Software y Base de DatosRed de Universidades con Carreras en Informática (RedUNCI

Duration calculus semantics for statecharts

Statecharts and Duration Calculus are two formalisms used in the development of reactive systems. Statecharts provide a powerful visual formalism to specify systems. Duration Calculus is a formal logic to specify and reason about temporal requeriments. In this work, we propose a description of statecharts semantics using Duration Calculus. Thus we build a common semantic model for Duration Calculus speci¯cations and statecharts. The formalization is done in two steps. First, the structure of a statechart is represented using Duration Calculus formula. Then, the semantics of the execution of a step is introduced.Eje: TeoríaRed de Universidades con Carreras en Informática (RedUNCI

Duration calculus semantics for statecharts

Statecharts and Duration Calculus are two formalisms used in the development of reactive systems. Statecharts provide a powerful visual formalism to specify systems. Duration Calculus is a formal logic to specify and reason about temporal requeriments. In this work, we propose a description of statecharts semantics using Duration Calculus. Thus we build a common semantic model for Duration Calculus speci¯cations and statecharts. The formalization is done in two steps. First, the structure of a statechart is represented using Duration Calculus formula. Then, the semantics of the execution of a step is introduced.Eje: TeoríaRed de Universidades con Carreras en Informática (RedUNCI

Implementation of Algorithm of Petri Nets Distributed Synthesis into FPGA

In the paper an implementation of algorithm of Petri net array-based synthesis is presented. The method is based on decomposition of colored interpreted macro Petri net into subnets. The structured encoding of places in subnets is done of using minimal numbers of bits. Microoperations, which are assigned to places, are written into distributed and flexible memories. It leads to realization of a logic circuit in a two-level concurrent structure, where the combinational circuit of the first level is responsible for firing transitions, and the second level memories are used for generation of microoperations. This algorithm is implemented in C# and delivered as a stand alone library

Duration calculus semantics for statecharts

Statecharts and Duration Calculus are two formalisms used in the development of reactive systems. Statecharts provide a powerful visual formalism to specify systems. Duration Calculus is a formal logic to specify and reason about temporal requeriments. In this work, we propose a description of statecharts semantics using Duration Calculus. Thus we build a common semantic model for Duration Calculus speci¯cations and statecharts. The formalization is done in two steps. First, the structure of a statechart is represented using Duration Calculus formula. Then, the semantics of the execution of a step is introduced.Eje: TeoríaRed de Universidades con Carreras en Informática (RedUNCI