Bibliography

• 1S. 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.
• 2A. 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.
• 3T. 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.
• 4E. 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.
• 5E. 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.
• 6E. Fabre, L. Jézéquel.
  
  Distributed optimal planning: an approach by weighted automata calculus, in: CDC, 2009, p. 211-216.
• 7T. 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.

Doctoral Dissertations and Habilitation Theses

• 8L. Jezequel.
  
  Distributed Optimal Planning in Large Distributed Systems, ENS Cachan, 2012.
• 9A. Kattepur.
  
  Flexible Quality of Service (QoS) Management of Web Services Orchestrations, Univ. Rennes 1, 2012.

Articles in International Peer-Reviewed Journals

• 10S. Akshay, B. Genest, L. Hélouët, S. Yang.
  
  Regular set of representatives for time-constrained MSC graphs, in: Inf. Process. Lett., 2012, vol. 112, n^o 14-15, p. 592-598.
• 11G. Aucher.
  
  DEL-Sequents for regression and epistemic planning, in: Journal of Applied Non-Classical Logics, 2012, vol. 22, n^o 4, p. 337-367.
  
  http://dx.doi.org/10.1080/11663081.2012.736703
• 12A. Basu, S. Bensalem, M. Bozga, B. Delahaye, A. Legay.
  
  Statistical abstraction and model-checking of Large Heterogeneous Systems, in: International Journal on Software Tools for Technology Transfer, 2012, vol. 14, n^o 1, p. 53-72. [ DOI : 10.1007/s10009-011-0201-2 ]
  
  http://hal.inria.fr/hal-00722489
• 13A. Classen, M. Cordy, P. Heymans, P.-Y. Schobbens, A. Legay.
  
  Model Checking for Software Product Lines with SNIP, in: International Journal on Software Tools for Technology Transfer (STTT), 2012. [ DOI : 10.1007/s10009-012-0234-1 ]
  
  http://hal.inria.fr/hal-00717956
• 14L. Hélouët, C. Jard, R. Abdallah.
  
  Distributed Implementation of Message Sequence Charts, in: SOSYM, 2013, to appear.
• 15S. K. Palaniappan, S. Akshay, B. Liu, B. Genest, P. S. Thiagarajan.
  
  A Hybrid Factored Frontier Algorithm for Dynamic Bayesian Networks with a Biopathways Application, in: IEEE/ACM Trans. Comput. Biology Bioinform., 2012, vol. 9, n^o 5, p. 1352-1365.
• 16F. Schwarzentruber.
  
  Complexity Results of STIT Fragments, in: Studia Logica, 2012, vol. 100, n^o 5, p. 1001-1045.

International Conferences with Proceedings

• 17M. Agrawal, S. Akshay, B. Genest, P. S. Thiagarajan.
  
  Approximate Verification of the Symbolic Dynamics of Markov Chains, in: Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, LICS 2012, IEEE, 2012, p. 55-64.
• 18S. Akshay, B. Genest, L. Hélouët, S. Yang.
  
  Symbolically Bounding the Drift in Time-Constrained MSC Graphs, in: Theoretical Aspects of Computing - ICTAC 2012 - 9th International Colloquium, A. Roychoudhury, M. D'Souza (editors), Lecture Notes in Computer Science, Springer, 2012, vol. 7521, p. 1-15.
• 19S. Akshay, L. Hélouët, C. Jard, D. Lime, O. H. Roux.
  
  Robustness of Time Petri Nets under Architectural Constraints, in: FORMATS, Lecture Notes in Computer Science, 2012, vol. 7595, p. 11-26.
• 20S. Akshay, L. Hélouët, C. Jard, P.-A. Reynier.
  
  Robustness of Time Petri Nets under Guard Enlargement, in: RP, Lecture Notes in Computer Science, 2012, vol. 7550, p. 92-106.
• 21G. Aucher, B. Maubert, F. Schwarzentruber.
  
  Generalized DEL-Sequents, in: JELIA, L. F. del Cerro, A. Herzig, J. Mengin (editors), Lecture Notes in Computer Science, Springer, 2012, vol. 7519, p. 54-66.
• 22G. Aucher, F. Schwarzentruber.
  
  On the complexity of Dynamic Epistemic Logic, in: TARK2013, 2013, to appear.
• 23M. Cordy, A. Classen, P. Heymans, P.-Y. Schobbens, A. Legay.
  
  Managing Evolution in Software Product Lines : A Model-Checking Perspective, in: 6th International Workshop on Variability Modelling of Software Intensive Systems, Leipzig, Saxe, Germany, ACM, January 2012, p. 183-191.
  
  http://hal.inria.fr/hal-00718216
