Coloured Petri Nets: Modelling and validation of concurrent systems

Coloured Petri Nets: Modelling and Validation of Concurrent Systems

Volumn , Issue , 2009, Pages 1-384

  Jensen, Kurt ^a   Kristensen, Lars M ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b BERGEN UNIVERSITY COLLEGE   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84892340728     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/b95112     Document Type: Book

References (112)

1. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, 1994.
2. A. W. Appel and D. B. MacQueen. Standard ML of New Jersey. In Proceedings of 3rd International Symposium on Programming Language Implementation and Logic Programming, Vol. 528 of Lecture Notes in Computer Science, pages 1-13. Springer, 1991.
3. Bang & Olufsen. www.bang-olufsen.com.
4. J. Banks (ed). Handbook of Simulation. Wiley, 1998.
5. G. Behrmann, K. G. Larsen, and R. Pelánek. To store or not to store. In Proc. of Computer-Aided Verification (CAV'03), Vol. 2725 of Lecture Notes in Computer Science, pages 433-445. Springer, 2003.
6. J. Biggs. Teaching for Quality Learning at University. The Society for Research into Higher Education and Open University Press, 2nd edition, 2003.
7. J. Billington. ISO/IEC 15909-1:2004, Software and System Engineering - High-level Petri nets - Part 1: Concepts, Definitions and Graphical notation.
8. J. Billington, G. Gallasch, L. M. Kristensen, and T. Mailund. Exploiting equivalence reduction and the sweep-line method for detecting terminal states. IEEE Transactions on Systems, Man, and Cybernetics. Part A: Systems and Humans, 34(1):23-38, 2004.
9. S. J. Bose. An Introduction to Queueing Theory. Kluwer, 2002.
10. C. Brabrand. Teaching Teaching and Understanding Understanding. www.daimi.au.dk/brabrand/short-film/.
11. BRITNeY Suite homepage. wiki.cs.au.dk/britney/.
12. J. Brøndsted and L. M. Kristensen. Specification and performance evaluation of two zone dissemination protocols for vehicular ad-hoc networks. In Proc. of 39th Annual Simulation Symposium, pages 68-79. IEEE Computer Society, 2006.
13. R. E. Bryant. Graph based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, 1986.
14. B. Bérard, M. Bidoit, A. Finkel, F. Laroussinie, L. Petrucci A. Petit, and P. Schnoebelen. Systems and Software Verification. Springer, 2001.
15. ITU (CCITT). Recommendation Z.120: Message Sequence Charts (MSC). Technical report, International Telecommunication Union, 1992.
16. I. D. Chakeres and C. E. Perkins. Dynamic MANET On-demand (DYMO) Routing. www.ietf.org/internet-drafts/. IETF, Internet-Draft, July 2007.
17. S. Christensen and J. B. Jørgensen. Analysis of Bang and Olufsen's BeoLink audio/video system using coloured Petri nets. In Proc. of 18th International Conference on Application and Theory of Petri Nets, Vol. 1248 of Lecture Notes in Computer Science, pages 387-406. Springer, 1997.
18. S. Christensen, L. M. Kristensen, and T. Mailund. A sweep-line method for state space exploration. In Proc. of Tools and Algorithms for the Construction and Analysis of Systems (TACAS'01), Vol. 2031 of Lecture Notes in Computer Science, pages 450-464. Springer, 2001.
19. S. Christensen, L. M. Kristensen, and T. Mailund. Condensed state spaces for timed Petri nets. In Proc. of 22nd International Conference on Application and Theory of Petri Nets, Vol. 2075 of Notes in Computer Science, pages 101-120. Springer, 2001.
20. E. Clarke, E. A. Emerson, S. Jha, and A. P. Sistla. Symmetry Reductions in Model Checking. In Proc. of Computer-Aided Verification (CAV'98), Vol. 1427 of Lecture Notes in Computer Science, pages 147-159. Springer, 1998.
21. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
22. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite state concurrent systems using temporal logic. ACM Transactions on Programming Languages and Systems, 8(2):244-263, 1986.
23. E. M. Clarke, R. Enders, T. Filkorn, and S. Jha. Exploiting symmetries in temporal logic model checking. Formal Methods in System Design, 9 (1-2):77-104, Kluwer Academic Publishers, 1996.
24. G. Colouris, J. Dollimore, and T. Kindberg. Distributed Systems: Concepts and Design. Addison-Wesley, 2001.
25. CPN Tools homepage. www.cs.au.dk/CPNTools.
26. CPN Group, at University of Aarhus, homepage. www.cs.au.dk/CPnets.
27. A. Cumming, (ed.). A Gentle Introduction to ML. www.dcs.napier.ac.uk/ course-notes/sml/manual.html, 1998.
28. Design/CPN homepage. www.daimi.au.dk/designCPN.
29. S. Deering and R. Hinden. Internet Protocol, Version 6 (IPv6) Specification. IETF RFC 2460, December 1998.
30. J. Desel and W. Reisig. Place/transition Nets. In Lectures on Petri Nets I: Basic Models, Vol. 1491 of Lecture Notes in Computer Science, pages 122-173. Springer, 1998.
31. R. Droms. Dynamic Host Configuration Protocol. IETF RFC 2131, March 1997.
32. Edinburgh Concurrency Workbench homepage. www.dcs.ed.ac.uk/home/cwb/ index.html.
33. K. Jensen (ed.). International Journal on Software Tools for Technology Transfer, Vol. 2, No. 2. Special section on coloured Petri nets, 1998.
34. K. Jensen (ed.). International Journal on Software Tools for Technology Transfer, Vol. 3, No. 4. Special section on coloured Petri nets, 2001.
35. K. Jensen (ed.). International Journal on Software Tools for Technology Transfer, Vol. 9, No. 3-4. Special section on coloured Petri nets, 2007.
36. K. Jensen (ed.). International Journal on Software Tools for Technology Transfer, Vol. 10, No. 1. Special section on coloured Petri nets, 2008.
37. E. A. Emerson. Temporal and Modal Logic, Vol. B of Handbook of Theoretical Computer Science, Chap. 16, pages 995-1072. Elsevier, 1990.
38. E. A. Emerson, A. K. Mok, A. P. Sistla, and J. Srinivasan. Quantitative temporal reasoning. In Proc. of Computer-Aided Verification (CAV'90), Vol. 531 of Lecture Notes in Computer Science, pages 136-145. Springer, 1990.
39. E. A. Emerson and A. P. Sistla. Symmetry and model checking. Formal Methods in System Design, 9 (1-2):105-131, Kluwer Academic Publishers, 1996.
40. Examples of Industrial Use of CP-nets. www.cs.au.dk/CPnets/industrialex.
41. Formal Systems - FDR2. www.fsel.com/software.html.
42. G. E. Gallasch and L. M. Kristensen. COMMS/CPN: A communication infrastructure for external communication with Design/CPN. In Third Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, DAIMI PB-554, pages 75-91, 2001.
43. v1G. E. Gallasch, L. M. Kristensen, and T. Mailund. Sweep-Line state space exploration for coloured Petri nets. In vsProc. of 4th Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, pages 101-120. Department of Computer Science, University of Aarhus, 2002. DAIMI PB-560.
44. J. Geldenhuys and A. Valmari. A nearly memory-optimal data structure for sets and mappings. In Proc. of SPIN 2003, Vol. 2648 of Lecture Notes in Computer Science, pages 136-150. Springer, 2003.
45. H. Genrich. Predicate/transition Nets. In K. Jensen and G. Rozenberg (eds.), High-level Petri Nets: Theory and Application, pages 3-43. Springer, 1991.
46. H. J. Genrich and K. Lautenbach. System modelling with high-level Petri nets. Theoretical Computer Science, 13:109-136, 1981.
47. R. Gerth, R. Kuiper, D. Peled, and W. Penczek. A partial order approach to branching time logic model checking. In Proc. of 3rd Israel Symposium on the Theory of Computing and Systems, pages 130-140. IEEE, 1995.
48. Gnuplot tool homepage. www.gnuplot.info.
49. P. Godefroid. Using partial orders to improve automatic verification Methods. In Proc. of Computer-Aided Verification (CAV'90), Vol. 531 of Lecture Notes in Computer Science, pages 175-186. Springer, 1990.
50. D. Harel. Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8:231-274, 1987.
51. R. Harper. Programming in Standard ML. www.cs.cmu.edu/rwh/smlbook/online. pdf, 2006.
52. C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall International, 1985.
53. G. Holzmann, E. Najm, and A. Serhrouchni. SPIN model checking: An introduction. International Journal on Software Tools for Technology Transfer, 2:321-327, 2000.
54. G. J. Holzmann. The SPIN Model Checker. Addison-Wesley, 2003.
55. G. J. Holzmann. An analysis of bitstate hashing. Formal Methods in System Design, 13:289-307, 1998.
56. C. Huitema. IPv6: The New Internet Protocol. Prentice-Hall, 1998.
57. C. N. Ip and D. L. Dill. Better verification through symmetry. Formal Methods in System Design, 9 (1-2):41-75, Kluwer Academic Publishers, 1996.
58. C. Jard and T. Jeron. Bounded-memory algorithms for verification on-the-fly. In Proc. of Computer-Aided Verification (CAV'91), Vol. 575 of Lecture Notes in Computer Science, pages 192-202. Springer, 1991.
59. K. Jensen. Coloured Petri nets and the invariant method. Theoretical Computer Science, 14:317-336, 1981.
60. K. Jensen. Coloured Petri Nets; Basic Concepts, Analysis Methods and Practical Use. Vol. 1, Basic Concepts, Monographs in Theoretical Computer Science. Springer, 1992.
61. K. Jensen. Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Vol. 2, Analysis Methods, Monographs in Theoretical Computer Science. Springer, 1994.
62. K. Jensen. Condensed state spaces for symmetrical coloured Petri nets. Formal Methods in System Design, 9 (1-2):7-40, Kluwer Academic Publishers, 1996.
63. K. Jensen. Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Vol. 3, Practical use, Monographs in Theoretical Computer Science. Springer, 1997.
64. J. B. Jørgensen and C. Bossen. Requirements engineering for a pervasive health care system. In Proc. of 11th IEEE International Requirements Engineering Conference, pages 55-64. IEEE Computer Society, 2003.
65. J. B. Jørgensen and L. M. Kristensen. Verification of coloured Petri nets using state spaces with equivalence classes. In Petri Net Approaches for Modelling and Validation, Vol. 1 of LINCOM Studies in Computer Science, Chap. 2, pages 17-34. Lincoln Europa, 2003.
66. C. Kaufman. Internet Key Exchange (IKEv2) Protocol. IETF, RFC 4306, December 2005.
67. W. D Kelton, Randall P. Sadowski, and D. A. Sadowski. Simulation with Arena. McGraw-Hill, 2nd edition, 2002.
68. L. M. Kristensen and S. Christensen. Implementing coloured Petri nets using a functional programming language. Journal on Higher-Order and Symbolic Computation, 17(3):207-243, 2004.
69. L. M. Kristensen and K. Jensen. Specification and validation of an edge router discovery protocol for mobile ad-hoc networks. In Proc. of Integration of Software Specification Techniques for Applications in Engineering, Vol. 3147 of Lecture Notes in Computer Science, pages 248-269. Springer, 2004.
70. L. M. Kristensen and T. Mailund. A generalised sweep-line method for safety properties. In Proc. of Formal Methods Europe (FME'02), Vol. 2391 of Lecture Notes in Computer Science, pages 549-567. Springer, 2002.
71. L. M. Kristensen and T. Mailund. A compositional sweep-line state space exploration method. In Proc. of Formal Techniques for Networked and Distributed Systems, Vol. 2529 of Lecture Notes in Computer Science, pages 327-343. Springer, 2002.
72. L. M. Kristensen and T. Mailund. Efficient path finding with the sweep-line method using external storage. In Proc. of International Conference on Formal Engineering Methods (ICFEM'03), Vol. 2885 of Lecture Notes in Computer Science, pages 319-337. Springer, 2003.
73. L. M. Kristensen, P. Mechlenborg, L. Zhang, B. Mitchell, and G. E. Gallasch. Model-based development of a course of action scheduling tool. In Proc. of 7th Workshop and Tutorial on Practical Use of Coloured Petri Nets and CPN Tools, DAIMI PB-579, pages 1-26, 2006.
74. L. M. Kristensen, P. Mechlenborg, L. Zhang, B. Mitchell, and G. E. Gallash. Model-based development of a course of action scheduling tool. International Journal on Software Tools for Technology Transfer, 10(1):5-14, 2007.
75. L. M. Kristensen, J. B. Jørgensen, and K. Jensen. Application of coloured Petri nets in system development. In Proc. of 4th Advanced Course on Petri Nets Lectures on Concurrency and Petri Nets - Advances in Petri Nets, Vol. 3098 of Lecture Notes in Computer Science, pages 626-685. Springer, 2004.
76. K. G. Larsen, P. Petterson, and W. Yi. UppAal in a nutshell. International Journal on Software Tools for Technology Transfer, 1 (1+ 2):134-152, 1997.
77. A. M. Law and W. D. Kelton. Simulation Modeling & Analysis. McGraw-Hill, 3rd edition, 2000.
78. J. Liu. Real-Time Systems. Prentice Hall, 2000.
79. L. Lorentsen and L. M. Kristensen. Exploiting stabilizers and parallelism in state space generation with the symmetry method. In Proc. of ICACSD'01, pages 211-220. IEEE Computer Society, 2001.
80. IETF MANET Working Group homepage. www.ietf.org/html.charters/manet- charter.html.
81. T. Mailund and M. Westergaard. Obtaining memory-efficient reachability graph representations using the sweep-line method. In Proc. of Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2004), Vol. 2988 of Lecture Notes in Computer Science, pages 177-191. Springer, 2004.
82. K. L. McMillan. Symbolic Model Checking. Kluwer Academic, 1993.
83. R. Milner. Communication and Concurrency, Prentice Hall International Series in Computer Science. Prentice-Hall, 1989.
84. R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (Revised). MIT Press, 1997.
85. T. Narten, E. Nordmark, and W. Simpson. Neighbor Discovery for IP Version 6 (IPv6). IETF, RFC 2461, December 1998
86. L. C. Paulson. ML for the Working Programmer. Cambridge University Press, 1996.
87. D. Peled. All from one, one for all: On model checking using representatives. In Proc. of Computer-Aided Verification (CAV'93), Vol. 697 of Lecture Notes in Computer Science, pages 409-423. Springer, 1993.
88. C. A. Petri. Kommunikation mit Automaten. Bonn: Institut für Instrumentelle Mathematik, Schriften des IIM Nr. 2, 1962.
89. Proc. of International Conferences on Application and Theory of Petri Nets and Other Models of Concurrency. Springer, 1992-.
90. Proc. of International Workshop on Petri Nets and Performance Models. IEEE Computer Society, 1992-.
91. Proc. of Workshops on Practical Use of Coloured Petri Nets and the CPN Tools. www.cs.au.dk/CPnets/, 1998-.
92. M. Raynal. Algorithms for Mutual Exclusion. North Oxford Academic, 1986.
93. W. Reisig. Petri Nets: An Introduction, Vol. 4 of EATCS Monographs on Theoretical Computer Science. Springer, 1985.
94. J. Rumbaugh, I. Jacobson, and G. Booch. The Unified Modeling Language Reference Manual. Addison-Wesley, 1999.
95. SceneBeans homepage. www-dse.doc.ic.ac.uk/Software/SceneBeans/.
96. SPIN tool homepage. spinroot.com/.
97. The Standard ML Basis Library. www.standardml.org/Basis/, 2004.
98. U. Stern and D. L. Dill. Improved probabilistic verification by hash compaction. In Correct Hardware Design and Verification Methods, Vol. 987 of Lecture Notes in Computer Science, pages 206-224. Springer, 1995.
99. U. Stern and D. L. Dill. Using magnetic disk instead of main memory in the Murphi verifier. In Proc. of Computer-Aided Verification (CAV'98), Vol. 1427 of Lecture Notes in Computer Science, pages 172-183. Springer, 1998.
100. A. S. Tanenbaum. Computer Networks. Prentice-Hall, 4th edition, 2003.
101. R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal of Computing, 1(2):146-160, 1972.
102. J. D. Ullman. Elements of ML Programming. Prentice Hall, 1998.
103. VisualState homepage. www.iar.com.
104. A. Valmari. Error detection by reduced reachability graph generation. In Proc. of the 9th European Workshop on Application and Theory of Petri Nets, pages 95-112, 1988.
105. A. Valmari. A stubborn attack on state explosion. In Proc. of Computer-Aided Verification (CAV'90), Vol. 531 of Lecture Notes in Computer Science, pages 156-165. Springer, 1990.
106. A. Valmari. The state explosion problem. In Lectures on Petri Nets I: Basic Models, Vol. 1491 of Lecture Notes in Computer Science, pages 429-528. Springer, 1998.
107. M. Vardi and P. Wolper, An automata-theoretic approach to automatic program verification. In Proc. of 1st IEEE Symposium on Logic in Computer Science, pages 322-331, IEEE, 1986.
108. M. Westergaard, L. M. Kristensen, G. S. Brodal, and L. A. Arge. The Comback method - extending hash compaction with backtracking. In Proc. of 28th International Conference on Application and Theory of Petri Nets and Other Models of Concurrency, Vol. 4546 of Lecture Notes in Computer Science, pages 445-464. Springer, 2007.
109. M. Westergaard and K. B. Lassen. The BRITNeY Suite animation tool. In Proc. of 27th International Conference on Application and Theory of Petri Nets and Other Models of Concurrency, Vol. 4024 of Lecture Notes in Computer Science, pages 431-440. Springer, 2006.
110. P. Wolper and D. Leroy. Reliable hashing without collision detection. In Proc. of Computer-Aided Verification (CAV'93), Vol. 697 of Lecture Notes in Computer Science, pages 59-70. Springer, 1993.
111. A. Yakovlev, L. Gomes, and L. Lavagno (eds). Hardware Design and Petri Nets. Kluwer Academic, 2000.
112. L. Zhang, L. M. Kristensen, C. Janczura, G. Gallasch, and J. Billington. A coloured Petri net based tool for course of action development and analysis. In Proc. of Workshop on Formal Methods Applied to Defence Systems, Vol. 12 of Conferences in Research and Practice in Information Technology, pages 125-134. Australian Computer Society, 2001.