Symbolic Diagnosis of Partially Observable Concurrent Systems. - Thomas Chatain; Claude Jard (FORTE, 2004)

Models for the Supervision of Web Services Orchestration with Dynamic Changes. - Thomas Chatain; Claude Jard (AICT/SAPIR/ELETE, 2005)

Time Supervision of Concurrent Systems Using Symbolic Unfoldings of Time Petri Nets. - Thomas Chatain; Claude Jard (FORMATS, 2005)

From Automata Networks to HMSCs: A Reverse Model Engineering Perspective. - Thomas Chatain; Loïc Hélouët; Claude Jard (FORTE, 2005)

Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets. - Thomas Chatain; Claude Jard (ICATPN, 2006)

Symbolic Unfoldings for Networks of Timed Automata. - Franck Cassez; Thomas Chatain; Claude Jard (ATVA, 2006)

On the well-foundedness of adequate orders used for construction of complete unfolding prefixes. - Thomas Chatain; Victor Khomenko (Inf. Process. Lett., 2007)

Playing Games with Timed Games. - Thomas Chatain; Alexandre David; Kim G. Larsen (ADHS, 2009)

Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation. - Peter E. Bulychev; Thomas Chatain; Alexandre David; Kim Guldstrand Larsen (FORMATS, 2009)

Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems. - Thomas Chatain; Paul Gastin; Nathalie Sznajder (SOFSEM, 2009)

An Inverse Method for Parametric Timed Automata. - Étienne André; Thomas Chatain; Laurent Fribourg; Emmanuelle Encrenaz (Int. J. Found. Comput. Sci., 2009)

Factorization Properties of Symbolic Unfoldings of Colored Petri Nets. - Thomas Chatain; Eric Fabre (Petri Nets, 2010)

Unfolding-based diagnosis of systems with an evolving topology. - Paolo Baldan; Thomas Chatain; Stefan Haar; Barbara König 001 (Inf. Comput., 2010)

Building Tight Occurrence Nets from Reveals Relations. - Sandie Balaguer; Thomas Chatain; Stefan Haar (ACSD, 2011)

A concurrency-preserving translation from time Petri nets to networks of timed automata. - Sandie Balaguer; Thomas Chatain; Stefan Haar (Formal Methods Syst. Des., 2012)

Concurrency in Real-Time Distributed Systems, from Unfoldings to Implementability. - Thomas Chatain (2013)

Tools for Model-Checking Timed Systems. - Alexandre David; Gerd Behrmann; Peter E. Bulychev; Joakim Byg; Thomas Chatain; Kim G. Larsen; Paul Pettersson; Jacob Illum Rasmussen; Jirí Srba; Wang Yi 001; Kenneth Yrke Jørgensen; Didier Lime; et al. (Communicating Embedded Systems, 2013)

Back in Time Petri Nets. - Thomas Chatain; Claude Jard (FORMATS, 2013)

Avoiding Shared Clocks in Networks of Timed Automata. - Sandie Balaguer; Thomas Chatain (Log. Methods Comput. Sci., 2013)

Building Occurrence Nets from Reveals Relations. - Sandie Balaguer; Thomas Chatain; Stefan Haar (Fundam. Informaticae, 2013)

Characterization of Reachable Attractors Using Petri Net Unfoldings. - Thomas Chatain; Stefan Haar; Loïg Jezequel; Loïc Paulevé; Stefan Schwoon (CMSB, 2014)

A Canonical Contraction for Safe Petri Nets. - Thomas Chatain; Stefan Haar (Trans. Petri Nets Other Model. Concurr., 2014)

Non-atomic Transition Firing in Contextual Nets. - Thomas Chatain; Stefan Haar; Maciej Koutny; Stefan Schwoon (Petri Nets, 2015)

Anti-alignments in Conformance Checking - The Dark Side of Process Models. - Thomas Chatain; Josep Carmona 001 (Petri Nets, 2016)

A Unified Approach for Measuring Precision and Generalization Based on Anti-alignments. - Boudewijn F. van Dongen; Josep Carmona 001; Thomas Chatain (BPM, 2016)

