This paper provides a true-concurrency approach for the specification and verification of systems of concurrent communicating agents with durable actions. We present high-level Petri nets with durable actions (DaHL) to cope with various details in such complex systems. We define a DaHL module as an open variant of time-dependent colored Petri nets. A DaHL system is a fused set of modules for systems consisting of concurrent agents which can interact with each other. We also introduce hybrid-based reachability graph that covers the entire state space of DaHL systems with a true-concurrency semantics. We show that such reachability graph allows us to check important properties such as deadlock-freeness, liveness, home space, and reversibility, and also to predict timing properties prior to real implementation. A case study is used to model and analyze a simple scenario where autonomous vehicles are able to transport containers freely in an enterprise environment.

本文为使用持久动作的并发通信代理系统的规范和验证提供了一种真正的并发方法。我们提供具有持久作用（DaHL）的高级Petri网，以应对此类复杂系统中的各种细节。我们将DaHL模块定义为时间相关的有色Petri网的开放变体。DaHL系统是由可相互交互的并发代理组成的系统的一组融合模块。我们还介绍了基于混合的可达性图，该图使用真实并发语义覆盖了DaHL系统的整个状态空间。我们证明了这种可达性图使我们能够检查重要特性，例如无死锁，活泼，居家空间和可逆性，并且可以在实际实现之前预测时序特性。