Remco Dijkman

Remco Dijkman

Auto-generated profile, based on publicly available information

Remco Dijkman

Eindhoven University of Technology

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 November 2008 in Information and Software Technology
Verified
Journal Article
Closed access
RDRemco M. Dijkman
Remco M. Dijkman
MDMarlon Dumas
Marlon Dumas
COChun Ouyang
Chun Ouyang

1 April 2011 in Information Systems
Verified
Journal Article
Closed access
RDRemco Dijkman
Remco Dijkman
MDMarlon Dumas
Marlon Dumas
BDBoudewijn van Dongen
Boudewijn van Dongen
RKReina Käärik
Reina Käärik
JMJan Mendling
Jan Mendling

1 December 2015 in International Journal of Information Management
Verified
Journal Article
Closed access
RDR.M. Dijkman
R.M. Dijkman
BSB. Sprenkels
B. Sprenkels
TPT. Peeters
T. Peeters
AJA. Janssen
A. Janssen

1 January 2009
Verified
Book Chapter
Closed access
PDF file
RDRemco Dijkman
Remco Dijkman
MDMarlon Dumas
Marlon Dumas
LGLuciano García-Bañuelos
Luciano García-Bañuelos

1 June 2011 in Expert Systems with Applications
Verified
Journal Article
Closed access
MRMarcello La Rosa
Marcello La Rosa
HRHajo A. Reijers
Hajo A. Reijers
Wil M.P. van der AalstWil M.P. van der Aalst
Wil M.P. van der Aalst
RDRemco M. Dijkman
Remco M. Dijkman
JMJan Mendling
Jan Mendling
LGLuciano García-Bañuelos
Luciano García-Bañuelos

1 March 2013 in ACM Transactions on Software Engineering and Methodology
Verified
Journal Article
Open access
MRMarcello La Rosa
Marcello La Rosa
MDMarlon Dumas
Marlon Dumas
RUReina Uba
Reina Uba
RDRemco Dijkman
Remco Dijkman
This article addresses the problem of constructing consolidated business process models out of collections of process models that share common fragments. The article considers the construction of unions of multiple models (called merged models ) as well as intersections (called digests ). Merged models are intended for analysts who wish to create a model that subsumes a collection of process models -- typically representing variants of the same underlying process -- with the aim of replacing the variants with the merged model. Digests, on the other hand, are intended for analysts who wish to identify the most recurring fragments across a collection of process models, so that they can focus their efforts on optimizing these fragments. The article presents an algorithm for computing merged models and an algorithm for extracting digests from a merged model. The merging and digest extraction algorithms have been implemented and tested against collections of process models taken from multiple application domains. The tests show that the merging algorithm produces compact models and scales up to process models containing hundreds of nodes. Furthermore, a case study conducted in a large insurance company has demonstrated the usefulness of the merging and digest extraction operators in a practical setting.