Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
Polymorphic Sesqui-Pushout Graph Rewriting Kapitel lesen Erstes Kapitel lesen

2015 | OriginalPaper | Buchkapitel

Reconfigurable Petri Nets with Transition Priorities and Inhibitor Arcs

verfasst von : Julia Padberg

Erschienen in: Graph Transformation

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper we introduce additional control structures for reconfigurable Petri nets. The main contributions are inhibitor arcs and transition priorities for reconfigurable Petri nets. The first ensure that a marking can inhibit the firing of a transition. Inhibitor arcs allow a transition to fire only if the adjacent place is empty. Transition priorities are given by an order of transitions and restrict the firing as well. A transition may fire only if it has the highest priority of all enabled transitions. Both concepts are compatible with reconfigurable Petri nets. In this paper we prove that place/transitions nets with inhibitor arcs and with transition priorities yield \(\mathcal {M}\)-adhesive categories. Hence, we obtain the well-known results for \(\mathcal {M}\)-adhesive categories. Moreover, we state the extension of our results to other types of Petri nets.
We illustrate the new concepts within an ongoing case study concerning travel agencies. This study deals with the organisation of processes that are constantly suspended by others. The main focus of the case study is to investigate the possibilities of small and medium travel agencies to provide a continuous service for their customers while travelling.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Vorheriges Kapitel Multi-amalgamated Triple Graph Grammars
Nächstes Kapitel Reachability in Graph Transformation Systems and Slice Languages
Fußnoten
1
See page 2 in [9] for the relation to other types of HLR systems.
 
2
For a discussion of the various adhesive categories see page 6 in [9].
 
3
In [25] they are called AHL-systems with morphisms that are isomorphisms on the algebra part.
 
4
For example, let \(P_0=\{0,5\}\) and \(P_1= \{0,3,5\}\) with f the inclusion and \(P_2=\{\bullet \}\), then \(3 \le _1 5\) yields \(([3],[\bullet ]) \in R_3\) and \(0 \le _1 3\) yields \(([\bullet ],[3]) \in R_3\), but \([\bullet ]=\{0,5\} \ne \{3\}=[3]\).
 
