activity
20162023
most citedConcurrency in Boolean networks

24 citations · 40 across the 5 of their papers we have counts for

collaborators

7 papers

cs.LO2023

Taking Complete Finite Prefixes To High Level, Symbolically

Nick Würdemann, Thomas Chatain, Stefan Haar +1

Unfoldings are a well known partial-order semantics of P/T Petri nets that can be applied to various model checking or verification problems. For high-level Petri nets, the so-call…

cs.FL2022★ 1 cited

Timed Alignments with Mixed Moves

Neha Rino, Thomas Chatain

The subject of this paper is to study conformance checking for timed models, that is, process models that consider both the sequence of events in a process as well as the timestamp…

cs.FL2022

Timed Alignments

Thomas Chatain, Neha Rino

The subject of this paper is to study conformance checking for timed models, that is, process models that consider both the sequence of events in a process as well as the timestamp…

cs.AI2019★ 13 cited

Anti-Alignments -- Measuring The Precision of Process Models and Event Logs

Thomas Chatain, Mathilde Boltenhagen, Josep Carmona

Processes are a crucial artefact in organizations, since they coordinate the execution of activities so that products and services are provided. The use of models to analyse the un…

cs.LO2019★ 24 cited

Concurrency in Boolean networks

Thomas Chatain, Stefan Haar, Juraj Kolčák +2

Boolean networks (BNs) are widely used to model the qualitative dynamics of biological systems. Besides the logical rules determining the evolution of each component with respect t…

cs.FL2018

Most Permissive Semantics of Boolean Networks

Thomas Chatain, Stefan Haar, Juraj Kol{č}ák +1

As shown in (http://dx.doi.org/10.1101/2020.03.22.998377), the usual update modes of Boolean networks (BNs), including synchronous and (generalized) asynchronous, fail to capture b…