Bibliography

Major publications by the team in recent years

[1]

S. Abbes, A. Benveniste.
True-concurrency probabilistic models: Markov nets and a law of large numbers, in: Theoretical Computer Science, 2008, vol. 390, n^o 2-3, p. 129-170.

[2]

A. Benveniste, E. Fabre, C. Jard, S. Haar.
Diagnosis of asynchronous discrete event systems, a net unfolding approach, in: IEEE Transactions on Automatic Control, May 2003, vol. 48, n^o 5, p. 714–727.

[3]

A. Bouillard, E. Thierry.
An Algorithmic Toolbox for Network Calculus, in: Journal of Discrete Event Dynamic Systems (JDEDS), 2008, vol. 18, n^o 1, p. 3-49.

[4]

T. Chatain, C. Jard.
Complete finite prefixes of symbolic unfoldings of safe time Petri nets, in: Proc. of ICATPN, LNCS, June 2006, n^o 4024, p. 125–145.

[5]

E. Fabre, A. Benveniste.
Partial Order Techniques for Distributed Discrete Event Systems: why you can't avoid using them, in: Journal of Discrete Event Dynamic Systems (JDEDS), 2007, vol. 17, p. 355-403.

[6]

E. Fabre.
Trellis Processes: a Compact Representation for Runs of Concurrent Systems, in: Journal of Discrete Event Dynamic Systems (JDEDS), 2007, vol. 17, n^o 3, p. 267–306.

[7]

T. Gazagnaire, B. Genest, L. Héloüet, P. Thiagarajan, S. Yang.
Causal Message Sequence Charts, in: Theoretical Computer Science (TCS), 2009, vol. 410, n^o 41, p. 4094-4110.

Publications of the year

Doctoral Dissertations and Habilitation Theses

[8]

D. Biswas.
Visibility in Hierarchical Systems, Université de Rennes 1, 2009, Ph. D. Thesis.

[9]

S. Rosario.
Quality of Service issues in compositions of Web services, Université de Rennes 1, 2009, Ph. D. Thesis.

Articles in International Peer-Reviewed Journal

[10]

D. Bosnacki, E. Elkind, B. Genest, D. Peled.
On Commutativity Based Edge Lean Search, in: Special issue of BISFAI 2007, Annals of Mathematic and Artificial Intelligence (AMAI), 2009, vol. in press.

[11]

P. Darondeau, B. Genest, P.S. Thiagarajan, S. Yang.
Quasi-Static Scheduling of Communicating Tasks, in: Special issue of CONCUR 2008 accepted to Information and Computation, 2009, vol. in press.

[12]

E. Elkind, B. Genest, D. Peled, P. Spoletini.
Quantifying the Discord: Order Discrepancies in Message Sequence Charts, in: Special Issue of ATVA'07, International Journal of Foundations of Computer Sciecnce (IJFCS), 2009, vol. in press.

[13]

T. Gazagnaire, B. Genest, L. Hélouët, P.S. Thiagarajan, S. Yang.
Causal Message Sequence Charts, in: Theoretical Computer Science (TCS), 2009, vol. 410, n^o 41, p. 4094-4110.

[14]

A. Madalinski, E. Fabre.
Modular Construction of Finite and Complete Prefixes of Petri Net Unfoldings, in: Fundamenta Informaticae, 2009, n^o 95.

[15]

S. Rosario, A. Benveniste, C. Jard.
Flexible Probabilistic QoS Management of Orchestrations, in: International Journal of Web Services Research, 2010, n^o 2, to appear.

Invited Conferences

[16]

A. Bouillard, B. Cottenceau, B. Gaujal, L. Hardouin, S. Lagrange, M. Lhommeau, E. Thierry.
COINC Library: a toolbox for the Network Calculus, in: Fourth International Conference on Performance Evaluation Methodologies and Tools (ValueTools), ICST, 2009.

International Peer-Reviewed Conference/Proceedings

[17]

S. Abbes, A. Benveniste.
Concurrency, Sigma-Algebras, and Probabilistic Fairness, in: FOSSACS, 2009, p. 380-394.

