Wednesday, September 5, 2012

[DMANET] CfP (J-15): 2d International Workshop on Worst-case Traversal Time (WCTT'2012)

Abstract submission deadline : J-15

**********************************************************************
2d International Workshop on Worst-case Traversal Time (WCTT'2012)
San Juan, Puerto Rico, Dec. 4, 2012
co-located with the 33nd IEEE Real-time Systems Symposium (RTSS)
website: http://www.wctt.info
info: wctt@cng1.iet.unipi.it
**********************************************************************


Following the success of the first editions, the WCTT workshop will
gather together scientists and practitioners from both academia and
industry to discuss methods for analysis of bounds on the traversal
time in networked systems. Multi-hop, network-like traversal will be
a mandatory requirement. Contributions that describe software tools
for computing worst-case bounds and/or assess the scalability and
accuracy of the performance methods will be given particular
attention. The workshop values both theoretical and practical
research. Experiences with real-life case studies (e.g., industrial
networks of practical relevance, fieldbuses, embedded networks and
network-on-chip) will also be appreciated, as well as those on the
integration of applicative scheduling and network.


Topics of interest include, but are not limited to:

Methods:
- Network Calculus (both deterministic and stochastic),
- Real-time Calculus
- Trajectory Approach
- Event-based methods
- Formal methods

Areas of applications:
- Embedded systems
- Computer networks
- Network-on-Chip
- Industrial networks

We solicit submission of manuscripts that present original research
results, neither previously published nor currently under review by
another conference or journal. Submitted papers must be formatted
according to the ACM conference proceedings format. Only PDF files
will be accepted. Papers must be up to eight pages long, including
references and title. Please note that the camera-ready version
will conform to the same guidelines as the submission for review.
All submitted papers will go through a rigorous peer review process.
Submissions will be judged on originality, significance, interest,
clarity, relevance, and correctness. Submission implies the
willingness of at least one author to attend the workshop and
present the paper. Accepted papers will be printed in the workshop
proceedings. Distinguished papers, after further revisions, may be
considered for a journal special issue.


---------------
Important Dates
---------------

Abstract submission deadline: Sep 19th, 2012
Paper submission deadline: Sep 30th, 2012
Paper decision deadline: Oct 21th, 2012
Camera-ready deadline: Nov 9th, 2012
Workshop date: Dec 4th, 2012

-------------------
Workshop organizers
-------------------

- Marc Boyer (ONERA, Toulouse, FR)
- Christian Fraboul (Univ. de Toulouse, FR)
- Giovanni Stea (University of Pisa, IT)

---------------------------
Technical Program Committee
---------------------------

- Annne Bouillard (ENS Ulm, FR)
- Jian-Jia Chen (KIT, DE)
- Florin Ciucu (T-labs TU Berlin, DE)
- Markus Fidler (Univ. of Hannover, DE)
- Jean Yves Le Boudec (EPFL, CH)
- Steven Martin (LRI, FR)
- Matthieu Moy (Ensimag/Verimag, FR)
- Linh Thi Xuan Phan (Univ. of Pennsylvania, US)
- Jens Schmitt (Univ. of Kaiserslautern, DE)
- Frank Slomka (University of Ulm, DE)

--
Marc Boyer, Ingenieur de recherche ONERA
Tel: (33) 5.62.25.26.36 DTIM
Fax: (33) 5.62.25.26.93 2, av Edouard Belin
http://www.onera.fr/staff/marc-boyer/ 31055 TOULOUSE Cedex 4
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************