default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRémi Morin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j3]Florent Avellaneda
, Rémi Morin:
Catching a Structural Bug with a Flower. Fundam. Informaticae 140(1): 61-87 (2015)- 2014
- [c24]Florent Avellaneda, Rémi Morin:
Exhibition of a Structural Bug with Wings. Petri Nets 2014: 253-272 - 2013
- [c23]Florent Avellaneda, Rémi Morin:
Checking Partial-Order Properties of Vector Addition Systems with States. ACSD 2013: 100-109 - 2011
- [c22]Florent Avellaneda, Rémi Morin:
Checking Non-divergence, Channel-Bound and Global Cooperation Using SAT-Solvers. ACSD 2011: 19-28 - [c21]Rémi Morin:
Shared-Memory Systems and Charts. CSR 2011: 317-330 - 2010
- [j2]Rémi Morin:
Unambiguous Shared-Memory Systems. Int. J. Found. Comput. Sci. 21(4): 665-685 (2010)
2000 – 2009
- 2009
- [c20]Jean Fanchon, Rémi Morin:
Pomset Languages of Finite Step Transition Systems. Petri Nets 2009: 83-102 - 2008
- [c19]Rémi Morin:
Semantics of Deterministic Shared-Memory Systems. CONCUR 2008: 36-51 - [c18]Rémi Morin:
MSO Logic for Unambiguous Shared-Memory Systems. Developments in Language Theory 2008: 516-528 - 2007
- [c17]Nicolas Baudru, Rémi Morin:
Synthesis of Safe Message-Passing Systems. FSTTCS 2007: 277-289 - 2006
- [c16]Nicolas Baudru, Rémi Morin:
The Synthesis Problem of Netcharts. ICATPN 2006: 84-104 - [c15]Nicolas Baudru, Rémi Morin:
Unfolding Synthesis of Asynchronous Automata. CSR 2006: 46-57 - 2005
- [c14]Rémi Morin:
Concurrent Automata vs. Asynchronous Systems. MFCS 2005: 686-698 - [i1]Nicolas Baudru, Rémi Morin:
Polynomial Synthesis of Asynchronous Automata. CoRR abs/cs/0506096 (2005) - 2004
- [c13]Nicolas Baudru, Rémi Morin:
The Pros and Cons of Netcharts. CONCUR 2004: 99-114 - 2003
- [c12]Nicolas Baudru, Rémi Morin:
Safe Implementability of Regular Message Sequence Chart Specifications. SNPD 2003: 210-217 - 2002
- [j1]Dietrich Kuske, Rémi Morin:
Pomsets for Local Trace Languages. J. Autom. Lang. Comb. 7(2): 187-224 (2002) - [c11]Jean Fanchon, Rémi Morin:
Regular Sets of Pomsets with Autoconcurrency. CONCUR 2002: 402-417 - [c10]Rémi Morin:
Recognizable Sets of Message Sequence Charts. STACS 2002: 523-534 - [c9]Sébastien Bornot, Rémi Morin, Peter Niebert, Sarah Zennou:
Black Box Unfolding with Local First Search. TACAS 2002: 386-400 - 2001
- [c8]Rémi Morin:
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory. FoSSaCS 2001: 332-346 - 2000
- [c7]Dietrich Kuske, Rémi Morin:
Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets. CONCUR 2000: 426-441 - [c6]Jean-François Husson, Rémi Morin:
On Recognizable Stable Trace Languages. FoSSaCS 2000: 177-191
1990 – 1999
- 1999
- [c5]Rémi Morin, Brigitte Rozoy:
On the Semantics of Place/Transition Nets. CONCUR 1999: 447-462 - [c4]H. C. M. Kleijn, Rémi Morin, Brigitte Rozoy:
A General Categorical Connection between Local Event Structures and Local Traces. FCT 1999: 338-349 - [c3]Rémi Morin:
Hierarchy of asynchronous automata. WDS@FCT 1999: 22-39 - 1998
- [c2]Rémi Morin:
Decompositions of Asynchronous Systems. CONCUR 1998: 549-564 - [c1]H. C. M. Kleijn, Rémi Morin, Brigitte Rozoy:
Event Structures for Local Traces. EXPRESS 1998: 98-113
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
