Cover Image

Synthesizing Petri Nets from Labelled Petri Nets using Token Trail Regions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bergenthum, Robin, Kovář, Jakub
Format:	Preprint
Published:	2026
Subjects:	Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

Efficient Construction of Reachability Graphs for Petri Net Product Lines
by: Gómez-Martínez, Elena, et al.
Published: (2026)

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

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

Separators in Continuous Petri Nets
by: Blondin, Michael, et al.
Published: (2022)

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

Extended time Petri nets
by: Radom, Marcin, et al.
Published: (2024)

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

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

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

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

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

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

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

A Synthesis Method of Safe Rust Code Based on Pushdown Colored Petri Nets
by: Zhang, Kaiwen, et al.
Published: (2026)

Bi-reachability in Petri nets with data
by: Kamiński, Łukasz, et al.
Published: (2024)

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

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

Decidability Issues for Petri Nets -- a survey
by: Esparza, Javier, et al.
Published: (2024)

Simulation Limitations of Affine Cellular Automata
by: Hudcová, Barbora, et al.
Published: (2023)

Token Games and History-Deterministic Quantitative-Automata
by: Boker, Udi, et al.
Published: (2021)

The 2-Token Theorem: Recognising History-Deterministic Parity Automata Efficiently
by: Lehtinen, Karoliina, et al.
Published: (2025)

Synthesizing DSLs for Few-Shot Learning
by: Krogmeier, Paul, et al.
Published: (2025)

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

On History-Deterministic One-Counter Nets
by: Prakash, Keya, et al.
Published: (2022)

One Adaptive Trailing Head Can Outperform Many Oblivious Trailing Heads
by: Cruz, Julianne, et al.
Published: (2026)

Tokenization as Finite-State Transduction
by: Cognetta, Marco, et al.
Published: (2024)

Nets-within-Nets through the Lens of Data Nets
by: Di Cosmo, Francesco, et al.
Published: (2025)

On asymptotically automatic sequences
by: Konieczny, Jakub
Published: (2023)

On the Complexity of the Secret Protection Problem for Discrete-Event Systems
by: Masopust, Tomáš, et al.
Published: (2025)

From Sound Workflow Nets to LTLf Declarative Specifications by Casting Three Spells
by: Barbaro, Luca, et al.
Published: (2025)

Behaviorally Correct Learning from Informants
by: Mohrin, Niklas
Published: (2025)

Synthesising Asynchronous Automata from Fair Specifications
by: Bérard, Béatrice, et al.
Published: (2025)

Passive Learning of Lattice Automata from Recurrent Neural Networks
by: Slimi, Jaouhar, et al.
Published: (2025)

Synthesis from LTL with Reward Optimization in Sampled Oblivious Environments
by: Raskin, Jean-François, et al.
Published: (2024)

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

$ω$-regular Expression Synthesis from Transition-Based Büchi Automata
by: Pert, Charles, et al.
Published: (2024)