DocumentCode :
2410701
Title :
Persistency and weak persistency in partial order based analysis
Author :
Hiraishi, Kunihiko
Author_Institution :
Sch. of Inf. Sci., Japan Adv. Inst. of Sci. & Technol., Ishikawa, Japan
Volume :
5
fYear :
1997
fDate :
12-15 Oct 1997
Firstpage :
4285
Abstract :
The purpose of the paper is to show how the results of Petri net theory can be applied to analysis of concurrent systems. State space explosion is known as one of the serious problems in the verification of concurrent systems. We focus on the partial order method, which was proposed to overcome this problem. In this method, a partial order defined on the set of transitions is used to obtain a reduced state space that preserves various properties to be verified. We give an interpretation of the partial order method by means of the theory of persistency and weak persistency of Petri nets
Keywords :
Petri nets; parallel algorithms; program verification; Petri net theory; concurrent systems analysis; concurrent systems verification; partial order based analysis; partial order method; reduced state space; state space explosion; weak persistency; Bipartite graph; Explosions; Logic; Petri nets; State-space methods; System recovery;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation., 1997 IEEE International Conference on
Conference_Location :
Orlando, FL
ISSN :
1062-922X
Print_ISBN :
0-7803-4053-1
Type :
conf
DOI :
10.1109/ICSMC.1997.637373
Filename :
637373
Link To Document :
بازگشت