Nov 8, 2021 · A strong computer can be thought of as a nondeterministic computation represented by a Petri net reachability graph (tree) compared to an exact ...

Nov 8, 2021 · Abstract. Petri net paradigm of computing is concerned discussing basic types of Petri net computers and their relations.

We developed a technique of parametric specification of Petri nets, built of a few connected components which are repeated depending on a parameter or a set of ...

We construct explicitly a Petri net that is a strong computer of double exponent after R.J. Lipton. Its nondeterministic computation is represented by a Petri ...

Published in International Journal of Parallel, Emergent and Distributed Systems by Informa UK Limited. 2021 p1-20. Type article-journal. Stage published

Fingerprint. Dive into the research topics of 'From strong to exact Petri net computers'. Together they form a unique fingerprint.

For Petri nets, Rabin introduced a concept of a weak Petri net computer, to prove that the reachability set inclusion/equivalence problem is undecidable [1] ...

The model illustrates difference beween weak, strong, and exact Petri net computers [1]. The generated for parameter k net. [2] counts 22k as a strong computer ...

Jan 22, 2022 · It is known that a Sleptsov net, with multiple firing a transition at a step, runs exponentially faster than a Petri net opening prospects for ...

The computational power of Petri nets is extended up to the power of counter machines by realizing certain priorities of parallelism.