Search results in the DIPF database of publications

Your query:

(Schlagwörter: "Netzarchitektur")

Automata and Petri Net models for visualizing and analyzing complex questionnaires. A case study Rölke, Heiko Book Chapter | Aus: Duvigneau, Michael; Moldt, Daniel (Hrsg.): Proceedings of the International Workshop on Petri Nets and Software Engineering PNSE'10 ; [in Braga, Portugal on June 22, 2010] | Hamburg: Univ. | 2010 30059 Endnote: Author(s): Rölke, Heiko
Title: Automata and Petri Net models for visualizing and analyzing complex questionnaires. A case study
In: Duvigneau, Michael; Moldt, Daniel (Hrsg.): Proceedings of the International Workshop on Petri Nets and Software Engineering PNSE'10 ; [in Braga, Portugal on June 22, 2010], Hamburg: Univ., 2010 , S. 111-124
URN: urn:nbn:de:gbv:18-228-7-1488
URL: http://epub.sub.uni-hamburg.de/informatik/volltexte/2010/148/
Publication Type: 4. Beiträge in Sammelwerken; Tagungsband/Konferenzbeitrag/Proceedings
Language: Englisch
Keywords: Computerprogramm; Datenanalyse; Informatik; Informationsverarbeitung; Internet; Modellierung; Netzarchitektur; Software; Tagungsbericht
Abstract: Fragebögen in komplexe Studien können beachtliche Größen annehmen. Mehrere Hundert Fragen sind nicht unüblich. Zusätzlich werden Bedingungen eingesetzt um zwischen unterschiedlichen Abläufen für unterschiedliche Befragte zu unterscheiden. Dies führt zur Frage, wie Gültigkeit und andere wichtige Eigenschaften sichergestellt werden können. Wir untersuchen diese Fragestellung an einem Fall mit sogar noch größeren Herausforderungen: Ein wichtiger Teil der OECD-Studie "PIAAC" (Programme for the International Assessment of Adult Competencies) ist ein Hintergrundfragebogen mit mehr als 400 Fragen. Dieser Fragebogen muss von allen teilnehmenden Ländern angepasst werden. Trotzdem muss die Integrität des Gesamtsystems gewährleistet werden.(DIPF/Orig.)
Abstract (english): Questionnaires for complex studies can grow to considerablesizes. Several hundred questions are not uncommon. In addition, routings are used to distinguish between question paths for differentrespondents. This leads to the question of how to ensure validity andother important properties. We examine this question for a case with even more demanding sideconditions: An important part of the OECD study "PIAAC" (Programme forthe International Assessment of Adult Competencies) is a background questionnaire (BQ) containing more than 400 questions. This BQ has tobe adapted by all participating countries. Nevertheless, integrity ofthe overall system has to be ensured.(DIPF/Orig.)
DIPF-Departments: Informationszentrum Bildung

Modeling with net references and synchronous channels Rölke, Heiko Book Chapter | Aus: Moldt, Daniel (Hrsg.): International Workshop on Petri Nets and Software Engineering: PNSE'2009 June 22-23, 2009, a satellite event of Petri Nets' 2009, 30th International Conference on Application and Theory of Petri Nets and O ther Models of Concurrency, June 22-26, 2009 Paris, France | Paris: Université Paris | 2009 7982 Endnote: Author(s): Rölke, Heiko
Title: Modeling with net references and synchronous channels
In: Moldt, Daniel (Hrsg.): International Workshop on Petri Nets and Software Engineering: PNSE'2009 June 22-23, 2009, a satellite event of Petri Nets' 2009, 30th International Conference on Application and Theory of Petri Nets and O ther Models of Concurrency, June 22-26, 2009 Paris, France, Paris: Université Paris, 2009 , S. 157-172
URL: http://www.informatik.uni-hamburg.de/TGI/events/pnse09/PNSE-09-official-proceedings.pdf
Publication Type: 4. Beiträge in Sammelwerken; Tagungsband/Konferenzbeitrag/Proceedings
Language: Englisch
Keywords: Petri-Netz; Modellierung; Informatik; Netzarchitektur; Kongress
Abstract (english): Nets-within-nets offer some modeling possibilitieswhich are not available ( or only to a limited extent) in classicalPetri nets formalisms like P/T nets or colored Petri nets. This holdsespecially true in the formalism of reference nets. The extendedmodeling possibilities arise from the newly come concepts, e.g. netinstances generated at run-time and synchronization betweentransitions. This paper focuses on practical aspects of the newmodeling possibilities - rather than theoretical backgrounds - anddemonstrates them in practical examples. As a modeling languagereference nets are used. This is the onlynets-within- nets formalism implemented up to now and with Renew a powerful simulation tool-set is available. The examples presented throughout the paper can serve as anintroduction to advanced modeling using reference nets. (Autor)
DIPF-Departments: Informationszentrum Bildung

