Towards Petri net calculi based on synchronization via places

Anisimov, Nikolay A.; Kovalenko, A.

doi:10.1109/aispas.1995.401330

Cited by 1 publication

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The most widely used is a nets composition by transitions [3,14], but there are variations of nets composition operations by places [10], and also by places and transitions [15]. We introduce the operation of Petri nets composition by places using the scheme proposed in articles [2,5]. In our case, the goal is to minimize the algorithmic complexity of the operation implementation.…”

Section: Definition 2 Formal Union Of Petri Nets Let Us Given Two Pmentioning

confidence: 99%

“…In our case, the goal is to minimize the algorithmic complexity of the operation implementation. The name "simple point of access" is used to distinguish this access point from the ones introduced in the articles [2,5]. Further in the text instead of the full name "simple access point by places" abbreviation "simple access point" may be used or even just "access point".…”

Section: Definition 2 Formal Union Of Petri Nets Let Us Given Two Pmentioning

confidence: 99%

See 1 more Smart Citation

A Method of Sample Models of Program Construction in Terms of Petri Nets

Kharitonov¹,

Golenkov²,

Tarasov³

et al. 2015

Model. anal. inf. sist.

View full text Add to dashboard Cite

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.

show abstract

Section: Definition 2 Formal Union Of Petri Nets Let Us Given Two Pmentioning

confidence: 99%

Section: Definition 2 Formal Union Of Petri Nets Let Us Given Two Pmentioning

confidence: 99%