• Home
• People
• Publications

Academic Journals

2023

1. Nathalie Bertrand, Hugo Francon, Nicolas Markey. Synchronizing words under LTL constraints. Information Processing Letters, 182, August 2023.
2. Patricia Bouyer, Orna Kupferman, Nicolas Markey, Bastien Maubert, Aniello Murano, Giuseppe Perelli. Reasoning about Quality and Fuzziness of Strategic Behaviors. ACM Transactions on Computational Logic, 24(3):1-38, July 2023.
3. Rômulo Meira-Góes, Hervé Marchand, Stéphane Lafortune. Dealing with sensor and actuator deception attacks in supervisory control. Automatica, 147, January 2023.
4. Arthur Queffelec, Ocan Sankur, Francois Schwarzentruber. Complexity of planning for connected agents in a partially known environment. Theoretical Computer Science, 941:202-220, January 2023.

2022

1. L. Hélouet, N. Markey, R. Raha. Reachability games with relaxed energy constraints. Information and Computation, 285B, May 2022.
2. L. Henry, T. Jéron, N. Markey. Control strategies for off-line testing of timed systems. Formal Methods in System Design, April 2022.
3. M. L. Tessitore, M. Sama, A. D'Ariano, L. Hélouet, D. Pacciarelli. A Simulation-Optimization Framework for Traffic Disturbance Recovery in Metro Systems. Transportation research. Part C, Emerging technologies, 136:1-23, March 2022.

2021

1. Romulo Meira-Goes, Stephane Lafortune, Hervé Marchand. Synthesis of Supervisors Robust Against Sensor Deception Attacks. IEEE Transactions on Automatic Control, 2021.
2. N. Bertrand, I. Konnov, M. Lazic, J. Widder. Verification of Randomized Consensus Algorithms under Round-Rigid Adversaries. International Journal on Software Tools for Technology Transfer, 23:797-821, October 2021.
3. R. Singh, L. Hélouet, Z. Miklos. Reducing the Cost of Aggregation in Crowdsourcing. Transactions on Large-Scale Data- and Knowledge-Centered Systems, pages 1-38, October 2021.
4. Sihem Cherrared, Sofiane Imadali, Eric Fabre, Gregor Gössler. SFC Self-Modeling and Active Diagnosis. IEEE Transactions on Network and Service Management, 18(3):2515-2530, September 2021.
5. P. Bouyer, L. Henry, S. Jaziri, Th. Jéron, N. Markey. Diagnosing timed automata using timed markings. International Journal on Software Tools for Technology Transfer, 23(2):229-253, April 2021.
6. Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar. Reconfiguration and Message Losses in Parameterized Broadcast Networks. Logical Methods in Computer Science, 17(1):1-18, March 2021.
7. Giovanni Bacci, Patricia Bouyer, Uli Fahrenberg, Kim Larsen, Nicolas Markey, Pierre-Alain Reynier. Optimal and robust controller synthesis using energy timed automata with uncertainty. Formal Aspects of Computing, 33(1):3-25, January 2021.

2020

1. Matthieu Pichené, Sucheendra K. Palaniappan, Eric Fabre, Blaise Genest. Modeling Variability in Populations of Cells using Approximated Multivariate Distributions. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 17(5):1691-1702, 2020.
2. Nathalie Bertrand, Serge Haddad, Engel Lefaucheux. Diagnosis and Degradation Control for Probabilistic Systems. Discrete Event Dynamic Systems, 30(4):695-723, December 2020.
3. E. Badouel, Rodrigue A. Djeumen D.. A Calculus of Interfaces for Distributed Collaborative Systems: The Guarded Attribute Grammar Approach. Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées, Volume 31 - 2019 - CARI 2018, October 2020.
4. Olivier Beaumont, Thomas Lambert, Loris Marchal, Bastien Thomas. Performance Analysis and Optimality Results for Data-Locality Aware Tasks Scheduling with Replicated Inputs. Future Generation Computer Systems, 111:582-598, October 2020.
5. Tristan Charrier, Arthur Queffelec, Ocan Sankur, Francois Schwarzentruber. Complexity of planning for connected agents. Autonomous Agents and Multi-Agent Systems, 34(2), October 2020.
6. Sundararaman Akshay, Lo\"ic Hélou\"et, Ramchandra Phawade. Combining Free choice and Time in Petri Nets. Journal of Logical and Algebraic Methods in Programming, pages 1-36, May 2020.
7. P. Gardy, P. Bouyer, N. Markey. Dependences in Strategy Logic. Theory of Computing Systems, 64(3):467-507, April 2020.
8. G. Michele Pinna, Éric Fabre. Spreading nets: a uniform approach to unfoldings. Journal of Logical and Algebraic Methods in Programming, 112, April 2020.
9. Nathalie Bertrand. Model checking randomized distributed algorithms. ACM SIGLOG News, 7(1):35-45, February 2020.
10. E. André, D. Lime, N. Markey. Language Preservation Problems in Parametric Timed Automata. Logical Methods in Computer Science, Extended version of the paper of the name published in the proceedings of FORMATS 2015, 16(1), January 2020.

