loading...
Verification of Distributed Systems Modelled by High-Level Petri Nets
Warsaw, Poland September 22-September 25
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PCEE.2002.1115202International Conference on Parallel ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
V. E. Kozura, Sibirian Division of the Russian Academy of Sciences
V. A. Nepomniaschy, Sibirian Division of the Russian Academy of Sciences
R. M. Novikov, Sibirian Division of the Russian Academy of Sciences
A tool PNV (Petri net verifier) designed for analysis, modelling and verification of coloured Petri nets (CPN) is presented in the paper. The tool consists of two main components: a translator which generates an internal form of CPN and a C++ program modelling the input CPN, and a model-checking component which is applied to CPN limited by finite state systems when properties are presented in mu-calculus. Moreover, the translator generates a program in Pascal extended by a nondeterministic construct in order to model and verify the input CPN. The model-checking component uses the internal form of CPN and includes a model constructor which generates the reachability graph of CPN, and a model-checker. The paper describes a model-checking experiment with CPN which model the ring communication protocol [7]. An ineffectiveness of the ring protocol is proven by the experiment, and a modified effective ring protocol is verified too.
Citation:
V. E. Kozura, V. A. Nepomniaschy, R. M. Novikov, "Verification of Distributed Systems Modelled by High-Level Petri Nets," parelec, pp.61, International Conference on Parallel Computing in Electrical Engineering (PARELEC'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.