Papers by Shaya Pourmirza
Process discovery algorithms aim to capture process orchestration models from event logs. These a... more Process discovery algorithms aim to capture process orchestration models from event logs. These algorithms have been designed for logs in which events that belong to the same case are related to each other-and to that case-by means of a unique case identifier. However, in service oriented systems these case identifiers are usually not stored beyond request-response pairs, which makes it hard to relate events that belong to the same case. This is known as the correlation challenge. This paper addresses the correlation challenge by introducing a new process discovery algorithm, called the correlation miner, that facilitates process discovery when events are not associated with a case identifier. Experiments performed on both synthetic and real-world event logs show the applicability of the correlation miner.
During the execution of a service collaboration, a party may drop out for technical reasons or bu... more During the execution of a service collaboration, a party may drop out for technical reasons or business reasons. In that case, that party must be replaced in the collaboration, at run-time, by a new party. Ideally, the new party can pick up where the old party left. Currently, algorithms exist that can help with the selection and adaptation of the new party to incorporate it in the collaboration. Also, algorithms exist that can help to pick up a business process where it left off. However, to the best of our knowledge, no algorithms exist that can help a new party in a collaboration to pick up where the old party left off. This paper fills that gap, by providing an overview of the components and operations that are necessary to enable a party in a collaboration to be replaced by another party at run-time. In addition the paper presents two strategies, and the corresponding algorithms, that realize the architecture. As a proof-of-concept, a tool was developed that implements both strategies.
Although extensive research has been carried out on virtual learning environments and the role of... more Although extensive research has been carried out on virtual learning environments and the role of groups and communities in social networks, few studies exist which adequately cover the relationship between these two domains In this paper, the authors demonstrate the effectiveness of integrating these two environments by creating a novel prototype and conducting a preliminary pilot evaluation session. For the prototype system, a Facebook Group was utilised as a repository for learning content and the Open Wonderland platform was selected as a mixed reality intelligent environment for 3D virtual collaborative activities. Since tacit knowledge can be gained via collaborative group-based activities and discussions, a new Wonderland module was developed to integrate this platform with the Facebook group. Similarly, explicit knowledge can be learned directly via the prepared materials which are provided within the group repository. We hope to demonstrate that this approach can provide greater accessibility to the learning content since it can be accessed from both the 3D world and the 2D Facebook Group. In other words, this system can support both synchronous interaction as well as asynchronous data retrieval. Finally, the prototype system was evaluated by means of a two-hour task-based assessment and user-satisfaction questionnaire. We present the key findings from this pilot study (which were very encouraging), and propose further ideas for the future refinement of the concepts presented in this paper.
Although broad research has been done on virtual learning environments and the role of communitie... more Although broad research has been done on virtual learning environments and the role of communities in social networks, few studies exist which sufficiently support the relationship between these two domains. In this paper, the authors demonstrate the effectiveness of integrating these two environments by creating a novel prototype and conducting a preliminary pilot evaluation session. For the prototype system, a Facebook Group was utilised as a repository for learning content and the Open Wonderland platform was selected as a mixed reality intelligent environment for 3D virtual collaborative activities. Finally, this prototype was evaluated by means of a two-hour task-based assessment and user-satisfaction questionnaire.
inproceedings by Shaya Pourmirza
articles by Shaya Pourmirza
Books by Shaya Pourmirza
During the execution of an inter-organizational business-to-business (B2B) collaboration,
a colla... more During the execution of an inter-organizational business-to-business (B2B) collaboration,
a collaborating party may drop out for technical reasons or for business reasons. In such
a case, the leaving party must be replaced, at runtime, by a new party. Ideally, the new
party can pick up where the old party left off.
Currently, algorithms exist that can help with the runtime selection of the new party
in order to incorporate it in the collaboration. Also, several studies have investigated the
theoretical foundations of dynamic business process changes within a single enterprise.
However, very few attempts have been made which can help a new party in a collaboration
to pick up where the old party left off. Designing such techniques constitutes a challenge
due to each party’s autonomy and to privacy policies that emerge in the context of a
collaboration.
This PhD dissertation aims to address this challenge by providing an overview of
the components, algorithms, operations and techniques that are necessary to enable a
party in a collaboration to be replaced by another party at runtime. Accordingly, this
dissertation consists of the following three research activities.
Firstly, it presents a descriptive reference architecture for Business Process
Management Systems (BPMS) that facilitates switching parties in inter-organizational
collaborations. This reference architecture, called BPMS-RA, has been designed based
on a systematic literature survey of existing BPMS architectures. The main purpose of the development of BPMS-RA is twofold: (i) it can be employed as an architectural
template for developing a new BPMS by offering two distinct levels of aggregation for
the components that comprise a BPMS architecture, and (ii) it enables the analysis and
comparison of existing BPMS in terms of their functionalities.
Secondly, it introduces a strategy for adapting an inter-organizational collaboration
when a global view on the collaboration exists. In this strategy we assume that it
is possible to have a central party, called the global controller, that can observe all
communication and be the intermediary between all collaborating parties when one
party is replaced by another. In this case there is also a model that describes all
communications, which is called the choreography model. This research contributes to
the body of knowledge by proposing a set of algorithms, operations and techniques (such
as rollback and compensation) that facilitate the party switch in the case where a global
controller and a choreography model exist.
Finally, it describes a strategy for adapting an inter-organizational collaboration when
a global view on the collaboration does not exist. In this strategy we assume that there
is no global controller in a collaboration and no choreography model of the collaboration.
The main challenge in this case is to capture the choreography model by relating the
past communications among the collaborating parties that belong to the same thread
of collaboration. This challenge is also known as the correlation challenge. This study
addresses this challenge by introducing a new process discovery algorithm, called the
correlation miner, that facilitates discovery when events (i.e., messages) are not associated
with a case identifier.
In order to demonstrate the feasibility of these studies, we have developed prototype
tools that implement our solutions and we evaluated them in a practical setting.
Additional experiments were performed on both synthetic and real-world process models
in order to determine the extent to which our proposed solutions are applicable.
Uploads
Papers by Shaya Pourmirza
inproceedings by Shaya Pourmirza
articles by Shaya Pourmirza
Books by Shaya Pourmirza
a collaborating party may drop out for technical reasons or for business reasons. In such
a case, the leaving party must be replaced, at runtime, by a new party. Ideally, the new
party can pick up where the old party left off.
Currently, algorithms exist that can help with the runtime selection of the new party
in order to incorporate it in the collaboration. Also, several studies have investigated the
theoretical foundations of dynamic business process changes within a single enterprise.
However, very few attempts have been made which can help a new party in a collaboration
to pick up where the old party left off. Designing such techniques constitutes a challenge
due to each party’s autonomy and to privacy policies that emerge in the context of a
collaboration.
This PhD dissertation aims to address this challenge by providing an overview of
the components, algorithms, operations and techniques that are necessary to enable a
party in a collaboration to be replaced by another party at runtime. Accordingly, this
dissertation consists of the following three research activities.
Firstly, it presents a descriptive reference architecture for Business Process
Management Systems (BPMS) that facilitates switching parties in inter-organizational
collaborations. This reference architecture, called BPMS-RA, has been designed based
on a systematic literature survey of existing BPMS architectures. The main purpose of the development of BPMS-RA is twofold: (i) it can be employed as an architectural
template for developing a new BPMS by offering two distinct levels of aggregation for
the components that comprise a BPMS architecture, and (ii) it enables the analysis and
comparison of existing BPMS in terms of their functionalities.
Secondly, it introduces a strategy for adapting an inter-organizational collaboration
when a global view on the collaboration exists. In this strategy we assume that it
is possible to have a central party, called the global controller, that can observe all
communication and be the intermediary between all collaborating parties when one
party is replaced by another. In this case there is also a model that describes all
communications, which is called the choreography model. This research contributes to
the body of knowledge by proposing a set of algorithms, operations and techniques (such
as rollback and compensation) that facilitate the party switch in the case where a global
controller and a choreography model exist.
Finally, it describes a strategy for adapting an inter-organizational collaboration when
a global view on the collaboration does not exist. In this strategy we assume that there
is no global controller in a collaboration and no choreography model of the collaboration.
The main challenge in this case is to capture the choreography model by relating the
past communications among the collaborating parties that belong to the same thread
of collaboration. This challenge is also known as the correlation challenge. This study
addresses this challenge by introducing a new process discovery algorithm, called the
correlation miner, that facilitates discovery when events (i.e., messages) are not associated
with a case identifier.
In order to demonstrate the feasibility of these studies, we have developed prototype
tools that implement our solutions and we evaluated them in a practical setting.
Additional experiments were performed on both synthetic and real-world process models
in order to determine the extent to which our proposed solutions are applicable.
a collaborating party may drop out for technical reasons or for business reasons. In such
a case, the leaving party must be replaced, at runtime, by a new party. Ideally, the new
party can pick up where the old party left off.
Currently, algorithms exist that can help with the runtime selection of the new party
in order to incorporate it in the collaboration. Also, several studies have investigated the
theoretical foundations of dynamic business process changes within a single enterprise.
However, very few attempts have been made which can help a new party in a collaboration
to pick up where the old party left off. Designing such techniques constitutes a challenge
due to each party’s autonomy and to privacy policies that emerge in the context of a
collaboration.
This PhD dissertation aims to address this challenge by providing an overview of
the components, algorithms, operations and techniques that are necessary to enable a
party in a collaboration to be replaced by another party at runtime. Accordingly, this
dissertation consists of the following three research activities.
Firstly, it presents a descriptive reference architecture for Business Process
Management Systems (BPMS) that facilitates switching parties in inter-organizational
collaborations. This reference architecture, called BPMS-RA, has been designed based
on a systematic literature survey of existing BPMS architectures. The main purpose of the development of BPMS-RA is twofold: (i) it can be employed as an architectural
template for developing a new BPMS by offering two distinct levels of aggregation for
the components that comprise a BPMS architecture, and (ii) it enables the analysis and
comparison of existing BPMS in terms of their functionalities.
Secondly, it introduces a strategy for adapting an inter-organizational collaboration
when a global view on the collaboration exists. In this strategy we assume that it
is possible to have a central party, called the global controller, that can observe all
communication and be the intermediary between all collaborating parties when one
party is replaced by another. In this case there is also a model that describes all
communications, which is called the choreography model. This research contributes to
the body of knowledge by proposing a set of algorithms, operations and techniques (such
as rollback and compensation) that facilitate the party switch in the case where a global
controller and a choreography model exist.
Finally, it describes a strategy for adapting an inter-organizational collaboration when
a global view on the collaboration does not exist. In this strategy we assume that there
is no global controller in a collaboration and no choreography model of the collaboration.
The main challenge in this case is to capture the choreography model by relating the
past communications among the collaborating parties that belong to the same thread
of collaboration. This challenge is also known as the correlation challenge. This study
addresses this challenge by introducing a new process discovery algorithm, called the
correlation miner, that facilitates discovery when events (i.e., messages) are not associated
with a case identifier.
In order to demonstrate the feasibility of these studies, we have developed prototype
tools that implement our solutions and we evaluated them in a practical setting.
Additional experiments were performed on both synthetic and real-world process models
in order to determine the extent to which our proposed solutions are applicable.