Petri net based model checking for the collaborative-ness of multiple processes systems
Abstract: In many distributed environments, multiple processes both interact/collaborate with each other and share some common resources. To model and analyze such systems, this paper defines a class of Petri nets called Parallel Processes Net (P2N). A P2N composes of a group of Single-process Nets (SNs). Each SN models a process and these SNs are connected via a set of places. Some of these places represent the common resources shared by these processes, and others represent the channels through which messages are transferred among these processes. We define collaborative-ness for P2Ns which requires that each process of a modeled system never enters into a deadlock or livelock state. The collaborative-ness can be represented by a CTL (Computational Tree Logic) formula and thus can be checked (for bounded P2Ns) by using some Petri net tools such as INA.
Loading