TITLE

Universal petri net

AUTHOR(S)
Zaitsev, D.
PUB. DATE
July 2012
SOURCE
Cybernetics & Systems Analysis;Jul2012, Vol. 48 Issue 4, p498
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
A universal inhibitor Petri net executing an arbitrary given inhibitor Petri net is constructed. An inhibitor Petri net graph, its marking, and transition firing sequence are encoded as 10 scalar nonnegative integer variables and are represented by the corresponding places of the universal net. An algorithm using only these scalar variables and executing an arbitrary inhibitor net is developed based on the state equation and is encoded by the universal inhibitor Petri net. Subnets that implement arithmetic, comparison, and copy operations are employed.
ACCESSION #
79824078

 

Related Articles

  • Turing Compute Model for Non-negative Binary Numbers. Chen Wenyu; Wang Xiaobin; Cheng Xiaoou; Sun Shixin // Journal of Software (1796217X);Jan2010, Vol. 5 Issue 1, p123 

    Turing-computable issue is important in research of Turing Machine and has significant value in both theory and practice. The paper analyzes Turing-computable issue of non-negative numbers by relational operations(includes greater than, less than and equal) and arithmetic operations(includes add...

  • De/compositional Mw Automaton-Based Reachability Algorithm. Korečko, Štefan; Hudák, Štefan; Doboš, Jozef; Šimoňák, Slavomír // Egyptian Computer Science Journal;Sep2013, Vol. 37 Issue 6, p19 

    This paper introduces a new reachability problem (RP) solving algorithm for the (pure) place/transition nets. This algorithm combines the existing Mw automaton-based method with the de/compositional approach called T-junction. The existing method is built around a special type of finite state...

  • The basic theory of infinite time register machines. Carl, Merlin; Fischbach, Tim; Koepke, Peter; Miller, Russell; Nasfi, Miriam; Weckbecker, Gregor // Archive for Mathematical Logic;Mar2010, Vol. 49 Issue 2, p249 

    Infinite time register machines (ITRMs) are register machines which act on natural numbers and which are allowed to run for arbitrarily many ordinal steps. Successor steps are determined by standard register machine commands. At limit times register contents are defined by appropriate limit...

  • Formal methods for analysis of discrete systems using a specification language. Kryvyi, S.; Chugayenko, A. // Cybernetics & Systems Analysis;Jul2009, Vol. 45 Issue 4, p528 

    A realization of an algorithm that translates an MSC diagram (an MSC document) into an event equivalent Petri net is described, and the correctness of the algorithm is proved. The net obtained in this way can be used to analyze properties of the original MSC document. The mentioned algorithm is...

  • Finite-state automata in information technologies. Kryvyi, S. // Cybernetics & Systems Analysis;Sep2011, Vol. 47 Issue 5, p669 

    A short review of applications of finite-state automata in some modern areas of computer science and technologies is presented. In particular, fields of application of finite-state automata in computer algebra, Petri nets, biology, and verification are considered.

  • Parallel computation of continuous Petri nets based on hypergraph partitioning. Ding, Zuohua; Shen, Hui; Cao, Jianwen // Journal of Supercomputing;Oct2012, Vol. 62 Issue 1, p345 

    Continuous Petri net can be used for performance analysis or static analysis. The analysis is based on solving the associated ordinary differential equations. This paper presents a method to parallel compute these differential equations. We first map the Petri net to a hypergraph, and then...

  • Identification of one-place-unbounded Petri nets from their modified coverability graph. Ji, Guangyou; Wang, Mingzhe // Transactions of the Institute of Measurement & Control;Jun2014, Vol. 36 Issue 4, p487 

    This paper presents the problem of identifying a one-place unbounded Petri net. Given an unlabelled graph that represents the modified coverability graph of a net, we establish a Petri net model whose modified coverability graph is isomorphic to the unlabelled graph, and that can identify the...

  • Simulating Turing Machines Using Colored Petri Nets with Priority Transitions. Javan, A.; Akhavan, M.; Moeini, A. // International Journal on Recent Trends in Engineering & Technolo;Jul2013, Vol. 9 Issue 1, p75 

    In this paper, we present a new way to simulate Turing machines using a specific form of Petri nets such that the resulting nets are capable of thoroughly describing behavior of the input Turing machines. We model every element of a Turing machine's tuple (i.e.,Q, ɣ, b, Σ, δ, q0, F)...

  • Fluid Limits for Many-Server Systems with Reneging Under a Priority Policy. Atar, Rami; Kaspi, Haya; Shimkin, Nahum // Mathematics of Operations Research;Aug2014, Vol. 39 Issue 3, p672 

    A multiclass many-server system is considered, in which customers are served according to a nonpreemptive priority policy and may renege while waiting to enter service. The service and reneging time distributions satisfy mild conditions. Building on an approach developed by Kaspi and Ramanan,...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sign out of this library

Other Topics