Preliminary Programme
ACSD 2011 (accepted papers)
Wednesday, 22nd June
08.30-09.00 Opening session
09.00-10.00 Distinguished Carl Adam Petri Lecture by Brian Randell
10.00-10.30 Coffee break
10.30-12.00 Model transformations
On generating *-sound nets with substitution (Jacek Sroka, Piotr Chrząstowski-Wachtel and Jan Hidders)
Parameterized partial orders for modeling embedded system use cases: formal definition and translation to coloured Petri nets (Nikola Trcka, Marc Voorhoeve and Twan Basten)
Checking non-divergence, channel-bound and global cooperation using SAT-solvers (Florent Avellaneda and Remi Morin)
12.00-13.30 Lunch
13.30-14.30 Invited talk by Tomohiro Yoneda
14.30-15.00 Coffee break
15.00-16.30 Concurrent system verification
Bounds: from parameterised to finite-state verification (Antti Siirtola)
Compositional analysis for weak stubborn sets (Henri Hansen and Xu Wang)
Building tight occurrence nets from reveals relations (Sandie Balaguer, Thomas Chatain and Stefan Haar)
16.30-18.00 Tool exhibition
Thursday, 23rd June
09.00-10.00 Invited talk by Walter Vogler
10.00-10.30 Coffee break
10.30-12.00 Conformance and run-time techniques
Cost-based fitness in conformance checking (Arya Adriansyah, Natalia Sidorova and Boudewijn Van Dongen)
Run-time concurrency tuning for peak power modulation in energy harvesting systems (Yu Zhou, Terrence Mak and Alex Yakovlev)
Runtime programming through model-preserving, scalable runtime patches (Christoph M. Kirsch, Luís Lopes, Eduardo R. B. Marques and Ana Sokolova)
12.00-13.30 Lunch
13.30-14.30 Invited talk by Monika Heiner
14.30-15.00 Coffee break
15.00-17.00 Stochastic systems
Bounded fairness for probabilistic distributed algorithms (Pepijn Crouzen, Ernst Moritz Hahn, Holger Hermanns, Abhishek Dhama, Oliver Theel, Ralf Wimmer, Bettina Braitling and Bernd Becker)
A probabilistic model of LMAC protocol for concurrent wireless sensor networks (Luz Judith R. Esparza, Kebin Zeng and Bo Friis Nielsen)
Towards supervisory control for interactive Markov chains: controllability (Jasen Markovski)
New results on abstract probabilistic automata (Benoit Delahaye, Joost-Pieter Katoen, Kim G. Larsen, Axel Legay, Mikkel L. Pedersen, Falak Sher and Andrzej Wasowski)
17.10-18.10 Asynchronous circuits
Improved parallel composition of labelled Petri nets (Arseniy Alekseyev, Victor Khomenko, Andrey Mokhov, Dominic Wist and Alex Yakovlev)
STG decomposition: partitioning heuristics (Dominic Wist, Walter Vogler and Ralf Wollowski)
19.00 Coaches leave for the conference dinner
Friday, 24th June
09.00-10.00 Invited talk by Alessandro Giua
10.00-10.30 Coffee break
10.30-12.00 Synchronous and heterogenous systems
Semantic adaptation for models of computation (Frédéric Boulanger, Cécile Hardebolle, Christophe Jacquet and Dominique Marcadet)
Data-flow analysis of extended finite state machines (Yu Bai, Jens Brandt and Klaus Schneider)
A GALS language for dynamic distributed and reactive programs (Avinash Malik, Alain Girault and Zoran Salcic)
12.00-13.30 Lunch
13.30-14.30 Timed systems
Modelling for symbolic analysis of safety instrumented systems with clocks (Roland Kindermann, Tommi Junttila and Ilkka Niemelä)
Timed games for computing WCET for pipelined processors with caches (Franck Cassez)
14.30-15.00 Coffee break
15.00-16.00 Closing session
Petri Nets 2011 (accepted papers)
Wednesday, 22nd June
08.30-09.00 Opening session
09.00-10.00 Distinguished Carl Adam Petri Lecture by Brian Randell
10.00-10.30 Coffee break
10.30-12.00 Tools
A tool for automated test code generation from high-level Petri nets (Dianxiang Xu)
The ePNK: An extensible Petri net tool for PNML (Ekkart Kindler)
Access/CPN 2.0: A high-level interface to coloured Petri net models (Michael Westergaard)
12.00-13.30 Lunch
13.30-14.30 Invited talk by Tomohiro Yoneda
14.30-15.00 Coffee break
15.00-16.30 Tools and State Spaces
Forward analysis and model checking for trace bounded WSTS (Pierre Chambart, Alain Finkel and Sylvain Schmitz)
Crocodile: a symbolic/symbolic model checker for symmetric nets with bag (Maximilien Colange, Souheib Baarir, Fabrice Kordon and Yann Thierry-Mieg)
Minimal coverability set for Petri nets: Karp and Miller algorithm with pruning (Pierre-Alain Reynier and Frédéric Servais)
16.30-18.00 Tool exhibition
Thursday, 23rd June
09.00-10.00 Invited talk by Walter Vogler
10.00-10.30 Coffee break
10.30-12.00 Unfolding
An algorithm for direct construction of complete merged processes (Victor Khomenko and Andrey Mokhov)
How much is worth to remember? A taxonomy based on Petri nets unfoldings (G. Michele Pinna)
Branching processes of general Petri nets (Jean-Michel Couvreur, Denis Poitrenaud and Pascal Weil)
12.00-13.30 Lunch
13.30-14.30 Invited talk by Monika Heiner
14.30-15.00 Coffee break
15.00-16.30 Verification
Refinement of synchronizable places with multi-workflow nets - weak termination preserved! (Kees Van Hee, Natalia Sidorova and Jan Martijn Van Der Werf)
Modelling and verification of a protocol for operational support using coloured Petri nets (Michael Westergaard and Fabrizio Maggi)
Finding a witness path for non-liveness in free-choice nets (Karsten Wolf and Harro Wimmel)
19.00 Coaches leave for the conference dinner
Friday, 24th June
09.00-10.00 Invited talk by Alessandro Giua
10.00-10.30 Coffee break
10.30-12.00 Semantics
A Petri net interpretation of open reconfigurable systems (Frederic Peschanski, Hanna Klaudel and Raymond Devillers)
The mutex paradigm of concurrency (Jetty Kleijn and Maciej Koutny)
On the origin of events: branching cells as stubborn sets (Henri Hansen and Xu Wang)
12.00-13.30 Lunch
13.30-14.30 Stochastic nets
On parametric steady state analysis of a generalised stochastic Petri net with a fork-join subnet (Jonathan Billington and Guy Edward Gallasch)
Synthesis and Analysis of Product-form Petri Nets (Serge Haddad, Jean Mairesse and Hoang-Thach Nguyen)
14.30-15.00 Coffee break
15.00-16.00 Closing session
