Understanding Petri nets: Modeling techniques, analysis methods, case studies

Understanding Petri Nets: Modeling Techniques, Analysis Methods, Case Studies

Volumn 9783642332784, Issue , 2013, Pages 1-230

  Reisig, Wolfgang ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; SOFTWARE DESIGN;

ANALYSIS TECHNIQUES; COMPREHENSIVE RESEARCH; DESIGN AND CONTROL; ELEMENTARY MODEL; FULLY INTEGRATED; GRAPHICAL APPROACH; GRAPHICAL ILLUSTRATIONS; MODELING TECHNIQUE;

PETRI NETS;

EID: 84930145835     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-642-33278-4     Document Type: Book

References (81)

1. W. van der Aalst Verification of workflow nets. Springer LNCS 1248 pp. 407-426 (1997)
2. W. van der Aalst, N. Lohmann, P. Massuthe, Chr. Stahl, K. Wolf Multiparty contracts: agreeing and implementing interorganizational processes. Computing Journal 53(1) pp. 90-106 (2008)
3. M. Abadi, L. Lamport Composing specifications. ACM Tr. Prog. Lang. Syst. 15(1), 73-132 (1993)
4. M. Ajmone Marsan, G. Balbo, G. Conte, S. Donatelli, G. Frankeschinis Modeling with Generalized Stochastic Petri Nets. Wiley (1995)
5. B. Alpern, F. Schneider Defining liveness. Information Processing Letters 21, 181-185 (1985)
6. E. Badouel, P. Darondeau Theory of regions. Springer LNCS 1492 (1998)
7. G. Balbo Introduction to generalized stochastic Petri nets. Springer LNCS 4486, 83-131 (2007)
8. L. Bernardinello Synthesis of net systems. Springer LNCS 691, 89-105 (1993)
9. E. Best, R. Devillers, M. Koutny Petri Net Algebra. Springer (2001)
10. E. Best, C. Fernandez Nonsequential Processes. Springer (1988)
11. N. Busi Analysis issues in Petri nets with inhibitor arcs. Theoretical Computer Science 275 (1-2) pp. 127-177 (2002)
12. J. Cortadella,M. Kishinevsky, L. Lavagne, A. Yakovlev Deriving Petri nets from finite transition systems. IEEE Trans. on Computers 47, 859-882 (1998)
13. J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, A. Yakovlev Petrify: A tool for manipulating concurrent specifications and synthesis of asynchronous controllers. IEICE Transactions on Information and Systems E 80-D (3), 315-325 (1997)
14. C.S. Calude, G. Paun, G. Rozenberg, A. Salomaa (eds) Multiset processing. Springer LNCS 2235 (2001)
15. J. Desel, J. Esparza Free Choice Petri Nets. Cambridge Tracts in Theoretical Computer Science, Vol. 40 (1995)
16. J. Desel, G. Juhás What is a Petri net? Informal answers for the informed reader. In: H. Ehrig, G. Juhás, J. Padberg, G. Rozenberg (Eds.): Unifying Petri Nets. Springer LNCS 2128, 1-25
17. J. Desel, K.P. Neuendorf, M.D. Radola Proving nonreachability by modulo-invariants. Theoretical Computer Science 153, pp. 49-64 (1996)
18. J. Desel, W. Reisig, G. Rozenberg Lectures on Concurrency and Petri Nets. Springer LNCS 3098 (2004)
19. E.W. Dijkstra Cooperating Sequential Processes. TR EWD-123 (1965)
20. E.W. Dijkstra Invariance and non-determinacy. In: C.A.R. Hoare, J.C. Sheperdson (Ed.): Mathematical. Logic and Programming Languages, Prentice Hall, 157-165 (1985)
21. A. Ehrenfeucht, G. Rozenberg Partial (set) 2-structures. Acta Inf. 27, 315-368 (1990)
22. J. Esparza Decidability and complexity of Petri net problems - an introduction. Springer LNCS 1491, 374-428
23. J. Esparza, K. Heljanko Unfoldings - A Partial-Order Approach to Model Checking. Springer (2008)
24. J. Esparza, M. Nielsen Decidability issues for Petri nets - a survey. Journal of Informatics Processing and Cybernetics 30(3), 143-160 (1994)
25. A. Finkel The minimal coverability graph for Petri nets. Springer LNCS 674, pp. 210-243 (1993)
26. H.J. Genrich Das Zollstationenproblem. GMD St. Augustin (1971)
27. H.J. Genrich Einfache nicht-sequentielle Prozesse. GMD Bonn, Report No. 37 (1971)
28. H. Genrich, K. Lautenbach System modelling with high-level Petri nets. Theoretical Computer Science 13, 109-134 (1981)
29. C. Girault, R. Valk Petri Nets for Systems Engineering. Springer (2003)
30. L. Gomes, J.P. Barros Structuring and composability issues in Petri net modeling. IEEE Tr. Industr. Inf. 1(2), 112-123 (2005)
31. G. Goos Vorlesungen über Informatik. Vol. 1, Springer (1995)
32. Y. Gurevich Sequential abstract-state machines capture sequential algorithms. ACM Trans. on Computational Logic 1, 1 pp. 77-111 (2000)
33. M.H.T. Hack Analysis of Production Schemata by Petri Nets. MIT, Cambridge (1972)
34. R. Hamadi, B. Benatallah A Petri Net-based model for web service composition. 14th Australian Database Conference (2003)
35. D. Harel, R. Marelly Come, Let's Play Springer (2003)
36. A.W. Holt, H. Saint, R. Shapiro, S. Warshall Final Report of the Information Systems Theory Project. Griffiss Air Force Base (1968)
37. K. Jensen Coloured Petri nets and the invariant method. Theoretical Computer Science 14, 317-336 (1981)
38. K. Jensen, L.M. Kristensen Coloured Petri Nets. Springer (2009)
39. R.M. Karp, R.E. Miller Parallel program schemata. J. Comp. Syst. Sci. 3, pp. 147-195 (1969)
40. E. Kindler, R. Walter Mutex Needs Fairness. Information Processing Letters 62, 31-39 (1997)
41. P. Kritzinger, V. Bause Introduction to Stochastic Petri Nets. Vieweg (2002)
42. L. Lamport Specifying Systems. Addison-Wesley (2002)
43. K. Lautenbach Liveness in Petri Nets. GMD St. Augustin 75-02-1 (1975)
44. K. Lautenbach Linear algebraic calculations of deadlocks and traps. In: K. Voss, M.J. Genrich, G. Rozenberg (Eds.) Concurrency and Nets. Springer (1987)
45. R. Lorenz, S.Mauser, G. Juhas How to synthesize nets from languages: a survey. 39thWinter Simulation Conference, IEEE Press, 637-647 (2007)
46. Z. Manna, A. Pnueli The Temporal Logic of Reactive and Concurrent Systems. Springer (1992)
47. E.W. Mayr Ein Algorithmus für das allgemeine Erreichbarkeitsproblem bei Petrinetzten und damit zusammenhängende Probleme. TU München (1980)
48. E.W. Mayr An algorithm for the general Petri net reachability problem. SIAM J. Computing 13, 3, 441-460 (1984)
49. K.L. McMillan Using unfoldings to avoid the state explosion problem in the verification of asynchronous cicuits. Springer LNCS 663, 164-177 (1993)
50. J. Misra, K.M. Chandy Parallel Program Design: A Foundation. Addison-Wesley (1988)
51. T. Miyamoto, S. Kumagai A survey of object oriented Petri nets and analysis methods. IEICE E88-A, 2964-2971 (2005)
52. U. Montanari, F. Rossi Contextual nets. Acta Informatica 32, 545-596 (1995)
53. T. Murata State equation, controllability and maximal matchings of Petri nets. IEEE Trans Autom. Contr. 22(3), 412-416 (1977)
54. M. Nielsen, G. Plotkin, G. Winskel Petri nets, event structures and domains. Theoretical Computer Science 13, 85-108 (1981)
55. S. Owicki, L. Lamport Proving liveness properties of concurrent programs. ACM Trans. on Programming Languages and Systems, 4 (3) 455-495 (1982)
56. C.A. Petri Kommunikation mit Automaten. Institut für Instrumentelle Mathematik, Bonn, IIM Report No. 2 (1962)
57. C.A. Petri Grundsätzliches zur Beschreibung diskreter Prozesse. 3. Colloquium über Automatentheorie (3rd Colloq. on Automata Theory), Birkhäuser, 121-140 (1967)
58. C.A. Petri Non-sequential Processes. GMD St. Augustin (1977)
59. C.A. Petri Nets, time and space. Theoretical Computer Science 153, 3-48 (1996)
60. Petri Net World: http://www.informatik.uni-hamburg.de/TGI/PetriNets/
61. L. Priese, H. Wimmel Theoretische Informatik - Petri Netze. Springer (2003)
62. W. Reisig Petrinetze - eine Einführung. Springer (1982)
63. W. Reisig Petri Nets - An Introduction. Springer (1985)
64. W. Reisig Elements of Distributed Algorithms. Springer (1998)
65. W. Reisig 50 JahreModellbasierter Entwurf: VomModellieren mit Programmen zum Programmieren mit Modellen. In: W. Reisig, J.-C. Freytag (Eds.): Informatik - Aktuelle Themen im historischen Kontext, Springer (2006)
66. W. Reisig The Decent Philosophers: An exercise in concurrent behaviour. Fundamenta Informaticae 80 1-9 (2007)
67. W. Reisig The Scholten/Dijkstra Pebble Game. Springer LNCS 4800, 589-595 (2008)
68. W. Reisig Simple composition of nets. Springer LNCS 5606 pp. 23-42 2009
69. W. Reisig, W. Brauer Carl Adam Petri und die Petrinetze. Informatik-Spektrum 29(5), Oktober 2006, Springer, 369-374 (2006). English version: E. Gelenbe (ed) FundamentalConcepts in Computer Science 3. Imperial College Press (2007)
70. W. Reisig, G. Rozenberg Lectures on Petri Nets I, II. Springer LNCS 1491, 1492 (1998)
71. C. Reutenauer The Mathematics of Petri Nets. Prentice Hall (1990)
72. K. Schmidt Verification of siphons and traps for algebraic Petri nets. Springer LNCS 1248, 427-446 (1997)
73. K. Schmidt Model-checking with coverability graphs. Formal Methods in SystemDesign 15(3), 239-254 (1999)
74. H. Störrle Models of Software-Architecture-Design and Analysis with UML and Petri Nets. Books on Demand (2000)
75. R. Valk Self-modifying nets, a natural extension of Petri nets. Springer LNCS 62 pp. 464-476 (1978)
76. R. Valk Object Petri nets. Springer LNCS 3098, pp. 819-848 (2004)
77. A. Valmari The state explosion problem. In: W. Reisig, G. Rozenberg (Eds.), Springer LNCS 1491 (1998)
78. W. Vogler Concurrent implementation of asynchronous transition systems. Springer LNCS 1639, 284-303
79. A. Wegrzyn, A. Kavatevich, J. Bieganowski Detection of deadlocks and traps in Petri nets by means of Thelen's prime implicant method. Int. J. Appl. Math. Comp. Sci. 14, 1 (113-121) (2004)
80. M. Yamauchi, T. Watanabe Time complexity analysis of the minimal siphon extraction problem of Petri nets. IEICE Tr. Fund. El. Com. Comp. Sci., E 82-A, 11, 2558-2565 (1999)
81. A.V. Yakovlev, A.M. Koelmans Petri nets and digital hardware design. Springer LNCS 1492, 154-236 (1998)