• 24M. Cordy, A. Classen, G. Perrouin, P.-Y. Schobbens, P. Heymans, A. Legay.
  
  Simulation-Based Abstractions for Software Product-Line Model Checking, in: 34th International Conference on Software Engineering, ICSE 2012, Zurich, Switzerland, M. Glinz, G. Murphy, M. Pezze (editors), June 2012, p. 672-682.
  
  http://hal.inria.fr/hal-00718047
• 25M. Cordy, P. Heymans, P.-Y. Schobbens, A. Legay.
  
  Behavioural Modelling and Verification of Real-time Software Product Lines, in: 16th Software Product Line Conference, Salvador de Bahia, Brazil, ACM, September 2012.
  
  http://hal.inria.fr/hal-00718157
• 26X. Devroey, M. Cordy, G. Perrouin, E.-Y. Kang, P.-Y. Schobbens, P. Heymans, A. Legay, B. Baudry.
  
  A Vision for Behavioural Model-Driven Validation of Software Product Lines, in: International Symposium On Leveraging Applications of Formal Methods, Verification and Validation, Amirandes, Heraclion, Greece, October 2012.
  
  http://hal.inria.fr/hal-00726121
• 27X. Devroey, M. Cordy, G. Perrouin, E.-Y. Kang, P.-Y. Schobbens, P. Heymans, A. Legay, B. Baudry.
  
  Towards Behavioural Model-Driven Validation of Software Product Lines, in: 5th International Sympoisum on Leveraging Applications of Formal Methods, Héraklion, Crète, Greece, October 2012.
  
  http://hal.inria.fr/hal-00718180
• 28C. Hounkonnou, E. Fabre.
  
  Empowering self-diagnosis with self-modeling, in: Conf. on Network and System Management, CNSM'12, 2012, p. 364-370.
• 29L. Jezequel, E. Fabre.
  
  A# : a distributed version of A* for factored planning, in: IEEE Conf. on Decision and Control, CDC'12, 2012, p. 7377-7382.
• 30L. Jezequel, E. Fabre.
  
  Turbo Planning, in: Workshop on Discrete Event Systems, WODES'12, 2012.
• 31A. Kattepur, A. Benveniste, C. Jard.
  
  Negotiation Strategies for Probabilistic Contracts in Web Services Orchestrations, in: ICWS, IEEE, 2012, p. 106-113.
• 32D. Lime, O. H. Roux, C. Jard.
  
  Clock Transition Systems, in: CS&P, 2012, p. 227-238.
• 33F. Schwarzentruber, S. Vesic, T. Rienstra.
  
  Building an Epistemic Logic for Argumentation, in: JELIA, L. F. del Cerro, A. Herzig, J. Mengin (editors), Lecture Notes in Computer Science, Springer, 2012, vol. 7519, p. 359-371.

Scientific Books (or Scientific Book chapters)

• 34L. F. del Cerro, A. Herzig, J. Mengin (editors)
  
  Logics in Artificial Intelligence - 13th European Conference, JELIA 2012, Toulouse, France, September 26-28, 2012. Proceedings, Lecture Notes in Computer Science, Springer, 2012, vol. 7519.
• 35C. Seatzu, M. Silva, J. H. van Schuppen (editors)
  
  Control of discrete-event systems – Automata and Petri net perspectives, Lecture Notes in Control and Information Sciences, Springer Verlag London Ltd., London, 2013, n^o 433, 479 p, DISC Project, DISC Ph.D. School 2011. [ DOI : DOI 10.1007/978-1-4471-4276-8 ]
  
  http://link.springer.com/book/10.1007/978-1-4471-4276-8
• 36G. Aucher.
  
  Principles of Knowledge, Belief and Conditional belief, in: Dialogue, Rationality, Formalism., G. Heinzmann, M. Musiol, M. Rebuschi, A. Trognon (editors), Logic, Epistemology and the Unity of Science, Springer, 2012, to appear.

Internal Reports

• 37G. Aucher, B. Maubert, F. Schwarzentruber.
  
  Generalized DEL-sequents, Inria, July 2012, n^o RR-8012, 23 p.
  
  http://hal.inria.fr/hal-00716074
• 38G. Aucher, F. Schwarzentruber.
  
  On the Complexity of Dynamic Epistemic Logic (Extended Version), Inria, November 2012, n^o RR-8164, 27 p.
  
  http://hal.inria.fr/hal-00759544
