3 papers
cs.FL2026
Efficient Construction of Reachability Graphs for Petri Net Product Lines
Elena Gómez-Martínez, José Ignacio Requeno Jarabo
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…
cs.SE2024
QCRMut: Quantum Circuit Random Mutant generator tool
Sinhué García Gil, Luis Llana Díaz, José Ignacio Requeno Jarabo
As quantum computing moves towards practical deployment, ensuring the reliability of quantum software becomes increasingly important. Mutation testing is a promising technique in t…
cs.SE2020
Coverage Analysis of Net Inscriptions in Coloured Petri Net Models
Faustin Ahishakiye, José Ignacio Requeno Jarabo, Lars Michael Kristensen +1
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 Too…