Thomas Chatain

Orcid: 0000-0002-1470-5074

According to our database1, Thomas Chatain authored at least 48 papers between 2004 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Taking Complete Finite Prefixes To High Level, Symbolically.
CoRR, 2023

Timed Alignments with Mixed Moves.
Proceedings of the Business Process Management Workshops, 2023

Taking Complete Finite Prefixes to High Level, Symbolically.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2023

2022
Pomset bisimulation and unfolding for reset Petri nets.
Inf. Comput., 2022

Timed Alignments.
Proceedings of the 4th International Conference on Process Mining, 2022

2021
Anti-alignments - Measuring the precision of process models and event logs.
Inf. Syst., 2021

Model-based trace variant analysis of event logs.
Inf. Syst., 2021

Optimized SAT encoding of conformance checking artefacts.
Computing, 2021

An A<sup>*</sup>-Algorithm for Computing Discounted Anti-Alignments in Process Mining.
Proceedings of the 3rd International Conference on Process Mining, 2021

A Discounted Cost Function for Fast Alignments of Business Processes.
Proceedings of the Business Process Management - 19th International Conference, 2021

2020
Concurrency in Boolean networks.
Nat. Comput., 2020

2019
A Tour in Process Mining: From Practice to Algorithmic Challenges.
Trans. Petri Nets Other Model. Concurr., 2019

Encoding Conformance Checking Artefacts in SAT.
Proceedings of the Business Process Management Workshops, 2019

Generalized Alignment-Based Trace Clustering of Process Behavior.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2019

2018
Most Permissive Semantics of Boolean Networks.
CoRR, 2018

Pomsets and Unfolding of Reset Petri Nets.
Proceedings of the Language and Automata Theory and Applications, 2018

Boolean Networks: Beyond Generalized Asynchronicity.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2018

2017
Preserving Partial-Order Runs in Parametric Time Petri Nets.
ACM Trans. Embed. Comput. Syst., 2017

Alignment-Based Trace Clustering.
Proceedings of the Conceptual Modeling - 36th International Conference, 2017

Goal-Driven Unfolding of Petri Nets.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

Aligning Modeled and Observed Behavior: A Compromise Between Computation Complexity and Quality.
Proceedings of the Advanced Information Systems Engineering, 2017

2016
Alignment-based Quality Metrics in Conformance Checking.
EMISA Forum, 2016

Alignment-based Quality Metrics in Conformance Checking (Summary).
Proceedings of the 7th International Workshop on Enterprise Modeling and Information Systems Architectures, 2016

A Unified Approach for Measuring Precision and Generalization Based on Anti-alignments.
Proceedings of the Business Process Management - 14th International Conference, 2016

Anti-alignments in Conformance Checking - The Dark Side of Process Models.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2016

2015
Non-atomic Transition Firing in Contextual Nets.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2015

2014
A Canonical Contraction for Safe Petri Nets.
Trans. Petri Nets Other Model. Concurr., 2014

Characterization of Reachable Attractors Using Petri Net Unfoldings.
Proceedings of the Computational Methods in Systems Biology, 2014

2013
Building Occurrence Nets from Reveals Relations.
Fundam. Informaticae, 2013

Avoiding Shared Clocks in Networks of Timed Automata.
Log. Methods Comput. Sci., 2013

Back in Time Petri Nets.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2013


Concurrency in Real-Time Distributed Systems, from Unfoldings to Implementability.
, 2013

2012
A concurrency-preserving translation from time Petri nets to networks of timed automata.
Formal Methods Syst. Des., 2012

2011
Building Tight Occurrence Nets from Reveals Relations.
Proceedings of the 11th International Conference on Application of Concurrency to System Design, 2011

2010
Unfolding-based diagnosis of systems with an evolving topology.
Inf. Comput., 2010

Factorization Properties of Symbolic Unfoldings of Colored Petri Nets.
Proceedings of the Applications and Theory of Petri Nets, 2010

2009
Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2009

Playing Games with Timed Games.
Proceedings of the 3rd IFAC Conference on Analysis and Design of Hybrid Systems, 2009

2008
An Inverse Method for Parametric Timed Automata.
Proceedings of the Second Workshop on Reachability Problems in Computational Models, 2008

2007
On the well-foundedness of adequate orders used for construction of complete unfolding prefixes.
Inf. Process. Lett., 2007

2006
Symbolic Unfoldings for Networks of Timed Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2006

Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets.
Proceedings of the Petri Nets and Other Models of Concurrency, 2006

2005
From Automata Networks to HMSCs: A Reverse Model Engineering Perspective.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2005

Time Supervision of Concurrent Systems Using Symbolic Unfoldings of Time Petri Nets.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2005

Models for the Supervision of Web Services Orchestration with Dynamic Changes.
Proceedings of the Telecommunications 2005: Advanced Industrial Conference on Telecommunications / Service Assurance with Partial and Intermittent Resources Conference / E-Learning on Telecommunications Workshop (AICT / SAPIR / ELETE 2005), 2005

2004
Symbolic Diagnosis of Partially Observable Concurrent Systems.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2004


  Loading...