( en | de | ru )

 

Disambiguation of "Hildebrandt, Thomas T."

Author of the publication

copydeleteadd this publication to your clipboard
Declarative process mining for DCR graphs.

, , , and . SAC, page 759-764. ACM, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Thomas Hildebrandt

Thomas Hildebrandt

Thomas Hildebrandt

Thomas Hildebrandt

Thomas Hildebrandt

 

Other publications of authors with the same name

Formalising Business Process Execution with Bigraphs and Reactive XML., , and . COORDINATION, volume 4038 of Lecture Notes in Computer Science, page 113-129. Springer, (2006)Hybrid Process Technologies in the Financial Sector: The Case of BRFkredit., , , and . Business Process Management Cases, Springer, (2018)Preface to special issue: Expressiveness in Concurrency 2008., and . Math. Struct. Comput. Sci., 20 (1): 1-2 (2010)"We Would Never Write That Down": Classifications of Unemployed and Data Challenges for AI., , , and . Proc. ACM Hum. Comput. Interact., 5 (CSCW1): 102:1-102:26 (2021)A process-oriented event-based programming language., and . DEBS, page 377-378. ACM, (2012)Digitalising the General Data Protection Regulation with Dynamic Condition Response Graphs., , , , , , and . BPM (Industry Track), volume 1985 of CEUR Workshop Proceedings, page 124-134. CEUR-WS.org, (2017)Concurrency and Asynchrony in Declarative Workflows., , and . BPM, volume 9253 of Lecture Notes in Computer Science, page 72-89. Springer, (2015)Exformatics Declarative Case Management Workflows as DCR Graphs., , , and . BPM, volume 8094 of Lecture Notes in Computer Science, page 339-354. Springer, (2013)Declarative Choreographies and Liveness., , , , and . FORTE, volume 11535 of Lecture Notes in Computer Science, page 129-147. Springer, (2019)Preface., and . CMCIM/GETCO@CONCUR, volume 100 of Electronic Notes in Theoretical Computer Science, page 3. Elsevier, (2003)