• 39L. Jezequel, E. Fabre.
  
  A-sharp: a Distributed A-star for Factored Planning, Inria, March 2012, n^o RR-7927.
  
  http://hal.inria.fr/hal-00687434
• 40A. Junier, A. Bouillard, R. Benoit.
  
  Hidden Anomaly Detection in Telecommunication Networks, Inria, October 2012, n^o RR-7979.
  
  http://hal.inria.fr/hal-00702587
• 41D. Lime, O. H. Roux, C. Jard.
  
  Clock Transition Systems, August 2012.
  
  http://hal.inria.fr/hal-00725792

• 42S. Abiteboul, L. Segoufin, V. Vianu.
  
  Static analysis of active XML systems, in: ACM Trans. Database Syst., 2009, vol. 34, n^o 4.
• 43T. Andrew, F. Curbera, H. Y. Goland, J. Klein, F. Leymann, K. Liu, D. Roller, D. Smith, S. Thatte, I. Trickovic, S. Weerawarana.
  
  Business Process Execution Language for Web Services. [BPEL4WS.], version 1.1., May 2003.
  
  http://xml.coverpages.org/BPELv11-May052003Final.pdf
• 44M. 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.
• 45C. Cassandras, S. Lafortune.
  
  Introduction to discrete event systems, Kluwer Academic Publishers, 1999.
• 46R. 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.
• 47E. Fabre, L. Jézéquel.
  
  Distributed Optimal Planning: an Approach by Weighted Automata Calculus, in: Conference on Detection and Control (CDC), 2009.
• 48R. Fagin, J. Halpern, Y. Moses, M. Vardi.
  
  Reasoning about knowledge, MIT Press, 1995.
• 49P. Gastin, K. Narayan. Kumar, M. Mukund.
  
  Reachability and boundedness in time-constrained MSC graphs, in: Perspectives in Concurrency Theory, festchrift for P.S. Thiagarajan, 2008.
• 50J. Halpern, Y. Moses.
  
  Knowledge and common knowledge in a distributed environment, in: Journal of the ACM, 1990, vol. 37, n^o 3, p. 549–587.
• 51L. Hélouët, C. Jard.
  
  Conditions for synthesis of communicating automata from HMSCs, in: 5th International Workshop on Formal Methods for Industrial Critical Systems (FMICS), 2000.
• 52 ITU-TS.
  
  ITU-TS Recommendation Z.120: Message Sequence Chart (MSC), ITU-TS, Geneva, September 1999.
• 53L. Jezequel, E. Fabre, P. Haslum, S. Thiebaux.
  
  Cost-Optimal Factored Planning: Promises and Pitfalls, in: ICAPS, Int. Conf. on Applications of Planning and Scheduling, May 2010.
• 54J.-J. C. Meyer, W. van der Hoek.
  
  Epistemic Logic for AI and Computer Science, Cambridge University Press, Cambridge, 1995.
• 55J. Misra.
  
  A Programming Model for the Orchestration of Web Services, in: SEFM, IEEE Computer Society, 2004, p. 2-11.
• 56M. Nielsen, G. Plotkin, G. Winskel.
  
  Petri nets, event structures and domains, part 1, in: Theoretical Computer Science, 1981.
• 57 Object Management Group.
  
  Unified Modeling Language Specification version 2.0: Superstructure, OMG, 2003, n^o pct/03-08-02.
• 58W. Reisig.
  
  Petri nets, Springer Verlag, 1985.
• 59M. 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.
• 60M. Reniers.
  
  Message Sequence Charts: Syntax and Semantics, Eindhoven University of Technology, 1998.
• 61E. Rudolph, P. Graubman, J. Grabowski.
  
  Tutorial On Message Sequence Charts, in: Computer Networks and ISDN Systems, 1996, vol. 28, p. 1629-1641.
• 62G. Winskel.
  
  Event structures semantics in CCS and related languages, in: Lecture Notes in Computer Science, Springer Verlag, 1982, vol. 140.
• 63G. Winskel.
  
  Categories of Models for Concurrency, in: Seminar on Concurrency, Lecture Notes in Computer Science, Springer, 1985, vol. 197, p. 246-267.
• 64J. van Benthem, J. Gerbrandy, E. Pacuit.
  
  Merging Frameworks for Interaction: DEL and ETL, in: Theoretical Aspect of Rationality and Knowledge (TARK XI), Brussels, D. Samet (editor), June 2007, p. 72–82.