RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Model. Anal. Inform. Sist.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Model. Anal. Inform. Sist., 2015, Volume 22, Number 4, Pages 563–577 (Mi mais460)  

This article is cited in 1 scientific paper (total in 1 paper)

A method of sample models of program construction in terms of Petri nets

D. I. Kharitonova, E. A. Golenkova, G. V. Tarasovab, D. V. Leontyevba

a Institution of Russian Academy of Sciences Institute of Automation and Control Processes Far Eastern Branch of the RAS, 5 Radio str., Vladivostok, Russia, 690041
b Far-Eastern Federal University, 8 Suhanova st., Vladivostok, Russia, 690950

Abstract: 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.
The article is published in the author's wording.

Keywords: program model, control flow model, Petri net object.

Funding Agency Grant Number
Russian Academy of Sciences - Federal Agency for Scientific Organizations 0262-2014-0157
Russian academy of sciences fundamental research program "Fundamental problems of mathematical modelling"


DOI: https://doi.org/10.18255/1818-1015-2015-4-563-577

Full text: PDF file (321 kB)
References: PDF file   HTML file

Bibliographic databases:

UDC: 519.681.2
Received: 01.09.2015
Language:

Citation: 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”, Model. Anal. Inform. Sist., 22:4 (2015), 563–577

Citation in format AMSBIB
\Bibitem{KhaGolTar15}
\by D.~I.~Kharitonov, E.~A.~Golenkov, G.~V.~Tarasov, D.~V.~Leontyev
\paper A method of sample models of program construction in terms of Petri nets
\jour Model. Anal. Inform. Sist.
\yr 2015
\vol 22
\issue 4
\pages 563--577
\mathnet{http://mi.mathnet.ru/mais460}
\crossref{https://doi.org/10.18255/1818-1015-2015-4-563-577}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3418474}
\elib{http://elibrary.ru/item.asp?id=24273055}


Linking options:
  • http://mi.mathnet.ru/eng/mais460
  • http://mi.mathnet.ru/eng/mais/v22/i4/p563

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. D. I. Kharitonov, G. V. Tarasov, D. V. Leontev, “Programmnaya realizatsiya metoda generatsii setei Petri bolshogo razmera”, Sistemy i sredstva inform., 28:2 (2018), 99–115  mathnet  crossref  elib
  • Моделирование и анализ информационных систем
    Number of views:
    This page:138
    Full text:63
    References:18

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020