Bibliography

Major publications by the team in recent years

1E. Badouel, M. Bednarczyk, A. Borzyszkowski, B. Caillaud, P. Darondeau.

Concurrent Secrets, in: Discrete Event Dynamic Systems, December 2007, vol. 17, n^o 4, p. 425-446.

http://dx.doi.org/10.1007/s10626-007-0020-5
2E. Badouel, M. Bednarczyk, P. Darondeau.

Generalized Automata and their Net Representations, H. Ehrig, G. Juhàs, J. Padberg, G. Rozenberg (editors), Lecture Notes in Computer Science, Springer, 2001, vol. 2128, p. 304–345.

http://link.springer.de/link/service/series/0558/bibs/2128/21280304.htm
3E. Badouel, B. Caillaud, P. Darondeau.

Distributing Finite Automata through Petri Net Synthesis, in: Journal on Formal Aspects of Computing, 2002, vol. 13, p. 447–470.

http://dx.doi.org/10.1007/s001650200022
4E. Badouel, P. Darondeau.

Theory of regions, in: Lectures on Petri Nets I: Basic Models, Lecture Notes in Computer Science, Springer, 1999, vol. 1491, p. 529–586.
5A. Benveniste, B. Caillaud, Luca P. Carloni, P. Caspi, Alberto L. Sangiovanni-Vincentelli.

Composing heterogeneous reactive systems, in: ACM Trans. Embedded Comput. Syst., 2008, vol. 7, n^o 4.

http://doi.acm.org/10.1145/1376804.1376811
6A. Benveniste, B. Caillaud, P. Le Guernic.

Compositionality in dataflow synchronous languages: specification and distributed code generation, in: Information and Computation, 2000, vol. 163, p. 125-171.
7B. Caillaud, P. Darondeau, L. Hélouët, G. Lesventes.

, HMSCs as specifications... with PN as completionsF. Cassez, C. Jard, B. Rozoy, M. Dermot (editors), Lecture Notes in Computer Science, Springer, 2001, vol. 2067, p. 125–152.

http://www.irisa.fr/s4/download/papers/hmsc2pn_movep2k_lncs.ps.gz
8G. Feuillade, S. Pinchinat.

Modal Specifications for the Control Theory of Discrete-Event Systems, in: Discrete Event Dynamic Systems, 2007, vol. 17, n^o 2, p. 211–232.

http://dx.doi.org/10.1007/s10626-006-0008-6
9D. Potop-Butucaru, B. Caillaud.

Correct-by-Construction Asynchronous Implementation of Modular Synchronous Specifications, in: Fundamenta Informaticae, 2007, vol. 78, n^o 1, p. 131–159.
10S. Riedweg, S. Pinchinat.

Quantified Mu-Calculus for Control Synthesis, in: MFCS 2003, 28th International Symposium on Mathematical Foundations of Computer Science, Lecture notes in computer science, Springer, aug 2003, vol. 2747, p. 642–651.

http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2747&spage=642

Publications of the year

Doctoral Dissertations and Habilitation Theses

11B. Caillaud.

Analysis, Control and Synthesis of Concurrent Systems, University of Rennes 1, March 2011, Habilitation Thesis.

Articles in International Peer-Reviewed Journal

12E. Badouel, B. Fotsing, R. Tchougong.

Attribute Grammars as Recursion Schemes over Cyclic Representations of Zippers, in: Electr. Notes Theor. Comput. Sci., 2011, vol. 229, n^o 5, p. 39-56.

http://dx.doi.org/10.1016/j.entcs.2011.02.015
13N. Bertrand, A. Legay, S. Pinchinat, J.-B. Raclet.

Modal event-clock specifications for timed component-based design, in: Science of Computer Programming, 2011, to appear.

http://dx.doi.org/10.1016/j.scico.2011.01.007
14E. Best, P. Darondeau.

Separability in Persistent Petri Nets, in: Fundamenta Informaticae, 2011, to appear.
15L. Bozzelli, A. Legay, S. Pinchinat.

Hardness of preorder checking for basic formalisms, in: Theor. Comput. Sci., 2011, vol. 412, n^o 49, p. 6795-6808.

http://dx.doi.org/10.1016/j.tcs.2011.08.037
16B. Caillaud, B. Delahaye, K. G. Larsen, A. Legay, M. L. Pedersen, A. Wasowski.

Constraint Markov Chains, in: Theor. Comput. Sci., 2011, vol. 412, n^o 34, p. 4373-4404.

http://dx.doi.org/10.1016/j.tcs.2011.05.010
17B. Delahaye, B. Caillaud, A. Legay.

Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects, in: Formal Methods in System Design, 2011, vol. 38, n^o 1, p. 1-32.

