#### Filter Results:

- Full text PDF available (18)

#### Publication Year

1998

2015

- This year (0)
- Last 5 years (5)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Rémi Morin
- CONCUR
- 1998

- Rémi Morin
- STACS
- 2002

High-level Message Sequence Charts are a well-established formalism to specify scenarios of communications in telecommunication protocols. In order to deal with possibly unbounded specifications, we focus on star-connected HMSCs. We relate this subclass with recognizability and MSO-definability by means of a new connection with Mazurkiewicz traces. Our main… (More)

- Rémi Morin
- FoSSaCS
- 2001

Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently through algebraic approaches or relationships to Mazurkiewicz trace theory. We show how to check whether a rational language of MSCs requires only channels of finite capacity. In… (More)

- Nicolas Baudru, Rémi Morin
- SNPD
- 2003

Message Sequence Charts (MSCs) are drawn by software designers in order to model the typical behaviors of some communication protocol at an early stage of its design. The important question of whether some given set of scenarios is realizable by some message passing system has already been investigated in different ways. We consider here deadlock-free… (More)

- Nicolas Baudru, Rémi Morin
- FSTTCS
- 2007

We show that any regular set of basic MSCs can be implemented by a deadlock-free communicating finite-state machine with local termination: Processes stop in local dead-states independently from the contents of channels and the local states of other processes. We present a self-contained, direct, and relatively simple construction based on a new notion… (More)

- Dietrich Kuske, Rémi Morin
- CONCUR
- 2000

- Sébastien Bornot, Rémi Morin, Peter Niebert, Sarah Zennou
- TACAS
- 2002

- Rémi Morin
- MFCS
- 2005

We compare the expressive power of two automata-based finite-state models of concurrency. We show that Droste’s and Kuske’s coherent stably concurrent automata and Bednarczyk’s forward-stable asynchronous systems describe the same class of regular event structures. This connection subsumes a previous study by Schmitt which relates Stark’s trace automata to… (More)

- Nicolas Baudru, Rémi Morin
- CSR
- 2006

Zielonka’s theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure called an asynchronous automaton. This paper gives a new algorithm for the synthesis of a non-deterministic asynchronous automaton from a regular Mazurkiewicz trace language. Our… (More)

- Jetty Kleijn, Rémi Morin, Brigitte Rozoy
- Electr. Notes Theor. Comput. Sci.
- 1998