Title :
A simulation method of Petri nets by conflict-free ones
Author_Institution :
Inst. of Eng. Cybern., Acad. of Sci., Minsk, Byelorussia
Abstract :
The main problem of this paper is to decide whether a net is safe and persistent. This problem has application at the verification of systems. To decide this problem we propose a method of simulation of ordinary Petri nets by conflict-free ones and prove a proposition about behaviour equivalence of two classes of safe Petri nets: persistent nets and labelled conflict-free nets, which are the result of simulation of persistent nets. The behaviour equivalence proves to be a necessary and sufficient condition for an ordinary net to be safe and persistent
Keywords :
Petri nets; formal verification; simulation; Petri nets; behaviour equivalence; labelled conflict-free nets; necessary condition; persistent nets; simulation; sufficient condition; system verification; Analytical models; Concurrent computing; Cybernetics; Petri nets; Sufficient conditions;
Conference_Titel :
Emerging Technologies and Factory Automation, 1995. ETFA '95, Proceedings., 1995 INRIA/IEEE Symposium on
Conference_Location :
Paris
Print_ISBN :
0-7803-2535-4
DOI :
10.1109/ETFA.1995.496810