2019

1. N. Bertrand, M. Dewaskar, B. Genest, H. Gimbert, A. Godbole. Controlling a population. Logical Methods in Computer Science, 15(3):1-30, 2019.
2. N. Bertrand, S. Haddad, E. Lefaucheux. A Tale of Two Diagnoses in Probabilistic Systems. Journal of Information and Computation, 269:1-33, December 2019.
3. S. Cherrared, S. Imadali, E. Fabre, G. Gössler, I. Yahia. A Survey of Fault Management in Network Virtualization Environments: Challenges and Solutions. IEEE Transactions on Network and Service Management, pages 1-15, October 2019.
4. M. Renard, Y. Falcone, A. Rollet, T. Jéron, H. Marchand. Optimal Enforcement of (Timed) Properties with Uncontrollable Events. Mathematical Structures in Computer Science, 51(1), May 2019.

2018

1. N. Bertrand, P. Bouyer, T. Brihaye, P. Carlier. When are stochastic transition systems tameable?. Journal of Logical and Algebraic Methods in Programming, 99:41-96, 2018.
2. A. Le Coent, L. Fribourg, N. Markey, F. De Vuyst, L. Chamoin. Compositional synthesis of state-dependent switching control. Theoretical Computer Science, 750:53-68, November 2018.
3. E. Fabre, L. Hélouet, E. Lefaucheux, H. Marchand. Diagnosability of Repairable Faults. Discrete Event Dynamic Systems, 28(2):183-213, June 2018.
4. L. Hélouet, K. Kecir. Realizability of schedules by stochastic time Petri nets with blocking semantics. Science of Computer Programming, 157:71-102, June 2018.
5. P. Bouyer, N. Markey, M. Randour, K. Larsen, S. Laursen. Average-energy games. Acta Informatica, 55(2):91-127, March 2018.

2017

1. B. Bérard, L. Hélouet, J. Mullins. Non-interference in partial order models. ACM Transactions on Embedded Computing Systems (TECS), 16(2), 2017.
2. S. Pinisetty, T. Jéron, S. Tripakis, Y. Falcone, H. Marchand, V. Preoteasa. Predictive Runtime Verification of Timed Properties. Journal of Systems and Software, 132:353-365, October 2017.
3. A. Bohy, V. Bruyère, J-F Raskin, N Bertrand. Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes. Acta Informatica, 54(6):545-587, September 2017.
4. Srinivas Pinisetty, Viorel Preoteasa, Stavros Tripakis, Thierry Jéron, Yliès Falcone, Hervé Marchand. Predictive runtime enforcement. Formal Methods in System Design, 51(1):154-199, August 2017.
5. E. Badouel, U. Schlachter. Incremental Process Discovery using Petri Net Synthesis. Fundamenta Informaticae, 154(1):1-13, June 2017.
6. S. Palaniappan, F. Bertaux, M. Pichené, E. Fabre, G. Batt, B. Genest. Abstracting the dynamics of biological pathways using information theory: a case study of apoptosis pathway. Bioinformatics, 33(13):1980-1986, February 2017.

2016