[18]

N. Bertrand, B. Genest, H. Gimbert.
Qualitative Determinacy and Decidability of Stochastic Games with Signals, in: Twenty-Fourth Annual IEEE Symposium on Logic In Computer Science (LICS), 2009, vol. IEEE 978-0-7695-3746-7, p. 319-328.

[19]

D. Biswas, A. Jiwane, B. Genest.
Atomicity for XML Databases, in: Sixth International XML Database Symposium (XSym), 2009, vol. LNCS 5679, p. 160-167.

[20]

A. Bouillard, S. Haar, S. Rosario.
Critical Paths in the Partial Order Unfolding of a Stochastic Petri Net, in: FORMATS, J. Ouaknine, F. W. Vaandrager (editors), Lecture Notes in Computer Science, Springer, 2009, vol. 5813.

[21]

A. Bouillard, L. T.X. Phan, S. Chakraborty.
Lightweight Modeling of Complex State Dependencies in Stream-Processing Systems, in: 15th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), 2009.

[22]

A. Bouillard, S. Rosario, A. Benveniste, S. Haar.
Monotonicity in Service Orchestrations, in: Petri Nets, Lecture Notes in Computer Science, Springer, 2009, vol. 5606, p. 263-282.

[23]

E. Fabre, L. Jézéquel.
Distributed Optimal Planning: an Approach by Weighted Automata Calculus, in: Conference on Detection and Control (CDC), 2009.

[24]

B. Grabiec, C. Jard.
Unfolding of Networks of Automata and their Application in Supervision, in: 9th annual international conference on New Technologies of Distributed Systems (NOTERE), july 2009.

[25]

F. Kerschbaum, D. Dahlmeier, A. Schröpfer, D. Biswas.
On the practical importance of communication complexity for secure multi-party computation protocols, in: Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), Honolulu, Hawaii, USA, March 9-12, 2009, 2009, p. 2008-2015.

[26]

S. Rosario, A. Benveniste, C. Jard.
Monitoring Probabilistic SLAs in Web Service Orchestrations, in: IFIP/IEEE Intern. Symposium on Integrated Network Management, Mini-conference, IEEE, june 2009.

[27]

S. Rosario, A. Benveniste, C. Jard.
Probabilistic QoS Management of Transaction based Web services Orchestrations, in: IEEE 7th International Conference on Web Services (ICWS 2009), IEEE, july 2009.

National Peer-Reviewed Conference/Proceedings

[28]

M. Boyer, L. Jouhet, A. Bouillard.
Notations pour le calcul réseau, in: Modélisation des systèmes réactifs (MSR), JESA, 2009.

Books or Proceedings Editing

[29]

C. Jard, O.-H. Roux (editors)
Communicating Embedded Systems – Software and Design, ISTE Publishing / John Wiley, October 2009, ISBN:978-1-8482-1143-8.

Internal Reports

[30]

A. Bouillard, S. Haar, S. Rosario.
Critical paths in the Partial Order Unfolding of a Stochastic Petri Net, INRIA, 2009, n^o 7003, Technical report.

[31]

A. Bouillard, L. Jouhet, E. Thierry.
Tight performance bounds in the worst-case analysis of feed-forward networks, INRIA, 2009, n^o 7012, Technical report.

[32]

L. Hélouët, A. Benveniste.
Distributed Active XML and Service Interfaces, INRIA, 2009, n^o 7082, Research report.

[33]

L. Hélouët, A. Roumy.
Canaux cachés et théorie de l'information, Projet ANR DOTS, 2009, Research report, DOTS deliverable 2.4.b.

[34]

V. Rehák, P. Slovák, J. Strejček, L. Hélouët.
Decidable Race Condition for HMSC, Faculty of Informatics, Masaryk Univ., 2009, n^o FIMU-RS-2009-10, Technical report.

References in notes

[35]