Literatur
1.
Andries, M., Engels, G., Habel, A., Hoffmann, B., Kreowski, H., Kuske, S., Plump, D., Schürr, A., Taentzer, G.: Graph transformation for specification and programming. Sci. Comput. Program. 34(1), 1–54 (1999)CrossRef
2.
3.
Bottoni, P., Hoffmann, K., Parisi-Presicce, F., Taentzer, G.: High-level replacement units and their termination properties. J. Vis. Lang. Comput. 16(6), 485–507 (2005)CrossRef
4.
Busi, N.: Analysis issues in petri nets with inhibitor arcs. Theor. Comput. Sci. 275(1–2), 127–177 (2002)MathSciNetCrossRef
5.
Codara, P.: A theory of partitions of partially ordered sets. Ph.D. thesis, Universita degli Studi die Milano (2007)
6.
Ede, M., Hoffmann, K., Oelker, G., Padberg, J.: Reconnet: a tool for modeling and simulating with reconfigurable place/transition nets. Electronic Communications of the EASST 54, 10 (2012)
7.
Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. EATCS Monographs in TCS. Springer, Heidelberg (2006)
8.
Ehrig, H., Golas, U., Habel, A., Lambers, L., Orejas, F.: M-Adhesive transformation systems with nested application conditions. part 2: embedding, critical pairs and local confluence. Fundam. Inform. 118(1–2), 35–63 (2012)MathSciNet
9.
Ehrig, H., Golas, U., Habel, A., Lambers, L., Orejas, F.: \({\cal M}\)-adhesive transformation systems with nested application conditions. part 1: parallelism, concurrency and amalgamation. Mathematical Structures in Computer Science 24(4), 48 (2014)
10.
Ehrig, H., Golas, U., Hermann, F.: Categorical frameworks for graph transformation and HLR systems based on the DPO approach. Bull. EATCS 102, 111–121 (2010)MathSciNet
11.
Ehrig, H., Hoffmann, K., Padberg, J., Prange, U., Ermel, C.: Independence of net transformations and token firing in reconfigurable place/transition systems. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 104–123. Springer, Heidelberg (2007) CrossRef
12.
Ehrig, H., Padberg, J.: Graph grammars and petri net transformations. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol. 3098, pp. 496–536. Springer, Heidelberg (2004) CrossRef
13.
Ermler, M., Kreowski, H.-J., Kuske, S., von Totth, C.: From graph transformation units via minisat to grgen.net. In: Schürr, A., Varró, D., Varró, G. (eds.) AGTIVE 2011. LNCS, vol. 7233, pp. 153–168. Springer, Heidelberg (2012) CrossRef
14.
Hölscher, K., Klempien-Hinrichs, R., Knirsch, P.: Undecidable control conditions in graph transformation units. Electron. Notes Theor. Comput. Sci. 195, 95–111 (2008)CrossRef
15.
16.
Kahloul, L., Chaoui, A., Djouani, K.: Modeling and analysis of reconfigurable systems using flexible Petri nets. In: 4th IEEE International Symposium on Theoretical Aspects of Software Engineering, pp. 107–116 (2010)
17.
Kreowski, H.-J., Kuske, S., Rozenberg, G.: Graph transformation units – an overview. In: Degano, P., De Nicola, R., Meseguer, J. (eds.) Concurrency, Graphs and Models. LNCS, vol. 5065, pp. 57–75. Springer, Heidelberg (2008) CrossRef
18.
Lack, S., Sobocinski, P.: Adhesive and quasiadhesive categories. ITA 39(3), 511–545 (2005)MathSciNet
19.
Lambers, L.: Certifying rule-based models using graph transformation. Ph.D. thesis, Berlin Institute of Technology (2009)
20.
Llorens, M., Oliver, J.: Structural and dynamic changes in concurrent systems: reconfigurable Petri nets. IEEE Trans. Comput. 53(9), 1147–1158 (2004)CrossRef
21.
Padberg, J.: Abstract Petri nets: a uniform approach and rule-based refinement. Ph.D. thesis, Technical University Berlin, Shaker Verlag (1996)
22.
Padberg, J.: Abstract interleaving semantics for reconfigurable Petri nets. Electron. Commun. EASST 51, 1–14 (2012)
23.
24.
Padberg, J., Hoffmann, K.: A survey of control structures for reconfigurable Petri nets. J. Comput. Commun. 3(2), 20–28 (2015)CrossRef
25.
Prange, U.: Towards algebraic high-level systems as weak adhesive HLR categories. Electron. Notes Theor. Comput. Sci. 203(6), 67–88 (2008)MathSciNetCrossRef
26.
Prange, U., Ehrig, H., Hoffmann, K., Padberg, J.: Transformations in reconfigurable place/transition systems. In: Degano, P., De Nicola, R., Meseguer, J. (eds.) Concurrency, Graphs and Models. LNCS, vol. 5065, pp. 96–113. Springer, Heidelberg (2008) CrossRef
27.
Prange, U., Ehrig, H., Lambers, L.: Construction and properties of adhesive and weak adhesive high-level replacement categories. Appl. Categorical Struct. 16(3), 365–388 (2008)MathSciNetCrossRef
28.
Rein, A., Prange, U., Lambers, L., Hoffmann, K., Padberg, J.: Negative application conditions for reconfigurable place/transition systems. Electron. Commun. EASST 10, 1–14 (2008)CrossRef
29.
30.
Werner, M., Popova-Zeugmann, L., Richling, J.: A method to prove non-reachability in priority duration Petri nets. Fundam. Inform. 61(3–4), 351–368 (2004)MathSciNet
31.
Metadaten
Titel
Reconfigurable Petri Nets with Transition Priorities and Inhibitor Arcs
verfasst von
Julia Padberg
Copyright-Jahr
2015
Buch
Graph Transformation

Print ISBN: 978-3-319-21144-2

Electronic ISBN: 978-3-319-21145-9

Copyright-Jahr: 2015

DOI
https://doi.org/10.1007/978-3-319-21145-9_7