Preface of the Proceedings of the Fourth International Workshop on Petri Nets and Graph Transformation PNGT 201

Ermel, Claudia

Hoffmann, Kathrin

English

PNGT 2010 is the fourth workshop of a series that serves as a forum for all researchers and practitioners interested in an exchange of ideas, notions, techniques between the fields of Petrinets and graph transformations, two prominent specification formalisms of concurrent and distributed systems. It belongs to the folklore that Petri nets can be seen as rewriting systems over (multi)sets,  the rewriting rules being the transitions,  and,  as such they can be seen as special graph transformation systems. This close correspondence between the two models has naturally led to a mutual influence. For instance, several approaches to the concurrent semantics of graph transformation systems as well as techniques for their analysis and verification are strongly influenced by the corresponding theories and constructions for Petri nets. Classical Petri net models have been integrated with graph transformation systems, e.g., in order to define rule-based changes in the net structure.  This serves both for a stepwise refinement of Petri net models or for the specification of dynamically reconfiguring nets. Interesting connections exist with extensions of Petri net models with dynamic topologies, or with notions of Petri net module or component. Graph transformation systems are also used for the development, the simulation, or animation of various types of Petri nets, e.g., via the the definition of visual languages and environments.PeerReviewe

REPOSIT HAW Hamburg

Preface

Electronic Communications of the EASST (European Association of Software Science and Technology)

Electronic Communications of the EASSTVolume 40 (2011)Proceedings of the4th International Workshop on Petri Nets and GraphTransformation(PNGT 2010)Preface2 pagesGuest Editors: Claudia Ermel, Kathrin HoffmannManaging Editors: Tiziana Margaria, Julia Padberg, Gabriele TaentzerECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122ECEASSTPrefacePNGT 2010 is the fourth workshop of a series that serves as a forum for all researchers andpractitioners interested in an exchange of ideas, notions, techniques between the fields of Petrinets and graph transformations, two prominent specification formalisms of concurrent and dis-tributed systems. It belongs to the folklore that Petri nets can be seen as rewriting systems over(multi)sets, the rewriting rules being the transitions, and, as such they can be seen as specialgraph transformation systems. This close correspondence between the two models has naturallyled to a mutual influence. For instance, several approaches to the concurrent semantics of graphtransformation systems as well as techniques for their analysis and verification are strongly in-fluenced by the corresponding theories and constructions for Petri nets.Classical Petri net models have been integrated with graph transformation systems, e.g., inorder to define rule-based changes in the net structure. This serves both for a stepwise refine-ment of Petri net models or for the specification of dynamically reconfiguring nets. Interestingconnections exist with extensions of Petri net models with dynamic topologies, or with notionsof Petri net module or component. Graph transformation systems are also used for the develop-ment, the simulation, or animation of various types of Petri nets, e.g., via the the definition ofvisual languages and environments.PNGT 2010 balances theoretical and applied concepts. The workshop continues the researchon reconfigurable Petri nets, and the selected papers published in this ECEASST volume estab-lish interesting connections between Petri nets and graph transformation systems and tools, aswell as between different classes of algebraic higher order systems. Suitable concepts focus onextensions to model especially highly dynamic structures and complex behavior in the area ofcommunication platforms in an adequate way and on net patterns to simplify the complicatedtask of rule application. Moreover a promising technique for state space exploration is presentedto increase the efficiency by identifying a feasible execution path of a graph transformation sys-tem corresponding to a given occurrence vector.We thank all reviewers who were involved in the review process and had their share in im-proving the papers for this PNGT volume of ECEASST.Claudia Ermel,Kathrin Hoffmann(Guest Editors of PNGT 2010)1 / 2 Volume 40 (2011)PrefaceReviewersEnrico Biermann (TU Berlin, Germany)Andrea Corradini (Università di Pisa, Italy)Hartmut Ehrig (TU Berlin, Germany) (PC chair)Claudia Ermel (TU Berlin, Germany) (PC chair)Karsten Gabriel (Fraunhofer Institut FOKUS Berlin, Germany)Ulrike Golas (TU Berlin, Germany)Reiko Heckel (University of Leicester, UK)Kathrin Hoffmann (Universität der Angewandten Wissenschaften, Hamburg, Germany) (PC chair)Christian Krause (HPI Potsdam, Germany)Tony Modica (TU Berlin, Germany)Julia Padberg (Universität der Angewandten Wissenschaften, Hamburg, Germany)Daniel Varró (Budapest University of Technology and Economics, Hungary)Francesco Parisi-Presicce (Sapienza Università di Roma, Italy)Proc. PNGT 2010 2 / 2

https://journal.ub.tu-berlin.de/eceasst/article/download/632/640

Preface

Abstract

Similar works

Full text

Available Versions

REPOSIT HAW Hamburg

Electronic Communications of the EASST (European Association of Software Science and Technology)