Modeling and verification of the SDL-specified communication protocols using high-level Petri nets
Programming and Computing Software
Using coloured petri nets to model and verify telecommunications systems
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Automatic train control system development and simulation for high-speed railways
IEEE Circuits and Systems Magazine
A two-level approach for modeling and verification of telecommunication systems
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
| Hi-index | 0.00 |
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.