位置/变迁系统中的抽象进程与冲突
计算机科学中的逻辑
2021-03-03 v1
摘要
对于单安全 Petri 网或条件/事件系统，由 Carl Adam Petri 所定义的进程提供了一种以偏序反映因果依赖的系统运行概念。Goltz 与 Reisig 通过依据因果历史区分令牌，将这一概念推广到库所携带多个令牌的网。然而，这种所谓的个体令牌解释常被认为过于细致。本文我们确定了一类 Petri 网的子类，称为结构冲突网，其中由于令牌多重性导致的冲突与并发之间的相互作用不会发生。对于该子类，我们将抽象进程定义为 Goltz-Reisig 进程的等价类。我们证明了当且仅当底层网相对于规范的冲突概念是无冲突时，存在最大的抽象进程，从而为该方法提供了依据。
引用
@article{arxiv.2103.01490,
title = {Abstract Processes and Conflicts in Place/Transition Systems},
author = {Rob van Glabbeek and Ursula Goltz and Jens-Wolfhard Schicke-Uffmann},
journal= {arXiv preprint arXiv:2103.01490},
year = {2021}
}
备注
The results of this paper appeared before in arXiv:2103.00729. However, there they were formulated differently, as we didn't have the current concept of a largest abstract process. Our proofs are conceptually much simpler than the ones in arXiv:2103.00729, as they are carried out directly on abstract processes, rather than via the auxiliary concepts of BD-runs and FS-runs. arXiv admin note: text overlap with arXiv:1103.5916