Cover Image

Non-interference analysis of bounded labeled Petri nets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ran, Ning, Wu, Zhengguang, Zhang, Shaokang, He, Zhou, Seatzu, Carla
Format:	Preprint
Published:	2025
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

[Draft] High-order estimation-based properties and high-order observers for labeled finite-state automata
by: Zhang, Kuize, et al.
Published: (2024)

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

State estimation of timed automata under partial observation [Draft version]
by: Gao, Chao, et al.
Published: (2024)

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

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

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

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

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

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

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

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

Diagnosability of labeled $\mathfrak{D_p}$ automata
by: Zhang, Kuize, et al.
Published: (2021)

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

Mining Diamonds in labeled Transition Systems
by: van Spaendonck, P. H. M., et al.
Published: (2025)

Soundness of reset workflow nets
by: Blondin, Michael, et al.
Published: (2025)

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

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

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

A quadratic lower bound for 2DFAs against one-way liveness
by: Adeogun, Kehinde, et al.
Published: (2026)

Completely reachable automata: a quadratic decision algorithm and a quadratic upper bound on the reaching threshold
by: Ferens, Robert, et al.
Published: (2022)

Separability and Non-Determinizability of WSTS
by: Czerwiński, Wojciech, et al.
Published: (2023)

Iterating Non-Aggregative Structure Compositions
by: Bozga, Marius, et al.
Published: (2025)

Non-Global Parikh Tree Automata
by: Herrmann, Luisa, et al.
Published: (2024)

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

Non-deterministic asynchronous automata games and their undecidability
by: Adsul, Bharat, et al.
Published: (2024)

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

Unconditional Time and Space Complexity Lower Bounds for Intersection Non-Emptiness
by: Wehar, Michael
Published: (2025)

Query Learning of Advice and Nominal Automata
by: Zhou, Kevin
Published: (2024)

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

Maximal 2-dimensional binary words of bounded degree
by: Massé, Alexandre Blondin, et al.
Published: (2025)

The Quadratic State Cost of Classical Simulation of One-Way Quantum Finite Automata
by: Chen, Zeyu, et al.
Published: (2026)

Exact Separation of Words via Trace Geometry
by: Chen, Zeyu, et al.
Published: (2026)

Model Checking for Multi-Agent Systems Modeled By Epistemic Process Calculus
by: Yu, Qixian, et al.
Published: (2025)

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

Structural Abstraction and Refinement for Probabilistic Programs
by: Li, Guanyan, et al.
Published: (2025)

Automated generation of attack trees with optimal shape and labelling
by: Gadyatskaya, Olga, et al.
Published: (2023)

Automated Formal Verification of Area-Optimized Safety Registers in Automotive SoCs
by: Zhang, Shuhang, et al.
Published: (2025)

Learning Deterministic Multi-Clock Timed Automata
by: Teng, Yu, et al.
Published: (2024)

Compositional Abstraction for Timed Systems with Broadcast Synchronization
by: Chen, Hanyue, et al.
Published: (2025)

Verification and Enforcement of Strong State-Based Opacity for Discrete-Event Systems
by: Han, Xiaoguang, et al.
Published: (2024)