Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2510.17582

Help | Advanced Search

Computer Science > Formal Languages and Automata Theory

arXiv:2510.17582 (cs)
[Submitted on 20 Oct 2025 ]

Title: Non-interference analysis of bounded labeled Petri nets

Title: 有界标记Petri网的非干扰性分析

Authors:Ning Ran, Zhengguang Wu, Shaokang Zhang, Zhou He, Carla Seatzu
Abstract: This paper focuses on a fundamental problem on information security of bounded labeled Petri nets: non-interference analysis. As in hierarchical control, we assume that a system is observed by users at different levels, namely high-level users and low-level users. The output events produced by the firing of transitions are also partitioned into high-level output events and low-level output events. In general, high-level users can observe the occurrence of all the output events, while low-level users can only observe the occurrence of low-level output events. A system is said to be non-interferent if low-level users cannot infer the firing of transitions labeled with high-level output events by looking at low-level outputs. In this paper, we study a particular non-interference property, namely strong non-deterministic non-interference (SNNI), using a special automaton called SNNI Verifier, and propose a necessary and sufficient condition for SNNI.
Abstract: 本文专注于有界标记Petri网信息安全的一个基本问题:非干扰性分析。 如同分层控制一样,我们假设系统被不同级别的用户观察,即高级用户和低级用户。 由转换触发产生的输出事件也被划分为高级输出事件和低级输出事件。 一般来说,高级用户可以观察所有输出事件的发生,而低级用户只能观察低级输出事件的发生。 如果低级用户无法通过查看低级输出来推断出标记为高级输出事件的转换的触发,则该系统被认为是无干扰的。 在本文中,我们使用一种称为SNNI验证器的特殊自动机来研究一种特定的非干扰性属性,即强非确定性非干扰(SNNI),并提出了SNNI的必要且充分条件。
Subjects: Formal Languages and Automata Theory (cs.FL)
Cite as: arXiv:2510.17582 [cs.FL]
  (or arXiv:2510.17582v1 [cs.FL] for this version)
  https://doi.org/10.48550/arXiv.2510.17582
arXiv-issued DOI via DataCite

Submission history

From: Ning Ran [view email]
[v1] Mon, 20 Oct 2025 14:31:43 UTC (52 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
cs.FL
< prev   |   next >
new | recent | 2025-10
Change to browse by:
cs

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号