| 2011 | ATVA | Assembling Sessions. | Philippe Darondeau, Loc Hlout, Madhavan Mukund |
| 2008 | CONCUR | Quasi-Static Scheduling of Communicating Tasks. | Philippe Darondeau, Blaise Genest, P. S. Thiagarajan, Shaofa Yang |
| 2008 | FOSSACS | Products of Message Sequence Charts. | Philippe Darondeau, Blaise Genest, Loc Hlout |
| 1999 | PDPTA | Modelling Dynamic Agent Systems with Cooperating Automata. | ric Badouel, Philippe Darondeau, Andrew Tokmakoff |
| 1998 | CONCUR | Deriving Unbounded Petri Nets from Formal Languages. | Philippe Darondeau |
| 1997 | FCT | Stratified Petri Nets. | ric Badouel, Philippe Darondeau |
| 1992 | CONCUR | Structural Operational Specifications and the Trace Automata. | ric Badouel, Philippe Darondeau |
| 1990 | MFCS | Event Structures, Causal Trees, and Refinements. | Philippe Darondeau, Pierpaolo Degano |
| 1989 | ICALP | Causal Trees. | Philippe Darondeau, Pierpaolo Degano |
| 1986 | STACS | Separating and Testing. | Philippe Darondeau |
| 1984 | CONCUR | A Fully Abstract Model of Fair Asynchrony. | Philippe Darondeau |
| 1983 | ICALP | On the Observational Semantics of Fair Parallelism. | Philippe Darondeau, Laurent Kott |