Petri Nets and distributed systems. PNDS'08, Proceedings of the International Workshop, part of the […] Sidorova, Natalia; Moldt, Daniel; Rölke, Heiko (Hrsg.) Compilation Book | Xi'an: Univ. | 2008 7985 Endnote: Editor(s) Sidorova, Natalia; Moldt, Daniel; Rölke, Heiko
Title: Petri Nets and distributed systems. PNDS'08, Proceedings of the International Workshop, part of the International Conference on Application and Theory of Petri Nets and other Models of Concurrency
Published: Xi'an: Univ., 2008
Publication Type: 2. Herausgeberschaft; Sammelband (keine besondere Kategorie)
Language: Englisch
Keywords: Petri-Netz; Modellierung; Softwareentwicklung; Netzarchitektur; Informatik; Datenanalyse; Informationsverarbeitung
Abstract (english): This booklet contains the proceedings of the International Workshop on Petri Nets andDistributed Systems (PNDS'08) in Xi'an, China, June 23-24, 2008. It is a satellite event ofPetri Nets 2008, the 29th International Conference on Application and Theory of Petri Netsand Other Models of Concurrency. PNDS'08 is organized by institutes from Eindhoven University of Technology, TheNetherlands, the University of Hamburg, Germany, and the German Institute for InternationalEducational Research, Frankfurt, Germany. More information about the workshop can be found at http://www.informatik.uni- hamburg.de/TGI/events/pnds08/. For the successful realization of complex systems of interacting and reactive software andhardware components the use of a precise language at different stages of the developmentprocess is of crucial importance. Petri nets are becoming increasingly popular in this area, asthey provide a uniform language that supports the tasks of modelling, validation andverification. Their popularity is due to the fact that fundamental aspects of causality,concurrency and choice are captured by Petri nets in a natural and mathematically precise waywithout compromising readability.The use of Petri nets (P/T-nets, colored Petri nets and extensions) related to all aspects ofdistributed systems, covering modelling, validation, and verification, are presented as well astheir application and tools supporting the disciplines mentioned above.The intention of this workshop is to bring together research and application to have a livelymutual exchange of ideas, view points, knowledge, and experience. (Autor)
DIPF-Departments: Informationszentrum Bildung

Petri net controlled finite automata Farwer, Berndt; Jantzen, Matthias; Kudlek, Manfred; Rölke, Heiko; Zetsche, Georg Journal Article | In: Fundamenta Informaticae | 2008 7984 Endnote: Author(s): Farwer, Berndt; Jantzen, Matthias; Kudlek, Manfred; Rölke, Heiko; Zetsche, Georg
Title: Petri net controlled finite automata
In: Fundamenta Informaticae, 85 (2008) , S. 111-121
Publication Type: 3a. Beiträge in begutachteten Zeitschriften; Aufsatz (keine besondere Kategorie)
Language: Englisch
Keywords: Petri-Netz; Modellierung; Sprache; Netzarchitektur; Informatik
Abstract (english): We present a generalization of finite automata using Petri nets as control, called Concurrent Finite Automata for short. Several modes of acceptance, defined by final markings of the Petri net, are introduced, and their equivalence is shown. The class of languages obtained by l-free concurrent finite automata contains both the class of regular sets and the class of Petri net languages defined by final marking, and is contained in the class of context-sensitive languages. (Autor)
DIPF-Departments: Informationszentrum Bildung

A monitoring toolset for PAOSE Cabac, Lawrence; Dörges, Till; Rölke, Heiko Book Chapter | Aus: Hee, Kees Max van; Rüdiger, Valk (Hrsg.): Applications and theory of Petri nets: 29th International Conference, PETRI NETS 2008, Xi'an, China, June 23-27, 2008, proceedings | Berlin: Spinger | 2008 7983 Endnote: Author(s): Cabac, Lawrence; Dörges, Till; Rölke, Heiko
Title: A monitoring toolset for PAOSE
In: Hee, Kees Max van; Rüdiger, Valk (Hrsg.): Applications and theory of Petri nets: 29th International Conference, PETRI NETS 2008, Xi'an, China, June 23-27, 2008, proceedings, Berlin: Spinger, 2008 (Lecture notes in computer science, 5062), S. 399-408
DOI: 10.1007/978-3-540-68746-7_26
URL: http://dx.doi.org/10.1007/978-3-540-68746-7_26
Publication Type: 4. Beiträge in Sammelwerken; Tagungsband/Konferenzbeitrag/Proceedings
Language: Englisch
Keywords: Petri-Netz; Softwareentwicklung; Computerprogramm; Netzarchitektur; Modell; Modellierung; Datenverarbeitung; Datenanalyse; Informatik; Informationswissenschaft
Abstract (english): Paose (Petri net-based Agent-Oriented Software Engineering) combines the paradigm of AOSE (Agent-Oriented Software Engineering), with the expressive power of Petri nets - reference netsto be more precise. While AOSE is a powerful approach when itcomes to designing and developing distributed (agent) applications, itdoes not address the problems specific to debugging, monitoring, andtesting of these applications, i.e. no global state of the system and verydynamic operating conditions. To tackle these problems, two tools havebeen developed in the context of Paose, which are presented in thiswork.Firstly, this paper will give a short overview over the interrelated set oftools, which exists already and supports Petri net- based AOSE. The toolsare centered around the Petri net-based multi- agent system developmentand runtime environment Renew/Mulan/Capa. Secondly, Mulan-Viewer and Mulan-Sniffer will be presented in moredetail - two tools to address the issues encountered during debugging, monitoring, and testing agent applications. Both tools are first class members of the aforementioned family. The first tool, Mulan-Viewer, deals with the introspection of agents and agent behaviors, while it alsooffers rudimentary features for controlling the agent-system. The Mulan-Sniffer as the second tool places emphasis on tracing, visualizing, and analyzing communication between all parts of the multi-agent applicationand offers interfaces for more advanced methods of analysis, such as process mining. Both Mulan-Viewer and Mulan-Sniffer are realizedas Renew plugins that can also be extended by other plugins. (Autor)
DIPF-Departments: Informationszentrum Bildung

Dynamic transition refinement Köhler, Michael; Rölke, Heiko Journal Article | In: Electronic Notes in Theoretical Computer Science | 2007 7316 Endnote: Author(s): Köhler, Michael; Rölke, Heiko
Title: Dynamic transition refinement
In: Electronic Notes in Theoretical Computer Science, 175 (2007) 2, S. 119-134
URL: http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B75H1-4NYD491-8-1&_cdi=13109&_user=10&_orig=browse&_coverDate=06%2F21%2F2007&_sk=998249997&view=c&wchp=dGLbVtb-zSkzk&md5=f41b12806ef766740e63f12a2188c188&ie=/sdarticle.pdf
Publication Type: 3a. Beiträge in begutachteten Zeitschriften; Aufsatz (keine besondere Kategorie)
Language: Englisch
Keywords: Informatik; Modell; Struktur; Netzarchitektur; Petri-Netz; Internet
Abstract (english): Refinement of Petri nets is well suited for the hierarchical design of system models. It is used to represent a model at different levels of abstraction. Usually, refinement is a static concept. For some inherent dynamic domains as for example the modeling of web services, we need a more flexible form of refinement, e.g. to bind web services at run-time. Run-time binding allows fora flexible orchestration of services. The requirement of dynamic refinement at run-time is quite strong. Since we would like to redefine the system structure by itself, transition refinement cannot be implemented by a model transformation. Instead, an approach is needed which allows for dynamic net structures that can evolve as an effect of transitions firing.In previous work we introduced nets-within-nets as a formalism for the dynamic refinement of tokens. Here we consider an extension of nets-within- nets that uses special net tokens describing the refinement structure of transitions. Using this formalism it is possible to update refinements, introduce alternative refinements, etc. We present some formal properties of the extended formalism and introduce an example implementation for the tool Renew. (DIPF/Author)
DIPF-Departments: Informationszentrum Bildung

Web service orchestration with super-dual object nets Köhler, Michael; Rölke, Heiko Book Chapter | Aus: Kleijn, Jetty; Yakolev, Alex (Eds.): Petri nets and other models of concurrency - ICATPN 2007: 28th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2007, Siedlce, Poland, June 25-29, 2007, proceedings | Berlin: Springer | 2007 7315 Endnote: Author(s): Köhler, Michael; Rölke, Heiko
Title: Web service orchestration with super-dual object nets
In: Kleijn, Jetty; Yakolev, Alex (Eds.): Petri nets and other models of concurrency - ICATPN 2007: 28th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2007, Siedlce, Poland, June 25-29, 2007, proceedings, Berlin: Springer, 2007 (Theoretical Computer Science and General Issues, 4546), S. 263-280
Publication Type: 4. Beiträge in Sammelwerken; Tagungsband/Konferenzbeitrag/Proceedings
Language: Englisch
Keywords: Informatik; Modell; Struktur; Netzarchitektur; Petri-Netz; Internet
Abstract (english): Refinement of Petri nets is well suited for the hierarchical design of system models. It is used to represent a model at different levels of abstraction.Usually, refinement is a static concept. For some inherent dynamic domains as for example the modelling of web services, we need a more flexible form of refinement, e.g. to bind web services at run-time. Run-time binding allows for a flexible orchestration of services. The requirement of dynamic refinement at run-time is quite strong. Since we would like to redefine the system structure by itself, transition refinement cannot be implemented by a model transformation. Instead, an approach is needed which allows for dynamic net structures that can evolve as an effect of transitions firing. In previous work we introduced nets-within-nets as a formalism for the dynamic refinement of tokens. Here we consider an extension of nets-within-nets that uses special net tokens describing the refinement structure of transitions. Using this formalism it is possible to update refinements, introduce alternative refinements, etc. We present some formal properties of the extended formalism and introduce an example implementation for the tool Renew. (DIPF/Au)
DIPF-Departments: Informationszentrum Bildung