Academic Journals

2012

1. Lo\"\ig Jezequel, Eric Fabre. On the construction of probabilistic diagnosers for modular systems. Journal of Discrete Events Dynamical Systems, 2012.

2011

1. Guillaume Aucher, Guido Boella, Leendert van der Torre. A dynamic logic for privacy compliance. Journal of artificial intelligence and law, 19(2), 2011.
2. Guillaume Aucher. DEL-Sequents for regression and epistemic planning. Journal of Applied Non-Classical Logics, 2011.
3. Guillaume Aucher. DEL-Sequents for progression. Journal of Applied Non-Classical Logics, 2011.
4. Laura Bozzelli, Axel Legay, Sophie Pinchinat. Hardness of preorder checking for basic formalisms. Theor. Comput. Sci, 412(49):6795-6808, 2011.
5. Benoît Caillaud, Benoît Delahaye, Kim G. Larsen, Axel Legay, Mikkel L. Pedersen, Andrzej Wasowski. Constraint Markov Chains. Theor. Comput. Sci, 412(34):4373-4404, 2011.
6. Alexandre David, Kim G. Larsen, Axel Legay, Marius Mikucionis, Danny B\ogsted Poulsen, Jonas van Vliet, Zheng Wang. Stochastic Semantics and Statistical Model Checking for Networks of Priced Timed Automata. CoRR, (0), 2011.
7. Benoît Delahaye, Benoît Caillaud, Axel Legay. Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects. Formal Methods in System Design, 38(1):1-32, 2011.
8. Thomas Gazagnaire, Blaise Genest, Loïc Hélouët, Hervé Marchand. Diagnosis from Scenarios and Applications. Journal of Discrete Events and Dynamic Systems, 2011.
9. Jean-Baptiste Raclet, Eric Badouel, Albert Benveniste, Benoît Caillaud, Axel Legay, Roberto Passerone. A Modal Interface Theory for Component-based Design. Fundam. Inform, 108(1):119-149, 2011.

2010

