Recursive Algorithms and their Representation by the Sequential Petri Nets

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27510%2F12%3A86081440" target="_blank" >RIV/61989100:27510/12:86081440 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Recursive Algorithms and their Representation by the Sequential Petri Nets

Popis výsledku v původním jazyce

Sequential Petri nets are the newly introduced class of Petri nets, whose definition is the main topic of this paper; they feature certain new and original concepts and can be successfully used at a design, modeling and verification of multithreading programming systems executing in parallel or distributed environment. In this paper basic characteristics of sequential Petri nets are very briefly presented including possibilities in their definition of newly introduced tokens as non-empty finite sequences over the set of non-negative integer numbers and the mechanism of the firing of transitions significantly increase modeling capabilities of this class of Petri nets at the modeling of multithreading programming systems. Sequential Petri nets can be used also in the area of recursive algorithms modeling and this fact is demonstrated on the examples. Sequential Petri Nets are also the initial step to the definition of sequential object Petri nets within the framework of which all paradig

Název v anglickém jazyce

Recursive Algorithms and their Representation by the Sequential Petri Nets

Popis výsledku anglicky

Sequential Petri nets are the newly introduced class of Petri nets, whose definition is the main topic of this paper; they feature certain new and original concepts and can be successfully used at a design, modeling and verification of multithreading programming systems executing in parallel or distributed environment. In this paper basic characteristics of sequential Petri nets are very briefly presented including possibilities in their definition of newly introduced tokens as non-empty finite sequences over the set of non-negative integer numbers and the mechanism of the firing of transitions significantly increase modeling capabilities of this class of Petri nets at the modeling of multithreading programming systems. Sequential Petri nets can be used also in the area of recursive algorithms modeling and this fact is demonstrated on the examples. Sequential Petri Nets are also the initial step to the definition of sequential object Petri nets within the framework of which all paradig

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

Rok uplatnění

2012

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

ECON '12

ISSN

1803-3865

e-ISSN

—

Svazek periodika

21

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

CZ - Česká republika

Počet stran výsledku

14

Strana od-do

27-40

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—