Rule-based refinement of petri nets: A survey

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2472, Issue , 2003, Pages 161-196

  Padberg, J ^a   Urbasek M ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346264922     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40022-6_9     Document Type: Article

References (54)

1. [BDH92] E. Best, R. Devillers, and J. Hall. The Box Calculus: A new causal algebra with multi-label communication. In Advances in Petri Nets, pages 21-69. Lecture Notes in Computer Science 609, 1992. 167
2. [BGV91] W. Brauer, R. Gold, and W. Vogler. A Survey of Behaviour and Equivalence Preserving Refinements of Petri Nets. Advances in Petri Nets, Lecture Notes in Computer Science 483:1-46, 1991. 167, 168
3. [BS90] J. Bradfield and C. Stirling. Verifying temporal properties of processes. In J. C. M. Baeten et al., editor, Lecture Notes in Computer Science; CONCUR' 90, Theories of Concurrency: Unification and Extension. (Conference, 1990, Amsterdam, The Netherlands), pages 115-125, Berlin, Germany, 1990. Springer Verlag. 167
4. Chen Y., Tsai W.T., An algebraic approach to petri net reduction and its application to protocol analysis, Technical report University of Minnesota, 1990., 167
5. [DA92] R. David and H. Alla, editors. Petri Nets and Grafcet. Prentice Hall (UK), 1992. 167
6. [DDGJ90] W. Damm, G. Döhmen, V. Gerstner, and B. Josko. Modular verification of petri nets: The temporal logic approach. In J. W. de Bakker et al., editors, Lecture Notes in Computer Science; Proceedings of the REX Workshop on Stepwise Refinement, 1989, Mook, The Netherlands, pages 180-207, Berlin, Germany, 1990. Springer-Verlag. 167
7. [DM90] J. Desel and A. Merceron. Vicinity Respecting Net Morphisms. In Advances in Petri Nets, pages 165-185. Springer Verlag, 1990. Lecture Notes in Computer Science 483. 167, 180
8. [Ehr97] H. Ehrig et al. Integration von Techniken der Software Spezifikation für ingenieuwissenschaftliche Anwendungen. Antrag für ein Schwerpunkprogramm an die DFG, http://tfs.cs.tu-berlin.de/SPP/index.html, 1997. (akzeptiert als DFG-SPP von Januar 1998 bis Dezember 2003). 172
9. [EM85] H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 1: Equations and Initial Semantics, volume 6 of EATCS Monographs on Theoretical Computer Science. Springer Verlag, Berlin, 1985. 186
10. [ERW02] H. Ehrig, W. Reisig, and H. Weber et al. The Petri Net Baukasten of the DFG-Forschergruppe PETRI NET TECHNOLOGY. In H. Ehrig, W. Reisig, G. Rozenberg, and H. Weber, editors. Advances in Petri Nets: Petri Net Technologies for Modeling Communication Based Systems. LNCS. Springer, 2002. To Appear. 162, 163
11. [ES91] J. Esparza and M. Silva. On the analysis and synthesis of free choice systems. Lecture Notes in Computer Science; Advances in Petri Nets 1990, 483:243-286, 1991. 167, 168
12. [Esp94] J. Esparza. Model checking using net unfoldings. Science of Computer Programming, 23:151-195, 1994. 167, 168
13. [FWL] J. Favrel, H. Wu, and K. H. Lee. Reduction method of coloured Petri nets. In Proc. IEEE Int. Conf. on Systems, Man, and Cybernetics. 167
14. [Gen91] H. J. Genrich. Predicate/Transition Nets. In High-Level Petri Nets: Theory and Application, pages 3-43. Springer Verlag, 1991. 172
15. [GG90] R. J. van Glabbeck and U. Golz. Equivalences and Refinement. In Semantics of Systems of Concurrent Processes, pages 309-333. Springer Verlag, 1990. Lecture Notes in Computer Science 469. 167
16. [GL81] H. J. Genrich and K. Lautenbach. System Modelling with High-Level Petri Nets. Theoretical Computer Science, 13:109-136, 1981. 172
17. [HRH91] R. R. Howell, L.E. Rosier, and Chun Yen Hsu. A taxonomy of fairness and temporal logic problems for Petri nets. Theoretical Computer Science, 82(2):341-372, 1991. 167
18. L. Jansen. Referenzfallstudie Verkehrsleittechnik. http://www.ifra.ing. tubs. de/m33/spezi/,1997. 172
19. [JCHH91] K. Jensen, S. Christensen, P. Huber, and M. Holla. Design/CPN. A Reference Manual. Meta Software Cooperation, 125 Cambridge Park Drive, Cambridge Ma 02140, USA, 1991. 172
20. [Jen92] K. Jensen. Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use, volume 1: Basic Concepts. Springer Verlag, EATCS Monographs in Theoretical Computer Science edition, 1992. 172, 184
21. [Jen94] K. Jensen. Coloured Petri Nets-Basic Concepts, Analysis Methods and Practical Use, volume 2: Analysis Methods. Springer Verlag, EATCS Monographs in Theoretical Computer Science edition, 1994. 167, 172
22. [Jen97] K. Jensen. Coloured Petri Nets-Basic Concepts, Analysis Methods and Practical Use, volume 3: Practical Use. Springer Verlag, EATCS Monographs in Theoretical Computer Science edition, 1997. 172
23. [Lam94] L. Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems 16, 3:872-923, 1994. 191
24. [MM90] J. Meseguer and U. Montanari. Petri Nets are Monoids. Information and Computation, 88(2):105-155, 1990. 178
25. [MP92] Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems, Specification. Springer Verlag, 1992. 167, 183, 186, 191
26. [Peu01] S. Peuker. Halbordnungsbasierte Verfeinerung zur Verifikation verteiler Algorithmen. PhD thesis, Humboldt University Berlin, 2001.
27. [Peu02] S. Peuker. Concurrency based transition refinement for the verification of distributed algorithms. In H. Ehrig, W. Reisig, G. Rozenberg, and H. Weber, editors. Advances in Petri Nets: Petri Net Technologies for Modeling Communication Based Systems. LNCS. Springer, 2002. To Appear. 162
28. [Rei91] W. Reisig. Petri Nets and Algebraic Specifications. Theoretical Computer Science, 80:1-34, 1991. 172
29. [Sch96] K. Schmidt. Symbolische Analysemethoden für algebraische Petri-Netze, volume 4. Bertz Verlag, versal edition, 1996. 167
30. [Sou91] Y. Soussy. Deterministic systems of sequential processes: A class of structured Petri nets. In Applications and Theory of Petri Nets, Gjern, Juni 1991, pages 62-81. Springer Verlag, 1991. 168
31. [Vau87] J. Vautherin. Parallel System Specification with Coloured Petri Nets. In G. Rozenberg, editor, Advances in Petri Nets 87, pages 293-308. Springer Verlag, 1987. Lecture Notes in Computer Science 266. 172
32. [vdA97] W. M. P. van der Aalst. Verification of workflow nets. In P. Azéma and G. Balbo, editors, Application and Theory of Petri Nets, volume 1248 of LNCS, pages 407-426. Springer-Verlag, June 1997. 168
33. [vdA98] W. M. P. van der Aalst. The Application of Petri Nets to Workflow Management. The Journal of Circuits, Systems and Computers, 8:21-66, 1998. 168
34. [vdAtH98] W. M. P. van der Aalst and A.H. M. ter Hofstede. Verification of Workflow Task Structures: A Petri-net-based approach. Forschungsberichte des AIFB 380, Universität Karlsruhe, November 1998. 168
35. [WER99] H. Weber, H. Ehrig, and W. Reisig, editors. Int. Colloquium on Petri Net Technologies for Modelling Communication Based Systems, Part II: The "Petri Net Baukasten". Fraunhofer Gesellschaft ISST, October 1999. 162
36. [WER01] H. Weber, H. Ehrig, and W. Reisig, editors. 2nd Int. Colloquium on Petri Net Technologies for Modelling Communication Based Systems, Berlin, Germany, Sept. 2001. Researcher Group Petri Net Technology, Fraunhofer Gesellschaft ISST. 162
37. [WLB01] H. Weber, S. Lembke, and A. Borusan. Improving the Usability of Petri Nets with the Petri Net Baukasten. In H. Ehrig, G. Juhás, J. Padberg, G. Rozenberg, editors, Advances in Petri Nets: Unifying Petri Nets, volume 2128 of LNCS, pages 54-78. Springer-Verlag, 2001.
38. H. Ehrig, M. Gajewsky, and F. Parisi-Presicce. High-Level Replacement Systems with Applications to Algebraic Specifications and Petri Nets, chapter 6, pages 341-400. Number 3: Concurrency, Parallelism, and Distribution in Handbook of Graph Grammars and Computing by Graph Transformations. World Scientific, 1999. 163
39. H. Ehrig, A. Habel, H.-J. Kreowski, and F. Parisi-Presicce. From graph grammars to high level replacement systems. In 4th Int. Workshop on Graph Grammars and their Application to Computer Science, LNCS 532, pages 269-291. Springer Verlag, 1991. 168, 189
40. H. Ehrig, A. Habel, H.-J. Kreowski, and F. Parisi-Presicce. Parallelism and concurrency in high-level replacement systems. Math. Struct. in Comp. Science, 1:361-404, 1991. 163
41. C. Ermel, J. Padberg, and H. Ehrig. Requirements engineering of a medical information system using rule-based refinement of petri nets. In Proc. IDPT Conference (International Design and Process Technology), pages 186-193, 1996. 171
42. M. Gajewsky. Concepts and Requirements for Transformations within Petri Net Based Process Models. In A. Ertas, editor, 5th World Conference on Integrated Design and Process Technology, Special Session on Model Integration, 2000. CDROM, 8 pages. 163
43. M. Gajewsky, K. Hoffmann, and J. Padberg. Place Preserving and Transition Gluing Morphisms in Rule-Based Refinement of Place/Transition Systems. Technical Report 99-14, Technical University Berlin, 1999. 178, 179, 180, 183, 184, 187
44. M. Gajewsky and F. Parisi-Presicce. On Compatibilty of Model and Class Transformations . In M. Cerioli, and G. Reggio, editors, 15th International Workshop on Algebraic Development Techniques and General Workshop of the CoFI WG, Lecture Notes in Computer Science 2267. Springer Verlag, 2001. 163
45. M. Gajewsky, J. Padberg, and M. Urbášek. Rule-Based Refinement for Place/Transition Systems: Preserving Liveness-Properties. Technical Report 2001-8, Technical University of Berlin, 2001. 167, 178, 180, 181, 182, 184, 187, 188
46. J. Padberg. Categorical Approach to Horizontal Structuring and Refinement of High-Level Replacement Systems. Applied Categorical Structures, 7(4):371-403, December 1999. 163, 165, 171, 189, 190
47. J. Padberg, H. Ehrig, and L. Ribeiro. Algebraic high-level net transformation systems. Mathematical Structures in Computer Science, 5:217-256, 1995. 172
48. J. Padberg and M. Gajewsky. Rule-Based Refinement of Petri Nets For Modeling Train Control Systems. In ?S. Kozák and M. Huba, editors, Petri Nets in Design, Modelling and Simulation of Control Systems, Special Session at the IFAC Conference on Control Systems Design, pages 299-304, 2000. 168, 187, 188
49. J. Padberg and M. Gajewsky. Safety Preserving Transformations of Coloured Petri Nets. Technical Report 2000-13, Technical University Berlin, 2000. 187
50. J. Padberg, M. Gajewsky, and C. Ermel. Rule-Based Refinement of High-Level Nets Preserving Safety Properties. In E. Astesiano, editor, Fundamental Approaches to Software Engineering, pages 221-238. Springer Verlag, Lecture Notes in Computer Science 1382, 1998. 163, 167
51. J. Padberg, M. Gajewsky, and C. Ermel. Rule-based refinement of high-level nets preserving safety properties. Science of Computer Programming, 40:97-118, 2001. www.elsevier.nl/locate/scico. 167
52. J. Padberg, K. Hoffmann, and M. Gajewsky. Stepwise Introduction and Preservation of Safety Properties in Algebraic High-Level Net Systems. In T. Maibaum, editor, Fundamental Approaches to Software Engineering, pages 249-265. Springer Verlag, Lecture Notes in Computer Science 1783, 2000. 167, 187, 188
53. M. Urbásek and J. Padberg. Preserving liveness with rule-based refinement of place/transition systems. In Society for Design and Process Science (SDPS), editors, Proc. IDPT 2002: Sixth World Conference on Integrated Design and Process Technology, 2002. to appear. 167, 187, 188
54. M. Urbásek. Another Safety Property and Liveness Preserving Morphisms of P/T Systems. Technical Report, Technical University of Berlin, 2002. 178, 179, 180, 183, 184, 188