On Preservation of Liveness in Synthesis Processes of Petri Net Systems
Weiming Lü
Abstract
Weiming Lü
Abstract
The synthesis process is an important bottom-up approach on modeling Petri net systems, and the preservation of properties also is a significant problem in study of synthesis process of Petri net systems. This paper summarizes our works on preservation of liveness in two synthesis processes, namely, synchronous and sharing processes. The difference from other works is that our approaches are based on concurrent language. An operation is defined to express the concurrent composition of paths, and a concurrent language formula of corresponding synthesis process is established, and it can be applied to judge the liveness and deadlock-freeness of synthesized system. Meanwhile, some criteria are introduced, which are necessary and sufficient for liveness and deadlock-freeness. Finally, some conditions are proposed to preserve the liveness and deadlock-freeness of composite system.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The synthesis process is an important bottom-up approach on modeling Petri net systems, and the preservation of properties also is a significant problem in study of synthesis process of Petri net systems. This paper summarizes our works on preservation of liveness in two synthesis processes, namely, synchronous and sharing processes. The difference from other works is that our approaches are based on concurrent language. An operation is defined to express the concurrent composition of paths, and a concurrent language formula of corresponding synthesis process is established, and it can be applied to judge the liveness and deadlock-freeness of synthesized system. Meanwhile, some criteria are introduced, which are necessary and sufficient for liveness and deadlock-freeness. Finally, some conditions are proposed to preserve the liveness and deadlock-freeness of composite system.
Key concepts: Liveness, Petri net, Deadlock, Computer science, Process (computing), Distributed computing, Process architecture, Programming language