A Method of Sample Models of Program Construction in Terms of Petri Nets
In the article a method of automated construction of Petri nets simulating the behaviour of imperative programs is considered from the formal point of view. Petri net samples with certain characteristics are necessary in programming new algorithms for program analysis; in particular, they can be use...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2015-08-01
|
| Series: | Моделирование и анализ информационных систем |
| Subjects: | |
| Online Access: | https://www.mais-journal.ru/jour/article/view/273 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849338814759174144 |
|---|---|
| author | D. I. Kharitonov E. A. Golenkov G. V. Tarasov D. V. Leontyev |
| author_facet | D. I. Kharitonov E. A. Golenkov G. V. Tarasov D. V. Leontyev |
| author_sort | D. I. Kharitonov |
| collection | DOAJ |
| description | In the article a method of automated construction of Petri nets simulating the behaviour of imperative programs is considered from the formal point of view. Petri net samples with certain characteristics are necessary in programming new algorithms for program analysis; in particular, they can be used for developing or optimizing algorithms of Petri nets compositions and decompositions, building the reachability tree, checking invariants and so on. The generation process consists of two stages. At the first stage, construction templates for a resulting net and parameters for construction are described. With the help of these parameters it is possible to regulate the final size and the absolute or relative amount of certain structures in the resulting net. At the second stage, iterative process of automated net construction is used for Petri net generation of any size, limited only by an available computer memory. In the first section of the article the minimum necessary definitions are given and a new version of Petri nets composition operation by places is introduced. Commutative and associative properties of introduced binary operation allow to synchronize any number of Petri nets in arbitrary order. Then construction template is defined as a marked Petri net with input and output interfaces and rules for templates composition using this interfaces. A number of construction templates can be united in a collection, for which the evolution rules are defined. The completeness property of a collection guarantees that the collection evolution results in a Petri net that simulates the imperative program behavior. The article provides a version of the construction templates complete collection and an example of Petri net simulating sequential imperative program construction. |
| format | Article |
| id | doaj-art-ca9a4cf0579e49609b50e4962c9641e9 |
| institution | Kabale University |
| issn | 1818-1015 2313-5417 |
| language | English |
| publishDate | 2015-08-01 |
| publisher | Yaroslavl State University |
| record_format | Article |
| series | Моделирование и анализ информационных систем |
| spelling | doaj-art-ca9a4cf0579e49609b50e4962c9641e92025-08-20T03:44:18ZengYaroslavl State UniversityМоделирование и анализ информационных систем1818-10152313-54172015-08-0122456357710.18255/1818-1015-2015-4-563-577259A Method of Sample Models of Program Construction in Terms of Petri NetsD. I. Kharitonov0E. A. Golenkov1G. V. Tarasov2D. V. Leontyev3Institution of Russian Academy of Sciences Institute of Automation and Control Processes Far Eastern Branch of the RASInstitution of Russian Academy of Sciences Institute of Automation and Control Processes Far Eastern Branch of the RASInstitution of Russian Academy of Sciences Institute of Automation and Control Processes Far Eastern Branch of the RAS Far-Eastern Federal UniversityInstitution of Russian Academy of Sciences Institute of Automation and Control Processes Far Eastern Branch of the RAS Far-Eastern Federal UniversityIn the article a method of automated construction of Petri nets simulating the behaviour of imperative programs is considered from the formal point of view. Petri net samples with certain characteristics are necessary in programming new algorithms for program analysis; in particular, they can be used for developing or optimizing algorithms of Petri nets compositions and decompositions, building the reachability tree, checking invariants and so on. The generation process consists of two stages. At the first stage, construction templates for a resulting net and parameters for construction are described. With the help of these parameters it is possible to regulate the final size and the absolute or relative amount of certain structures in the resulting net. At the second stage, iterative process of automated net construction is used for Petri net generation of any size, limited only by an available computer memory. In the first section of the article the minimum necessary definitions are given and a new version of Petri nets composition operation by places is introduced. Commutative and associative properties of introduced binary operation allow to synchronize any number of Petri nets in arbitrary order. Then construction template is defined as a marked Petri net with input and output interfaces and rules for templates composition using this interfaces. A number of construction templates can be united in a collection, for which the evolution rules are defined. The completeness property of a collection guarantees that the collection evolution results in a Petri net that simulates the imperative program behavior. The article provides a version of the construction templates complete collection and an example of Petri net simulating sequential imperative program construction.https://www.mais-journal.ru/jour/article/view/273program modelcontrol flow modelpetri net object |
| spellingShingle | D. I. Kharitonov E. A. Golenkov G. V. Tarasov D. V. Leontyev A Method of Sample Models of Program Construction in Terms of Petri Nets Моделирование и анализ информационных систем program model control flow model petri net object |
| title | A Method of Sample Models of Program Construction in Terms of Petri Nets |
| title_full | A Method of Sample Models of Program Construction in Terms of Petri Nets |
| title_fullStr | A Method of Sample Models of Program Construction in Terms of Petri Nets |
| title_full_unstemmed | A Method of Sample Models of Program Construction in Terms of Petri Nets |
| title_short | A Method of Sample Models of Program Construction in Terms of Petri Nets |
| title_sort | method of sample models of program construction in terms of petri nets |
| topic | program model control flow model petri net object |
| url | https://www.mais-journal.ru/jour/article/view/273 |
| work_keys_str_mv | AT dikharitonov amethodofsamplemodelsofprogramconstructionintermsofpetrinets AT eagolenkov amethodofsamplemodelsofprogramconstructionintermsofpetrinets AT gvtarasov amethodofsamplemodelsofprogramconstructionintermsofpetrinets AT dvleontyev amethodofsamplemodelsofprogramconstructionintermsofpetrinets AT dikharitonov methodofsamplemodelsofprogramconstructionintermsofpetrinets AT eagolenkov methodofsamplemodelsofprogramconstructionintermsofpetrinets AT gvtarasov methodofsamplemodelsofprogramconstructionintermsofpetrinets AT dvleontyev methodofsamplemodelsofprogramconstructionintermsofpetrinets |