1. Philippe Darondeau, Blaise Genest, P. S. Thiagarajan, Shaofa Yang. Quasi-static scheduling of communicating tasks. Inf. Comput, 208(10):1154-1168, 2010.
2. Edith Elkind, Blaise Genest, Doron Peled, Paola Spoletini. Quantifying the Discord: Order Discrepancies in Message Sequence Charts (Special Issue of ATVA'07). International Journal of Foundations of Computer Sciecnce (IJFCS), 21(2):211-233, 2010.
3. Vojtech Reh\'ak, Petr Slov\'ak, Jan Strejcek, Loïc Hélouët. Decidable Race Condition and Open Coregions in HMSC. ECEASST, 29, 2010.
4. Sidney Rosario, Albert Benveniste, Claude Jard. Flexible Probabilistic QoS Management of Orchestrations. International Journal of Web Services Research, 2, 2010.
5. Sidney Rosario, Albert Benveniste, Claude Jard. Flexible Probabilistic QoS Management of Orchestrations. Int. J. Web Service Res, 7(2):21-42, 2010.

2009

1. Dragan Bosnacki, Edith Elkind, Blaise Genest, Doron Peled. On Commutativity Based Edge Lean Search. Special issue of BISFAI 2007, Annals of Mathematic and Artificial Intelligence (AMAI), in press(0):0-0, 2009.
2. Philippe Darondeau, Blaise Genest, P.S. Thiagarajan, Shaofa Yang. Quasi-Static Scheduling of Communicating Tasks. Special issue of CONCUR 2008 accepted to Information and Computation, in press(0):0-0, 2009.
3. Edith Elkind, Blaise Genest, Doron Peled, Paola Spoletini. Quantifying the Discord: Order Discrepancies in Message Sequence Charts. Special Issue of ATVA'07, International Journal of Foundations of Computer Sciecnce (IJFCS), in press(0):0-0, 2009.
4. Thomas Gazagnaire, Blaise Genest, Loïc Hélouët, P.S. Thiagarajan, Shaofa Yang. Causal Message Sequence Charts. Theoretical Computer Science (TCS), 410(41):4094-4110, 2009.
5. Agnes Madalinski, Eric Fabre. Modular Construction of Finite and Complete Prefixes of Petri Net Unfoldings. Fundamenta Informaticae, 95, 2009.

2008

1. Samy Abbes, Albert Benveniste. True-concurrency probabilistic models: Markov nets and a law of large numbers. Theoretical Computer Science, 390(2):129-170, 2008.
2. Anne Bouillard, Bruno Gaujal. Backward Coupling in Bounded Free-Choice Nets Under Markovian and Non-Markovian Assumptions. Journal of Discrete Event Dynamamic Systems (JDEDS), 18(4):473-498, 2008.
3. Anne Bouillard, Bruno Gaujal, Sébastien Lagrange, Éric Thierry. Optimal routing for end-to-end guarantees using Network Calculus. Performance Evaluation, 65(11):883-906, 2008.
4. Anne Bouillard, Éric Thierry. An Algorithmic Toolbox for Network Calculus. Journal of Discrete Event Dynamic Systems (JDEDS), 18(1):3-49, 2008.
5. Blaise Genest, Anca Muscholl. Pattern Matching and Membership for Hierarchical Message Sequence Charts. Theory of Computing Systems (TOCS), 42(4):536-567, 2008.
6. Shaofa Yang, Loïc Hélouët, Thomas Gazagnaire. Logic-based diagnosis for distributed systems. Perspectives in concurrency, P.S. Thiagarajan's Festchrift, 2008.
7. Helia Pouyllau, Stefan Haar. Distributed Busacker-Gowen algorithm for end-to-end QoS pipe negotiation in X-domain networks. Annals of Telecommunications, pages 0-0, October 2008.

2007

1. S. Abbes, A. Benveniste. Probabilistic true-concurrency models: Markov nets and a law of large numbers. TCS special issue: FOSSACS 2005, 2007.
2. A. Bouillard, E. Thierry. An Algorithmic Toolbox for Network Calculus. Journal of Discrete Event Dynamical Systems, 18(1), 2007.
3. Eric Fabre. Trellis Processes: a Compact Representation for Runs of Concurrent Systems. Journal of Discrete Event Dynamical Systems, 17(3):267-306, 2007.
4. Eric Fabre, Albert Benveniste. Partial Order Techniques for Distributed Discrete Event Systems: why you can't avoid using them. Journal of Discrete Events Dynamical Systems, 2007.
5. Blaise Genest,,Dietrich Kuske, Anca Muscholl. On Communicating Automata with Bounded Channels. Fundamenta Informaticae, IOS Press, 80:1-21, 2007.
6. S. Pickin, C. Jard, T. Jéron, J.-M. Jézéquel, Y. Le Traon. Test Synthesis form UML Models of Distributed Software. IEEE Transactions on Software Engineering, 33(4):252-268, April 2007.

2006

1. Blaise Genest,,Dietrich Kuske, Anca Muscholl. A Kleene Theorem and Model Checking for a Class of Communicating Automata. Information and Computation, 204(6):920-956, 2006.
2. Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun. Infinite-State High-Level MSCs: Model-Checking and Realizability. J. Computer and System Science JCSS, 72(4):617-647, 2006.
3. A. Bouillard, B. Gaujal, J. Mairesse. Extremal throughputs in free-choice nets. Journal of Discrete Event Dynamic Systems, 16(3):327-352, September 2006.
4. Samy Abbes, Albert Benveniste. True-concurrency Probabilistic Models: Branching cells and Distributed Probabilities for Event Structures. Information and Computation, 204(2):231-274, 2006.

2005

1. C. Jard, T. Chatain, P. Bourhis. Diagnostic temporel dans les systèmes répartis à l'aide de dépliages de réseaux de Petri temporels. Journal européen des systèmes automatisés (JESA), 1-2-3:351-366, 2005.
2. E. Fabre, A. Benveniste, S. Haar, C. Jard. Distributed Monitoring of Concurrent and Asynchronous Systems. Journal of Discrete Event Systems, special issue, pages 33-84, May 2005.

2004

1. A. Bouillard, J. Mairesse. Möbius inversion formula for the trace group. C. R. Acad. Sci. Paris, Ser I, 339:899-904, 2004.
2. C. Jard, T. Jéron. TGV: theory, principles and algorithms. A tool for the automatic synthesis of conformance test cases for non-deterministic reactive systems. Software Tools for Technology Transfer, 2004.

2003

1. B. Gaujal, S. Haar, J. Mairesse. Blocking a Transition in a Free Choice Net, and what it tells about its throughput. Journal of Computer and System Sciences, 66(3):515-548, 2003.
2. A. Benveniste, E. Fabre, S. Haar. Markov Nets: Probabilistic Models for distributed and concurrent systems. IEEE Transactions on Automatic Control, 48(11):1936-1950, November 2003.
3. A. Benveniste, E. Fabre, C. Jard, S. Haar. Diagnosis of asynchronous discrete event systems, a net unfolding approach. IEEE Transactions on Automatic Control, 48(5):714-727, May 2003.

2002

1. Loïc Hélouët. Distributed system requirements modeling with Message Sequence Charts. International Journal of Information and Software Technology, 2002.
2. Loïc Hélouët, Claude Jard, Benoît Caillaud. An Event Structure Semantics for Message Sequence Charts. Mathematical Structures in Computer Science (MSCS) journal, 12(4):377-403, 2002.
3. C. JardR. Dssouli, F. Khendec. Synthesis of distributed testers from true-concurrency models of reactive systems. International Journal of Information and Software Technology, 2002.
4. S. Haar. Probabilistic Cluster Unfoldings. Fundamenta Informaticae, 53(3):281-314, December 2002.

2001

1. A. Guyader, E. Fabre, C. Guillemot, M. Robert. Joint source-channel turbo decoding of entropy-coded sources. IEEE Journal on Selected Areas in Communications, SAC-19(9):1680-1696, September 2001.
2. S. Haar. Clusters, Confusion and Unfoldings. Fundamenta Informaticae, 47(3):259-270, September 2001.

2000

1. M. Bozga, JC Fernandez, L. Ghirvu, C. Jard, T. and Kerbrat,A. Jeron, P. Morel, L. Mounier. Verification and Test Generation for the SSCOP Protocol. Journal of Science of Computer Programming, Special Issue on The Application of Formal Methods in Industrial Critical Systems, 36:27-52, 2000.
2. C. Jard, T. Jeron. An Educational Case Study in Protocol Verification and Distributed Observation. Journal of Computer Science Education, ECASP Special Issue, 10(3), 2000.
3. Stefan Haar. Occurrence Net Logics. Fundamenta Informaticae, 43:105-127, August 2000.

1999

1. C. Jard et JC. Fernandez T. Jeron. Generation automatique de tests pour les protocoles : l'exemple de l'approche formelle de TGV. Revue Electronique et Electricite, 1999.

1998

1. A. Aghasaryan, E. Fabre, A. Benveniste, R. Boubour, C. Jard. Fault detection and diagnosis in distributed systems: an approach by partially stochastic Petri Nets. Journal of Discrete Event Dynamical Systems, 8(2):203-231, June 1998.

1997

1. B. Caillaud, P. Caspi, A. Girault, C. Jard. Distributing Automata for Asynchronous Networks of Processors. European Journal on Automated Systems, 31(3):503-524, 1997.
2. JC Fernandez, C. Jard, T. Jéron, C. Viho. An Experiment in Automatic Generation of Test Suites for Protocols with Verification Technology. Science of Computer Programming, special issue on industrially relevant applications of formal analysis techniques, 1997.
3. C. Jard. Observation d'executions reparties, detection de proprietes d'ordonnancement. Technique et Science Informatiques, 16(2):225-242, 1997.

1996

1. C. Jard, JM Jezequel. Building a Global Clock for Observing Computations in Distributed Memory Parallel Computers. Concurrency Practice and Experience, 1(8):71-89, 1996.
2. C. Jard, GV Jourdan. Incremental Transitive Dependency Tracking in Distributed Computations. Parallel Processing Letters, 6(2):427-435, 1996.
3. E. Fabre. New Fast Smoothers for Multiscale Systems. ieee-sp, 44(8):1893-1911, August 1996.

1995

1. A. Benveniste, B.C. Levy, E. Fabre, P. Le Guernic. A Calculus of Stochastic Systems for the Specification, Simulation, and Hidden State Estimation of Mixed Stochastic/NonStochastic Systems. Theoretical Computer Science, 152:171-217, 1995.
2. E. Fromentin, C. Jard, GV Jourdan, M. Raynal. On-the-fly Analysis of Distributed Computations. Information Processing Letters, 54:267-274, 1995.
3. C. Jard, GV Jourdan, JX Rampon. On-line Computations of the Ideal Lattice of Posets. RAIRO ITA, Theoretical Informatics and Applications, 29(3):227-244, 1995.

1994

1. GV Jourdan, JX Rampon, C. Jard. Computing On-line the Lattice of Maximal Antichains of Posets. Order, 11:197-210, December 1994.

1992

1. C. Diehl, C. Jard. L'observation des executions reparties, Datation par intervalles. Revue Reseaux et Informatique Repartie, 1(4), 1992.

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.This page is automatically generated by bib2html v210, © INRIA 2002-2006, Projet Lagadic