default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Chatain
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Neha Rino
, Thomas Chatain:
Timed alignments with mixed moves. Data Knowl. Eng. 154: 102366 (2024)- [j16]Nick Würdemann, Thomas Chatain, Stefan Haar, Lukas Panneke:
Taking Complete Finite Prefixes To High Level, Symbolically. Fundam. Informaticae 192(3-4): 313-361 (2024) - 2023
- [c35]Nick Würdemann, Thomas Chatain, Stefan Haar:
Taking Complete Finite Prefixes to High Level, Symbolically. Petri Nets 2023: 123-144 - [c34]Neha Rino, Thomas Chatain:
Timed Alignments with Mixed Moves. Business Process Management Workshops 2023: 186-197 - [i7]Nick Würdemann, Thomas Chatain, Stefan Haar, Lukas Panneke:
Taking Complete Finite Prefixes To High Level, Symbolically. CoRR abs/2311.11443 (2023) - 2022
- [j15]Thomas Chatain, Maurice Comlan, David Delfieu, Loïg Jezequel, Olivier Henri Roux:
Pomset bisimulation and unfolding for reset Petri nets. Inf. Comput. 283: 104674 (2022) - [c33]Thomas Chatain, Neha Rino:
Timed Alignments. ICPM 2022: 112-119 - [i6]Thomas Chatain, Neha Rino:
Timed Alignments. CoRR abs/2207.01870 (2022) - [i5]Neha Rino, Thomas Chatain:
Timed Alignments with Mixed Moves. CoRR abs/2210.15209 (2022) - 2021
- [j14]Mathilde Boltenhagen, Thomas Chatain, Josep Carmona:
Optimized SAT encoding of conformance checking artefacts. Computing 103(1): 29-50 (2021) - [j13]Thomas Chatain, Mathilde Boltenhagen, Josep Carmona:
Anti-alignments - Measuring the precision of process models and event logs. Inf. Syst. 98: 101708 (2021) - [j12]Mathilde Boltenhagen, Thomas Chatain, Josep Carmona:
Model-based trace variant analysis of event logs. Inf. Syst. 102: 101675 (2021) - [c32]Mathilde Boltenhagen, Thomas Chatain, Josep Carmona:
A Discounted Cost Function for Fast Alignments of Business Processes. BPM 2021: 252-269 - [c31]Mathilde Boltenhagen, Thomas Chatain, Josep Carmona:
An A*-Algorithm for Computing Discounted Anti-Alignments in Process Mining. ICPM 2021: 25-31 - 2020
- [j11]Thomas Chatain, Stefan Haar, Juraj Kolcák, Loïc Paulevé, Aalok Thakkar:
Concurrency in Boolean networks. Nat. Comput. 19(1): 91-109 (2020) - [e1]Ryszard Janicki, Natalia Sidorova, Thomas Chatain:
Application and Theory of Petri Nets and Concurrency - 41st International Conference, PETRI NETS 2020, Paris, France, June 24-25, 2020, Proceedings. Lecture Notes in Computer Science 12152, Springer 2020, ISBN 978-3-030-51830-1 [contents]
2010 – 2019
- 2019
- [j10]Wil M. P. van der Aalst, Josep Carmona, Thomas Chatain, Boudewijn F. van Dongen:
A Tour in Process Mining: From Practice to Algorithmic Challenges. Trans. Petri Nets Other Model. Concurr. 14: 1-35 (2019) - [c30]Mathilde Boltenhagen, Thomas Chatain, Josep Carmona:
Generalized Alignment-Based Trace Clustering of Process Behavior. Petri Nets 2019: 237-257 - [c29]Mathilde Boltenhagen, Thomas Chatain, Josep Carmona:
Encoding Conformance Checking Artefacts in SAT. Business Process Management Workshops 2019: 160-171 - [i4]Thomas Chatain, Stefan Haar, Juraj Kolcák, Loïc Paulevé, Aalok Thakkar:
Concurrency in Boolean networks. CoRR abs/1905.13467 (2019) - [i3]Thomas Chatain, Mathilde Boltenhagen, Josep Carmona:
Anti-Alignments - Measuring The Precision of Process Models and Event Logs. CoRR abs/1912.05907 (2019) - 2018
- [c28]Thomas Chatain, Stefan Haar, Loïc Paulevé:
Boolean Networks: Beyond Generalized Asynchronicity. Automata 2018: 29-42 - [c27]Thomas Chatain, Maurice Comlan, David Delfieu, Loïg Jezequel, Olivier H. Roux:
Pomsets and Unfolding of Reset Petri Nets. LATA 2018: 258-270 - [i2]Thomas Chatain, Stefan Haar, Loïc Paulevé:
Most Permissive Semantics of Boolean Networks. CoRR abs/1808.10240 (2018) - 2017
- [j9]Étienne André, Thomas Chatain, César Rodríguez:
Preserving Partial-Order Runs in Parametric Time Petri Nets. ACM Trans. Embed. Comput. Syst. 16(2): 43:1-43:26 (2017) - [c26]Boudewijn F. van Dongen, Josep Carmona, Thomas Chatain, Farbod Taymouri:
Aligning Modeled and Observed Behavior: A Compromise Between Computation Complexity and Quality. CAiSE 2017: 94-109 - [c25]Thomas Chatain, Loïc Paulevé:
Goal-Driven Unfolding of Petri Nets. CONCUR 2017: 18:1-18:16 - [c24]Thomas Chatain, Josep Carmona, Boudewijn F. van Dongen:
Alignment-Based Trace Clustering. ER 2017: 295-308 - 2016
- [j8]Boudewijn F. van Dongen, Josep Carmona, Thomas Chatain:
Alignment-based Quality Metrics in Conformance Checking. EMISA Forum 36(2): 77-80 (2016) - [c23]Thomas Chatain, Josep Carmona:
Anti-alignments in Conformance Checking - The Dark Side of Process Models. Petri Nets 2016: 240-258 - [c22]Boudewijn F. van Dongen, Josep Carmona, Thomas Chatain:
A Unified Approach for Measuring Precision and Generalization Based on Anti-alignments. BPM 2016: 39-56 - [c21]Boudewijn F. van Dongen, Josep Carmona, Thomas Chatain:
Alignment-based Quality Metrics in Conformance Checking (Summary). EMISA 2016: 87-90 - [i1]Thomas Chatain, Loïc Paulevé:
Goal-Driven Unfolding of Petri Nets. CoRR abs/1611.01296 (2016) - 2015
- [c20]Étienne André, Thomas Chatain, César Rodríguez:
Preserving Partial Order Runs in Parametric Time Petri Nets. ACSD 2015: 120-129 - [c19]Thomas Chatain, Stefan Haar, Maciej Koutny, Stefan Schwoon:
Non-atomic Transition Firing in Contextual Nets. Petri Nets 2015: 117-136 - 2014
- [j7]Thomas Chatain, Stefan Haar:
A Canonical Contraction for Safe Petri Nets. Trans. Petri Nets Other Model. Concurr. 9: 83-98 (2014) - [c18]Thomas Chatain, Stefan Haar, Loïg Jezequel, Loïc Paulevé, Stefan Schwoon:
Characterization of Reachable Attractors Using Petri Net Unfoldings. CMSB 2014: 129-142 - 2013
- [b1]Thomas Chatain:
Concurrency in Real-Time Distributed Systems, from Unfoldings to Implementability. École normale supérieure de Cachan, France, 2013 - [j6]Sandie Balaguer, Thomas Chatain:
Avoiding Shared Clocks in Networks of Timed Automata. Log. Methods Comput. Sci. 9(4) (2013) - [j5]Sandie Balaguer, Thomas Chatain, Stefan Haar:
Building Occurrence Nets from Reveals Relations. Fundam. Informaticae 123(3): 245-272 (2013) - [c17]Thomas Chatain, Stefan Haar:
A Canonical Contraction for Safe Petri Nets. PNSE+ModPE 2013: 25-39 - [c16]Thomas Chatain, Claude Jard:
Back in Time Petri Nets. FORMATS 2013: 91-105 - [p1]Alexandre David, Gerd Behrmann, Peter E. Bulychev, Joakim Byg, Thomas Chatain, Kim G. Larsen, Paul Pettersson, Jacob Illum Rasmussen, Jirí Srba, Wang Yi, Kenneth Yrke Jørgensen, Didier Lime, Morgan Magnin, Olivier H. Roux, Louis-Marie Traonouez:
Tools for Model-Checking Timed Systems. Communicating Embedded Systems 2013: 165-225 - 2012
- [j4]Sandie Balaguer, Thomas Chatain, Stefan Haar:
A concurrency-preserving translation from time Petri nets to networks of timed automata. Formal Methods Syst. Des. 40(3): 330-355 (2012) - [c15]Sandie Balaguer, Thomas Chatain:
Avoiding Shared Clocks in Networks of Timed Automata. CONCUR 2012: 100-114 - 2011
- [c14]Sandie Balaguer, Thomas Chatain, Stefan Haar:
Building Tight Occurrence Nets from Reveals Relations. ACSD 2011: 44-53 - 2010
- [j3]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) - [c13]Thomas Chatain, Eric Fabre:
Factorization Properties of Symbolic Unfoldings of Colored Petri Nets. Petri Nets 2010: 165-184 - [c12]Sandie Balaguer, Thomas Chatain, Stefan Haar:
A Concurrency-Preserving Translation from Time Petri Nets to Networks of Timed Automata. TIME 2010: 77-84
2000 – 2009
- 2009
- [j2]É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) - [c11]Thomas Chatain, Alexandre David, Kim G. Larsen:
Playing Games with Timed Games. ADHS 2009: 238-243 - [c10]Peter E. Bulychev, Thomas Chatain, Alexandre David, Kim Guldstrand Larsen:
Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation. FORMATS 2009: 73-87 - [c9]Thomas Chatain, Paul Gastin, Nathalie Sznajder:
Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems. SOFSEM 2009: 141-152 - 2008
- [c8]Paolo Baldan, Thomas Chatain, Stefan Haar, Barbara König:
Unfolding-Based Diagnosis of Systems with an Evolving Topology. CONCUR 2008: 203-217 - [c7]Étienne André, Thomas Chatain, Laurent Fribourg, Emmanuelle Encrenaz:
An Inverse Method for Parametric Timed Automata. RP 2008: 29-46 - 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
