Petri net as a modeling tool

Abstract Over the last decade, Petri nets have emerged as a most suitable, powerful and widely acceptable modeling tool for representing and studying the asynchronous concurrent hardware (or software) systems/processes. Petri nets can be viewed as formal automata or as an automation which can generate the formal languages or a model to analyse and synthesize various kinds of systems. The structure of Petri nets, their markings, extensions and subclasses are briefly discussed. Several examples of Petri net models of computer hardware and software are presented. Various applications of reachability concepts are also given.

[1]  G. S. Hura.  Petri net approach to the analysis of a structured program , 1982 .

[2]  Tilak Agerwala,et al.  Special Feature: Putting Petri Nets to Work , 1979, Computer.

[3]  G. S. Hura.  A Petri net approach to minimize rom in microprogrammed digital computers , 1981 .

[4]  Tilak Agerwala,et al.  Comments on capabilities, limitations and “correctness” of Petri nets , 1973, ISCA 1973.

[5]  Gary James Nutt,et al.  The formulation and application of evaluation nets , 1972 .

[6]  Michel Hack,et al.  ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS , 1972 .

[7]  Jean-Loup Baer,et al.  Model, Design, and Evaluation of a Compiler for a Parallel Processing Environment , 1977, IEEE Transactions on Software Engineering.

[8]  Narsingh Deo,et al.  Graph Theory with Applications to Engineering and Computer Science , 1975, Networks.

[9]  A.A. Khan,et al.  On the determination of the solution of a class of Murata's state equation of Petri nets , 1981, Proceedings of the IEEE.

[10]  Gary J. Nutt,et al.  Macro E-Nets for Representation of Parallel Systems , 1973, IEEE Transactions on Computers.

[11]  Jerre D. Noe.  Nets in Modeling and Simulation , 1979, Advanced Course: Net Theory and Applications.

[12]  Tilak Krishna Mahesh Agerwala,et al.  Towards a theory for the analysis and synthesis of systems exhibiting concurrency. , 1975 .

[13]  Suhas S. Patil,et al.  COORDINATION OF ASYNCHRONOUS EVENTS , 1970 .

[14]  Wesley A. Clark.  Macromodular computer systems , 1967, AFIPS '67 (Spring).

[15]  N. K. Nanda,et al.  A Petri net approach to the evaluation of the complexity of a program , 1981 .

[16]  T Murata,et al.  Reduction and expansion of live and safe marked graphs. , 1979 .

[17]  Jack B. Dennis.  Modular, asynchronous control structures for a high performance processor , 1970 .

[18]  G. S. Hura.  A petri net approach to enumerate all system success paths for reliability evaluation of a complex system , 1982 .

[19]  R. M Shapiro,et al.  A new approach to optimization of sequencing decisions , 1970 .

[20]  Tadao Murata,et al.  Circuit theoretic analysis and synthesis of marked graphs , 1977 .

[21]  Kurt Lautenbach,et al.  Use of Petri Nets for Proving Correctness of Concurrent Process Systems , 1974, IFIP Congress.

[22]  C. A. Petri.  Communication with automata , 1966 .

[23]  G. S. Hura,et al.  Optimization of assembly code generation using Petri nets , 1980 .

[24]  Gary J. Nutt.  Evaluation nets for computer system performance analysis , 1972, AFIPS '72 (Fall, part I).

[25]  Amir Pnueli,et al.  Marked Directed Graphs , 1971, J. Comput. Syst. Sci..

[26]  Tadao Murata,et al.  Relevance of network theory to models of distributed/parallel processing☆ , 1980 .

[27]  T. Murata.  State equation, controllability, and maximal matchings of petri nets , 1977 .