1. S Akshay, L. Helouet, C. Jard, P-A. Reynier. Robustness of Time Petri Nets under Guard Enlargement. Fundamenta Informaticae, 143, 2016.
2. R. Brenguier, JF. Raskin, O. Sankur. Assume-admissible synthesis. Acta Informatica, 2016. download
3. Y. Falcone, T. Jeron, H. Marchand, S. Pinisetty. Runtime enforcement of regular timed properties by suppressing and delaying events. Science of Computer Programming, 123:2-41, 2016.
4. N. Berthier, E. Rutten, N. De Palma, S. Gueye. Designing Autonomic Management Systems by using Reactive Control Techniques. IEEE Transactions on Software Engineering, 42(7), July 2016.
5. S. Jacobs, R. Bloem, R. Brenguier, R. Ehlers, T. Hell, R. Konighofer, G. A. Pérez, J-F Raskin, L. Ryzhyk, O. Sankur, M. Seidl, L. Tentrup, A. Walker. The first reactive synthesis competition (SYNTCOMP 2014). International Journal on Software Tools for Technology Transfer, April 2016.

2015

1. M. Agrawal, S. Akshay, B. Genest, P.S. Thiagarajan. Approximate Verification of the Symbolic Dynamics of Markov Chains. Journal of the ACM (JACM), 62(1):34-65, 2015. download
2. P. Bouyer, N. Markey, O. Sankur. Robust Reachability in Timed Automata: Game-Based Approach. Journal of Theoretical Computer Science (TCS), 563:43-74, 2015.
3. E. Badouel, L. Hélouet, G-E. Kouamou, C. Morvan, R. Nsaibirni. Active Workspaces: Distributed Collaborative Systems based on Guarded Attribute Grammars. ACM SIGAPP Applied Computing Review (ACM Digital Library), 15(3), September 2015. download
4. L. Jezequel, E. Fabre. Factored Cost-Optimal Planning Using Message Passing Algorithms. Fundamenta Informaticae, 139(4), July 2015.
5. L. Jezequel, E. Fabre, V. Khomenko. Factored Planning: From Automata to Petri Nets. ACM Transactions in Embedded Computing Systems, 14(2), March 2015.
6. N. Bertrand, A. Stainer, T. Jéron, M. Krichen. A game approach to determinize timed automata. Formal Methods in System Design, February 2015. download

2014

1. D. Biswas, B. Genest. Minimal Observability and Privacy Preserving Compensation for Transactional Services. Discrete Event Dynamic Systems, 24(4):611-646, 2014.
2. S. Chédor, Ch. Morvan, S. Pinchinat, H. Marchand. Diagnosis and Opacity Problems for Infinite State Systems Modeled by Recursive Tile Systems. Discrete Event Dynamic Systems, 2014.
3. Ph. Darondeau, H. Marchand, L. Ricker. Enforcing Opacity of Regular Predicates on Modal Transition Systems. Discrete Event Dynamic Systems, 2014.
4. Y. Falcone, H. Marchand. Enforcement and Validation (at runtime) of Various Notions of Opacity. Discrete Event Dynamic Systems, 2014.
5. S. Pinisetty, Y. Falcone, T. Jéron, H. Marchand, A. Rollet, O. Nguema Timo. Runtime enforcement of timed properties revisited. Formal Methods in System Design, 45(3):381-422, 2014.
6. G. Kalyon, T. Le Gall, H. Marchand, T. Massart. Symbolic Supervisory Control of Distributed Systems with Communications. IEEE Transaction on Automatic Control, 59(2):396-408, February 2014.

2013

1. Eric Badouel, Rodrigue Tchougong, Célestin Nkuimi-Jugnia, Bernard Fotsing. Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition. Theoretical Computer Science, 480:1-25, 2013.
2. S. Chédor, T. Jéron, C. Morvan. Test Generation from Recursive Tile Systems. Journal on Software Testing, Verification & Reliability, Accepted for publication, 2013.
3. L. Hélouet, H. Marchand, B. Genest, T. Gazagnaire. Diagnosis from Scenarios, and applications. Discrete Event Dynamic Systems : Theory and Applications, (To appear), 2013.
4. D. Biswas, B. Genest. Minimal Observability and Privacy Preserving Compensation for Transactional Services.. Discrete Event Dynamic Systems, December 2013.
5. G Delaval, E. Rutten, H. Marchand. Integrating Discrete Controller Synthesis in a Reactive Programming Language Compiler. Discrete Event Dynamic Systems : Theory and Applications, 23(4):385-418, December 2013.
6. N. Bertrand, Ph. Schnoebelen. Computable fixpoints in well-structured symbolic model checking. Formal Methods in System Design, 43(2):223-267, October 2013.

2012

