 | 2012 |
|---|
| 17 |       | 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) |
| 2011 |
|---|
| 16 | | Sandie Balaguer,
Thomas Chatain,
Stefan Haar:
Building Tight Occurrence Nets from Reveals Relations.
ACSD 2011: 44-53 |
| 2010 |
|---|
| 15 | | Thomas Chatain,
Eric Fabre:
Factorization Properties of Symbolic Unfoldings of Colored Petri Nets.
Petri Nets 2010: 165-184 |
| 14 | | Sandie Balaguer,
Thomas Chatain,
Stefan Haar:
A Concurrency-Preserving Translation from Time Petri Nets to Networks of Timed Automata.
TIME 2010: 77-84 |
| 13 | | 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) |
| 2009 |
|---|
| 12 | | Peter E. Bulychev,
Thomas Chatain,
Alexandre David,
Kim Guldstrand Larsen:
Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation.
FORMATS 2009: 73-87 |
| 11 | | Thomas Chatain,
Paul Gastin,
Nathalie Sznajder:
Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems.
SOFSEM 2009: 141-152 |
| 10 | | É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) |
| 2008 |
|---|
| 9 | | Paolo Baldan,
Thomas Chatain,
Stefan Haar,
Barbara König:
Unfolding-Based Diagnosis of Systems with an Evolving Topology.
CONCUR 2008: 203-217 |
| 8 | | Étienne André,
Thomas Chatain,
Laurent Fribourg,
Emmanuelle Encrenaz:
An Inverse Method for Parametric Timed Automata.
Electr. Notes Theor. Comput. Sci. 223: 29-46 (2008) |
| 2007 |
|---|
| 7 | | 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 |
|---|
| 6 | | Franck Cassez,
Thomas Chatain,
Claude Jard:
Symbolic Unfoldings for Networks of Timed Automata.
ATVA 2006: 307-321 |
| 5 | | Thomas Chatain,
Claude Jard:
Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets.
ICATPN 2006: 125-145 |
| 2005 |
|---|
| 4 | | Thomas Chatain,
Claude Jard:
Models for the Supervision of Web Services Orchestration with Dynamic Changes.
AICT/SAPIR/ELETE 2005: 446-451 |
| 3 | | Thomas Chatain,
Claude Jard:
Time Supervision of Concurrent Systems Using Symbolic Unfoldings of Time Petri Nets.
FORMATS 2005: 196-210 |
| 2 | | Thomas Chatain,
Loïc Hélouët,
Claude Jard:
From Automata Networks to HMSCs: A Reverse Model Engineering Perspective.
FORTE 2005: 489-502 |
| 2004 |
|---|
| 1 | | Thomas Chatain,
Claude Jard:
Symbolic Diagnosis of Partially Observable Concurrent Systems.
FORTE 2004: 326-342 |
Data released under the ODC-BY 1.0 license — See also our legal information page