PL
 |
EN

PL EN

Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

Modelowanie i analiza wydajności systemów współbieżnych

Autorzy
Zuberek W.
Identyfikatory
Warianty tytułu
Języki publikacji
PL
Abstrakty
PL
Systemy współbieżne są złożone z asynchronicznie działających procesów, komunikujących się między sobą w celu wymiany informacji albo zsynchronizowania wykonywanych operacji. Modele sieciowe, znane również jako sieci Petriego, są formalnym modelem takich systemów, szczególnie wygodnym dla przedstawiania synchronizacji oraz komunikacji procesów. Do oceny wydajności modelowanych systemów, w modelach takich trzeba dodatkowo uwzględniać czasy trwania modelowanych zdarzeń. Modele sieciowe z dołączonym opisem temporalnym są nazywane temporal-nymi modelami sieciowymi. Okazuje się, że takie modele temporalne mogą reprezentować szeroką klasę systemów dyskretnych, takich jak systemy wieloprocesorowe, systemy komunikacyjne, systemy produkcyjne, rozproszone bazy danych i wiele innych. Analiza modeli temporalnych może być przeprowadzona na podstawie przestrzeni stanów, albo może korzystać z własności strukturalnych modeli. Metody symulacyjne są jeszcze jednym rozwiązaniem w przypadkach, gdy wymagane własności strukturalne nie są spełnione, a przestrzeń stanów jest albo nieskończona, albo zbyt duża dla praktycznej analizy. Przedstawiona praca jest wprowadzeniem do podstawowych pojęć modeli sieciowych oraz przewodnikiem po opublikowanych wcześniej pracach, dotyczących niektórych własności całej rodziny temporalnych modeli sieciowych oraz omawiających metody analizy wydajności takich modeli. W pracy tej również dokładniej przedstawiono dwa zastosowania, modelowanie i analizę gniazd produkcyjnych oraz modelowanie i analizę wydajności wieloprocesorowych systemów z rozproszoną pamięcią. W pierwszym przypadku wydajność jest oceniana za pomocą metod strukturalnych oraz transformacji modelu, w przypadku drugim, ze względu na rozmiar modelu, przedstawione wyniki są otrzymane metodą symulacyjną.
EN
Concurrent systems arę composed of asynchronous processes which communicate with each other to exchange Information or to synchronize their operations. Net models, also known as Petri nets, arę formal models of such systems, designed specifically to represent process synchronization and communication. For performance analysis of such models, the duration of modelled activitie" must also be taken into account. Net models augmented by temporal descriptions arę known as timed Petri nets. Timed models can represent a broad class of discrete-event systems, such as multiproces-sor and communication systems, production systems, distributed data bases and many others. Ań analysis of timed models can be based on an exhaustive analysis of their state spaces, or on the structural properties of the models. Simulation methods arę yet another possibility in cases where the other approaches cannot be used. This work provides an introduction to the basie concepts of net models and a broad overview of the properties and performance analysis of timed Petri nets. Two applications arę discussed in greater detail, the modelling and analysis of manufacturing cells, and performance analysis of distributed memory multithreaded multiprocessor systems. In the first case, the performance of the derived models is evaluated by structural methods, using P-invariants. In the second case, because of the size of the model, performance characteristics arę obtained by discrete-event simulation of the models.
Słowa kluczowe
PL
Wydawca
Oficyna Wydawnicza Politechniki Warszawskiej
Czasopismo
Prace Naukowe Politechniki Warszawskiej. Elektronika
Rocznik
2001
Tom
z. 128
Strony
3--56
Opis fizyczny
Bibliogr. 265 poz., wykr., schem.
Twórcy
autor
Zuberek W.
  • Wydział Elektroniki i Technik Informacyjnych Politechniki Warszawskiej
