2025-02-23T06:30:13-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22journaliasakpiua-article-279774%22&qt=morelikethis&rows=5
2025-02-23T06:30:13-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22journaliasakpiua-article-279774%22&qt=morelikethis&rows=5
2025-02-23T06:30:13-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T06:30:13-05:00 DEBUG: Deserialized SOLR response
Модифікація мереж Петрі з антисипацією по позиції
We propose a modification of Petri nets with strong anticipation on a position. The extension modifies a transition rule by adding a new term that contains an integer function of the new marking in the position. The differences from classic Petri nets are found; for example, the set of markings that...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Ukrainian |
| Published: |
The National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute"
2023
|
| Subjects: | |
| Online Access: | http://journal.iasa.kpi.ua/article/view/279774 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | We propose a modification of Petri nets with strong anticipation on a position. The extension modifies a transition rule by adding a new term that contains an integer function of the new marking in the position. The differences from classic Petri nets are found; for example, the set of markings that are reachable from a current marking by firing the enabled transition can either be empty or contain more than one marking. We consider the construction of a reachability graph and a coverability tree. We give the conditions for the existence of the coverability tree and propose the algorithm for constructing the coverability tree that generalizes the well-known classic algorithm. The main ideas and constructions are illustrated in the examples. |
|---|