|
Search the dblp DataBase
Rémi Morin:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Nicolas Baudru, Rémi Morin
The Synthesis Problem of Netcharts. [Citation Graph (0, 0)][DBLP] ICATPN, 2006, pp:84-104 [Conf]
- Nicolas Baudru, Rémi Morin
The Pros and Cons of Netcharts. [Citation Graph (0, 0)][DBLP] CONCUR, 2004, pp:99-114 [Conf]
- Jean Fanchon, Rémi Morin
Regular Sets of Pomsets with Autoconcurrency. [Citation Graph (0, 0)][DBLP] CONCUR, 2002, pp:402-417 [Conf]
- Dietrich Kuske, Rémi Morin
Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets. [Citation Graph (0, 0)][DBLP] CONCUR, 2000, pp:426-441 [Conf]
- Rémi Morin
Decompositions of Asynchronous Systems. [Citation Graph (0, 0)][DBLP] CONCUR, 1998, pp:549-564 [Conf]
- Rémi Morin, Brigitte Rozoy
On the Semantics of Place/Transition Nets. [Citation Graph (0, 0)][DBLP] CONCUR, 1999, pp:447-462 [Conf]
- Nicolas Baudru, Rémi Morin
Unfolding Synthesis of Asynchronous Automata. [Citation Graph (0, 0)][DBLP] CSR, 2006, pp:46-57 [Conf]
- H. C. M. Kleijn, Rémi Morin, Brigitte Rozoy
A General Categorical Connection between Local Event Structures and Local Traces. [Citation Graph (0, 0)][DBLP] FCT, 1999, pp:338-349 [Conf]
- Jean-François Husson, Rémi Morin
On Recognizable Stable Trace Languages. [Citation Graph (0, 0)][DBLP] FoSSaCS, 2000, pp:177-191 [Conf]
- Rémi Morin
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory. [Citation Graph (0, 0)][DBLP] FoSSaCS, 2001, pp:332-346 [Conf]
- Rémi Morin
Concurrent Automata vs. Asynchronous Systems. [Citation Graph (0, 0)][DBLP] MFCS, 2005, pp:686-698 [Conf]
- Nicolas Baudru, Rémi Morin
Safe Implementability of Regular Message Sequence Chart Specifications. [Citation Graph (0, 0)][DBLP] SNPD, 2003, pp:210-217 [Conf]
- Rémi Morin
Recognizable Sets of Message Sequence Charts. [Citation Graph (0, 0)][DBLP] STACS, 2002, pp:523-534 [Conf]
- Sébastien Bornot, Rémi Morin, Peter Niebert, Sarah Zennou
Black Box Unfolding with Local First Search. [Citation Graph (0, 0)][DBLP] TACAS, 2002, pp:386-400 [Conf]
- H. C. M. Kleijn, Rémi Morin, Brigitte Rozoy
Event Structures for Local Traces. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 1998, v:16, n:2, pp:- [Journal]
- Rémi Morin
Hierarchy of asynchronous automata. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 1999, v:28, n:, pp:- [Journal]
- Dietrich Kuske, Rémi Morin
Pomsets for Local Trace Languages. [Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 2002, v:7, n:2, pp:187-224 [Journal]
Pomset Languages of Finite Step Transition Systems. [Citation Graph (, )][DBLP]
Semantics of Deterministic Shared-Memory Systems. [Citation Graph (, )][DBLP]
MSO Logic for Unambiguous Shared-Memory Systems. [Citation Graph (, )][DBLP]
Synthesis of Safe Message-Passing Systems. [Citation Graph (, )][DBLP]
Polynomial Synthesis of Asynchronous Automata [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
|