Imagen de Portada

Efficient Construction of Reachability Graphs for Petri Net Product Lines

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gómez-Martínez, Elena, Jarabo, José Ignacio Requeno
Formato:	Preprint
Publicado:	2026
Materias:	Formal Languages and Automata Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Synthesizing Petri Nets from Labelled Petri Nets using Token Trail Regions
por: Bergenthum, Robin, et al.
Publicado: (2026)

Correctness Notions for Petri Nets with Identifiers
por: van der Werf, Jan Martijn E. M., et al.
Publicado: (2022)

Well-Formed Free-Choice Petri Nets Revisited
por: Jancar, Petr, et al.
Publicado: (2026)

Invariants and Home Spaces in Transition Systems and Petri Nets
por: Memmi, Gerard
Publicado: (2023)

Collaboration Miner: Discovering Collaboration Petri Nets (Extended Version)
por: Benzin, Janik-Vasily, et al.
Publicado: (2024)

Semiflows, Home Spaces, and Home States, Applications to the Analysis of Parameterized Petri Nets
por: Memmi, Gerard
Publicado: (2025)

Extended time Petri nets
por: Radom, Marcin, et al.
Publicado: (2024)

Persistent Permutability in Choice Petri Nets
por: Best, Eike, et al.
Publicado: (2026)

Secret Protection in Labeled Petri Nets
por: Haar, Stefan, et al.
Publicado: (2025)

Reachability in Trace-Pushdown Systems
por: Köcher, Chris, et al.
Publicado: (2025)

Non-interference analysis of bounded labeled Petri nets
por: Ran, Ning, et al.
Publicado: (2025)

Reachability in VASS Extended with Integer Counters
por: Bizière, Clotilde, et al.
Publicado: (2026)

On the Separability Problem of VASS Reachability Languages
por: Keskin, Eren, et al.
Publicado: (2024)

Box-Reachability in Vector Addition Systems
por: Almagor, Shaull, et al.
Publicado: (2025)

Completely Reachable Almost Group Automata
por: Torres, David Fernando Casas
Publicado: (2024)

CIR+CVN: Bridging LLM Semantic Understanding and Petri-Net Verification for Concurrent Programs
por: Zhang, Kaiwen, et al.
Publicado: (2026)

Separators in Continuous Petri Nets
por: Blondin, Michael, et al.
Publicado: (2022)

Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
por: Bizière, Clotilde, et al.
Publicado: (2024)

On-The-Fly Algorithm for Reachability in Parametric Timed Games (Extended Version)
por: Dahlsen-Jensen, Mikael Bisgaard, et al.
Publicado: (2024)

DRAMPyML: A Formal Description of DRAM Protocols with Timed Petri Nets
por: Christ, Derek, et al.
Publicado: (2026)

Efficient Constructions of Finite-State Independent Normal Pairs
por: Pulari, Subin
Publicado: (2026)

Reachability in symmetric VASS
por: Kamiński, Łukasz, et al.
Publicado: (2025)

TARZAN: A Region-Based Library for Forward and Backward Reachability of Timed Automata (Extended Version)
por: Manini, Andrea, et al.
Publicado: (2026)

Maximal and minimal dynamic Petri net slicing
por: Llorens, Marisa, et al.
Publicado: (2021)

Reasoning about Rare-Event Reachability in Stochastic Vector Addition Systems via Affine Vector Spaces
por: Jeppson, Joshua, et al.
Publicado: (2025)

Finite Automata for Efficient Graph Recognition
por: Drewes, Frank, et al.
Publicado: (2024)

Modelling and Analysis of Supply Chains using Product Time Petri Nets
por: Lubat, Eric, et al.
Publicado: (2026)

Relating Reversible Petri Nets and Reversible Event Structures, categorically
por: Melgratti, Hernán, et al.
Publicado: (2023)

Waiting Nets: State Classes and Taxonomy
por: Hélouët, Loïc, et al.
Publicado: (2022)

Petri Nets-based Methods on Automatically Detecting for Concurrency Bugs in Rust Programs
por: Zhang, Kaiwen, et al.
Publicado: (2022)

GrappaRE -- A Tool for Efficient Graph Recognition Based on Finite Automata and Regular Expressions
por: De Rosa, Mattia, et al.
Publicado: (2025)

Two-Way One-Counter Nets Revisited
por: Almagor, Shaull, et al.
Publicado: (2024)

The Power-Set Construction for Tree Algebras
por: Blumensath, Achim
Publicado: (2022)

A Close Analysis of the Subset Construction
por: Baburin, Ivan, et al.
Publicado: (2024)

On Shuffling and Splitting Automata
por: Cunningham, Ignacio Mollo
Publicado: (2024)

Reachability Analysis of the Domain Name System
por: Nevatia, Dhruv, et al.
Publicado: (2024)

Systems of Graph Formulas and their Equivalence to Alternating Graph Automata
por: Drewes, Frank, et al.
Publicado: (2025)

Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages
por: Angluin, Dana, et al.
Publicado: (2022)

Constructing Deterministic Parity Automata from Positive and Negative Examples
por: Bohn, León, et al.
Publicado: (2023)

Deciding Reachability and the Covering Problem with Diagnostics for Sound Acyclic Free-Choice Workflow Nets
por: Prinz, Thomas M., et al.
Publicado: (2026)