• Aucun résultat trouvé

Preface

N/A
N/A
Protected

Academic year: 2022

Partager "Preface"

Copied!
2
0
0

Texte intégral

(1)

Preface

This volume contains the papers presented at the joint SUMo/CompoNet 2011 event: second international workshop on Scalable and Usable Model Checking for Petri nets and other models of concurrency and the first international workshop on Composition of Petri nets held on June 20-24, 2011 in Newcastle, United Kingdom as a part of the International Conference on Applications and Theory of Petri Nets (PETRI NETS 2011). These joint workshops aim at bringing together, in an informal setting, researchers interested in all aspects of model checking and composition for different models of concurrency, whether this interest be practical or theoretical, primary or derived.

SUMo and CompoNet PC members have reviewed nine submissions by re- searchers from several countries. Each submission was reviewed by 4 program committee members. Finally six papers have been selected for publication and presentation.

The Model Checking Contest is a SUMo’s additional event that runs in par- allel with the paper submissions, this year the results of this contest will be presented at the conference but not directly published in this proceeding. We expect a future publication of those results after the workshop.

The workshops organizers would like to thank Alexandre Duret-Lutz, from EPITA/LRDE for his Keynote talk entitled”Building LTL Model Checkers using Transition-based Generalized B¨uchi Automata”.

The workshops organizers would also like to thank the authors of submitted papers for their interest in SUMo/CompoNet. We also thank the program com- mittee members and the external reviewers for their outstanding work during the reviewing process.

Last but not least, we thank the authors of the EasyChair conference man- agement system which made the practical organization of the reviewing process considerably easier.

June 2011 Didier Buchs (PC chair SUMo)

Hanna Klaudel and Franck Pommereau (PC chairs CompoNet)

(2)

Conference Organization

SUMo Programme Committee

B´eatrice B´erard (France)

Dragan Bosnacki (The Netherlands) Ivana Cern´a (Czech Republic) Gianfranco Ciardo (USA) Jean-Michel Couvreur (France) Martin Fr¨anzle (Germany) Giuliana Franchescinis (Italy) Monika Heiner (Germany) Tommi Junttila (Finland) Kais Klai (France)

Olga Kouchnarenko (France) Marta Kwiatkowska (UK)

Charles Lakos (Australia) Isabella Mastroeni (Italia) Emmanuel Paviot-Adet (France) Wojciech Penczek (Poland) Denis Poitrenaud (France) Olivier Roux (France)

Alexander Serebrenik (Netherland) Jeremy Spronston (Italy)

Yann Thierry-Mieg (France) Bow-Yaw Wang (Taiwan) Karsten Wolf (Germany)

External Reviewers

Edmundo Lopez (University of Geneva)

CompoNet Programme Committee

Eike Best (Germany) Didier Buchs (Switzerland) Gianfranco Ciardo (USA) Raymond Devillers (Belgium) Berndt M¨uller (Farwer) (UK) Alain Finkel (France)

David de Frutos-Escrig (Spain) Ryszard Janicki (Canada) Ekkart Kindler (Denmark) Jetty Kleijn (The Netherlands)

Charles Lakos (Australia) Johan Lilius (Finland) Daniel Moldt (Germany) Elisabeth Pelz (France) Laure Petrucci (France) Wolfgang Reisig (Germany)

Natalia Sidorova (The Netherlands) Alex Yakovlev (UK)

Søren Christensen (Denmark) Karsten Wolf (Germany)

Références

Documents relatifs

To cope with the state space explosion problem, several reduction techniques have been proposed: on-the-fly verification checks properties during the state space

TAPAAL [11], for instance, is an explicit-state model checker that combines Partial-Order Reduction techniques and structural reductions and can check property on Petri nets

We demonstrated the validity of our approach proving that, an event log perfectly fits a nested Petri net if and only if it is syntactically correct w.r.t the model and each

Progam Comittee: Klaus-Dieter Althoff (DFKI), Kerstin Bach (Norwegian University of Science and Technology), Ralph Bergmann (Universität Trier), Michael Fellmann (Universi-

It tries to cover all aspects of modeling, yet analytics and mining of model repositories (and other large collections of models) has not been a prime focus or the topic of a

Dijkstra and Kooy, [6] in their paper “The Learning model of Smartphone Feedback Applications in the field of e-health applied to the Step Counter The Learning model of Smartphone

Papers from the four main tracks at CICM 2014 (Calcule- mus, Digital Mathematical Libraries, Mathematical Knowledge Management, and Systems & Projects) will be published in

Moreover, one can compute the minimum and maximum elapsed time through every path of the graph which permits on- the-fly verification of timed reachability properties (e.g., is