S. Abiteboul, Z. Abrams, S. Haar, T. Milo.
Diagnosis of asynchronous discrete event systems: datalog to the rescue!, in: PODS '05: Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, New York, NY, USA, ACM Press, 2005, p. 358–367
http://doi.acm.org/10.1145/1065167.1065214.

[36]

A. Bouillard, B. Gaujal, S. Lagrange, E. Thierry.
Optimal routing for end-to-end guarantees using Network Calculus, in: Performance Evaluation, 2008, vol. 65, n^o 11-12, p. 883-906.

[37]

A. Bouillard, L. Jouhet, E. Thierry.
Computation of a (min,+) multi-dimensional convolution for end-to-end performance analysis, in: 3rd international conference on Performance Evaluation Methodologies and Tools (ValueTools 2008), Athens, Greece, October 2008.

[38]

A. Bouillard, E. Thierry.
An Algorithmic Toolbox for Network Calculus, in: Journal of Discrete Event Dynamic Systems (JDEDS), 2008, vol. 18, n^o 1, p. 3-49.

[39]

M. G. Buscemi, V. Sassone.
High-Level Petri Nets as Type Theories in the Join Calculus, in: FoSSaCS, Lecture Notes in Computer Science, Springer, 2001, vol. 2030, p. 104-120.

[40]

C. Cassandras, S. Lafortune.
Introduction to discrete event systems, Kluwer Academic Publishers, 1999.

[41]

R. Devillers, H. Klaudel.
Solving Petri net recursions through finite representation, in: IASTED International Conference on Advances in Computer Science and Technology, ACST'2004, ACTA Press, 2004, p. 145-150, ISBN 0-88986-497-3.

[42]

L. Hélouët, T. Gazagnaire, B. Genest.
Diagnosis from Scenarios, in: WODES'06, 2006, p. 307-312.

[43]

L. Hélouët, T. Gazagnaire, H. Marchand.
Anomaly Detection with diagnosis technique, Projet Politess, 2008, Technical report.

[44]

ITU-TS.
ITU-TS Recommendation Z.120: Message Sequence Chart (MSC), ITU-TS, Geneva, September 1999.

[45]

A. Madalinski, E. Fabre.
Modular construction of finite and complete prefixes of Petri net unfoldings, in: ACSD'08, Applications of Concurrency to System Design, Xian, China, July 2008.

[46]

J. Misra.
A Programming Model for the Orchestration of Web Services, in: SEFM, IEEE Computer Society, 2004, p. 2-11.

[47]

M. Nielsen, G. Plotkin, G. Winskel.
Petri nets, event structures and domains, part 1, in: Theoretical Computer Science, 1981.

[48]

Object Management Group.
Unified Modeling Language Specification version 2.0: Superstructure, OMG, 2003, n^o pct/03-08-02, Technical report.

[49]

W. Reisig.
Petri nets, Springer Verlag, 1985.

[50]

M. Reniers, S. Mauw.
High-level Message Sequence Charts, in: SDL97: Time for Testing - SDL, MSC and Trends, Evry, France, A. Cavalli, A. Sarma (editors), Proceedings of the Eighth SDL Forum, September 1997, p. 291-306.

[51]

M. Reniers.
Message Sequence Charts: Syntax and Semantics, Eindhoven University of Technology, 1998, Ph. D. Thesis.

[52]

S. Rosario, A. Benveniste, S. Haar, C. Jard.
Probabilistic QoS and soft contracts for transaction based Web services orchestrations, in: IEEE Trans. on Service Computing, Oct-Dec 2008, vol. 1, n^o 14, p. 1-14.

[53]

E. Rudolph, P. Graubman, J. Grabowski.
Tutorial On Message Sequence Charts, in: Computer Networks and ISDN Systems, 1996, vol. 28, p. 1629-1641.

[54]

G. Winskel.
Event structures semantics in CCS and related languages, in: Lecture Notes in Computer Science, Springer Verlag, 1982, vol. 140.

[55]

G. Winskel.
Categories of Models for Concurrency, in: Seminar on Concurrency, Lecture Notes in Computer Science, Springer, 1985, vol. 197, p. 246-267.