Academic Journals

2012

1. Albert Benveniste, Timothy Bourke, Benoît Caillaud, Marc Pouzet. Non-Standard Semantics of Hybrid Systems Modelers. Journal of Computer and System Sciences (JCSS), 78(3):877-910, 2012.

2011

1. Eric Badouel, Bernard Fotsing, Rodrigue Tchougong. Attribute Grammars as Recursion Schemes over Cyclic Representations of Zippers. Electr. Notes Theor. Comput. Sci, 229(5):39-56, 2011.
2. Nathalie Bertrand, Axel Legay, Sophie Pinchinat, Jean-Baptiste Raclet. Modal event-clock specifications for timed component-based design. Science of Computer Programming, 2011.
3. Eike Best, Philippe Darondeau. Separability in Persistent Petri Nets. Fundamenta Informaticae, 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. 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.
7. 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.
8. Laurie Ricker, Benoît Caillaud. Mind the gap: Expanding communication options in decentralized discrete-event control. Automatica, 47(11):2364-2372, 2011.

2010

1. Philippe Darondeau, Blaise Genest, P.S. Thiagarajan, Shaofa Yang. Quasi-static scheduling of communicating tasks. Information and Computation, 208(10):1154-1168, 2010. download download
2. Philippe Darondeau, Blaise Genest, P.S. Thiagarajan, Shaofa Yang. Quasi-static scheduling of communicating tasks. Information and Computation, 208(10):1154-1168, 2010.
3. E. M. Clarke, A. Donzé, A. Legay. On Simulation-Based Probabilistic Model Checking of Mixed-Analog Circuits. Formal Methods in System Design, (0):97-113, 2010.
4. Jeremy Dubreil, Philippe Darondeau, Herve Marchand. Supervisory Control for Opacity. IEEE Transactions on Automatic Control, 55(5):1089-1100, May 2010.
5. J. Dubreil, Ph. Darondeau, H. Marchand. Supervisory Control for Opacity. IEEE Transactions on Automatic Control, 55(5):1089-1100, May 2010.

2009

1. Eike Best, Philippe Darondeau. A decomposition theorem for finite persistent transition systems. Acta Informatica, 46:237-254, 2009.
2. François Cantin, Axel Legay, Pierre Wolper. Computing Convex hulls by automata iteration. International Journal of Foundations of Computer Science, 20(4):647-667, 2009.
3. Krishnendu Chatterjee, Luca de Alfaro, Marco Faella, Axel Legay. Qualitative Logics and Equivalences for Probabilistic Systems. Logical Methods in Computer Science, 2009.
4. Philippe Darondeau, Maciej Koutny, Marta Pietkiewicz-Koutny, Alex Yakovlev. Synthesis of Nets with Step Firing Policies. Fundamenta Informaticae, 94(3):275-474, 2009.
5. E. M. Clarke, Alexandre Donzé, Axel Legay. On Simulation-Based Probabilistic Model Checking of Mixed-Analog Circuits. Formal Methods in System Design, 2009.

2008

1. Eric Badouel, Maurice TchoupéYahya Slimani. Projections et cohérence de vues dans les grammaires algébriques. Revue ARIMA, 8, 2008. download
2. Albert Benveniste, Benoît Caillaud, Luca Carloni, Paul Caspi, Alberto Sangiovanni-Vincentelli. Composing Heterogeneous Reactive Systems. ACM Transactions on Embedded Computing Systems (TECS), 7(4), 2008. download

2007

1. Eric Badouel, Jules Chenou, Gurvan Guillou. An axiomatization of the token game based on Petri algebras. Fundamenta Informaticae, 77(3):187-215, 2007.
2. Eric Badouel, Maurice TchoupéYahya Slimani. Projections et cohérence de vues dans les grammaires algébriques. Revue ARIMA, 2007. download
3. Eike Best, Philippe Darondeau, Harro Wimmel. Making Petri Nets Safe and Free of Internal Transitions. Fundamenta Informaticae, 80(1):75-90, 2007.
4. Guillaume Feuillade, Sophie Pinchinat. Modal Specifications for the Control Theory of Discrete-Event Systems. Discrete Event Dynamic Systems, 17(2):211-232, 2007.
5. Dumitru Potop-Butucaru, Benoît Caillaud. Correct-by-Construction Asynchronous Implementation of Modular Synchronous Specifications. Fundamenta Informaticae, 78(1):131-159, 2007. download
6. Eric Badouel, Marek A. Bednarczyk, Andrzej Borzyszkowski, Benoît Caillaud, Philippe Darondeau. Concurrent Secrets. Discrete Event Dynamic Systems, 17(4):425-446, December 2007.

2006

1. Eric Badouel, Jules Chenou, Goulven Guillou. An axiomatization of the token game based on Petri algebras. Fundamenta Informaticae, 76:1-30, 2006.
2. Dumitru Potop-Butucaru, Benoît Caillaud, Albert Benveniste. Concurrency in Synchronous Systems. Formal Methods in System Design, 28(2), March 2006.

2005

1. Andrzej Borzyszkowski, Philippe Darondeau. Transition systems without transitions. Theoretical Computer Science, 338:1-16, 2005.
2. Philippe 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. Guillaume Feuillade, Sophie Pinchinat. Spécifications modales de réseaux de Petri. Journal Européen des Systèmes Automatisés, 39(1), October 2005.
4. Sophie Pinchinat, Stéphane Riedweg. A Decidable Class of Problems for Control under Partial Observation. Information Processing Letters, 95(4):454-465, August 2005.

2004

1. Eric Badouel, Philippe Darondeau. The synthesis of Petri nets from path-automatic specifications. Information and Computation, 193:117-135, 2004.
2. Guillaume Feuillade, Thomas Genet, Valérie Viet Triem Tong. Reachability Analysis over Term Rewriting Systems. Journal of Automated Reasoning, 2004.

2003

1. Albert Benveniste, Paul Caspi, Stephen Edwards, Nicolas Halbwachs, Paul Le Guernic, Robert de Simone. The Synchronous Languages Twelve Years Later. Proceedings of the IEEE, 91(1):64-83, 2003.
2. Philippe Darondeau, Xiaolan Xie. Linear Control of Live Marked Graphs. Automatica, 39(3):429-440, 2003.

2002

1. Eric Badouel, Benoît Caillaud, Philippe Darondeau. Distributing Finite Automata through Petri Net Synthesis. Journal on Formal Aspects of Computing, 13:447-470, 2002.
2. Loïc Hélouët, Claude Jard, Benoît Caillaud. An Event Structure Semantics for Message Sequence Chart. Mathematical Structures in Computer Science, 12:377-403, 2002.

2001

1. Philippe Darondeau. On the Petri net realization of context-free graphs. Theoretical Computer Science, 258(1):573-598, 2001.

2000

1. Albert Benveniste, Benoît Caillaud, Paul Le Guernic. Compositionality in dataflow synchronous languages: specification and distributed code generation. Information and Computation, 163:125-171, 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. Benoît Caillaud. Bounded Petri-net synthesis techniques and their applications to the distribution of reactive automata. JESA, European Journal on Automated Systems, 33(8):925-942, 1999.

1998

1. Albert Benveniste. Compositional and Uniform Modelling of Hybrid Systems. IEEE Transactions on Automatic Control, 43(4), April 1998.

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.