Page en cours de construction
Publications de Rémi Morin
| 2011 |
||
| 25 | EE | Nicolas Baudru, Rémi Morin: Synthesis of safe message passing systems: the deterministic case (Work in progress) |
| 24 |
EE | Rémi Morin:
Shared-Memory Systems and Charts.
Accepted at CSR 2011 |
| 23 |
EE | Florent Avellaneda, Rémi Morin:
Checking non-divergence, channel-bound, and global-cooperation
using SAT-solvers.
Accepted at ACSD 2011 |
| 2010 |
||
| 22 | EE | Rémi Morin: Unambiguous Shared-Memory Systems. International Journal of Foundations of Computer Science (IJFCS) 21(4): p. 665-685 |
| 2009 |
||
| 21 | EE | Jean Fanchon, Rémi Morin: Pomset Languages of Finite Step Transition Systems. Petri Nets 2009: LNCS 5606, p. 83-102 |
| 2008 |
||
| 20 |
EE | Rémi Morin:
Semantics of Deterministic Shared-Memory Systems.
CONCUR 2008: LNCS 5201,
p. 36-51 |
| 19 |
EE | Rémi Morin:
MSO Logic for Unambiguous Shared-Memory Systems.
Developments in Language Theory 2008: LNCS 5257,
p. 516-528 |
| 2007 |
||
| 18 |
EE | Nicolas Baudru, Rémi Morin: Synthesis of Safe Message-Passing Systems. FSTTCS 2007, LNCS 4855, p. 277-289 |
| 2006 |
||
| 17 |
EE | Nicolas Baudru, Rémi Morin: Unfolding Synthesis of Asynchronous. CSR 2006, LNCS 3967, p. 46-57. |
| 16 |
EE | Nicolas Baudru, Rémi Morin: The Synthesis Problem of Netcharts. ATPN 2006, LNCS 4024, p. 84-104. |
| 2005 |
||
| 15 |
EE | Rémi Morin: Concurrent
Automata vs. Asynchronous Systems. MFCS 2005: LNCS 3618, p.
686-698 |
| 2004 | ||
|---|---|---|
| 14 | EE | Nicolas Baudru, Rémi Morin: The Pros and Cons of Netcharts. CONCUR 2004: LNCS 3170, p. 99-114 |
| 2003 | ||
| 13 | EE | Nicolas Baudru, Rémi Morin: Safe Implementability of Regular Message Sequence Chart Specifications. SNPD 2003: 210-217 |
| 2002 | ||
| 12 | EE | Jean Fanchon, Rémi Morin: Regular Sets of Pomsets with Autoconcurrency. CONCUR 2002: LNCS 2421, p. 402-417 |
| 11 | EE | Rémi Morin: Recognizable Sets of Message Sequence Charts. STACS 2002: LNCS 2285, p. 523-534 |
| 10 | EE | Sébastien Bornot, Rémi Morin, Peter Niebert, Sarah Zennou: Black Box Unfolding with Local First Search. TACAS 2002: LNCS 2280, p. 386-400 |
| 9 | EE | Dietrich Kuske, Rémi Morin: Pomsets for Local Trace Languages. Journal of Automata, Languages and Combinatorics 7(2): p. 187-224 (2002) |
| 2001 | ||
| 8 | EE | Rémi Morin: On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory. FoSSaCS 2001: LNCS 2030, p. 332-346 |
| 2000 | ||
| 7 | EE | Dietrich Kuske, Rémi Morin: Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets. CONCUR 2000: LNCS 1877, p. 426-441 |
| 6 | EE | Jean-François Husson, Rémi Morin: On Recognizable Stable Trace Languages. FoSSaCS 2000: LNCS 1784, p. 177-191 |
| 1999 | ||
| 5 | EE | Rémi Morin, Brigitte Rozoy: On the Semantics of Place/Transition Nets. CONCUR 1999: LNCS 1664, p. 447-462 |
| 4 | EE | H. C. M. Kleijn, Rémi Morin, Brigitte Rozoy: A General Categorical Connection between Local Event Structures and Local Traces. FCT 1999: LNCS 1684, p. 338-349 |
| 3 | EE | Rémi Morin: Hierarchy of asynchronous automata. Electr. Notes Theor. Comput. Sci. 28: (1999) |
| 1998 | ||
| 2 |
EE | H. C. M. Kleijn, Rémi Morin, Brigitte Rozoy: Event Structures for Local Traces. Electr. Notes Theor. Comput. Sci. 16(2): (1998) |
| 1 |
EE | Rémi Morin: Decompositions of Asynchronous Systems. CONCUR 1998: LNCS 1466, p. 549-564 |