Petri Nets: Properties, Analysis and Applications

Proceedings of the IEEE

Volumn 77, Issue 4, 1989, Pages 541-580

  Murata, Tadao ^a  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; SYSTEMS ANALYSIS;

CONCURRENT SYSTEM MODEL; LOGIC PROGRAMMING; PETRI NETS; REACHABILITY CRITERIA; STOCHASTIC NETS;

MATHEMATICAL TECHNIQUES;

EID: 0024645936     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/5.24143     Document Type: Article

References (315)

1. C.A. Petri, “Kommunikation mitAutomaten.” Bonn:lnsti-tut fiir Instrumentelle Mathematik, Schriften des MM Nr. 3, 1962. Also, English translation, “Communication with Automata.” New York: Griffiss Air Force Base. Tech. Rep. RADC-TR-65–377, vol. 1, Suppl. 1, 1966.
2. C.A. Petri, “Fundamentals of a theory of asynchronous information flow,” in Proc. IFIP Congress 62, pp. 386–390, 1963.
3. A.W. Holt, H. Saint, R. Shapiro, and S. Warshall, Final Report of the Information Systems Theory Project, Tech. Rep. RADC-TR-68–305. New York: Griffiss Air Force Base, Sept. 1968.
4. A.W. Holt and F. Commoner, “Events and conditions,” Princeton, N.J., Applied Data Research Inc., Information System Theory Project, 1970. Also, Record Project MAC Conf. Concurrent Systems Parallel Computation, pp. 3–52, 1970.
5. A.W. Holt, “Introduction to occurrence systems,” in-4sso-ciative Information Techniques, L. Jacks, Ed. New York: American Elsevier, pp. 175–203, 1971.
6. R.M. Shapiro and H. Saint, “A new approach to optimization of sequencing decisions,” Ann. Rev. Automatic Programming, vol. 6, no. 5, pp. 257–288, 1970.
7. F. Commoner, A.W. Holt, S. Even, and A. Pnueli, “Marked directed graphs,” J. Comput. Syst. Sci., vol. 5, pp. 511–523, 1971.
8. F. Commoner, “Deadlocks in Petri nets,” Wakefield, Applied Data Research, Inc., Report #CA-7206–2311, 1972.
9. J.B. Dennis, Ed., Record Project MAC Conf. Concurrent Systems and Parallel Computation, June 1970, 199 pages.
10. J.L. Peterson, Petri Net Theory and the Modeling of Systems. Englewood Cliffs, N): Prentice-Hall, Inc., 1981.
11. W. Reisig, Petri Nets, EATCS Monographs on Theoretical Computer Science, vol. 4. New York: Springer-Verlag, 1985.
12. T. Agerwala, “Putting Petri nets to work,” Computer, vol. 12, no. 12, pp. 85–94, Dec. 1979.
13. R. Johnsonbaugh and T. Murata, “Petri nets and marked graphs-mathematical models of concurrent computation,” The American Math. Monthly, vol. 89, no. 8, pp. 552–566, Oct. 1982.
14. J.L. Peterson, “Petri nets,” ACM Computing Surveys, vol. 9, no. 3, pp. 223–252, Sept. 1977.
15. W. Brauer, Ed., Net Theory and Applications, Lecture Notes in Computer Science (LNCS), vol. 84. New York: Springer-Verlag, 1980, out of print.
16. W. Brauer, W. Reisig, and G. Rozenberg, Eds., Petri Nets: Central Models and Their Properties, Lecture Notes in Computer Science (LNCS), vol. 254, New York: Springer-Verlag, 1987.
17. W. Brauer, W. Reisig, and G. Rozenberg, (Eds.), Petri Nets: Applications and Relationships to Other Models of Concurrency, Lecture Notes in Computer Science (LNCS), vol. 255. New York: Springer-Verlag, 1987.
18. C.A. Petri, “Concurrency theory,” in LNCS, vol. 254 [16].
19. C.A. Petri, “Forgotten topics” of net theory,” in LNCS, vol. 255 [17].
20. C. Giraultand W. Reisig, Eds., Application and Theory of Petri Nets, Selected Papers from the First and Second European Workshop on Applications and Theory of Petri Nets, Informatik-Fachberichte, Band 52. New York: Springer-Verlag, 1982.
21. A. Pagnoni and G. Rozenberg, Ed. Applications and Theory of Petri Nets, Selected Papers from the 3rd European Workshop on Applications and Theory of Petri Nets, Varenna, Italy, Sept. 1982. Informatik-Fachberichte, Band 66. New York: Springer-Verlag, 1983, out of print.
22. G. Rozenberg, Ed. Advances in Petri Nets 1984, Lecture Notes in Computer Science, vol. 188. New York: Springer-Verlag, 1985.
23. G. Rozenberg, Ed. Advances in Petri Nets 1985, Lecture Notes in Comptuer Science, vol. 222. New York: Springer-Verlag, 1986.
24. G. Rozenberg, Ed. Advances in Petri Nets 1987, Lecture Notes in Computer Science, vol. 266. New York: Springer-Verlag, 1987.
25. K. Voss, H.J. Genrich, and G. Rozenberg, Eds. Concurrency and Nets, Special volume in the series “Advances in Petri Nets.” New York: Springer-Verlag, 1987.
26. S. Dress, D. Gomm, H. Plunneke, W. Reisig, and R. Walter, “Bibliography of Petri Nets,” in LNCS, vol. 266 [24], pp. 319–451.
27. Petri Net Newsletters (published three times a year by Gesellschaft fiir Informatik, Postfach 1669, D-5300 Bonn 1, W. Germany, from which subscription applications forms can be obtainedJ.
28. Proc. Int. Workshop Timed Petri Nets, Torino, Italy, July 1–3, 1985, 1985, 307 pages.
29. Proc. Int. Workshop Petri Nets and Performance Models, Madison, Wl, August 24–26, 1987, 1987, 184 pages.
30. M. Ajmone Marsan, G. Balbo, and G. Conte, Performance Models of Multiprocessor Systems. Cambridge MA: The MIT Press, 1987.
31. M. Ajmone Marsan, G. Conte, and G. Balbo, “A class of generalized Petri nets for the performance evaluation of multiprocessor systems,” ACM Trans. Comput. Sys., vol. 2, no. 2, pp. 93–122, May 1984.
32. M. Ajmone Marsan and G. Chiola, “On Petri nets with deterministic and exponential transition firing times,” in LNCS, vol. 266 [24], pp. 132–145, 1987.
33. H.H. Ammar, Y.F. Huang, and R.W. Liu, “Hierarchical models for systems reliability, maintainability, and availability,” IEEE Trans. Circuits Syst, vol. 34, no. 6, pp. 629–638, June 1987.
34. J.B. Dugan, K.S. Trivedi, R.M. Geist, and V.F. Nicola, “Extended stochastic Petri nets: Applications and analysis,” PERFORMANCE ′84, Models of Comput. System Performance, in Proc. 10th Int. Symp., Paris, E. Gelenbe, Ed. Amsterdam: Elsevier, pp. 507–519, 1984.
35. K. Garg, “An approach to performance specification of communication protocols using timed Petri nets,” IEEE Trans. Software Eng., vol. SE-11, no. 10, pp. 1216–1225, Oct. 1985.
36. M.A. Holiday and Mary K. Venon, “A generalized timed Petri net model for performance analysis,” IEEE Trans. Software Eng., vol. SE-13, no. 12, pp. 1297–1310, Dec. 1987.
37. P.J. Hass and G.S. Shedler, “Stochastic Petri net representation of discrete event simulation,” in the special section in Petri net performance models in IEEE Trans. Software Eng., vol. 15, no. 4, pp. 381–393, Apr. 1989; an earlier version in [29].
38. J. Magott, “Performance evaluation of concurrent systems using Petri nets,” Inform. Processing Lett., vol. 18, no. 1, pp. 7–13, 1984.
39. J.F. Meyer, A. Movaghar, and W.H. Sanders, “Stochastic activity networks: structure behaviour and application,” in Proc. Int. Workshop Timed Petri Nets, Torino, Italy, July 1-3, 1985, pp. 106–115, 1985.
40. M.K. Molloy, “Performance analysis using stochastic Petri nets,” IEEE Trans. Computers, vol. C-31, no. 9, pp. 913–917, Sep. 1982.
41. M.K. Molloy, “Discrete time stochastic Petri nets,” IEEE Trans. Software Eng., vol. SE-11, no. 4, pp. 417–423, April 1985.
42. T. Murata, “Use of resource-time product concept to derive a performance measure of timed Petri nets,” in Proc. 1985 Midwest Symp. Circuits Systems, Aug. 19–20, 1985.
43. J.D. Noe and G.J. Nutt, “Macro E-nets for representation of parallel systems,” IEEE Trans. Comp., vol. TC-22, no. 8, pp. 718–727, Aug. 1973.
44. K. Onaga, K. Tani, and S.P. Chan, “Modeling and scheduling of resource-sharing concurrent processes in networks of recurrent multiprograms and multi-PERTs,” in Proc. 14th Asilomar Conf. Circuits, Systems, Computers, D.E. Kirk, Ed., pp. 168–172, 1981.
45. C.V. Ramamoorthy and G.S. Ho, “Performance evaluation of asynchronous concurrent systems using Petri nets,” IEEE Trans. Software Eng., vol. SE-6, no. 5, pp. 440–449, Sept. 1980.
46. C. Ramchandani, “Analysis of asynchronous concurrent systems by timed Petri nets,” Cambridge, MA: MIT, Project MAC, Tech. Rep. 120, Feb. 1974.
47. S.D. Shapiro, “A stochastic Petri net with applications to modelling occupancy times for concurrent task systems,” Networks, vol. 9, no. 4, pp. 375–379, 1979.
48. J. Sifakis, “Use of Petri nets for performance evaluation,” Acta Cybernet., vol. 4, no. 2, pp. 185–202, 1978.
49. K. Tani and T. Murata, “Scheduling parallel computations with storage constraints,” in Proc. 12th Annual Asilomar Conf. Circuits, Systems, Computers, Nov. 1978, pp. 736–743.
50. W.M. Zuberek, “M-timed Petri nets, priorities, preemptions, and performance evaluation of systems,” in Lecture Notes in Computer Science, Vol. 222. New York: Springer-Verlag, pp. 478–498, 1986.
51. G. Berthelot and R. Terrat, “Petri nets theory for the correctness of protocols,” IEEE Trans. Commun., vol. COM-30, no. 12, pp. 2497–2505, Dec. 1982.
52. G. Bochmann and J. Gecsel, “A unified method for the specification and verification of protocols,” Information Processing 77, IFIP, B. Gilchrist, Ed. Amsterdam: North-Holland, pp. 229–234, 1977.
53. M. Diaz and P. Azema, “Petri net based models for the specification and validation of protocols,” in Lecture Notes in Computer Science, vol. 188. New York: Springer-Verlag, pp. 101–121, 1985.
54. M. Diaz, “Modeling and analysis of communication and cooperation protocols using Petri net based models,” Corn-put Networks, vol. 6, pp. 419–441, Dec. 1982.
55. G. Florin and S. Natkin, “Evaluation based upon stochastic Petri nets of the maximum throughput of a full duplex protocol,” in Informatik-Fachberichte 52 [20]. New York: Springer-Verlag, pp. 208–288, 1982.
56. G. Juanole, B. Algayres, and J. Dufau, “On communication protocol modeling and design,” in LNCS, vol. 188, [22], pp. 267–287.
57. I. Lopez, “The use of GALI LEO to represent and analyze telecommunications protocols,” in Proc. 2nd Europ. Workshop Appl. Theory Petri Nets, Sept. 1981, pp. 377–410.
58. P.M. Merlin, “A methodology for the design and implementation of communication protocols,” IEEE Trans. Commun. vol. COM-24, no. 6, pp. 614–621, June 1976.
59. P.M. Merlin and D.J. Farber, “Recoverability of communication protocols: I mplications of a theoretical study,” IEEE Trans. Communs., vol. COM-24, no. 9, pp. 1036–1043, Sept. 1976.
60. R. Razoukand G. Estrin, “Modeling and verification of communication protocols in SARA: The X.21 interface,” IEEE Trans. Comput., vol. C-29, no. 12, Dec. 1980, pp. 1038–1052.
61. F.J.W. Symons, “Development and application of Petri net based techniques in Australia,” in Concurrency and Nets [25], pp. 497–510, 1987.
62. G.R. Wheeler, M.C. Wilbur-Ham, J. Billington, and J.A. Gil- mour, “Protocol analysis using numerical Petri nets,” in lecture Notes in Computer Science, vol. 222 [23], pp. 435–452, 1986.
63. P. Azema and B. Berthomieu, “The design and validation by Petri nets of a mechanism for the invocation of remote servers,” Information Processing80, S.H. Lavington, Ed., pp. 599–604, 1980.
64. P. Azema, G. Juanole, E. Sanchis, and M. Montbernard, “Specification and verification of distributed systems using PROLOG interpreted Petri nets,” in Proc. 7th Int. Conf. Software Eng., Orlando, USA, 1984, pp. 510–518, 1984.
65. G. Estrin, R.S. Fenchel, R.R. Razouk, and M.K. Vernon, “SARA (System ARchitects Apprentice): Modeling, analysis, and simulation support for design of concurrent systems,” IEEE Trans. Software Eng., vol. SE-12, pp. 293–311, Feb. 1986.
66. B. Kramer, “Stepwise construction of non-sequential software system using a net-based specification language,” in LNCS, vol. 188 [22], pp. 307–330.
67. D. Mandrioli, R. Zicari, C. Ghezzi, and F. Tisato, “Modeling the Ada task system by Petri nets,” Comput. Lang., vol. 10, no. 1, pp. 43–61, 1985.
68. L.J. Mekly and S.S. Yau, “Software design representation using abstract process networks,” IEEE Trans. Software Eng., vol. SE-6, no. 5, pp. 420–435, Sept. 1980.
69. T. Murata, B. Shenker, and S.M. Shatz, “Detection of Ada static deadlocks using Petri net invariants,” IEEE Trans. Software Eng., vol. 15, no. 3, pp. 314–326, Mar. 1989.
70. S.M. Shatz and W.K. Cheng, “Static analysis of Ada programs using the Petri net model,” Proc. ISCAS 85, pp. 719–746, 1985.
71. S.S. Yau and M.U. Caglayan, “Distributed software system design representation using modified Petri nets,” IEEE Trans. Software Eng., vol. SE-9, no. 6, pp. 733–745, Nov. 1983.
72. J.B. Dugan and G. Ciardo, “Stochastic Petri net analysis of a replicated file system,” in [29], also in the special section of Petri net performance models in IEEE Trans. Software Eng., vol. 15, no. 4, pp. 394–401, Apr. 1989.
73. H.J. Genrich and K. Lautenbach, “The analysis of distributed systems by means of predicate/transition-nets,” lecture Notes in Computer Science, vol. 70, Semantics of Concurrent Computation. New York: Springer-Verlag, pp. 123–146, 1979.
74. M.T. Ozsu, “Modeling and analysis of distributed database concurrency control algorithms using an extended Petri net formalism,” IEEE Trans. Software Eng., vol. SE-11, no. 10, pp. 1225–1240, Oct. 1985.
75. K. Voss, “Using predicate/transition-nets to model and analyze distributed database systems,” IEEE Trans. Software Eng., vol. SE-6, no. 6, pp. 539–544, Nov. 1980.
76. E. Best, “COSY: Its relation to nets and to CSP,” in LNCS, vol. 255 [17].
77. S.I. Baranov, L.N. Zhuravina, and V.A. Peshanskii, “Method of representing parallel flow charts of algorithms by sets of sequential flowcharts,” (in Russian), English translation in Autom. Control Comput. Sci, vol. 18, no. 5, pp. 71–78, 1984.
78. H.J. Genrich and P.S. Thiagarajan, “A theory of bipolar synchronization schemes,” Theoret. Comput. Sci., vol. 30, pp. 241–318, 1984.
79. U. Goltz and A. Mycroft, “On the relationship of CCS and Petri nets,” in Lecture Notes in Computer Science, vol. 172, Automata, Languages and Programming, J. Paredaens, Ed. New York: Springer-Verlag, pp. 196–208, 1984.
80. U. Goltz and W. Reisig, “CSP-programs as nets with individual tokens,” in Lecture Notes in Computer Science, vol. 188 [22], pp. 169–196, 1985.
81. R.M. Karp and R.E. Miller, “Properties of a model for parallel computations: Determinancy, term i nation, queuing,” S/AM I. Applied Math., vol. 14, no. 6, pp. 1390–1411, Nov. 1966.
82. R.M. Karp, “Parallel program schemata,” J. Comput. Syst. Sci., vol. 3, no. 2, pp. 147–195, May 1969.
83. T. Kasai and R.E. Miller, “Homomorpisms between models of parallel computation,” 7. Comput. Sys. Sci., vol. 25, pp. 285–331, Dec. 1982.
84. R.M. Keller, “Parallel program schemata and maximal parallelism, I. Fundamental results,” J. ACM, vol. 20, no. 3, pp. 514–537, July 1973.
85. R.M. Keller, “Parallel program schemata and maximal parallelism, II. Construction of closures,” J. ACM, vol. 20, no. 4, pp. 696–710, Oct. 1973.
86. R.M. Keller, “Formal verification of parallel programs,” Comm. ACM, vol. 19, no. 7, pp. 371–384, 1976.
87. P.E. Lauer and R.H. Campbell, “Formal semantics of a class of highlevel primitives for coordinating concurrent processes,” Acta Informatica, vol. 5, no. 4, pp. 297–332, 1975.
88. K. Lautenbach and H.A. Schmid, “Use of Petri nets for proving correctness of concurrent process systems,” Proc. IFIP Congress 74, pp. 187–191, 1974.
89. K. Lautenbach and P.S. Thiagarajan, “Analysis of a resource allocation problem using Petri nets,” in Proc. 1st European Conf. Parallel Distributed Processing, J.C. Syre, Ed., pp. 260–266, 1979.
90. R.E. Miller, “A comparison of some theroretical models of parallel computation,” IEEE Trans. Comp., Vol. TC-22, no. 8, pp. 710–717, 1973.
91. R.E. Miller, “Some relationships between various models of parallelism and synchronization,” Yorktown Heights, New York, IBM T.J. Watson Research Center, Rep. RC-5074, Oct. 1974.
92. T. Murata, “Relevance of network theory to models of distributed/parallel processing,” J. Franklin Institute, vol. 310, no. 1, pp. 41–50, 1980.
93. H. Alia, P. Ladet, J. Martinez, and M. Silva-Suarez, “Modelling and validation of complex systems by coloured Petri nets; application to a flexible manufacturing system,” in Lecture Notes in Computer Science, vol. 188. New York: Springer-Verlag, pp. 15–31, 1985.
94. G. Bruno and G. Marchetto, “Process-translatable Petri nets for the rapid prototyping of process control systems,” IEEE Trans. SoftwareEng., vol. SE-12, no. 2, pp. 346–357, Feb. 1986.
95. D. Crockett, A. Desrochers, F. Dicesare, and T. Ward, “Implementation of a Petri net controller for a machine workstation,” in Proc. 1987 IEEE Int. Conf. Robotics Automat, pp. 1861–1867, 1987.
96. H. Demmou, M. Courvoisier, E. Thuriot, and R. Valette, “A new synchronization scheme for microprocessor based realtime control systems,” in Proc. 1983 Conf. Ind. Electron., pp. 237–242, 1983.
97. H.P. Lipp, “Application of a fuzzy Petri net for controlling complex industrial processes,” in IFAC Proc, Series 6, Pergamon Press, pp. 471–477, July 1983.
98. J. Martinez, H. Alia, and M. Silva, “Petri nets for the specification of flexible manufacturing systems,” in Modeling and Design of Flexible Manufacturing Systems. New York: Elsevier Science Publ., pp. 389–406, 1986.
99. T. Murata, N. Komoda, K. Matsumoto, and K. Haruna, “A Petri net-based controller for flexible and maintainable sequence control and its application in factory automation,” IEEE Trans. Ind. Electron, vol. 33, no. 1, pp. 1–8, 1986.
100. T. Murata and M. Silva (organizers), special sessions on Petri Nets and Flexible Manufacturing in Proc. 1987 IEEE Int. Conf. Robotics Automat, pp. 999-1018 and pp. 1160–1185, 1987.
101. A. Ichikawa and K. Hiraishi, “Analysis and control of discrete event systems represented by Petri nets,” in Lecture Notes in Control and Information Sciences, Vol. 103, Discrete Event Systems: Models and Applications, pp. 115–134. New York: Springer-Verlag, 1987.
102. S. Kodama (organizer), special sessions on Modeling, Analysis, and Control of Discrete Event Systems: Net Theoretical Approach, in Proc. 1985 IEEE Int. Symp. Circuits Syst., Kyoto, Japan, pp. 471-498, pp. 719-746, pp. 917–940, June 1985.
103. B.H. Krogh, “Controlled Petri nets and maximally permissive feedback logic,” Proc. 25 Allerton Conf. Communication, Control and Computing, pp. 317–326, Oct. 1987.
104. M.A. Holiday and M.K. Vernon, “Performance estimates for multiprocessor memory and bus interference,” IEEE Trans. Comput., vol. C-36, pp. 76–85, Jan. 1987.
105. W.E. Kluge and K. Lautenbach, “The orderly resolution of memory access conflicts among competing channel processes,” IEEE Trans. Comput, vol. C-31, no. 3, pp. 194–207, March 1982.
106. W. Kluge, “Reduction, data flow and control flow models of computation,” in LNCS, vol. 255 [17], pp. 466–498, 1987.
107. S.Y. Kung, S.C. Lo, and P.S. Lewis, “Timing analysis and design optimization of VLSI dataflow arrays,” in Proc. 1986 Int. Conf. Parallel Processing, also, a revised version, “Performance analysis and optimization of VLSI dataflow arrays,” 7. Parallel and Distributed Computing, vol. 4, no. 6, pp. 592–618, Dec. 1987.
108. T. Smigelski, T. Murata, and M. Sowa, “A timed Petri net model and simulation of dataflow computer,” in Proc. Int. Workshop Timed Petri Nets, Torino, Italy, July 1-3, 1985, pp. 56–63, 1985.
109. N.G. Leveson and J.L. Stolzy, “Safety analysis using Petri nets,” IEEE Trans. Software Eng., vol. SE-13, no. 3, pp. 386–397, March 1987.
110. M. Lu, D. Zhang, and T. Murata, “Stochastic net model for self-stability measures of fault-tolerant clock synchronization,” Proc. Int. Workshop Petri Nets and Performance Models, pp. 104–110, 1987.
111. S. Kumagai, H. Shiizuka, and S. Kodama, “Optimal realization of fault-tolerant decision-free concurrent systems,” in Proc. 28th Midwest Symposium Circuits and Systems, pp. 253–256, 1985.
112. S.K. Paranjpe, A.B. Ektare, and D.P. Mital, “Fault diagnosis of alignment networks using Petri nets,” Int. J. Electron, (GB), vol. 56, no. 3, pp. 365–370, March 1984.
113. J. Sifakis, “Realization of fault-tolerant systems by coding Petri nets,” J. Design Automation and Fault Tolerant Computing, vol. Ill, no. 1, pp. 93–107, 1979.
114. M. Silva and S. Velilla, “Error detection and correction on Petri net models of discrete events control systems,” in Proc. 1985 IEEE Int. Symposium Circuits and Systems, pp. 921–924, 1985.
115. M. Courvoisier, R. Valette, J.M. Bigou, and P. Esteban, “A programmable logic controller based on a high level specification tool,” in Proc. 1983 Conf. Ind. Electron., pp. 174–179, 1983.
116. F. Distante, “A Petri net matrix approach in VLSI functional testing,” Microprocessing and Microprogramming, vol. 16, no. 2–3, p. 194, 1985.
117. F.J. Ramming, “Hierarchical modulator description of VLSI systems,” in Workshop Report, VLSI and Software Eng. Workshop, Silver Spring, MD, USA, IEEE Computer Society Press, pp. 112–116, 1983.
118. P.B. Sheridan, L.M. Haibt, and R.A. Nelson, “Casting Boolean logic arrays into Petri nets,” IBM Research Rep., RC 10130, (45036), IBM T.J. Watson Research Center, New York, Aug. 1983.
119. M. Silva and S. Velilla, “Programmable logic controllers and Petri nets: A comparative study,” IFAC Software for Computer Control, Madrid, Spain, G. Ferrate, E.A. Puente, Eds. Oxford, England, Pergamon, pp. 83–88, 1982.
120. R. Valette, M. Courvoisier, J.M. Begou, and J. Albukerque, “Petri net based programmable logic controllers,” in Proc. 1st Int. IFIP Conf.: Comp. Appl. in Production and Engineering, pp. 103–116, 1983.
121. J.B. Dennis, “Modular, asynchronous control structures for a high performance processor,” in Proc. Project MAC Conference, pp. 55–80, 1970.
122. J.B. Dennis and S.S. Patil, “Speed independent asynchronous circuits,” in Proc. 4th Hawaii Int. Conf. Syst. Sci., pp. 55–58, 1971.
123. J.R. Jump and P.S. Thiagarajan, “On the equivalence of asynchronous control structures,” in Proc. 13th Annual Switching and Automata Theory Symp., pp. 212–223, Oct. 1972.
124. J.R. Jump, “Asynchronous Control Arrays,” IEEE Trans. Comput, vol. TC-23, no. 10, pp. 1020–1029, Oct. 1974.
125. J.R. Jump and P.S. Thiagarajan, “On the interconnection of asynchronous control structures,” J. ACM, vol. 22, no. 4, pp. 596–612, Oct. 1975.
126. D.P. Misunas, “Petri nets and speed independent design,” Comm. ACM 76, No. 8, pp. 474–481, 1973.
127. S.S. Patil, “Coordination of asynchronous events,” Mass. Inst, of Tech., Project MAC, Tech. Rep. 72, June 1970.
128. S.S. Patil, “An asynchronous logic array,” Mass. Inst, of Tech., Project MAC, Comp. Struct. Group Memo 111–1, Feb. 1975.
129. M. Yoeli, “Specification and verification of asynchronous circuits using marked graphs,” in Concurrency and Nets [25], pp. 605–622, 1987.
130. J.L. Baer and C.A. Ellis, “Model design and evaluation of a compiler for a parallel processing environment,” IEEE Trans. Software Eng., vol. SE-3, no. 6, pp. 394–405, Nov. 1977.
131. J.D. Noe, “A Petri net model of the CDC 6400,” Proc. ACM/ SIGOPS Workshop on Systems Performance Evaluation, pp. 362–378, 1971.
132. F. De Cindio, G. De Michelis, and C. Simone, “GAMERU: A language for the analysis and design of human communication pragmatics within organizational systems,” in LNCS, vol. 266 [24], pp. 21–44, 1987.
133. C.A. Ellis and G.J. Nutt, “Office information systems and computer science,” Computing Surveys, vol. 12, no. 1, pp. 27–60, March 1980.
134. A.W. Holt, “Coordination technology and Petri nets,” in Lecture Notes in Computer Science, vol. 222 [23], pp. 278–296, 1986.
135. M.D. Zisman, “Representation, specification and automation of office procedures,” Philadelphia, PA.: University of Pennsylvania, Wharton School, Department of Decision Sciences, Ph.D. Thesis, Sept. 1977.
136. S. Crespi-Reghizzi and D. Mandrioli, “Petri nets and szilard languages,” Information and Control, vol. 33, no. 2, pp. 177–192, Feb. 1977.
137. S. Crespi-Reghizzi, “Some algebraic properties of Petri nets,” Alta Frequenza, vol. 45, no. 2, pp. 130–137, Feb. 1976.
138. M. Hack, “Petri net languages,” Comp. Struct. Group Memo 124, Project MAC, MIT, 1975.
139. D. Mandrioli, “A note on Petri net languages,” Information and Control, vol. 34, no. 2, pp. 169–171, 1977.
140. J.L. Peterson, “Computation sequence sets,” J. Comput. Syst. Sci., vol. 13, no. 1, pp. 1–24, Aug. 1976.
141. A. Mazurkiewicz, “Trace theory,” in LNCS, vol. 255 [17], pp. 279–324, 1987.
142. G. Rozenberg and R. Verraedt, “Subset languages of Petri nets part II: the relationship to string languages and normal forms,” Theoret. Comput. Sci., vol. 26, pp. 301–326, 1983.
143. J.L. Darlington, “A net based theorem prover for program verification and synthesis,” Gesellschaft fur Math, und DatenverarbeitungmbH Bonn, Interner Berichtdes 1ST3/79 Dez. 1979.
144. H.J. Genrich and G. Thieler-Mevissen, “The calculus of facts,” in Mathematical Foundations of Computer Science 7976, A. Mazurkiewicz, Ed. New York: Springer-Verlag, pp. 588–595, 1976.
145. A. Giordana and L. Saitta, “Modeling production rules by means of predicate transition networks,” Inform. Sci., vol. 35, pp. 1–41, 1985.
146. K. Lautenbach, “On logical and linear dependencies,” Gesellschaft fur Math, und Datenverarbeitung mbH Bonn, Arbeitspapiere der GMD Nr. 147, March 1985.
147. T. Murataand K. Matsuyama, “Inconsistency check of a set of clauses using Petri net reductions,” J. Franklin Institute, vol. 325, no. 1, pp. 73–93, 1988.
148. T. Murata and D. Zhang, “A predicate-transition net model for parallel interpretation of logic programs,” IEEE Trans. Software Eng., vol. 14, no. 4, pp. 481–497, April 1988.
149. G. Peterka and T. Murata, “Proof procedure and answer extraction in Petri net model of logic programs,” IEEE Trans. Software Eng., vol. 15, no. 2, pp. 209–217, Feb. 1989.
150. G. Thieler-Mevissen, “The Petri net calculus of predicate logic,” St. Augustin: Gesellschaft fur Mathematik und Datenverarbeitung Bonn, Interner Bericht ISF-76–09, 1976.
151. M. Ajmone Marsan, G. Chiola, and A. Fumagali, “An accurate performance model of CSMA/CD bus LAN,” in LNCS, vol. 266 [24], pp. 146–161, 1987.
152. E. Gressier, “A stochastic Petri net model for Ethernet,” in Proc. Int. Workshop on Timed Petri Nets, Torino, Italy, July 1-3, 1985, pp. 296–303, 1985.
153. K. Voss, “A net model of a local area network protocol,” in Lecture Notes in Computer Science, vol. 188, Advances in Petri Nets 1984. New York: Springer-Verlag, pp. 413–437, 1985.
154. J.A. Meldman, “A Petri-net representation of civil procedure,” IDEA: J. LawTechnol., vol. 19, no. 2, pp. 123–148, 1978.
155. W.R. van Biljon, “Extending Petri nets for specifying man-machine dialogues,” Int. J. Man-Machine Studies, vol. 28, no. 4, pp. 437–455, 1988.
156. H. Oberquelle, I. Kupka, and H. Maass, “A view of human-machine communication and cooperation,” Int. I. Man-Machine Studies, vol. 19, pp. 309–333, 1983.
157. N. Stoicaand G. Roth, “Neuronal networks modelled by Petri type nets with controllers,” in Proc. 12th IFIP Conf, Budapest, in tecture Nofes in Control Inf. Sci., pp. 923–932, 1986.
158. M.R. Zargham and M. Tyman, “Neural Petri nets,” in Proc. Int. Workshop Timed Petri Nets, Torino, Italy, pp. 72–77, 1985.
159. S.C. Brofferio, “A Petri net control unit for highspeed modular signal processors,” IEEE Trans. Commun., vol. C35, no. 6, pp. 577–583, June 1987.
160. R. Nouta and O. Simula, “On the use of modified Petri nets for multiprocessor realization of digital filters,” in Circuit Theory and Design, G.S. Moschytz, J. Nierynch, Eds., St. Saphorin, Georgi, pp. 315–319, 1978.
161. W.M. Zuberek, “Application of timed Petri nets to analysis of multiprocessor realizations of digital filters,” in Proc. 25th Midwest Symp. Circuits and Systems, pp. 134–139, 1982.
162. D. Tabak and A.H. Levis, “Petri net representation of decision models,” IEEE Trans. Syst. Man, Cybern., vol. SMC-15, no. 6, pp. 812–818, Nov-Dec. 1985.
163. F. Feldbrugge and K. Jensen, “Petri net tool overview 1986,” in LNCS, vol. 255 [17], pp. 20–61, 1987.
164. J. Billington, G.R. Wheeler, and M.C. Wilbur-Ham, “PROTEAN: A High-level Petri net tool for the specification and verification of communication protocols,” IEEE Trans. Software Eng., vol. 14, no. 3, pp. 301–316, March 1988.
165. G. Chiola, “A software package for the analysis of generalized stochastic Petri net models,” in Proc. Int. Workshop Timed Petri Nets, Torino, Italy, July 1-3, 1985, pp. 136–143, 1985.
166. J.B. Dugan, A. Bobbio, G. Ciardo, and K.S. Trivedi, “The design of a unified package for the solution of stochastic Petri net models,” in Proc. Workshop Timed Petri Nets, Torino, Italy, July 1-3, 1985, pp. 6–13, 1985.
167. E. Le Mer, “OVIDE: A software package for verifying and validating Petri nets,” in Software for Computer Control (Proc. Third IFAC/IFIP Symposium, Madrid), G. Ferrate, E.A. Puente, Eds. Oxford: Pergamon Press, pp. 255–260, 1983.
168. J. Martinez and M. Silva, “A package for computer design of concurrent logic control systems,” in Software for Computer Control (Proc. Third IFAC/IFIP Symposium, Madrid, Oct. 5-8, 1982), C. Ferrate, E.A. Puente, Eds. Oxford: Pergamon Press, pp. 243–248, 1983.
169. M.K. Molloy, “A CAD tool for stochastic Petri nets,” in Proc. 1986 Fall Joint Comp. Conf., pp. 1082–1091, 1986.
170. M.A. Holliday and M.K. Vernon, “The GTPN analyzer: numerical methods and user interface” in Proc. 1986 Fall joint Computer Conf., pp. 1099–1105, 1986.
171. R. Devillers, “The semantics of capacities in P/T nets: A first look,” in proc. 6th European Workshop Appli. Theory Petri Nets, Espoo, Finland, pp. 171–190, 1985.
172. C.A. Petri, “Concurrency as a basis of systems thinking,” St. Augustin: Gesellschaft fur Mathematik und Datenverarbeitung Bonn, Interner Bericht ISF-78–06, Sept. 1978.
173. T. Agerwala, “A complete model for representing the coordination of asynchronous processes,” Baltimore: John Hopkins University, Hopkins Computer Science Program, Res. Rep. No. 32, July 1974.
174. S.R. Kosaraju, “Decidability of reachability in vector addition systems,” in Proc. 14th Annual ACM Symp. Theory Computing, San Francisco, May 5-7, 1982, pp. 267–281, 1982.
175. E.W. Mayr, “An algorithm for the general Petri net reachability problem,” SIAM, J. Comput. vol. 13, no. 3, pp. 441–460, Aug. 1984.
176. M. Hack, “Decidability questions for Petri nets,” Cambridge, Mass., MIT, Dept. Electrical Engineering, Ph.D. Thesis, Dec. 1975.
177. M. Hack, “The equality problem for vector addition systems is undecidable,” Theoret. Comput. Sci., vol. 2, pp. 77–95, 1976.
178. K. Lautenbach, “Liveness in Petri nets,” St. Augustin, Gesellschaft fur Mathematik und Datenverarbeitung Bonn, Interner Bericht ISF-75–02.1, 1975.
179. M. Silva, Petri Nets in Automation and Computer Engineering. Madrid, Spain, Editorial AC, (in Spanish) 1985; English translation to be published by Kluwer Academic Press, Hingham, MA, 1990 (plannedJ.
180. L.H. Landweber and E.L. Robertson, “Properties of conflict free and persistent Petri nets,” J. ACM, vol. 25, no. 3, pp. 352–364, July 1978.
181. C.A. Petri, “Interpretations of net theory,” St. Augustin: Gesellschaft fur Mathematik und Datenverarbeitung Bonn, Interner Bericht ISF-75–07, Second Edition Dez. 1976.
182. T. Murata and Z. Wu, “Fair relation and modified synchronic distances in a Petri net,” J. Franklin Inst., vol. 320, no. 2, pp. 63–82, Aug. 1985.
183. H.J. Genrich, K. Lautenbach, and P.S. Thiagarajan, “Elements of general net theory,” Lecture Notes in Computer Science, vol. 84 [15], pp. 21–163, 1980.
184. U. Goltz and Y. Chong-Yi, “Synchronic structure-A tutorial,” Lecture Notes in Computer Science, vol. 222 [23], pp. 233–252, 1986.
185. M. Silva, “Toward a synchrony theory for P/T nets,” in Concurrency and Nets [25], pp. 435–460, 1987.
186. I. Suzuki and T. Kasami, “Three measures for synchronic dependence in Petri nets,” Acta Informatica, vol. 19, no. 4, pp. 325–338, 1983.
187. D. Leu, M. Silva, J.M. Colom, and T. Murata, “Interrelationships among various concepts of fairness for Petri nets,” in Proc. 31th Midwest Symposium Circuits and Systems, 1988.
188. E. Best, “Fairness and conspiracies,” in Inform. Process. Lett.W. New York: North-Holland, pp. 215–220, 1984.
189. H. Carstensen and R. Valk, “Infinite behaviour and fairness in Petri nets,” Lecture Notes, in Computer Science, vol. 188 [22], pp. 83–100, 1985.
190. N. Francez, Fairness. New York: Springer-Verlag, 1986.
191. A. Pagnoni, “A fair competition between two or more partners,” in Informatik-Fachberichte 52 [20], pp. 327–337, 1982.
192. J.P. Queille and J. Sifakis, “Fairness and related properties in transition systems-A temporal logic to deal with fairness,” Acta Informatica, 19, pp. 195–220, 1983.
193. M. Silva and T. Murata, “B-fairness and structural B-fairness in Petri net models of concurrent systems,” Tech. Rep. No. UIC-EECS-86–10, Univ. of Illinois at Chicago, June 1986.
194. Z. Wu and T. Murata, “Use of Petri nets for distributed control of fairness in concurrent systems,” in Proc. First Conf. Computers Applications, Peking, 1984, pp. 84–91, 1984.
195. Z. Wu, “A Petri net model of a starvation-free solution to the dining philosopher's problem,” IEEE Workshop on Languages for Automation, Chicago, November 7-9, 1983, pp. 192–195, 1983.
196. R. Valk, “Infinite behaviour and fairness,” in LNCS, vol. 254 [16], pp. 377–396, 1987.
197. D. Leu, T. Murata, and M. Silva, “Maximum firing deviation and fair relations in Petri nets,” Proc. 1986 IEEE Int. Symp. Circuits Syst., pp. 1008–1010, May 1986.
198. T. Murata, “State equation, controllability, and maximal marchings of Petri nets,” IEEE Trans. Automat. Contr., vol. AC-22, no. 3, pp. 412–416, Jun. 1977.
199. F.E. Hohn, Elementary Matrix Algebra. Macmillan: New York, 1958.
200. G. Berthelot, G. Roucairol, and R. Valk, “Reduction of nets and parallel programs,” in Lecture Notes in Computer Science, vol. 84 [15], pp. 277–290, 1980.
201. G. Berthelot, “Checking properties of nets using transformations,” in Lecture Notes in Computer Science, vol. 222 [23], pp. 19–40, 1986.
202. R. Johnsonbaugh and T. Murata, “Additional methods for reduction and expansion of marked graphs,” IEEE Trans. Circuit Syst., vol. CAS-28, no. 10, pp. 1009–1014, Oct. 1981.
203. T. Murata and J.Y. Koh, “Reduction and expansion of live and safe marked graphs,” lEEETrans. Circuits Syst., vol. CAS-27, no. 1, pp. 68–70, Jan. 1980.
204. I. Suzuki and T. Murata, “A method for stepwise refinements and abstractions of Petri nets,” 7. Comput. Syst. Sci., vol. 27, no. 1, pp. 51–76, Aug. 1983.
205. T.A. Chu, “A method of abstraction for Petri nets,” pp. 164–173, in [29].
206. M. Hack, “Analysis of production schemata by Petri nets,” Cambridge, Mass., MIT, Dept. Electrical Engineering, MS Thesis, 1972.
207. E. Best, “Structural theory of Petri nets: The free choice hiatus,” in Lecture Notes in Computer Science. New York: Springer-Verlag, vol. 254, pp. 168–206, 1987.
208. E. Best and P.S. Thiagarajan, “Some classes of live and safe Petri nets,” in Concurrency and Nets [25], pp. 71–94, 1987.
209. A.T. AminandT. Murata, “A characterization of live and safe markings of a directed graph,” in Proc. 10th Conf. Inform. Sci. Syst., pp. 295–299, 1976.
210. M. KinuyamaandT. Murata, “Generating siphons and traps by Petri-net representation of logic equations,” in Proc. 2nd IECE (Japan) Conference on Net Theory, pp. 93–100, Dec. 1986.
211. P.S. Thiagarajan and K. Voss, “A fresh look at free choice nets,” Inform. Contr., vol. 61, no. 2, pp. 85–113, May 1984.
212. A. Ichikawa and K. Hiraishi, “A class of Petri nets that a necessary and sufficient condition for reachability is obtainable,” Trans. Society of Instrument and Control Engineers (SICE) (in Japanese), vol. 24, no. 6, 1988.
213. S. Kodama and T. Murata, “On necessary and sufficient reachability conditions for some subclasses of Petri nets,” Tech. Rep. #UIC-EECS 88–8, Univ. of Illinois at Chicago, June 1988.
214. M. Jantzen and R. Valk, “Formal properties of place/transition nets,” Lecture Notes in Computer Science, vol. 84 [15], 1980.
215. T. Murata, “Circuit theoretic analysis and synthesis of marked graphs,” IEEE Trans. Circuits Syst., vol. CAS-24, no. 7, pp. 400–405, July 1977.
216. S. Kumagai, S. Kodama, and M. Kitagawa, “Submarking reachability of marked graphs,” IEEE Trans. Circuits Syst., vol. CAS-31, no. 2, pp. 159–164, 1984.
217. M.A. Comeau and K. Thulasiraman, “Structure of the sub-marking-reachability problem and network programming,” IEEE Trans. Circuits Syst., vol. 35, no. 1, pp. 89–100, Jan. 1988.
218. F. Commoner et al., “Final report for the project-development of theoretical foundations for description and analysis of discrete information systems,” vol. Il-Mathematics, CADD-7405–2011, Mass. Comp. Assoc, Inc., Wakefield, MA 01880, May 1974.
219. T. Murata, “Synthesis of decision-free concurrent systems for prescribed resources and performance,” IEEE Trans. Software Eng., vol. SE-6, no. 6, pp. 525–530, Nov. 1980.
220. T. Murata, V.B. Le, and D.J. Leu, “Method for realizing the synchronic distance matrix as a marked graph,” in Proc. IEEE Int. Symp. Circuits Syst., Rome, Italy, vol. 2, pp. 609–612, May 1982.
221. D.J. Leu and T. Murata, “Properties and applications of the token distance matrix of a marked graph,” in Proc. 1984 IEEE Int. Symp. Circuits Syst., vol. 3, pp. 1381–1385, 1984.
222. D.J. Leu, “On maximum concurrency in a decision-free concurrent system,” in Proc. Int. Conput. Symp., 1984, Tamkang Univ., Taipei, Rep. of China, Dec. 12-14, 1984, vol. 2, pp. 1065–1071, 1985.
223. H.J. Genrich and K. Lautenbach, “Synchronisationsgraphen,” Acta Informatica 2, pp. 143–161, 1973.
224. G. Memmi and G. Roucairol, “Linear algebra in net theory,” in Lecture Notes in Computer Science, vol. 84, [15], pp. 213–223, 1980.
225. M. Silva and J.M. Colom, “On the computation of structural synchronic invariants in P/T nets,” to appear in Advances in Petri Nets 1988, Lecture Notes in Computer Science, New York: Springer-Verlag, 1989.
226. J. Sifakis, “Structural properties of Petri nets,” Mathetical Foundations of Computer Science, 1978, J. Winkowski, Ed. New York: Springer-Verlag, pp. 474–483, 1978.
227. H.J. Genrich and K. Lautenbach, “System modelling with highlevel Petri nets,” Theoret. Comp. Sci., vol. 13, pp. 109–136, 1981.
228. P. Huber, A.M. Jensen, L.O. Jepsen, and K. Jensen, “Towards reachability trees for highlevel Petri nets,” Theoret. Comput. Sci., vol. 45, pp. 261–292, 1986.
229. K. Jensen, “Coloured Petri nets and the invariant-method,” Theoret. Comput. Sci., vol. 14, pp. 317–336, 1981.
230. K. Jensen, “How to find invariants for coloured Petri nets,” in Lecture Notes in Computer Science, vol. 118, Math. Found, of Computer Science, 1981, 10th Symp. New York: Springer-Verlag, pp. 327–338, 1981.
231. K. Lautenbach and A. Pagnoni, “Invariance and duality in predicate/transition nets and in coloured nets,” Gesellschaft fur Math, und Datenverarbeitung mbH Bonn, Arbeitspapiere der GMD Nr. 132, Feb. 1985.
232. H. Mizuba, J. Herath, K. Ueda, and N. Saito, “Predicate/transition net simulation based on concurrent PROLOG,” in Software Science and Eng., (Proc. Symp. Kyoto 1984, RIMS Kokyuroku 547), pp. 23–34, 1985.
233. Y. Narahari and N. Viswanadham, “On the invariants of coloured Petri nets,” in Lecture Notes in Computer Science, vol. 222 [23], pp. 330–345, 1986.
234. J.L. Peterson, “A note on colored Petri nets,” Inform. Process. Lett., vol. 11, no. 1, pp. 40–43, Aug. 1980.
235. M. Silva, J. Martinez, P. Ladet, and H. Alia, “Generalized inverses and the calculation of symbolic invariants for colored Petri nets,” TSI-Technique et Science Informatiques, vol. 4, no. 1, G. Memmi, Ed., pp. 113–126, 1985.
236. J. Vautherin, “Nonlinear invariants for coloured Petri nets with interdependent token; Application to the proof of parallel programs,” in Lecture Notes in Computer Science, vol. 222 [23], pp. 418–434, 1986.
237. C.R. Zervos and K.B. Irani, “Colored Petri nets: Their properties and applications,” Ann Arbor, Michigan, Michigan University, Systems Eng. Lab., Rep. RADC-TR-77–246, Aug. 1977.
238. A. Zenie, “Colored stochastic Petri nets,” in Proc. Int. Workshop Timed Petri Nets, Torino, Italy, July 1-3, 1985, pp. 262–271, 1985.
239. R. David and H. Alia, “Continuous Petri nets,” in Proc. 8th European Workshop Application and Theory of Petri Nets, pp. 275–294, Zaragoza, Spain, 1987.
240. A. Finkel and G. Memmi, “An introduction to FIFO nets- Monogeneous nets: A subclass of FIFO nets,” Theoret. Corn-put. Sci., vol. 35, pp. 191–214, 1985.
241. H. Fuss, “Numerical simulations with place/transactor nets,” in Concurrency and Nets [25], pp. 187–199, 1987.
242. R. Valk, “Self-modifying nets, a natural extension of Petri nets,” in Lecture Notes in Computer Science, Vol. 62, Automata, Languages and Programming, G. Ausiello, C. Bohm, Eds. Berlin, New York: Springer-Verlag, pp. 464–476, 1978.
243. R. Valk, “Generalizations of Petri nets,” in Lecture Notes in Computer Science, Vol. 118, Math. Found, of Computer Science, 1981, 10th Symp. New York: Springer-Verlag, pp. 140–155, 1981.
244. S. Poratand M. Yoeli, “Towards a hierarchy of nets,” J. Corn-put. Sys. Sci., vol. 29, no. 2, pp. 198–206, Oct. 1984.
245. Y.S. Kwong, “On reduction of asynchronous systems,” Theoret. Comput. Sci., vol. 5, pp. 25–50, 1977.
246. R. Valette, “Analysis of Petri nets by stepwise refinements,” I. Comput. Syst. Sci., vol. 18, pp. 35–46, 1979.
247. H.W. Kuhn and A.W. Tucker, Eds. Linear Inequalities and Related Systems, Annals of Mathematics Study, No. 38, Princeton, NJ: Princeton Univ. Press, 1956.
248. W. Reisig, “Petri nets with individual tokens,” Informatik-Fachberichte 66 [21], pp. 229–249, 1983.
249. T.C. Hu, Integer Programming and Network Flows. Reading, MA: Addison Wesley Pub. Co. 1970.
250. Y.E. Lien, “Termination properties of generalized Petri nets,” SIAMj. Computing, vol. 5, no. 2, pp. 251–265, June 1976.
251. Y.E. Lien, “A note on transition systems,” J. Inform. Sci., vol. 10, no. 4, pp. 347–362, 1976.
252. J. Martinez and M. Silva, “A simple and fast algorithm to obtain all invariants of a generalized Petri net,” Informatik-Fachberichte 52, Application andlheory oi Petri Nets. New York: Springer-Verlag, pp. 301–310, 1982.
253. H.J. Genrich, “Predicate/transition nets,” in LNCS, vol. 254 [16], pp. 207–247.
254. K. Jensen, “Coloured Petri nets,” in LNCS, vol. 254 [16], pp. 248–299.
255. G. Roucairol, “FIFO-Nets,” in LNCS, vol. 254 [16], pp. 436–459.
256. C. Andre, “Use of the behaviour equivalence in place-tran- sition net analysis,” Informatik-Fachberichte 52 [20], pp. 241–250, 1982. Additional Bibliography
257. T. Araki and T. Kasami, “Some undecidable problems for Petri nets,” Syst. Comput. Contr., vol. 7, no. 1, pp. 20–28, Jan.-Feb., 1976.
258. T. Araki, “Decidable problems on the strong connectivity of Petri net reachability sets,” Theoret. Comput. Sci., vol. 4, no. 1, pp. 99–119, Feb. 1977.
259. M. Auguin, F. Boeri, and C. Andre, “Systematic method of realization of interpreted Petri nets,” Digital Processes, vol. 6, pp. 55–68, 1980.
260. H.H. Ammar and R.W. Liu, “Analysis of the generalized stochastic Petri nets by state aggregation,” in [28], pp. 88–95, 1985.
261. J.L. Baer, “A survey of some theoretical aspects of multiprocessing,” ACM Computing Surveys, vol. 5, no. 1, pp. 31–80, 1973.
262. E. Best and H.A. Schmid, “Systems of open paths in Petri nets,” in Lecture Notes in Computer Science, vol. 32. New York: Springer-Verlag, pp. 186–193, 1975.
263. A. DattaandS. Ghosh, “Synthesis of a class of deadlock-free Petri nets,” J. Assoc. Comput. Machinery, vol. 31, no. 3, pp. 486–506, July 1984.
264. F. De Cindio, G. De Michelis, L. Pomello and C. Simone, “Superposed automata nets,” Informatik-Fachberichte 52 [20]. New York: Springer-Verlag, pp. 269–279, 1982.
265. J. Grabowski, “The decidability of persistence for vector addition systems,” Inform. Process. Lett., vol. 11, no. 1, pp. 20–23, Aug. 1980.
266. C. Girault, C. Chatelain, and S. Haddad, “Specification and properties of a cache coherence protocol model,” in LNCS, vol. 266 [24] pp. 1–20, 1987.
267. M. Hack, “The recursive equivalence of the reachability problem and the liveness problem for Petri nets and vector addition systems,” in Proc. 15th Ann. Symp. Switching Automata Theory, pp. 156–164, 1974.
268. G.S. Hura and J.W. Atwood, “Program verification for microprocessors through Petri net modeling,” Microelectron. Reliab., vol. 25, no. 5, pp. 1001–1010, 1985.
269. J.L. Johnson and T. Murata, “Structure matrices for Petri nets and their applications,” J. Franklin Inst, vol. 319, no. 3, pp. 299–309, March 1985.
270. A.A. Khan, G.S. Hura, H. Singh, and N.K. Nanda, “On the determination of the solution of a class of Murata's state equation of Petri nets,” Proc. IEEE, vol. 69, no. 4, pp. 466–467, April 1981.
271. F. Kriickeberg and M. Jaxy, “Mathematical methods for calculating invariants in Petri nets,” in LNCS, vol. 266 [24], pp. 104–131, 1987.
272. C.L. LargenandT. Murata, “Use of prime numbers for computer-aided analysis of colored Petri nets,” in Proc. 26th Midwest Symp. Circuits Syst., Instituto Nacional de Astrofisica, Optica y Electronica (I NAOE), Puebla, Mexico, August 15-16, 1983, E.S. Sinencio, Ed., pp. 124–128, 1983.
273. J. Van Leeuwen, “A partial solution to the reachability-problem for vector addition systems,” in Proc. 6th Annual ACM Symp. Theory Computing, pp. 303–309, 1974.
274. T.Y. Lin, “Petri net models for computer security,” Bull. Inst. Math. Acad. Sinica, vol. 11, no. 3, pp. 439–457, 1983.
275. R.J. Lipton, “The reachability problem requires exponential space,” New Haven, CT, Yale University, Department of Computer Science, Res. Rep. 62, Jan. 1976.
276. R. Liu, Q. Huang, C. Lin, H. Ammar, and Y.F. Huang, “Petri net application to functional fault diagnosis,” in Proc. 7986 IEEE Int. Symp. Circuits Sys., San Jose, Calif. May, 1986, pp. 1323–1327.
277. A.C. Liu and H.C. Lin, “Modeling nuclear power plant by Petri nets,” in Computers in Engrg. 1986 (AMSE Pressure Vessel and Piping Conf., Chicago), pp. 151–156, 1986.
278. T. Murata and T. Shah, “On liveness, deadlock, and reachability of E-nets,” in Proc. 14th Allerton Conf. Circuit Syst. Theory, Oct. 1976, pp. 597–605, 1976.
279. T. Murata, “State equation for E-net interpreted marked graphs,” in Proc. 19th MidwestSymp. Circuits Syst., pp. 152–157, 1976.
280. T. Murata, “Petri nets, marked graphs, and circuit-system theory: A recent CAS application,” Circuits and Systems 11, no. 3, pp. 2–12, June 1977.
281. T. Murata, “Petri nets,” in Systems & Control Encyclopedia: Theory, Technology, Applications, M.G. Singh (Editor-in-Chief), pp. 3665–3670. New York: Pergamon Press, 1987.
282. T. Murata, “Modeling and analysis of concurrent systems,” Ch. 3 in Handbook of Software Engineering, C.R. Vick and C.V. Ramamoorthy Eds. New York: Van Nostrand, Reinhold, pp. 39–63, 1984.
283. R.A. Nelson, L.M. Haibt, and P.B. Sheridan, “Casting Petri nets into programs,” IEEE Trans. Software Eng., vol. SE-9, no. 5, pp. 590–602, Sept. 1983.
284. C.A. Petri, “Concepts of net theory,” Mathematical Foundations on Computer Science: in Proc. Symp. and Summer School, High Tatras, Sept. 3-8, 1973, Math. Inst, of the Slovak Acad, of Sciences, pp. 137–146, 1973.
285. C.A. Petri, “Communication disciplines,” in Computing System Design: Proc. Joint IBM-University of Newcastle-upon-Tyne Seminar, Sept. 1976, B. Shaw, Ed., pp. 171–183, 1977.
286. C.A. Petri, “Modelling as a communication discipline,” in Measuring, Modelling and Evaluating Computer Systems, H. Beilner, E. Gelenbe, Eds. Amsterdam: North-Holland, pp. 435–449, 1977.
287. C.A. Petri, “Introduction to general net theory,” in Lecture Notes in Computer Science, vol. 84, Net Theory and Applications. New York: Springer-Verlag, pp. 1–19, 1980.
288. C.A. Petri, “Concurrency,” in Lecture Notes in Computer Science, vol. 84, Net Theory and Applications. New York: Springer-Verlag, pp. 251–260, 1980.
289. C.A. Petri, “State-transition structures in physics and in computation,” Int. J. Theoret. Physics, vol. 21, no. 12, pp. 979–992, 1982.
290. L. Pomello, “Some equivalence notions for concurrent systems,” in Lecture Notes in Computer Science, vol. 222, Advances in Petri Nets 1985, G. Rozenberg, Ed. New York: Springer-Verlag, pp. 381–400, 1986.
291. W. Reisig, “Deterministic buffer synchronization of sequential processes,” Acta Informatica 18, pp. 117–134, 1982.
292. G.S. Sacerdote and R. L Tenney, “The decidability of the reachability problem for vector addition systems,” Proc. 9th Ann. Symp. Theory Computing, Boulder, Colorado, May 2-4, 1977, pp. 61–76, 1977.
293. H.A. Schmid and E. Best, “A step towards a solution of the liveness problem in Petri nets,” University of Newcastle-upon-Tyne, Computing Laboratory, Tech. Rep. 114, Feb. 1978.
294. E. Schnieder, Proze Informatik. Braunschweig, Wiesbaden: Vieweg Verlag, 1986.
295. C.L. Seitz, “Graph representations for logical machines,” Cambridge, MA: MIT, Department of Electrical Engineering, Ph.D. Thesis, Jan. 1971.
296. J. Sifakis, “A unified approach for studying the properties of transition systems,” Theoret. Comput. Sci., vol. 18, pp. 227–258, 1982.
297. P.H. Starke, Petri netze, Berlin, DDR: Deutscher Verlag der Wissenschaften, 1980.
298. K. Tagahashi, K. Hasegawa, and Z. Banaszak, “Synthesis method for a Petri net with prescribed firing sequence,” Trans. Soc. Instrum. Control Eng. (Japan), vol. 21, no. 3, pp. 277–283, March 1985.
299. K. Tsuji, S. Kumagai, S. Kodama, and T. Yamada, “Modelling and verification of sequential control systems by Petri nets,” in Proc. IEEE Int. Symp. Circuits Syst., San Jose, vol. 3, pp. 988–991, 1986.
300. N. Viswanadham and Y. Narahari, “Coloured Petri net models for automated manufacturing systems,” Proc. 7987 IEEE Int. Conf. Robot. Automat, pp. 1985–1990, 1987.
301. G. Winskel, “Petri nets, morphisms and compositionality,” in Lecture Notes in Computer Science, vol. 222. New York: Springer-Verlag, pp. 453–477, 1986.
302. H. Yamasaki, “Normal Petri nets,” Theoret. Comput. Sci., vol. 31, no. 3, pp. 307–315, June 1984.
303. S.H. Yu and T. Murata, “PT-marked graphs: a reduced model of Petri nets,” in Proc. 16th Ann. Allerton Conf. Commun., Cont. Comput, Oct. 1978, pp. 175–184, 1978.
304. Y.W. Han, “Performance evaluation of a digital system using a Petri net-like approach,” in Proc. Nat. Electron. Conf., vol. 32, Oct. 16-18, 1978, W.H. Tranter, Ed., pp. 166–172, 1978.
305. R.M. Shapiro and R.E. Millstein, “Failure recovery in a distributed database system,” in Proc. IEEE COMPCON Spring 1978, pp. 66–70, 1978.
306. O.L. Bandman, “The correctness of asynchronous parallel-flow systems of data reduction,” (in Russian), English translation in Program. Comput. Software, vol. 12, no. 1, pp. 9–17, 1986.
307. V.E. Kotov and L.A. Cherkasova, “From nets to logic and back in the specification of processes,” Concurrency and Nets, Special volume in the series “Advances in Petri Nets.” New York: Springer-Verlag, pp. 253–268, 1987.
308. H. Lee-Kwang, J. Favrel, and P. Baptiste, “Generalized Petri net reduction method,” IEEE Trans Syst. Man, Cybernet, vol. SMC-17, no. 2, pp. 297–303, March/April 1987.
309. M. Silva, “Sur le concept de macroplace et son utilisation pour I'analyse des reseaux de Petri,” RAIRO-Automatique, vol. 15, no. 4, pp. 57–67, 1981.
310. J. Martinez and M. Silva, “A language of description of concurrent systems modeled by colored Petri nets: Application to the control of flexible manufacturing systems,” in Languages for Automation, S.K. Chang, Ed. New York: Plenum Press, pp. 369–388, 1985.
311. J.M. Colom, J. Martinez, and M. Silva, “Packages for validating discrete production systems modelled with Petri nets,” in Applied Modelling and Simulation of Technological Systems (P. Borne and S. Tzafestas, Eds.), Amsterdam and New York: North-Holland, pp. 529–536, 1987.
312. J.A. Meldmanand A.W. Holt, “Petri nets and legal systems,” JurimetricsJ., vol. 12, no. 2, pp. 65–75, 1971.
313. C.G. Looney, “Fuzzy Petri nets for rule-based decisionmaking,” IEEE Trans. Syst, Man, Cybernet., vol. 18, no. 1, pp. 178–183, Feb./Mar., 1988.
314. T. Ushio and R. Matsumoto, “State feedback and modular control synthesis in controlled Petri nets,” Proc. 27th IEEE Conf. Decision Contr., Austin, TX, pp. 1502–1507, Dec. 1988.
315. C. Lin and D.C. Marinescu, “Stochastic highlevel Petri nets and applications,” IEEE Trans. Comput, vol. 37, no. 7, pp. 815–825, July 1988.