Searcharxiv⌕ Search

arXiv subjects

José Ignacio Requeno Jarabo

Publications and source records attributed to José Ignacio Requeno Jarabo.

3 recordsLinked to original sources

QCRMut: Quantum Circuit Random Mutant generator tool

As quantum computing moves towards practical deployment, ensuring the reliability of quantum software becomes increasingly important. Mutation testing is a promising technique in this context; however, existing exhaustive mutation generators have primarily been developed for legacy versions of Qiskit (0.x), limiting their applicability to current stable releases. This work presents QCRMut, a mutation testing tool for quantum circuits compatible with stable Qiskit versions, which supports controlled preservation of circuit structure through immutable positions and enables efficient, representative random mutant generation as an alternative to exhaustive mutation. We develop QCRMut according to four design principles: unicity, similarity, representativity, and coverability. We evaluate the tool empirically by comparing mutation scores obtained from randomly sampled mutant subsets against those produced by exhaustive mutation over a benchmark suite of quantum circuits. We further analyse sensitivity to random seeds and apply statistical tests to assess the robustness of the observed differences. Finally, we compare QCRMut with existing mutation testing tools. Across the benchmark suite, randomly generated mutant subsets produced by QCRMut achieve mutation scores that are comparable to those obtained via exhaustive mutation. The results are stable across different random seeds and highlight practical limitations in existing approaches that are addressed by our method. Overall, QCRMut provides a practical and extensible solution for mutation testing of quantum circuits by combining compatibility with stable Qiskit releases, controlled structure preservation, statistically sound evaluation, and efficient mutant generation. In addition, it enables the mutation and analysis of circuits that cannot be handled by previous tools.

cs.SE↗

Efficient Construction of Reachability Graphs for Petri Net Product Lines

This paper presents a set of algorithms for computing the reachability graph of Petri Net Product Lines (PNPLs). These algorithms address the combined challenges of concurrency and variability that arise from product-line configurations. The proposed approach integrates symbolic state representations with family-based variability handling to generate a compact, parameterised reachability graph that captures behaviour across all products without exhaustive product enumeration. The main contributions are threefold. First, we introduce a symbolic state encoding adapted to PNPL semantics. Second, we define a family-preserving successor generation procedure that applies feature constraints during exploration. Third, we propose reduction techniques to mitigate state-space explosion, including on-the-fly merging of equivalent symbolic states and selective abstraction of irrelevant state details. We prove soundness and completeness of the construction with respect to standard per-product semantics and analyse computational complexity. An implementation integrated into our modelling tool demonstrates substantial savings in memory and time compared with naive product-based exploration, while preserving diagnostic and verification capabilities. The results indicate that the method enables practical reachability analysis for realistically sized product-line models, thereby facilitating verification and design-space exploration in configurable concurrent systems.

cs.FL↗

Coverage Analysis of Net Inscriptions in Coloured Petri Net Models

High-level Petri net such as Coloured Petri Nets (CPNs) are characterised by the combination of Petri nets and a high-level programming language. In the context of CPNs and CPN Tools, the inscriptions (e.g., arc expressions and guards) are specified using Standard ML (SML). The application of simulation and state space exploration (SSE) for validating CPN models traditionally focuses on behavioural properties related to net structure, i.e., places and transitions. This means that the net inscriptions are only implicitly validated, and the extent to which these have been covered is not made explicit. The contribution of this paper is an approach that establishes a link between coverage analysis known from programming languages and net inscriptions of CPN models. Specifically, we consider Modified Condition/Decision Coverage (MC/DC) which generalises branch coverage of SML decisions. We have implemented our approach in a library for CPN Tools comprised of an annotation and instrumentation mechanism that transparently intercept and collect evaluations of Boolean conditions, and a post-processing tool that determines whether each decision is MC/DC-covered by a set of models executions (runs). We evaluate our approach on four larger public-available CPN models.

cs.SE↗