Rémi Morin

According to our database1, Rémi Morin authored at least 28 papers between 1998 and 2015.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
Catching a Structural Bug with a Flower.
Fundam. Informaticae, 2015

2014
Exhibition of a Structural Bug with Wings.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2014

2013
Checking Partial-Order Properties of Vector Addition Systems with States.
Proceedings of the 13th International Conference on Application of Concurrency to System Design, 2013

2011
Shared-Memory Systems and Charts.
Proceedings of the Computer Science - Theory and Applications, 2011

Checking Non-divergence, Channel-Bound and Global Cooperation Using SAT-Solvers.
Proceedings of the 11th International Conference on Application of Concurrency to System Design, 2011

2010
Unambiguous Shared-Memory Systems.
Int. J. Found. Comput. Sci., 2010

2009
Pomset Languages of Finite Step Transition Systems.
Proceedings of the Applications and Theory of Petri Nets, 2009

2008
MSO Logic for Unambiguous Shared-Memory Systems.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

Semantics of Deterministic Shared-Memory Systems.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

2007
Synthesis of Safe Message-Passing Systems.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2006
Unfolding Synthesis of Asynchronous Automata.
Proceedings of the Computer Science, 2006

The Synthesis Problem of Netcharts.
Proceedings of the Petri Nets and Other Models of Concurrency, 2006

2005
Polynomial Synthesis of Asynchronous Automata
CoRR, 2005

Concurrent Automata vs. Asynchronous Systems.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004
The Pros and Cons of Netcharts.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003
Safe Implementability of Regular Message Sequence Chart Specifications.
Proceedings of the ACIS Fourth International Conference on Software Engineering, 2003

2002
Pomsets for Local Trace Languages.
J. Autom. Lang. Comb., 2002

Black Box Unfolding with Local First Search.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2002

Recognizable Sets of Message Sequence Charts.
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

Regular Sets of Pomsets with Autoconcurrency.
Proceedings of the CONCUR 2002, 2002

2001
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory.
Proceedings of the Foundations of Software Science and Computation Structures, 2001

2000
On Recognizable Stable Trace Languages.
Proceedings of the Foundations of Software Science and Computation Structures, 2000

Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets.
Proceedings of the CONCUR 2000, 2000

1999
Hierarchy of asynchronous automata.
Proceedings of the Workshop on Distributed Systems, 1999

A General Categorical Connection between Local Event Structures and Local Traces.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

On the Semantics of Place/Transition Nets.
Proceedings of the CONCUR '99: Concurrency Theory, 1999

1998
Event Structures for Local Traces.
Proceedings of the Fifth International Workshop on Expressiveness in Concurrency, 1998

Decompositions of Asynchronous Systems.
Proceedings of the CONCUR '98: Concurrency Theory, 1998


  Loading...