• Aucun résultat trouvé

Preface

N/A
N/A
Protected

Academic year: 2022

Partager "Preface"

Copied!
2
0
0

Texte intégral

(1)

Preface by the PNSE’2021 Organisers

These are the proceedings of the International Workshop on Petri Nets and Software Engineering (PNSE’2021) to be held at June 25, 2021. The workshop is co-located with 42nd International Conference on Applica- tion and Theory of Petri Nets and Concurrency (PETRI NETS 2021) in Paris, France.

The workshop emphasizes on the impact of software engineering in general and its development based on Petri nets. Therefore we have espe- cially invited contributions that work on subjects that could be relevant for Petri nets, their application, supporting tools, etc. Results on other formalisms or semi-formal techniques are highly welcome. More informa- tion about the workshop can be found at:http://www.pnse.de/

The previous edition of PNSE in 2020 should also have been in Paris, but due to the pandemic it has to be be organised as a virtual meeting.

By the time this workshop was organised we all hoped that it would be possible to meet in Paris again. We were too optimistic.

Overall we received 20 contributions for these proceedings. Each paper was reviewed by at least three referees. During the reviewing process the program comittee selected 13 contributions for publication.

We are glad that Joel Greenyer accepted our invitation to give an inivted talk about Scenario-Based Modeling and Programming of Dis- tributed Systems.

The international program committee of PNSE’21 was supported by the valued work of Artur Meski, Teofil Sidoruk, Mitchell Klijs, Malte Heithoff, and Joel Charles as additional reviewers. Their valuable work is highly appreciated.

Furthermore, we would like to thank our colleagues in the PC and the local organization team for their support – we are all now ‘experts’ in the organisation of virtual events.

June 2021 Michael K¨ohler-Bußmeier

Ekkart Kindler Heiko R¨olke

Copyright © 2021 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

(2)

The PNSE’2021 Programme Committee

Robin Bergenthum Jos´e Manuel Colom Elena G´omez-Mart´ınez Serge Haddad

Ekkart Kindler (co-chair)

Michael K¨ohler-Bußmeier (co-chair) Maciej Koutny

Lars Kristensen Jan Mendling Daniel Moldt Wojciech Penczek Laure Petrucci Alfonso Pierantonio Pascal Poizat

Heiko R¨olke (co-chair) Bernhard Rumpe Yann Thierry-Mieg Jan Martijn van der Werf Eric Verbeek

Manuel Wimmer

Références

Documents relatifs

Termination, soundness, and coverability for symbolic set of initial cases defined by a monotonous pattern are decidable properties on the class of backward-effective wqo-StDN

Subsections 2.3 and 2.4 give a short review on Petri net resources and resource equivalences (similarity and bisimulation). Section 3 deals with invisible transitions. In

Unit´e de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unit´e de recherche INRIA Rhˆone-Alpes, 655, avenue de l’Europe, 38330 MONTBONNOT ST

Unit´e de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unit´e de recherche INRIA Rhˆone-Alpes, 655, avenue de l’Europe, 38330 MONTBONNOT ST

There are many possible ways in which time and Petri nets interact, this talk will take a short look at three time-dependent Petri nets: Time Petri nets, Timed Petri nets, and

The concurrent step reachability graph of a Petri net has all reachable markings m as vertices, a distinguished initial marking m 0 and an arc labelled by U leading from m to m 0 when

In timed nets [65], [70], [83], firing times are associated with transitions, and transition firings are real–time events, i.e., tokens are removed from input places at the beginning

Local state spaces are built for the refining nets while a global state space captures the markings of the other places and points onto the local state spaces, as the