Alignment-based Quality Metrics in Conformance Checking (Summary). - Boudewijn F. van Dongen; Josep Carmona 001; Thomas Chatain (EMISA, 2016)

Alignment-based Quality Metrics in Conformance Checking. - Boudewijn F. van Dongen; Josep Carmona 001; Thomas Chatain (EMISA Forum, 2016)

Aligning Modeled and Observed Behavior: A Compromise Between Computation Complexity and Quality. - Boudewijn F. van Dongen; Josep Carmona 001; Thomas Chatain; Farbod Taymouri (CAiSE, 2017)

Goal-Driven Unfolding of Petri Nets. - Thomas Chatain; Loïc Paulevé (CONCUR, 2017)

Alignment-Based Trace Clustering. - Thomas Chatain; Josep Carmona 001; Boudewijn F. van Dongen (ER, 2017)

Preserving Partial-Order Runs in Parametric Time Petri Nets. - Étienne André; Thomas Chatain; César Rodríguez (ACM Trans. Embed. Comput. Syst., 2017)

Boolean Networks: Beyond Generalized Asynchronicity. - Thomas Chatain; Stefan Haar; Loïc Paulevé (Automata, 2018)

Pomsets and Unfolding of Reset Petri Nets. - Thomas Chatain; Maurice Comlan; David Delfieu; Loïg Jezequel; Olivier H. Roux (LATA, 2018)

Most Permissive Semantics of Boolean Networks. - Thomas Chatain; Stefan Haar; Loïc Paulevé (CoRR, 2018)

Generalized Alignment-Based Trace Clustering of Process Behavior. - Mathilde Boltenhagen; Thomas Chatain; Josep Carmona 001 (Petri Nets, 2019)

Encoding Conformance Checking Artefacts in SAT. - Mathilde Boltenhagen; Thomas Chatain; Josep Carmona 001 (Business Process Management Workshops, 2019)

A Tour in Process Mining: From Practice to Algorithmic Challenges. - Wil M. P. van der Aalst; Josep Carmona 001; Thomas Chatain; Boudewijn F. van Dongen (Trans. Petri Nets Other Model. Concurr., 2019)

Concurrency in Boolean networks. - Thomas Chatain; Stefan Haar; Juraj Kolcák; Loïc Paulevé; Aalok Thakkar (Nat. Comput., 2020)

A Discounted Cost Function for Fast Alignments of Business Processes. - Mathilde Boltenhagen; Thomas Chatain; Josep Carmona 001 (BPM, 2021)

An A*-Algorithm for Computing Discounted Anti-Alignments in Process Mining. - Mathilde Boltenhagen; Thomas Chatain; Josep Carmona 001 (ICPM, 2021)

Optimized SAT encoding of conformance checking artefacts. - Mathilde Boltenhagen; Thomas Chatain; Josep Carmona 001 (Computing, 2021)

Model-based trace variant analysis of event logs. - Mathilde Boltenhagen; Thomas Chatain; Josep Carmona 001 (Inf. Syst., 2021)

Anti-alignments - Measuring the precision of process models and event logs. - Thomas Chatain; Mathilde Boltenhagen; Josep Carmona 001 (Inf. Syst., 2021)

Timed Alignments. - Thomas Chatain; Neha Rino (ICPM, 2022)

Pomset bisimulation and unfolding for reset Petri nets. - Thomas Chatain; Maurice Comlan; David Delfieu; Loïg Jezequel; Olivier Henri Roux (Inf. Comput., 2022)

Taking Complete Finite Prefixes to High Level, Symbolically. - Nick Würdemann; Thomas Chatain; Stefan Haar (Petri Nets, 2023)

Timed alignments with mixed moves. - Neha Rino; Thomas Chatain (Data Knowl. Eng., 2024)

Taking Complete Finite Prefixes To High Level, Symbolically. - Nick Würdemann; Thomas Chatain; Stefan Haar; Lukas Panneke (Fundam. Informaticae, 2024)