Recursive Algorithms and their Representation by the Sequential Petri Nets

Result code in 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>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Recursive Algorithms and their Representation by the Sequential Petri Nets
Original language description
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
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

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

Similar results(10)