Bibliografia
  • 1. Aalbersberg I.J., Rozenberg G.: Theory of traces. Theoretical computer Science, vol. 60, no 1, pp. 1-82, 1988.
  • 2. Aalst van der W., Colom J-M., Kordon F., Kotsis G., Moldt D.: Perti net approach for modelling and validation (LINCOM Studies in Computer Science). Lincon Europa Academic Publisher 1998.
  • 3. Agerwala T.: Putting Perti nets to work. IEEE Computer Magazine. IEEE Computer Magazine, vol. 12, no 12, pp. 85-94, 1979.
  • 4. Agerwala T., Flynn M.: Comments on capabilities, limitations and ‘correctness’ of Petri nets. Proc. of the First Annual Symp. On computer Architecture, pp. 81-86, 1973.
  • 5. Ajmone Marsan M., Balbo G., Chiola G., Conte G.: Generalized stochastic Petri nets revisited, random switches and proprieties. Proc. Int. Workshop on Petri Nets and Performance Models (PNPM’87), Madison, WI, pp. 44-53, 1987.
  • 6. Ajmone Marsan M., Conte G., Balbo G.: A class of generalized stochastic Petri for the performance evaluation of multiprocessor systems. ACM Trans. on computer Systems, vol. 2, no. 2, pp. 93-122, 1984.
  • 7. Ajmone Marsan M., Balbo G., Conte G.: Performance models of multiprocessor systems. MIT Press 1986.
  • 8. Ajmone Marsan M., Balbo G., Conte G., Donatelli S., Franceschinis G.: Modelling with generalized stochastic Petri nets. Wiley & Sons 1995.
  • 9. Al-Jaar R.Y., Desrochers A.: Performance evaluation of automated manufacturing systems using generalized stochastic Perti nets. IEEE Trans. on Robotics and Automation, vol. 6, no 6, pp. 621-639, 1990.
  • 10. Araki T., Kasami T.: Some decision problems related to the reachability problem for Petri nets. Theoretical Computer Science, vol. 3, no 1, pp. 85-104, 1977.
  • 11. Balbo G., Bruell S.C., Ghanta S.: Combining queueing networks and generalized stochastic Petri net model for the analysis of some software blocking phenomena. IEEE Trans. on Software Engineering, vol. 12, no 4, pp. 561-576, 1986.
  • 12. Banszek Z.: Modelling of manufacturing systems. “Modern Manufacturing”, pp. 253-286, Springer-Verlag 1994.
  • 13. Banszek Z., Krogh B.H.: Deadlock avoidance in flexible manufacturing systems with concurrently competing process flows. IEEE Trans. on Robotics and Automation, vol. 6, no 6, pp. 724-734, 1990.
  • 14. Basten T., Voorhoeve M.: An algebraic semantics for hierarchical P/T nets. Proc. 16th Int. Conf. on Applications and Theory of Petri Nets 1995 (Lecture Notes in Computer Science 935) pp. 45-65, Springer-Verlag 1995.
  • 15. Bause F., Kritzinger P.S.: Stochastic Petri nets – an introduction to the theory (Academic Studies in Computer Science). Vieweg Publ. 1996.
  • 16. Bernardienello L., De Cindio F.: A survey of basic net models and modular net classes. “Advances in Petri Nets 1992” (Lecture Notes in Computer Science 609) pp. 304-351, Springer-Verlag 1992.
  • 17. Berthelot G.: Transformations and decompositions of nets. “Petri Nets: Central Models and Their Properties – Advances in Petri Nets 1986” (Lecture Notes in Computer Science 254) pp. 359-376, Springer-Verlag 1987.
  • 18. Berthelot G., Roucariol G.: Reductions of Petri nets. “Mathematical Foundations of Computer Science 1976” (Lecture Notes in Computer Science 45) pp. 202-209, Springer-Verlag 1976.
  • 19. Berthelot G., Terrat R.: Petri net theory for correctness of protocols. IEEE Trans. on Communications, vol. 30, no 12, pp. 2497-2505, 1982.
  • 20. Best E.: Structiral theory of Petri nets: the free-choice hiatus. “Advances in Petri Nets 1986” (Lecture Notes in Computer Science 254) pp. 168-2066, 1987.
  • 21. Best E., Devillers R.: Sequential and concurrent behaviour in Petri net theory. Theoretical Computer Science, vol. 55, no 1, pp. 87-136, 1987.
  • 22. Best E., Shields M.W.: some equivalence results for free-choice and simple nets and on the periodicity of life free-choice nets. “CAAP’83 – Tree in Algebra and Programming” (Lecture Notes in Computer Science 159) pp. 141-154, Springer-Verlag 1983.
  • 23. Best E., Thagarajan P.S.: Some classes of live and safe Petri Nets. “Concurrency and nets”, pp. 71-94, Springer-Verlag 1987.
  • 24. Billington J., Diaz M., Rozenberg G.: Applications of Petri Nets to Communication Networks (Lecture Notes in Computer Science 1605) Springer-Verlag 1999.
  • 25. Billington J., Wheeler G.R., Wilbur-Ham M.C.: PROTEAN: a high-level Petri net tool for the specification and verification of communication protocols. IEEE Trans. on Software Engineering, vol. 14, no 3, pp. 301-316, 1988.
  • 26. Bobbio A., Puliafito A., Telek M., Trivedi K.S.: Recent developments in non-Markovian stochastic Petri nets. Journal of Circuits, systems and Computers, vol. 8, no 1, pp. 119-158, 1998.
  • 27. Boothe B., Ranade A.: Improved multithreading techniques for hiding communication latency in multiprocessors. Proc. 19th Annual Int. Symp. on Computer Architecture, pp. 214-223, 1992.
  • 28. Boucher T.O., Jafari M.A., Meredith G.A.: Petri net control of an automated manufacturing cell. Computers and Industrial Engineering, vol. 17, no 1-4, pp. 459-463, 1989.
  • 29. Brauer W. (ed.): Net Theory and Applications (Lecture Notes in Computer Science 84) Springer-Verlag 1980.
  • 30. Brauer W., Gold R., Vogler W.: A survey of behavior and equivalebce preserving refinements of Petri nets. “Advances in Petri Nets 1990” (Lecture Notes in Computer Science 483) pp. 1-46, Springer-Verlag 1991.
  • 31. Bruno G., Biglia P.: Performance evaluation and validation of tool handling in flexible manufacturing systems using Petri nets. Proc. 1985 IEEE Int. Workshop on Time Petri nets, pp. 64-71, 1985.
  • 32. Bruno G., Marchetto G.: Process-translatable Petri nets for the rapid prototyping of process control systems. IEEE Trans. on Software Engineering, vol. 12, no 2, pp. 346-357, 1986.
  • 33. Buchholz P.: Hierarchical Markovian models: symmetries and reduction. Performance Evaluation, vol. 22, no 1, pp. 93-110, 1995.
  • 34. Buchholz P.: Hierarchical structuring of superposed GSPNs. Proc. 7th Int. Workshop on Perti Net and Performance Models (PNPM’97) St. Malo, France, pp. 81-90, 1997.
  • 35. Buchholz P., Kemper P.: Numerical analysis of stochastic marked graphs. Proc. 6th Int. Workshop on Petri Net and Performance Models (PNPM’95) Durham, NC, pp. 32-41, 1995.
  • 36. Cailoni a., Magnani G., Pezze M.: A technique for designing robotic control systems based on Petri nets. IEEE Trans. on Control Systems Technology, vol. 6, no 1, pp. 72-87, 1998.
  • 37. Campos J., Chiola G., Colom J.M., Silva M.: Properties and performance bounds for timed marked graphs. IEEE Trans. on Circuits and Systems, vol. 39, pp. 386-401, 1992.
  • 38. Campos J., Colom M., Jungnitz H., Silva M.: Approximate throughput computation of stochastic marked graphs. IEEE Trans. on Software Engineering, vol. 20, no 7, pp. 526-535, 1994.
  • 39. Cao T., Sanderson A.C.: Task sequence planning using fuzzy Petri nets. IEEE Trans. on Systems, Man and Cybernetics, vol. 25, no 5, pp. 755-768, 1995.
  • 40. Carlier J., Chretienne P.: Timed Petri net schedules. “Advances in Petri Nets 1988” (Lecture Notes in Computer Science 340) pp. 62-84, Springer-Verlag 1989.
  • 41. Carlier J., Chretienne P., Girault C.: Modeling scheduling problems with timed Petri nets. “Advances in Petri Nets 1984” (Lecture Notes in Computer Science 188) pp. 62-82, Springer-Verlag 1985.
  • 42. Cavalieri S., Mirabella O., Zingarino G.: A Petri net based approach for FMS performance evaluation. Proc. 23rd Int. Conf. on Industrial Electronics, Control and Instrumentation (IECON’97) New Orleans, LA, vol. 3, pp. 1204-1209, 1997.
  • 43. Cecil J.A., Srihari K., Emerson E.R.: A review of Petri net applications in manufacturing. Int. Journal of Advanced Manufacturing Technology, vol. 7, no 3, pp. 168-177, 1992.
  • 44. Chan C.C., Wang H.P.: Design and development of a stochastic high-level Petri net systems for FMS performance evaluation. Int. Journal of Production Research, vol. 31, no 10, pp. 2415-2440, 1993.
  • 45. Chao D.Y., Zhou M.-C., Wang D.T.: Extending knitting technique to Petri net synthesis of automated manufacturing systems. The Computer Journal, vol. 37, no 1, pp. 67-76, 1994.
  • 46. Chiola G., Dutheillet C., Franceschinis G., Haddad S.: Stochastic well-formed colored nets and multiprocessor modelling applications. “High-level Petri Nets – theory and application”, Jensen K., Rozenberg G. (eds.) pp. 504-530, Springer-Verlag 1991.
  • 47. Chu F., Xie X.: Deadlock analysis of Petri nets using siphons and mathematical programming. IEEE Trans. on Robotics and Automation, vol. 13, no 6, pp. 793-804, 1997.
  • 48. Clarke E.M., Grumberg O., Minea M., Peled D.: State spece reduction using partial order techniques. International Journal on software Tools for Technology Transfer, vol. 2, no 3, pp. 279-287, 1999.
  • 49. Coleman J.L.: Algorithms for product-from stochastic Petri nets – a new approach. Proc. 5th Int. Workshop on Petri Net and Performance Models (PNPM’93) Toulouse, France, pp. 108-116, 1993.
  • 50. Commoner F., Holt A.W., Even S., Pnueli A.: Marked directed graphs. Journal of Computer and System Science, vol. 5, pp. 511-532, 1971.
  • 51. Commoner F.: Deadlocks in Petri Nets. Report CS-7206-2311, Applied Data Research, Wakefiels 1972.
  • 52. Coolahan J.E. Jr., Roussopoulos N.: Timing requirements for time-driven systems using augmented Petri nets. IEEE Trans. on Software Engineering, vol. 9, no 5, pp. 603-616, 1997.
  • 53. Courtiat J.P., Ayache J.M., Algayres B.: Petri nets are good for protocols. Computer Communication Review, vol. 14, no 2, pp. 66-74, 1984.
  • 54. David R., Alla H.: Petri nets for modelling of dynamic systems – a survey. Automatica, vol. 30, no 2, pp. 175-202, 1994.
  • 55. Dennis J.B. (ed.): Record of the Project MAC Conference on Concurrent Systems and Parallel Computation. Cambridge, MA 1970.
  • 56. Desel J., Esparza J.: Free choice Petri nets (Cambridge Tracts in Theoretical Computer Science 40). Cambridge University Press 1995.
  • 57. Desel J., Esparza J.: Shortest paths in reachability graphs. Journal of Computer and System Sciences, vol. 51, no 2, pp. 314-323, 1995.
  • 58. Destochers A.A., Al-Jaar R.Y.: Applications of Petri nets in manufacturing systems. IEEE Press 1995.
  • 59. DiCesare F., Harhalakis G., Proth J.M., Silva M., Vernadat F.B.: Practice of Petri nets in manufacturing. Chapman & Hall 1993.
  • 60. Diekert V.: A partial trace semantics for Petri nets. Theoretical Computer Science, vol. 134, no 1, pp. 87-105, 1994.
  • 61. Donatelli S., Sereno M.: On the product from solution for stochastic Petri nets. “Applications and Theory of Petri Nets 1992” (Lecture Notes in Computer Science 616) pp. 154-172, Springer-Verlag 1992.
  • 62. D’Souza K., Kalwyn A.: A control model for detecting deadlocks in an automated machining cell. Computer and Industrial Engineering, vol. 26, no 1, pp. 133-139, 1994.
  • 63. Dugan J.B., Bobbio A., Ciardo G., Trivedi K.: The design of a unified package for the solution of stochastic Petri net models. Proc. Int. Workshop on Timed Petri Nets, Toriono, Italy, pp. 6-13, 1985.
  • 64. Dugan J.B., Trivedi K.S., Geist R.M., Nicola V.F.: Extended stochastic Petri nets – applications and analysis. “Performance’84”, pp. 507-519, Elsevier 1984.
  • 65. Duri S., Buy U., Devarapalli R., Schatz S.: Application and experimental evaluation of state space reduction methods for deadlock analysis on Ada. ACM Trans. on Software Engineering and Methodology, vol. 3, no 4, pp. 340-380, 1994.
  • 66. Esparza J.: Model checking using net unfolding. Science of Computer Programming, vol. 23, no 2-3, pp. 151-195, 1994.
  • 67. Esparza J., Roemer S., Volger W.: an improvement of McMillan’s unfolding algorithm. “Tools and Algorithms for the Construction and analysis of Systems” (Lecture Notes in Computer Science 1055) pp. 87-106, Springer-Verlag 1996.
  • 68. Ezpelate J., Colom J.M., Martinez J.: A Petri net based deadlock prevention policy for flexible manufacturing systems. IEEE Trans. on Robotics and Automation, vol. 11, pp. 793-804, 1995.
  • 69. Ezpelate J.,Garcia-Valles F., Colom J.M.: A class of well structured Petri nets for flexible manufacturing systems. “Applications and Theory of Petri Nets 1998” (Lecture Notes in Computer Science 1420) pp. 64-83, 1998.
  • 70. Fanti M.P., Maione B., Mascolo S., Turchiano B.: Event-based feedback control for deadlock avoidance in flexible production systems. IEEE Trans. on Robotics and Automation, vol. 13, pp. 347-363, 1997.
  • 71. Feldbrugge F.: Petri net tool overview 1992. “Advances in Petri Nets 1993” (Lecture Notes in Computer Science 674) pp. 169-203, Springer-Verlag 1993.
  • 72. Freedman P.: Time, Petri nets and robotics. IEEE Trans. on Robotics and Automation, vol. 7, no 4, pp. 417-433, 1991.
  • 73. Frey G., Mossing K., Schnabel M.: Assembly line sequencing based on Petri net T-invariants. Proc. 9th IFAC Symp. On Information Control in Manufacturing (INCOM’98) Nancy-Metz, France, vol. 2, pp. 33-38, 1998.
  • 74. Garg K.: An approach to performance specification of communication protocols using timed Petri nets. IEEE Trans. on Software Engineering, vol. 11, no 10, pp. 1216-1225, 1985.
  • 75. Genrich H.J., Lautenbach K.: Systems modelling with high-level Petri nets. Theoretical computer Science, vol. 13, pp. 109-136, 1981.
  • 76. Giua A., Dicesare F.: Blocking and controllability of Petri nets in supervisory control. IEEE Trans. on Automatic Control, vol. 39, no 4, pp. 818-823, 1994.
  • 77. Goodman R.: Introduction to Stochastic Models. Benjamin/Cummings 1988.
  • 78. Govindarajan R., Nemawarkar S.S., LeNir P.: Design and performance evaluation of a multithreaded architecture. Proc. First IEEE Symp. On high-Performance Computer Architecture, Raleigh, NC, pp. 298-307, 1995.
  • 79. Govindarajan R., Suciu F., Zuberek W.M.: Timed Petri net models of multithreaded multiprocessor architectures. Proc. 7th Int. Workshop on Perti Net and Performance Models (PNPM’97) St. Malo, France, pp. 153-162, 1997.
  • 80. Godefroid P.: Using partial orders to improve automatic verification methods. “Computer Aided Verification” (Lecture Notes in Computer Science 531) pp. 176-185, Springer-Verlag 1991.
  • 81. Godefroid P., Wolper P.: Using partial orders for the efficient verification of deadlock freedom and safety properties. “Computer Aided Verification” (Lecture Notes in Computer Science 575) pp. 332-342, Springer-Verlag 1992.
  • 82. Graves B.: Computing reachability properties hidden in finite net unfoldings. “Foundations of Software Technology and Theoretical Computer Science” (Lecture Notes in Computer Science 1346) pp. 327-341, Springer-Verlag 1997.
  • 83. Haas P.J., Shedler G.S.: Stochastic Petri nets with simultaneous transition firings. Proc. Int. Workshop on Petri Nets and Performance Models (PNPM’87) Madison, WI, pp. 24-32, 1987.
  • 84. Hack M.: Analysis of production schemata by Petri nets. Project MAC Technical Report TR-94, 1972.
  • 85. Hanen C., Chretienne P., Carlier J.: Modeling and optimizing pipelines with timed petri nets. Proc. 7th European workshop on applications and Theory of Petri Nets, Oxford, England, pp. 432-447, 1986.
  • 86. Hanisch H-M.: Analysis of place/transition nets with time arcs and its application to batch process control. “Applications and Theory of Petri Nets 1993” (Lecture Notes in Computer Science 691) pp. 282-299, Springer-Verlag 1994.
  • 87. Hanisch H-M., Thieme J., Kueder A., Wienhold O.: Modelling of PLC behaviour by means of timed net condition/event systems. Proc. 6th IEEE Int. Conference on Emerging Technologies and Factory Automation, pp. 391-396, 1997.
  • 88. Hatono I., Yamagata K., Tamura H.: Modeling and on-line scheduling of flexible manufacturing systems using stochastic Peri nets. IEEE Trans. on Software Engineering, vol. 17, no 2, pp. 126-132, 1991.
  • 89. Hillion H.P.: Timed Petri nets and application to multi-stage production system. “Advances in Petri Nets 1989” (Lecture Notes in Computer Science 424) pp. 281-305, Springer-Verlag 1989.
  • 90. Hillion H.P., Proth J.M.: Performance evaluation of job-shop systems using timed event graphs. IEEE Trans. on Automatic Control, vol. 34, no 1, pp. 149-154, 1989.
  • 91. Hillston J.: A compositional approach to performance modelling. Cambridge University Press 1996.
  • 92. Hoogers P.W., Kleijn H.C.M., Thiagarajan P.S.: A trace semantics for Petri nets. Information and Computation, vol. 117, pp. 98-114, 1995.
  • 93. Holliday M.A., Vernon M.K.: A generalized timed Petri net model for performance evaluation. Proc. Int. Workshop on Timed Petri Nets, Torino, Italy, pp. 181-190, 1985.
  • 94. Holliday M.A., Vernon M.K.: Exact performance estimates for multiprocessor memory and bus interference. IEEE Tran. on Computers, vol. 36, no 1, pp. 76-85, 1987.
  • 95. Holloway L.E., Krogh B.H., Giua A.: A survey of Petri net methods for controlled discrete event systems. Discrete Event Dynamic Systems: Theory and Applications, vol. 7, no 2, pp. 151-190, 1997.
  • 96. Holt A.W., Commoner F.: Events and conditions. Information Systems Theory Project, Applied Data Research, Princeton, NJ 1970.
  • 97. Holt A.W., Saint H., Shapiro R., Warshall S.: Final Report of the Information Systems theory Project. Technical Report RADC-TR-68-305, New York, Griffiss Air Force Base 1968.
  • 98. Hwang C-H., Lee D-I.: A concurrency characteristic on Peti net unfolding. IEICE Trans. on Fundamentals in Electronics, Communications and computer Science, vol. E81-A, no 4, pp. 532-539, 1998.
  • 99. Jafari M.A.: An architecture for a shop-floor controller using colored petri nets. Journal of Manufacturing systems, vol. 4, no 4, pp. 159-181, 1992.
  • 100. Janicki R., Koutny M.: Invariant semantics of nets with inhibitor arcs. “CONCUR’91” (Lecture Notes in Computer Science 527) pp. 317-331, 1991.
  • 101. Janicki R., Koutny M.: Invariants and paradigms of concurrency theory. Future Generation Computer Systems, vol. 8, no 4, pp. 423-435, 1992.
  • 102. Janicki R., Koutny M.: Semantics of inhibitor nets. Information and Computation, vol. 123, no 1, pp. 1-16, 1995.
  • 103. Janicki R., Koutny M.: On causality semantics of nets with priorities. Fundamenta Informaticae, vol. 38, no 3, pp. 223-255, 1999.
  • 104. Jategaonkar L., Meyer A.: Deciding true concurrency equivalences on finite safe nets. “Automate, Languages and Programming” (Lecture Notes in Computer Science 700) pp. 519-531, 1993.
  • 105. Jeng M.D., Lin C.S.: Perti nets for the formulation of aperiodic scheduling problems in FMS. Proc. 6th IEEE Conference on Emerging Technologies and Factory Automation, pp. 375-380, 1997.
  • 106. Jeng M.D., Peng M.Y.: Augmented reachability trees for 1-place unbounded generalized Petri nets. IEEE Trans. on Systems, Man and Cybernetics. Part A: Humans and systems, vol. 29, no 2, pp. 173-183, 1999.
  • 107. Jensen K.: High-level Petri nets. “Application and Theory of Petri Nets” (Informatik-Fachberichte 66) pp. 166-180, Springer-Verlag 1983.
  • 108. Jensen K.: Coloured Petri Nets. “Advanced Course on Petri Nets 1986” (Lecture Notes in Computer Science 254) G. Rozenberg (ed.) pp. 248-299, Springer-Verlag 1987.
  • 109. Jensen K.: A brief introduction to colored Petri nets. Proc. Workshop on the applicability of Formal Models, Aarhus, Denmark, pp. 55-58, 1998.
  • 110. Johnsonbaugh R., Murata T.: Additional methods for reduction and expansion of marked graphs. IEEE Trans. on Circuits and Systems, vol. 29, no 10, pp. 1009-1014, 1981.
  • 111. Juanole G., Rouz J.L.: On the pertinence of the extended time Petri net model for analyzing communication activities. Proc. 3rd Int. Workshop on Petri Nets and Performance Models (PNPM’89) Kyoto, Japan, pp. 230-239, 1989.
  • 112. Karp R.M., Miller R.E.: Parallel program schemata. Journal of Computer and Systems Science, vol. 3, pp. 147-195, 1969.
  • 113. Kim J., Desrochers A.A.: Modeling and analysis of semiconductor manufacturing plants using time Petri net models. Proc. IEEE Int. Conference on Systems, Man and Cybernetics, pp. 3227-3232, 1997.
  • 114. Knapp G.M., Wang H.P.: Modeling of automated storage/retrieval systems using Petri nets. Journal of Manufacturing Systems, vol. 11, no 2, pp. 112-117, 1992.
  • 115. Kochikar V.P., Narendran T.T.: Modeling automated manufacturing systems using a modification of colored Petri nets. Robotics and Computer Integrated Manufacturing, vol. 9, no 3, pp. 181-189, 1992.
  • 116. Kosaraju S.R.: Limitations of Dijkstra’s semaphore primitives and Petri nets. Operating Systems Review, vol. 7, no 4, pp. 122-126, 1973.
  • 117. Kristensen L.M., Christensen S., Jensen K.: The practitioner’s guide to coloured Petri nets. International Journal of Software Tools for Technology Transfer, vol. 2, no 2, pp. 98-132, 1998.
  • 118. Krueckeberg F., Jaxy M.: Mathematical methods for calculating invariants in Petri nets. “Advances in Petri Nets 1987” (Lecture Notes in Computer Science 266) pp. 104-131, Springer-Verlag 1987.
  • 119. Kumagai S., Kodama S., Naito T., Sawai T.: On the structural properties of extended marked graphs. Proc. IEEE Int. Symp. on Circuits and Systems, Montreal, Canada, pp. 1396-1389, 1984.
  • 120. Lamport L.: Composition: a way to make proofs harder. “Compositionality: The Significant Difference” (Lecture Notes in Computer Science 1536) pp. 402-423, Springer-Verlag 1998.
  • 121. Landweber L.H., Robertson E.L.: Properties of conflict free and persistent nets. Journal of the ACM, vol. 25, no 3, pp. 352-364, 1978.
  • 122. Lautenbach K.: Linear algebraic techniques for place/transition nets. “Advances in Petri Nets 1986” (Lecture Notes in Computer Science 254) pp. 142-167, Springer-Verlag 1987.
  • 123. Lazat A.A., Robertazzi T.G.: Markovian Petri net protocols with product from solution. Performance Evaluation, vol. 12, no 1, pp. 67-77, 1991.
  • 124. Lee C.C., Lin J.T.: Deadlock prediction and avoidance based on Petri nets for zone-control automated guided vehicle systems. Int. Journal of Production Research, vol. 33, no 12, pp. 3249-3265, 1995.
  • 125. Lester B.P.: Analysis of firing rated in Petri nets using linear algebra. 1985 Int. Conf. on Parallel Processing, pp. 217-224, 1985.
  • 126. Leveson N.G., Stolzy J.L.: Safety analysis using Petri nets. IEEE Trans. on Software Engineering, vol. 13, no 3, pp. 386-297, 1987.
  • 127. Li Y., Woodside C.M.: Iterative decomposition and aggregation of stochastic marked graph Petri nets. “Advances in Petri Nets 1993” (Lecture Notes in Computer Science 674) pp. 325-349, Springer-Verlag 1993.
  • 128. Lin C., Marinescu D.C.: Stochastic high-level Petri nets and applications. IEEE Trans. on Computer, vol. 37, no 7, pp. 815-825, 1988.
  • 129. Lndemann C.: Performance modelling with deterministic and stochastic Petri nets. Wiley and Sons 1998.
  • 130. Londqvist M.: Parameterized reachability tress for predicate/transition nets. “High-level Petri Nets – theory and application”, Jensen K., Rozenberg G. (eds.) pp. 351-372, Springer-Verlag 1991.
  • 131. Liu C.M., Wu F.C.: Using Petri nets to solve FMS problems. Int. Journal of Computer Integrated Manufacturing, vol. 6, no 3, pp. 175-185, 1993.
  • 132. McMillan K.L.: Using unfolding to avoid the state explosion problem in the verification of asynchronous circuits. “Computer Aided Verification” (Lecture Notes in Computer Science 663) pp. 164-177, Springer-Verlag 1992.
  • 133. Maggiolo-Schettini A., Winkowski J.: A compositional semantics for time Petri nets. Fundamenta Informaticae, vol. 13, no 2, pp. 141-170, 1990.
  • 134. Magott J.: Performance evaluation of concurrent systems using Petri nets. Information Processing Letters, vol. 18, no 1, pp. 7-13, 1984.
  • 135. Magott J.: Performance evaluation of systems of cyclic sequential processes with mutual exclusion using Petri nets. Information Processing Letters, vol. 21, no 11, pp. 229-232, 1985.
  • 136. Magott J.: New NP-complete problems in performance evaluation of concurrent systems using Petri nets. IEEE Trans. of Software Engineering, vol. 13, no 5, pp. 578-581, 1987.
  • 137. Magott J.: Performance evaluation of concurrent systems using conflict-free and persistent Petri nets. Information Processing Letters, vol. 26, no 1, pp. 77-80, 1987.
  • 138. Magott J.: Sieci Petriego w ocenie wydajności systemów komputerowych. Prace Naukowe Instytutu Cybernetyki Technicznej Politechniki Wrocławskiej, nr 80, Seria: Monografie, nr 15, Wydawnictwo Politechniki Wrocławskiej 1989.
  • 139. Magott J., Skudlarski K.: Combining generalized stochastic Petri nets and PERT networks for the performance evaluation of concurrent processes. Proc. 3rd Int. Workshop on Petri Nets and Performance Models (PNPM’89) Kyoto, Japan, pp. 249-256, 1989.
  • 140. Martinez J., Silva M.: Simple and fast algorithm to obtain all invariants of a generalized Petri net. “Applications and Theory of Petri Nets” (Informatik Fachberichte 52). Pp. 301-310, Springer-Verlag 1982.
  • 141. Mayr E.W.: An algorithm fo the general Patri net reachability problem. SIAM Journal on Computing, vol. 13, no 3, pp. 441-460, 1984.
  • 142. Mazurkiewicz A.: Trace theory. “Advanced Course on Petri Nets” (Lecture Notes in Computer Science 256) pp. 279-324, Springer-Verlag 1987.
  • 143. Mazurkiewicz A.: Basic notions of trace theory. “Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency” (Lecture Notes in Computer Science 354) pp. 285-363, Springer-Verlag 1989.
  • 144. Mazurkiewicz A.: Introduction to trace theory. “A Book of Trace”, pp. 1-41, world Scientific 1995.
  • 145. Memmi G.: A graph theoretical property for minimal deadlock. “Applications and Theory of Petri Nets” (Informatik-Fachberichte 66) pp. 221-228, Springer-Verlag 1983.
  • 146. Memmi G., Finkel A.: An introduction to FIFO nets – monogeneous nets: a subclass of FIFO nets. Theoretical Computer Science, vol. 35, no 2, pp. 191-214, 1985.
  • 147. Merlin P.M., Farber D.J.: Recoverability of communication protocols – implications of a theoretical study. IEEE Trans. on Communications, vol. 24, no 9, pp. 1036-1049, 1976.
  • 148. Meseguer J., Montanari U., Sassone V.: Process versus unfolding semantics for place/transition Petri nets. Theoretical Computer Science, vol. 153, no 1-2, pp. 171-210, 1996.
  • 149. Meseguer J., Montanari U., Sassone V.: On the semantics of place/transition Petri nets. Mathematical Structures in Computer Science, vol. 7, no 4, pp. 359-397, 1997.
  • 150. Mikami K., Tamura H., Sengoku M., Yamaguchi Y.: On a sufficient condition for a matrix to be the synchronic distance matrix of a marked graph. IEICE Trans. on Fundamentals in Electronics, Communications and Computer Science, vol. E76-A, no 10, pp. 1607-1609, 1993.
  • 151. Miyamoto T., Nakano S., Kumagai S.: An algorithm for Petri nets reachability by unfolding. IEICE Trans. on Fundamentals in Electronics, Communications and Computer Science, vol. E82-A, no 3, pp. 500-503, 1999.
  • 152. Molloy M.K.: Performance analysis using stochastic Petri Nets. IEEE Trans. on Computers, vol. 31, no 9, pp. 913-917, 1982.
  • 153. Moode J.O., Antsaklis P.J.: supervisory control of discrete event systems using Petri nets. Kluwer Academic Publisher 1998.
  • 154. Moore S.W.: Multithreaded processor design. Kluwer Academic Publisher 1996.
  • 155. Morin R., Rozoy B.: On the semantics of place/transition nets. “CONCUR’99: Concurrency Theory” (Lecture Notes in Computer Science 1664) pp. 447-462, Springer-Verlag 1999.
  • 156. Murata T.: Circuit theoretic analysis and synthesis of marked graphs. IEEE Trans. Circuits and systems, vol. 24, no 7, pp. 400-405, 1977.
  • 157. Murata T.: Petri nets: properties, analysis and applications. Proceedings of IEEE, vol. 77, no 4, pp. 541-580, 1989.
  • 158. Nielsen M., Sassone V.: Petri nets and other models of concurrency. “Lectures on Petri Nets I: Basic Models” (Lecture Notes in Computer Science 1491) pp. 587-642, Springer-Verlag 1998.
  • 159. Odersky M.: Functional nets. “Programming Languages and Systems” (Lecture Notes in Computer Science 1782) pp. 1-25, Springer-Verlag 2000.
  • 160. Onaga K.: analysis of Cyclic behaviours of multi-PERT Petri nets via extended marked graphs. IEEE Int. Symp. on Circuits and Systems, Kyoto, Japan, pp. 475-478.
  • 161. Ozsu M.T.: Modelling and analysis of distributed database concurrency control algorithms using an extended Petri net formalism. IEEE Trans. Software Engineering, vol. 11, no 10, pp. 1225-1240, 1985.
  • 162. Pator E., Cortadella J., Pena M.A.: structural methods to improve the symbolic analysis of Petri nets. “Application and Theory of Petri Nets” ” (Lecture Notes in Computer Science 1639) pp. 26-45, Springer-Verlag 1999.
  • 163. Peterson J.L.: Petri nets. ACM Computing Surveys, vol. 9, no 3, pp. 223-252, 1977.
  • 164. Peterson J.L.: Petri net theory and the modelling of systems. Prentice-Hall 1981.
  • 165. Petri C.A.: Kommunikation mit Automaten. Ph. D. Disseratation, University of Bonn, Bonn, Germany 1962. Also: Memorandum MAC-M-212, Project MAC, Massachuetts Institute of Technology, Cambridge, MA.
  • 166. Pratt V.: Modelling concurrency with partial orders. Journal of Parallel Programming, vol. 15, no 1, pp. 33-71, 1986.
  • 167. Probst D.K., Li H.F.: Using partial order semantics to avoid the state explosion problem in asynchronous systems. “Computer Aided Verification” (Lecture Notes in Computer Science 531) pp. 146-165, Springer-Verlag 1991.
  • 168. Proth J.M., Xie X.: Petri Nets. Wiley & Sons 1996.
  • 169. Rajsbaum S.: Stochastic marked graphs. Proc. 4th Int. Workshop on Petri Net and Performance Models (PNPM’91) Melbourne, Australia, pp. 95-101, 1991.
  • 170. Raju K.R., Chetty O.VK.: Design and evaluation of automated guided vehicle systems for flexible manufacturing systems: an extended timed Petri nets based approach. Int. Journal of Productions Research, vol. 31, no 5, pp. 34-40, 1993.
  • 171. Raju K.R., Chetty O.VK.: Priority nets for scheduling flexible manufacturing systems. Journal of manufacturing systems, vol. 12, pp. 326-340, 1993.
  • 172. Ramaswamy S.E., Joshi S.B.: Deadlock-free schedules for automated manufacturing workstations. IEEE Trans. on Robotics and Automation, vol. 12, no 3, pp. 391-400, 1996.
  • 173. Ramchandani C.: Analysis of asynchronous concurrent systems by Petri nets. Project MAC Technical Report TR-120, MIT 1974.
  • 174. Razouk R.R.: The derivation of performance expressions for communication protocols from timed Petri nets. Computer Communication Revie, vol. 14, no 2, pp. 210-217, 1984.
  • 175. Razouk R.R., Phelphs C.V.: Performance analysis using timed Petri nets. “Protocol Specification, Testing and Verification IV” (Proc. of the IFIP WG 6.1 Fourth Int. Workshop) pp. 561-576, north-Holland 1985.
  • 176. Reddy C.E., Chetty O.V.K., Chaudhuri D.: A Petri net based approach for analyzing tool management issues in FMS. Int. Journal of Production Research, vol. 30, no 6, pp. 1427-1446, 1992.
  • 177. Reising W.: Deterministic buffer synchronization of sequential processes. Acta Informatica, vol. 18, no 2, pp. 117-134, 1982.
  • 178. Reising W.: Petri nets – an introduction (EATCS Monographs on Theoretical Computer Science 4). Springer-Verlag 1985.
  • 179. Reising W.: Elements of distributed algorithms – modelling and analysis with Petri nets. Springer-Verlag 1999.
  • 180. Reveliotis S.A., Lawley M.A., Ferreira P.M.: polynomial complexity deadlock avoidance policy for flexible manufacturing systems. IEEE Trans. on Robotics and Automation, vol. 13, pp. 1344-1357, 1997.
  • 181. Roever de, W-P.: The need for compositional proof system: a survey. “Compositionality: The Significant Difference” (Lecture Notes in Computer Science 1536) pp. 1-22, Springer-Verlag 1998.
  • 182. Sacha K.: Transnet: a method for transformational development of embedded software. Microprocessing and Microporogramming, vol. 32, no 1-5, pp. 617-624, 1991.
  • 183. Sacha K.: Real-time specification using Petri nets. Microprocessing and Microporogramming, vol. 38, no 1-5, pp. 607-614, 1993.
  • 184. Sacha K.: Projektowanie oprogramowanie systemów wbudowanych. Prace Naukowe – Elektronika, Politechnika Warszawska, warszawa 1996.
  • 185. Schmidt K.: Parameterized reachability trees for algebraic Petri nets. “Application and Theory of Petri Nets 1995” (Lecture Notes in Computer Science 935) pp. 392-411, Springer-Verlag 1995.
  • 186. Sereno M., Balbo G.: Computational algorithms for product-from solution of stochastic Petri nets. Proc. 5th Int. Workshop on Petri Net and Performance Models (PNPM’93) Toulouse, France, pp. 98-107, 1993.
  • 187. Shimomata H., Kataoka S., Yamada T.: A resource-allocation problem on timed marked graphs – a decomposition approach. International Journal of Systems Science, vol. 27, no 4, pp. 405-411, 1996.
  • 188. Sifakis J.: Use of Petri nets for performance evaluation. “Measuring, modelling and evaluating computer systems”, pp. 75-93, North-Holland 1977.
  • 189. Sifakis J.: Structural properties of Petri nets. “Mathematical Foundations of Computer Science 1978” (Lecture Notes in Computer Science 64) pp. 474-483, Springer-Verlag 1978.
  • 190. Silva M., Valette R.: Petri nets and flexible manufacturing. “Advances in Petri Nets 1989” (Lecture Notes in Computer Science 424) pp. 374-417, Springer-Verlag 1989.
  • 191. Srinivasan R.S.: Modeling and performance analysis of cluster tools using Petri nets. IEEE Trans. on Semiconductor Manufacturing, vol. 11, no 3, pp. 394-403, 1998.
  • 192. Srinivasan V.S., Jafari M.A.: Monitoring and fault detection on shop floor using timed Petri nets. IEEE Conference on Systems, Man and Cybernetics, pp. 355-360, 1991.
  • 193. Stewart W.J.: Introduction to the numerical solution of Markov chains. Princeton University Press 1994.
  • 194. Sun T.H., Cheng C.W., Fu L.C.: A Petri net based approach to modelling and scheduling for an FMS and a case study. IEEE Trans. on Industrial Electronics, vol. 41, no 6, pp. 593-601, 1994.
  • 195. Suzuki I.: On the notion of simultaneous firings of transition in Petri nets and marked graphs. Proc. 24th Midwest Symposium on circuits and Systems, Morgantown, WV, pp. 716-719, 1984.
  • 196. Suzuki I., Murata T.: A method for stepwise and abstraction of Petri nets. Journal of Computer and System Sciences, vol. 27, no 1, pp. 51-76, 1983.
  • 197. Symons F.J.W.: The description and definition of queueing systems by numerical Petri nets. Australian Telecommunication Research, vol. 13, no 2, pp. 20-31, 1980.
  • 198. Tamura H., Abe T., Shinoda S.: Obtaining a marked graph from a synchronic distance matrix. Electronics and Communications in Japan. Part III – Fundamental Electronic Science. Vol. 79, no 3, pp. 53-63, 1996.
  • 199. Teruel E., Silva M.: Structure theory of equal conflict systems. Theoretical Computer Science, vol. 153, no 1-2, pp. 271-300, 1996.
  • 200. Thirusangu K., Rangarajan K.: A note on the construction of marked graphs. Information Processing Letters, vol. 55, no 4, pp. 211-215, 1995.
  • 201. Thirusangu K., Rangarajan K.: Marked graphs. Microelectronics and Reliability, vol. 37, no 2, pp. 225-235, 1997.
  • 202. Thulasiraman K., Comeau M.A.: Maximum-weight markings in marked graphs: algorithms and interpretations based on simplex method. IEEE Trans. on Circuits and Systems, vol. 34, no 12, pp. 1535-1545, 1987.
  • 203. Thomas J.P., Nisanke M., Baker K.D.: A hierarchical Petri net framework for the representation and analysis of assembly. IEEE Trans. on Robotics and Automation, vol. 12, no 2, pp .168-279, 1996.
  • 204. Torn A.A.: Simulation nets, a simulation, modelling and validation tool. Simulation Journal, vol. 45, no 2, pp. 71-75, 1985.
  • 205. Tsuji K., Kumagi S., Kodama s., Takeda S.: On the liveness of extended marked graphs. Proc. IEEE Int. Symp. on Circuits and Systems, Kyoto, Japan, pp. 471-474, 1985.
  • 206. Valavanis K.P.: On the hierarchical modelling, analysis and simulation of FMSs with extended Petri nets. IEEE Trans. on systems, Man, and Cybernetics, vol. 20, no 1, pp. 94-100, 1990.
  • 207. Valette R.: Analysis of Petri nets by stepwise refinement. Journal of Computer and System Sciences, vol. 18, no 1, pp. 35-46, 1979.
  • 208. Valette R.: Nets in production systems. “Advances in Petri Nets 1986” (Lecture Notes in Computer Science 255) pp. 191-217, springer-Verlag 1987.
  • 209. Valk R.: Test on zero in petri nets. “Applications and Theory of Petri Nets” (Informatik-Fachberichte 52). pp. 193-197, Springer-Verlag 1982.
  • 210. Valmari A.: Stubborn sets for reduced state generation. Proc. 10th Conf. on application and Theory of Petri Nets, Bonn, Germany, vol. 2, pp. 1-22, 1989.
  • 211. Valmari A.: A stubborn attack on the state explosion problem. “Computer Aided Verification” (Lecture Notes in Computer Science 531) pp. 156-165, Springer-Verlag 1991.
  • 212. Venkatesh K., Kaighobadi M., Zhou M-C., Caudill R.J.: Augmented timed Petri nets for modelling of robotic systems with breakdowns. Journal of Manufacturing Systems, vol. 12, no 4, pp. 289-301, 1994.
  • 213. Viswanadham N., Narahari Y., Johson L.: Deadlock prevention and avoidance in flexible manufacturing systems using Petri net models. IEEE Trans. on Robotics and Automation, vol. 6, no 6, p. 713-723, 1990.
  • 214. Volger W.: Failures semantics and deadlocking of modular Petri nets. Acta Informatica, vol. 26, no 4, pp. 333-348, 1989.
  • 215. Volger W.: Partial order semantics and read arcs. “Mathematical Foundations of Computer Science 1997” (Lecture Notes in Computer Science 1295) pp. 508-517, 1997.
  • 216. Volger W., Semenov A., Yakolev A.: Unfolding and finite prefix for nets with read arcs. “CONCUR’98: Concurrency Theory” (Lecture Notes in Computer Science 1466) pp. 501-516, Springer-Verlag 1998.
  • 217. Voss K.: Using predicate/transition nets to model and analyze distributed database systems. IEEE Trans. on software Engineering, vol. 6, no 6, pp. 539-544, 1980.
  • 218. Wang I.Y., Robertazzi T.G.: Service stage Petri net models with product form solution. Queueing Systems, vol. 7, pp. 355-374, 1990.
  • 219. Wang J., Timed Petri nets. Kluwer Academic Publ. 1998.
  • 220. Wang J., Jiang S.: Stochstic Petri net models of communication and flexible systems. “Petri Nets in Flexible and Agile Automation”, pp. 207-238, Kluwer Academic Publ. 1995.
  • 221. Weber W.D., Gupta A.: Exploring the benefits od multiple contexts in a multiprocessor architecture: preliminary results. Proc. 16th Annual Int. Symp. on computer Architecture, pp. 273-280, 1989.
  • 222. Wimmel H., Priese L.: Algebraic characterization of Petri net pomset semantic. “CONCUR’97: Concurrency Theory” (Lecture Notes in Computer Science 1243) pp. 406-420, Springer-Verlag 1997.
  • 223. Winkowski J.: Behaviours of concurrent systems. Theoretical Computer Science, vol. 12, pp. 39-60, 1980.
  • 224. Winkowski J., Maggiolo-Schettini A.: An algebra of processes. Journal of Computer and System Sciences, vol. 35, no 2, pp. 206-228, 1987.
  • 225. Winkowski J.: An algebraic way of defining the behaviours of place-transition Petri nets. Petri Net Newsletter, no 33, pp. 15-24, Bonn, Germany, 1989.
  • 226. Wolf R.W.: Stochastic modelling and the theory of queues (Prentice-Hall International Series in Industrial and systems Engineering). Prentice Hall 1989.
  • 227. Wysk R.A., Yang N.S., Joshi S.: Resolution of deadlocks in flexible manufacturing systems: avoidance and recovery approaches. Journal of Manufacturing systems,. Vol. 12, pp. 128-138, 1994.
  • 228. Xing K., Hu B., Chen H.: Deadlock avoidance policy for flexible manufacturing systems. “Petri Nets in Flexible and Agile Automation”, pp. 239-263, Kluwer Academic Publ. 1995.
  • 229. Xue Y., Kieckhafer R.M., Choobineh F.F.: automated construction of GSPN models for flexible manufacturing systems. Computer in Industry, vol. 37, no 1, pp. 17-25, 1998.
  • 230. Yamada T., Kataoka S.: On some LP problems for performance evaluation of timed marked graphs. IEEE Trans. on Automatic Control, vol. 39, no 3, pp. 696-698, 1994.
  • 231. Zhou M-C.: Petri nets in flexible and agile automation. Kluwer Academic Publisher 1995.
  • 232. Zhou M-C.: Deadlock avoidance methods for a distributed robotic system: Petri net modelling and analysis. Journal of Robotic Systems, vol. 12, no 3, pp. 177-187, 1995.
  • 233. Zhou M-C., DiCesare F.: Petri net modelling of buffers in automated manufacturing systems. IEEE Trans. on Systems, Man and cybernetics, vol. 16, no 1, pp. 157-164, 1996.
  • 234. Zhou M.C., Jeng M.D.: Modeling, analysis, simulation, and control of semiconductor manufacturing systems – a Petri net approach. IEEE Trans. on Semiconductor Manufacturing, vol. 11, no 3, pp. 333-357, 1998.
  • 235. Zhou M-C., Venkates K.: Modeling, simulation and control of flexible manufacturing systems. World Scientific Publ. 1999.
  • 236. Zuberek W.M.: Timed Petri nets an preliminary performance evaluation. Proc. 7th Annual symposium on computer Architecture, pp. 89-96, 1980.
  • 237. Zuberek W.M.: Application of timed Petri nets to analysis of multiprocessor realizations of digital filters. Proc. 25th Midwest Symp. on Circuits and systems, Houghton, MI, pp. 134-139, 1982.
  • 238. Zuberek W.M.: Augmented M-timed Petri nets, modelling and performance evaluation of computer systems. Transactions of the Society for Computer Simulation, vol. 2, no 2, pp. 135-153, 1985.
  • 239. Zuberek W.M.: Generalized M-timed Peri nets and performance evaluation of computer systems. INFOR Journal – Special Issue on Computer Systems Performance Evaluation, vol. 23, no 3, pp. 344-362, 1985.
  • 240. Zuberek W.M.: Inhibitor D-timed Petri nets and performance analysis of communication protocols. INFOR Journal – Special Issue on Computer Systems Performance Evaluation, vol. 24, no 3, pp. 231-249, 1986.
  • 241. Zuberek W.M.: M-timed Petri nets and Markov chains in modelling of computer systems. Proc. 14th ACM Computer Science Conf. (CSC’86) Cincinnati, OH, pp. 101-106, 1986.
  • 242. Zuberek W.M.: Modified D-timed Petri nets, time outs, and modelling of communication protocols. Proc. 6th Int. Conf. on distributed Computer Systems, Cambridge, MA, pp. 452-457, 1986.
  • 243. Zuberek W.M.: M-timed Petri nets, priorities, preemptions and performance evaluation of systems. “Advances in Petri Nets 1985” (Lecture Notes in Computer Science 222) pp. 478-498, Springer-Verlag 1986.
  • 244. Zuberek W.M.: D-timed Petri nets and modelling of timeouts and protocols. Transactions of the Society for Computer Simulation, vol. 4, no 4, pp. 331-357, 1987.
  • 245. Zuberek W.M.: Preemptive D-timed Petri nets, timeouts, modelling and analysis of communication protocols. Proc. IEEE Sixth Annual conf. on global Networks (INFOCOM’87) San Francisco, CA, pp. 721-730, 1987.
  • 246. Zuberek W.M.: Performance evaluation using unbounded timed Patri nets. Proc. 3rd Int. Workshop on Petri Nets and Performance Models (PNPM’89) Kyoto, Japan, pp. 180-186, 1989.
  • 247. Zuberek W.M.: Performance evaluation using timed colored Petri nets. Proc. 33rd Midwest Symp. on Circuit and Systems (Special Session on Petri Net Models) Calgary, Alberta, pp. 779-782, 1990.
  • 248. Zuberek W.M.: Timed Petri nest – definitions, properties and applications. Microelectronics and Reliability (Special Issue on Petri Nets and Related Graph Models) vol. 31, no 4, pp. 627-644, 1991.
  • 249. Zuberek W.M.: Schedules of flexible manufacturing cells and their timed colored Petri net models. Proc. IEEE Int. Conf. on systems, Man and cybernetics (SMC’95) Vancouver, BC, pp. 2142-2147, 1995.
  • 250. Zuberek W.M.: Application of timed Petri nets to modelling and analysis of flexible manufacturing cells. Technical Report #9503, Department of Computer Science, Memorial University of Newfoundland, St. John’s, NF, Canada A1B 3X5, 1995 (available through anonymous ftp at ftp.cs.mun.ca/pub/techreports/tr-9503.ps.Z).
  • 251. Zuberek W.M.: Composite schedules of manufacturing cells and their timed Petri net models. Proc. IEEE Int. Conf. on systems, Man and cybernetics (SMC’96) Beijing, China, pp. 2990-2995, 1996.
  • 252. Zuberek W.M.: Modeling using timed Petri nets – model description and representation. Technical Report #9601, Department of Computer Science, Memorial University of Newfoundland, St. John’s, NF, Canada A1B 3X5, 1996 (available through anonymous ftp at ftp.cs.mun.ca/pub/techreports/tr-9601.ps.Z).
  • 253. Zuberek W.M.: Modeling using timed Petri nets – event-driven simulation. Technical Report #9602, Department of Computer Science, Memorial University of Newfoundland, St. John’s, NF, Canada A1B 3X5, 1996 (available through anonymous ftp at ftp.cs.mun.ca/pub/techreports/tr-9602.ps.Z).
  • 254. Zuberek W.M.: Hierarchical derivation of schedules for manufacturing cells. Proc. 9th Symp. on Information Control in Manufacturing (INCOM’98) Nancy-Metz, France, pp. 423-428, 1998.
  • 255. Zuberek W.M.: Stepwise refinements of net models and their place invariants. Proc. 8th Int. Workshop on Perti Net and Performance Models (PNPM’99) Zaragoza, Spain, pp. 92-101, 1999.
  • 256. Zuberek W.M.: Hierarchical derivation of Petri net models of composite schedules for manufacturing cells. Proc. IEEE Int. Conf. on systems, Man and cybernetics (SMC’99) Tokyo, Japan, vol. 3, pp. 775-780, 1999.
  • 257. Zuberek W.M.: Discrete-event simulation of timed Petri net models. Proc. 33rd Annual Simulation Symposium, Washington D.C., pp. 91-98, 2000.
  • 258. Zuberek W.M.: Performance modelling of multithreaded memory architectures. “ Hardware Design and Petri Nets”, A. Yakovlev, K. Gomes (eds.) pp. 311-331, Kluwer Academic Publishers 2000.
  • 259. Zuberek W.M.: Performance comparison of fine-grain and block multithreaded architectures. Proc. High Performance Computing Symposium (HPC’2000) Washington D.C., pp. 383-388, 2000.
  • 260. Zuberek W.M., Bluemke I.: Hierarchies of place/transition refinements in Petri nets. Proc. 5th IEEE Int. Conf. on emerging Technologies and Factory Automation (ETFA’96) Kauai, Hawaii, pp. 355-360, 1996.
  • 261. Zuberek W.M., Govindarajan R.: Performance balancing in multithreaded multiprocessor architectures. Proc 4th Australasian Conf. on Parallel and Real-Time Systems (PART’97) Newcastle, Australia, pp. 15-26, 1997.
  • 262. Zuberek W.M., Govindarajan R., Suciu F.: Timed colored Petri net models of distributed memory multithreaded multiprocessors. Proc. Workshop on Practical Use of Colored Petri Nets and Design/CPN (CPN’98) Aarhus, Denmark, pp. 253-270, 1998.
  • 263. Zuberek W.M., Kubiak W.: Timed Petri nets in modeling and analysis of simple schedules for manufacturing cells. Computers and Mathematics with Applications, vol. 37, no 11-12, pp. 191-206, 1999.
  • 264. Zuberek W.M., Zuberek M.S.: Transformations of timed Petri nets and performance analysis”. Proc. 33rd Midwest Symp. on Circuit and Systems (Special Session on Petri Net Models) Calgary, Alberta, pp. 774-778, 1990.
  • 265. Baza bibliograficzna prac na temat sieci Petriego oraz programów analizy modeli sieciowych jest dostępna w DAIMI, Department of Computer Science, Aarhus Univeristy, Denmark: http://www.daimi.au.dk/PetriNets.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-PWA2-0030-0001
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.