Scholarlink

Ochmański’s conjecture asserts that in a plain, pure and safe Petri net, and in the context of fairness, the existence of persistent permutations of finite computations allows one to deduce the existence of persistent permutations of infinite computations. In this paper, the conjecture is established for the class of pure and safe asymmetric choice Petri nets.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Persistent Permutations, Fairness, Asymmetric Choice Petri Nets, and Ochmański’s Conjecture

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Eike Best,
  • Raymond Devillers

摘要

Ochmański’s conjecture asserts that in a plain, pure and safe Petri net, and in the context of fairness, the existence of persistent permutations of finite computations allows one to deduce the existence of persistent permutations of infinite computations. In this paper, the conjecture is established for the class of pure and safe asymmetric choice Petri nets.