1. S. Akshay, B. Genest, L. Hélouet, S. Yang. Regular set of representatives for time-constrained MSC graphs. Inf. Process. Lett, 112(14):592-598, 2012.
2. A. Benveniste, T. Bourke, B. Caillaud, M. Pouzet. Non-Standard Semantics of Hybrid Systems Modelers. Journal of Computer and System Sciences (JCSS), 78(3):877-910, 2012.
3. N. Bertrand, A. Legay, S. Pinchinat, Raclet JB.. Modal event-clock specifications for timed component-based design. Science of Computer Programming, 77:1212-1234, 2012.
4. F. Cassez, J. Dubreil, H. Marchand. Synthesis of Opaque Systems with Static and Dynamic Masks. Formal Methods in System Design, 40(1):88-115, 2012.
5. Y. Falcone, J-C Fernandez, T. Jéron, H. Marchand, L. Mounier. More Testable Properties. STTT: Software Tools for Technology Transfer, (Extension of the ICTSS'10 paper), 14(2):403-437, 2012.
6. Loig Jezequel, E. Fabre. On the construction of probabilistic diagnosers for modular systems. Journal of Discrete Events Dynamical Systems, to appear, 2012.
7. G. Kalyon, T. Le Gall, H. Marchand, T. Massart. Symbolic Supervisory Control of Infinite Transition Systems under Partial Observation using Abstract Interpretation. Discrete Event Dynamic Systems : Theory and Applications, 22(2):121-161, 2012.
8. S. Palaniappan, S. Akshay, B. Liu, B. Genest, P. S. Thiagarajan. A Hybrid Factored Frontier Algorithm for Dynamic Bayesian Networks with a Biopathways Application. IEEE/ACM Trans. Comput. Biology Bioinform, 9(5):1352-1365, 2012.
9. P. Darondeau, S. Demri, R. Meyer, C. Morvan. Petri Net Reachability Graphs: Decidability Status of First Order Properties. Logical Methods in Computer Science, 8(4):1-28, October 2012.
10. N. Bertrand, T. Jéron, A. Stainer, M. Krichen. Off-line Test Selection with Test Purposes for Non-Deterministic Timed Automata. Logical Methods in Computer Science, 8(4), March 2012.
11. C. Baier, M. Grösser, N. Bertrand. Probabilistic w-automata. Journal of the ACM, 59(1), February 2012.

2011

1. Eric Badouel, Bernard Fotsing, Rodrigue Tchougong. Attribute Grammars as Recursion Schemes over Cyclic Representations of Zippers. Electronic Notes in Theoretical Computer Science, 229(5):39-56, 2011.
2. E. Best, P. Darondeau. Separability in Persistent Petri Nets. Fundamenta Informaticae, to appear, 2011.
3. Jean-Baptiste Raclet, Eric Badouel, Albert Benveniste, Benoît Caillaud, Axel Legay, Roberto Passerone. A Modal Interface Theory for Component-based Design. Fundamenta Informaticae, 108(1):119-149, 2011.
4. G. Kalyon, T. Le Gall, H. Marchand, T. Massart. Decentralized Control of Infinite Systems. Discrete Event Dynamic Systems : Theory and Applications, 21(3):359-393, September 2011.

2010

1. P. Darondeau, B. Genest, P.S. Thiagarajan, S. Yang. Quasi-static scheduling of communicating tasks. Information and Computation, Special Issue: 19th International Conference on Concurrency Theory (CONCUR 2008), 208(10):1154-1168, 2010. download download
2. E. Elkind, B. Genest, D. Peled, P. 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. V. Rehak, P. Slovak, J. Strejcek, L. Hélouet. Decidable Race Condition and Open Coregions in HMSC. ECEASST, 29, 2010.
4. S. Rosario, A. Benveniste, C. Jard. Flexible Probabilistic QoS Management of Orchestrations. Int. J. Web Service Res, 7(2):21-42, 2010.
5. S. Rosario, A. Benveniste, C. Jard. Flexible Probabilistic QoS Management of Orchestrations. International Journal of Web Services Research, 2, 2010.
6. J. Dubreil, Ph. Darondeau, H. Marchand. Supervisory Control for Opacity. IEEE Transactions on Automatic Control, 55(5):1089-1100, May 2010.

2009

1. E. Best, P. Darondeau. A decomposition theorem for finite persistent transition systems. Acta Informatica, 46:237-254, 2009.
2. D. Bosnacki, E. Elkind, B. Genest, D. Peled. On Commutativity Based Edge Lean Search. Special issue of BISFAI 2007, Annals of Mathematic and Artificial Intelligence (AMAI), in press(0), 2009.
3. P. Darondeau, M. Koutny, M. Pietkiewicz-Koutny, A. Yakovlev. Synthesis of Nets with Step Firing Policies. Fundamenta Informaticae, 94(3):275-474, 2009.
4. T. Gazagnaire, B. Genest, L. Hélouet, P.S. Thiagarajan, Shaofa Yang. Causal Message Sequence Charts. Theoretical Computer Science (TCS), 410(41):4094-4110, 2009.
5. Agnes Madalinski, E. Fabre. Modular Construction of Finite and Complete Prefixes of Petri Net Unfoldings. Fundamenta Informaticae, 95, 2009.
6. E. Rutten, H. Marchand. Automatic generation of safe handlers for multi-task systems. Journal of Embedded Computing, 3(4):255-276, 2009.

2008

1. S. Abbes, A. Benveniste. True-concurrency probabilistic models: Markov nets and a law of large numbers. Theoretical Computer Science, 390(2):129-170, 2008.
2. Eric Badouel, Maurice Tchoupé Tchendji. Merging Hierarchically-Structured Documents in Workflow Systems. Electronic Notes in Theoretical Computer Science, 203(5):3-24, 2008.
3. Eric Badouel, Maurice Tchoupé Tchendji. Projections et cohérence de vues dans les grammaires algébriques. Revue ARIMA, 8:18-48, 2008.
4. A. Benveniste, B. Caillaud, L. Carloni, P. Caspi, A.o Sangiovanni-Vincentelli. Composing Heterogeneous Reactive Systems. ACM Transactions on Embedded Computing Systems (TECS), 7(4), 2008. download
5. B. Genest, A. Muscholl. Pattern Matching and Membership for Hierarchical Message Sequence Charts. Theory of Computing Systems (TOCS), 42(4):536-567, 2008.
6. S. Yang, L. Hélouet, T. Gazagnaire. Logic-based diagnosis for distributed systems. Theoretical Computer Science, Special Issue for P.S. Thiagarajan's Festchrift, 2008.
7. J. Komenda, J. van Schuppen, B. Gaudin, H. Marchand. Supervisory Control of Modular Systems with Global Specification Languages. Automatica, 44(4):1127-1134, April 2008.

2007

1. S. Abbes, A. Benveniste. Probabilistic true-concurrency models: Markov nets and a law of large numbers. TCS special issue: FOSSACS 2005, to appear, 2007.
2. Eric Badouel, Marek Bednarczyk, Andrzej Borzyszkowski, Benoît Caillaud, Philippe Darondeau. Concurrent Secrets. Discrete Event Dynamic Systems, 17(4):425-446, 2007.
3. Eric Badouel, Jules Chenou, Goulven Guillou. An Axiomatization of the Token Game Based on Petri Algebras. Fundamenta Informaticae, 77(3):187-215, 2007.
4. C. Baier, N. Bertrand, Ph. Schnoebelen. Verifying nondeterministic probabilistic channel systems against omega-regular linear-time properties. ACM Transactions on Computational Logic, 9(1), 2007.
5. E. Best, P. Darondeau, H. Wimmel. Making Petri Nets Safe and Free of Internal Transitions. Fundamenta Informaticae, 80(1):75-90, 2007.
6. E. Fabre. Trellis Processes: a Compact Representation for Runs of Concurrent Systems. Journal of Discrete Event Dynamical Systems, 17(3):267-306, 2007.
7. E. Fabre, A. Benveniste. Partial Order Techniques for Distributed Discrete Event Systems: why you can't avoid using them. Journal of Discrete Events Dynamical Systems, to appear, 2007.
8. B. Gaudin, H. Marchand. An Efficient Modular Method for the Control of Concurrent Discrete Event Systems: A Language-Based Approach. Discrete Event Dynamic System, 17(2):179-209, 2007.
9. B. Genest, D. Kuske, A. Muscholl. On Communicating Automata with Bounded Channels. Fundamenta Informaticae, IOS Press, 80:1-21, 2007.
10. C. Constant, T. Jéron, H. Marchand, V. Rusu. Integrating formal verification and conformance testing for reactive systems. IEEE Transactions on Software Engineering, 33(8):558-574, August 2007.
11. S. Pickin, C. Jard, T. Jéron, J-M Jézéquel, Y. Le Traon. Test Synthesis from UML Models of Distributed Software. IEEE Transactions on Software Engineering, 33(4):252-269, April 2007.

2006

1. B. Genest, D. Kuske, A. Muscholl. A Kleene Theorem and Model Checking for a Class of Communicating Automata. Information and Computation, 204(6):920-956, 2006.
2. B. Genest, A. Muscholl, H. Seidl, M. Zeitoun. Infinite-State High-Level MSCs: Model-Checking and Realizability. J. Computer and System Science JCSS, 72(4):617-647, 2006.
3. T. Le Gall, B. Jeannet, H. Marchand. Contrôle de systèmes symboliques, discrets ou hybrides. Technique et Science Informatiques (TSI), 25(3):293-319, 2006.
4. C. Baier, N. Bertrand, Ph. Schnoebelen. A note on the attractor-property of infinite-state Markov chains. Information Processing Letters, 97(2):58-63, January 2006.
5. S. Abbes, A. Benveniste. True-concurrency Probabilistic Models: Branching cells and Distributed Probabilities for Event Structures. Information and Computation, Partial orders, scenarios, unfoldings, 204(2):231-274, 2006.

2005

1. A. Borzyszkowski, P. Darondeau. Transition systems without transitions. Theoretical Computer Science, 338:1-16, 2005.
2. P. Darondeau. Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets. Information Processing Letters, 94:241-245, 2005.
3. P.A. Abdulla, N. Bertrand, A. Rabinovich, Ph. Schnoebelen. Verification of Probabilistic Systems with Faulty Communication. Information and Computation, 202(2):141-165, November 2005. download
4. N. Bertrand, I. Charon, O. Hudry, A. Lobstein. 1-Identifying Codes on Trees. Australasian Journal of Combinatorics, 31:21-35, February 2005.
5. 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, 2005.

2004

1. Eric Badouel, Philippe Darondeau. The synthesis of Petri nets from path-automatic specifications. Information and Computation, 193(2):117-135, 2004.
2. B. Gaudin, H Marchand. Supervisory Control of Product and Hierarchical Discrete Event Systems. European Journal of Control, Special issue of European Control Conference, ECC 2003, 10(2), 2004.
3. T. Jéron, H. Marchand, V. Rusu, V. Tschaen. Ensuring the conformance of reactive discrete-event systems by means of supervisory control. International Journal of Production Research, 42(14):2809-2826, 2004.
4. 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 (STTT), 6, October 2004.

2003

1. A. Benveniste, P. Caspi, S. Edwards, N. Halbwachs, P. Le Guernic, R. de Simone. The Synchronous Languages Twelve Years Later. Proceedings of the IEEE, Special issue on modeling and design of embedded software, 91(1):64-83, 2003.
2. P. Darondeau, X. Xie. Linear Control of Live Marked Graphs. Automatica, 39(3):429-440, 2003.
3. 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.
4. 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. Eric Badouel, Benoît Caillaud, Philippe Darondeau. Distributing Finite Automata Through Petri Net Synthesis. Formal Aspects of Computing, 13(6):447-470, 2002.
2. L. Hélouet. Distributed system requirements modeling with Message Sequence Charts. International Journal of Information and Software Technology, 2002.
3. L. Hélouet, C. Jard, B. Caillaud. An Event Structure Semantics for Message Sequence Charts. Mathematical Structures in Computer Science (MSCS) journal, 12(4):377-403, 2002.
4. T. Jéron. TGV: théorie, principes et algorithmes. Techniques et Sciences Informatiques, numéro spécial Test de Logiciels, (21), 2002.
5. H. Marchand, O. Boivineau, S. Lafortune. On Optimal Control of a class of partially-Observed Discrete Event Systems. Automatica, 38(11):1935-1943, October 2002.

2001

1. P. Darondeau. On the Petri net realization of context-free graphs. Theoretical Computer Science, 258(1):573-598, 2001.
2. 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.
3. H. Marchand, E. Rutten, M. Le Borgne, M. Samaan. Formal Verification of programs specified with SIGNAL : Application to a Power Transformer Station Controller. Science of Computer Programming, 41(1):85-104, August 2001.

2000

1. A. Benveniste, B. Caillaud, Paul Le Guernic. Compositionality in dataflow synchronous languages: specification and distributed code generation. Information and Computation, 163:125-171, 2000.
2. C. Jard, T. Jéron. An educational case study in protocol verification and distributed observation. Journal of Computer Science Education, ECASP Special Issue, 10(3), 2000.
3. H Marchand, O. Boivineau, S. Lafortune. On the Synthesis of Optimal Schedulers in Discrete Event Control Problems with Multiple Goals. SIAM Journal on Control and Optimization, 39(2):512-532, 2000.
4. H. Marchand, P. Bournai, M. Le Borgne, P. Le Guernic. Synthesis of Discrete-Event Controllers based on the Signal Environment. Discrete Event Dynamic System: Theory and Applications, 10(4):325-346, October 2000.
5. H. Marchand, M. Samaan. Incremental Design of a Power Transformer Station Controller using Controller Synthesis Methodology. IEEE Transaction on Software Engineering, 26(8):729-741, August 2000.
6. S. Ramangalahy, P. Le Gall, T. Jéron. Une application de la théorie des jeux au test de conformité. Revue Electronique sur les Réseaux et l'Informatique Répartie (RERIR), 9:3-23, May 2000.
7. Y. Le Traon, T. Jéron, J.-M. Jézéquel, P. Morel. Efficient OO Integration and Regression Testing. IEEE Transactions on Reliability, 49(1):12-25, March 2000.
8. M. Bozga, J.-C. Fernandez, L. Ghirvu, C. Jard, T. Jéron, A. Kerbrat, P. Morel, L. MounierS. Gnesi, J. R. Cuellor, D. Latella. Verification and test generation for the SSCOP protocol. Journal of Science of Computer Programming, special issue on Formal Methods in Industry, 36(1):27-52, January 2000.

1999

1. Eric Badouel, Philippe Darondeau, Jean-Claude Raoult. Context-Free Event Domains are Recognizable. Information and Computation, 149(2):134-172, 1999.
2. O Roux, V. Rusu, F. Cassez. Hybrid verifications of reactive programs. Formal Aspects of Computing, 11(4):448-471, 1999.
3. T. Jéron, C. Jard, C. Viho, B. Caillaud, H. Kahlouche, P. Morel, J.-C. Fernandez, A. Kerbrat, M. Bozga. Génération automatique de tests pour les protocoles: l'exemple de l'approche formelle de TGV. Revue de l'Electricité et de l'Eléctronique (REE), 3, March 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, special issue on hybrid systems, 8(2):203-231, June 1998.
2. A. Benveniste. Compositional and Uniform Modelling of Hybrid Systems. IEEE Transactions on Automatic Control, 43(4), April 1998.
3. E. Marchand, E. Rutten, H. Marchand, F. Chaumette. Specifying and verifying active vision-based robotic systems with the Signal environment. Int. Journal of Robotics Research, 17(4):418-432, April 1998.

1997

1. Eric Badouel, Luca Bernardinello, Philippe Darondeau. The Synthesis Problem for Elementary Net Systems is NP-Complete. Theoretical Computer Science, 186(1):107-134, 1997.
2. J.-C. Fernandez, C. Jard, T. Jéron, G. Viho. An Experiment in Automatic Generation of Conformance Test Suites for Protocols with Verification Technology. Science of Computer Programming, 29:123-146, 1997. download

1996

1. E. Fabre. New Fast Smoothers for Multiscale Systems. IEEE Transactions on Signal Processing, 44(8):1893-1911, August 1996.

1995

1. Eric Badouel, Philippe Darondeau. Trace Nets and Process Automata. Acta Informatica, 32(7):647-679, 1995.
2. 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.

1994

1. O. Roux, V. Rusu. Translating from GRAFCET to the reactive language ELECTRE. Automatique, Productique et Informatique Industrielle, 28(2):131-158, 1994.

1993

1. T. Jéron, C. Jard. Testing for Unboundedness of Fifo Channels. Theoretical Computer Science, 113:93-117, 1993.

1992

1. J.-C. Fernandez, C. Jard, T. Jéron, L. Mounier. On-the-fly Verification of Finite Transition Systems. Formal Methods in System Design, 1(2):251-273, 1992.

1991

1. Eric Badouel, Philippe Darondeau. On Guarded Recursion. Theoretical Computer Science, 82(2):403-408, 1991.

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 v216, © INRIA 2002-2007, Projet Lagadic