- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j5 |      | Sandie Balaguer, Thomas Chatain, Stefan Haar: A concurrency-preserving translation from time Petri nets to networks of timed automata. Formal Methods in System Design 40(3): 330-355 (2012) |
| c13 | | Sandie Balaguer, Thomas Chatain: Avoiding Shared Clocks in Networks of Timed Automata. CONCUR 2012: 100-114 |
| 2011 | ||
| c12 | | Sandie Balaguer, Thomas Chatain, Stefan Haar: Building Tight Occurrence Nets from Reveals Relations. ACSD 2011: 44-53 |
| 2010 | ||
| j4 | | Paolo Baldan, Thomas Chatain, Stefan Haar, Barbara König: Unfolding-based diagnosis of systems with an evolving topology. Inf. Comput. 208(10): 1169-1192 (2010) |
| c11 | | Thomas Chatain, Eric Fabre: Factorization Properties of Symbolic Unfoldings of Colored Petri Nets. Petri Nets 2010: 165-184 |
| c10 | | Sandie Balaguer, Thomas Chatain, Stefan Haar: A Concurrency-Preserving Translation from Time Petri Nets to Networks of Timed Automata. TIME 2010: 77-84 |
| 2009 | ||
| j3 | | Étienne André, Thomas Chatain, Laurent Fribourg, Emmanuelle Encrenaz: An Inverse Method for Parametric Timed Automata. Int. J. Found. Comput. Sci. 20(5): 819-836 (2009) |
| c9 | | Peter E. Bulychev, Thomas Chatain, Alexandre David, Kim Guldstrand Larsen: Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation. FORMATS 2009: 73-87 |
| c8 | | Thomas Chatain, Paul Gastin, Nathalie Sznajder: Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems. SOFSEM 2009: 141-152 |
| 2008 | ||
| j2 | | Étienne André, Thomas Chatain, Laurent Fribourg, Emmanuelle Encrenaz: An Inverse Method for Parametric Timed Automata. Electr. Notes Theor. Comput. Sci. 223: 29-46 (2008) |
| c7 | | Paolo Baldan, Thomas Chatain, Stefan Haar, Barbara König: Unfolding-Based Diagnosis of Systems with an Evolving Topology. CONCUR 2008: 203-217 |
| 2007 | ||
| j1 | | Thomas Chatain, Victor Khomenko: On the well-foundedness of adequate orders used for construction of complete unfolding prefixes. Inf. Process. Lett. 104(4): 129-136 (2007) |
| 2006 | ||
| c6 | | Thomas Chatain, Claude Jard: Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets. ICATPN 2006: 125-145 |
| c5 | | Franck Cassez, Thomas Chatain, Claude Jard: Symbolic Unfoldings for Networks of Timed Automata. ATVA 2006: 307-321 |
| 2005 | ||
| c4 | | Thomas Chatain, Claude Jard: Models for the Supervision of Web Services Orchestration with Dynamic Changes. AICT/SAPIR/ELETE 2005: 446-451 |
| c3 | | Thomas Chatain, Claude Jard: Time Supervision of Concurrent Systems Using Symbolic Unfoldings of Time Petri Nets. FORMATS 2005: 196-210 |
| c2 | | Thomas Chatain, Loïc Hélouët, Claude Jard: From Automata Networks to HMSCs: A Reverse Model Engineering Perspective. FORTE 2005: 489-502 |
| 2004 | ||
| c1 | | Thomas Chatain, Claude Jard: Symbolic Diagnosis of Partially Observable Concurrent Systems. FORTE 2004: 326-342 |
Colors in the list of coauthors
Last update Mon May 20 02:17:13 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page