http://dx.doi.org/10.1007/s10703-010-0107-8
18J.-B. Raclet, E. Badouel, A. Benveniste, B. Caillaud, A. Legay, R. Passerone.

A Modal Interface Theory for Component-based Design, in: Fundam. Inform., 2011, vol. 108, n^o 1-2, p. 119-149.

http://dx.doi.org/10.3233/FI-2011-416
19L. Ricker, B. Caillaud.

Mind the gap: Expanding communication options in decentralized discrete-event control, in: Automatica, 2011, vol. 47, n^o 11, p. 2364-2372.

http://dx.doi.org/10.1016/j.automatica.2011.08.040

International Conferences with Proceedings

20E. Badouel, A. Bouillard, P. Darondeau, J. Komenda.

Residuation of tropical series: rationality issues, in: CDC-ECC, IEEE society (editor), 2011, to appear.
21A. Benveniste, T. Bourke, B. Caillaud, M. Pouzet.

A hybrid synchronous language with hierarchical automata: static typing and translation to synchronous code, in: Proceedings of the 11th International Conference on Embedded Software, EMSOFT 2011, S. Chakraborty, A. Jerraya, S. K. Baruah, S. Fischmeister (editors), ACM, 2011, p. 137-148.

http://doi.acm.org/10.1145/2038642.2038664
22A. Benveniste, T. Bourke, B. Caillaud, M. Pouzet.

Divide and recycle: types and compilation for a hybrid synchronous language, in: LCTES, J. Vitek, B. De Sutter (editors), ACM, 2011, p. 61-70.

http://doi.acm.org/10.1145/1967677.1967687
23E. Best, P. Darondeau.

Petri Net Distributability, in: PSI, Lecture Notes in Computer Science, Springer, 2011, vol. 7162, to appear.
24P. Darondeau, S. Demri, R. Meyer, C. Morvan.

Petri Net Reachability Graphs: Decidability Status of FO Properties, in: FSTTCS, S. Chakraborty, A. Kumar (editors), LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011, vol. 13, p. 140-151.

http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2011.140
25P. Darondeau, L. Hélouët, M. Mukund.

Assembling Sessions, in: ATVA, T. Bultan, P.-A. Hsiung (editors), Lecture Notes in Computer Science, Springer, 2011, vol. 6996, p. 259-274.

http://dx.doi.org/10.1007/978-3-642-24372-1_19
26P. Darondeau, L. Ricker.

Towards Distributed Control of Discrete Event Systems, in: Workshop on Applications of Region Theory, J. Desel, A. Yakovlev (editors), CEUR Workshop Proceedings, 2011, vol. 725, p. 63-78.

http://ceur-ws.org/Vol-725
27B. Maubert, S. Pinchinat, L. Bozzelli.

Opacity Issues in Games with Imperfect Information, in: GandALF, G. D'Agostino, S. La Torre (editors), EPTCS, 2011, vol. 54, p. 87-101.

http://dx.doi.org/10.4204/EPTCS.54.7

Scientific Books (or Scientific Book chapters)

28M. P. Cabasino, P. Darondeau, M. P. Fanti, C. Seatzu.

Model Identification and Synthesis of Discrete-Event Systems, IEEE-Wiley, 2011, to appear.

Books or Proceedings Editing

29B. Caillaud, J. Carmona, K. Hiraishi (editors)

Eleventh International Conference on Application of Concurrency to System Design, IEEE, Newcastle Upon Tyne, UK, June 2011.

http://dx.doi.org/10.1109/ACSD.2011.1

References in notes

30E. Badouel, B. Caillaud, P. Darondeau.

Distributing Finite Automata through Petri Net Synthesis, in: Journal on Formal Aspects of Computing, 2002, vol. 13, p. 447–470.
31E. Badouel, P. Darondeau.

Theory of regions, in: Lectures on Petri Nets I: Basic Models, Lecture Notes in Computer Science, Springer, 1999, vol. 1491, p. 529–586.
32A. Benveniste, B. Caillaud, M. Pouzet.

The Fundamentals of Hybrid Systems Modelers, in: 49th IEEE Conference on Decision and Control (CDC 2010), IEEE Computer Society, 2010.
33R. P. Hopkins.

Distributable nets, in: Advances in Petri Nets 1991, Papers from the 11th International Conference on Applications and Theory of Petri Nets, G. Rozenberg (editor), Lecture Notes in Computer Science, Springer, 1991, vol. 524, p. 161–187.
34A. Schrijver.

Theory of linear and integer programming, Wiley, April 1998.

Previous |

Home