AI 中文总结
针对仅可直接观测部分迁移的P时间事件图，基于时间事件图的经典Luenberger观测器，设计算法以准确估计其迁移触发时间，解决了含上下界停留时间约束的离散事件系统的状态估计问题。
AI 中文摘要
P时间事件图（P-TEGs）是可对同步和延迟现象建模的离散事件系统，它们扩展了时间事件图（TEGs）的建模能力，不仅包含库所中托肯停留时间的下界约束，还包含上界约束。本研究假设仅能直接观测部分迁移，考虑估计P-TEGs中迁移触发时间的问题，基于已成为经典的TEGs的Luenberger观测器，设计了一种算法，该算法考虑了P-TEGs上界约束带来的额外限制，以获得更准确的触发时间估计。
英文摘要
P-Time Event Graphs (P-TEGs) are discrete event systems able to model synchronization and delay phenomena. They extend the modeling power of Timed Event Graphs (TEGs) by including not only lower-bound, but also upper-bound constraints on the sojourn times of tokens in places. In this work, we consider the problem of estimating the firing time of transitions in P-TEGs, assuming that only a subset of transitions can be directly observed. Building on the (now classical) Luenberger observer for TEGs, we design an algorithm that takes into account the additional restrictions posed by the upper-bound constraints of P-TEGs to obtain a more accurate firing time estimation.
Comments6 pages double column, 1 figure, accepted for presentation at IFAC World Congress 2026
