<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>Comunicaciones en Congresos</title>
<link>https://hdl.handle.net/20.500.12412/2549</link>
<description/>
<pubDate>Wed, 06 May 2026 02:12:29 GMT</pubDate>
<dc:date>2026-05-06T02:12:29Z</dc:date>
<item>
<title>Decision-making support for input data in business processes according to former instances</title>
<link>https://hdl.handle.net/20.500.12412/5929</link>
<description>Decision-making support for input data in business processes according to former instances
Pérez Álvarez, José Miguel; Parody Núñez, María Luisa; Gómez-López, María Teresa; Martínez Gasca, Rafael; Ceravolo, Paolo
Business Processes facilitate the execution of a set of activities to achieve&#13;
the strategic plans of a company. During the execution of a business process model,&#13;
several decisions can be made that frequently involve the values of the input data of&#13;
certain activities. The decision regarding the value of these input data concerns not&#13;
only the correct execution of the business process in terms of consistency, but also&#13;
the compliance with the strategic plans of the company. Smart decision-support sys tems provide information by analyzing the process model and the business rules to&#13;
be satisfied, but other elements, such as the previous temporal variation of the data&#13;
during the former executed instances of similar processes, can also be employed to&#13;
guide the input data decisions at instantiation time.&#13;
Our proposal consists of learning the evolution patterns of the temporal variation of&#13;
the data values in a process model extracted from previous process instances by ap plying Constraint Programming techniques. The knowledge obtained is applied in a&#13;
Decision Support System (DSS) which helps in the maintenance of the alignment of&#13;
the process execution with the organizational strategic plans, through a framework&#13;
and a methodology. Finally, to present a proof of concept, the proposal has been&#13;
applied to a complete case study.
</description>
<pubDate>Fri, 01 Jan 2021 00:00:00 GMT</pubDate>
<guid isPermaLink="false">https://hdl.handle.net/20.500.12412/5929</guid>
<dc:date>2021-01-01T00:00:00Z</dc:date>
</item>
<item>
<title>Using Distributed CSPs to Model Business Processes Agreement in Software Multiprocess</title>
<link>https://hdl.handle.net/20.500.12412/5928</link>
<description>Using Distributed CSPs to Model Business Processes Agreement in Software Multiprocess
Parody Núñez, María Luisa; Gómez-López, María Teresa; Martínez Gasca, Rafael; Borrego, Diana
A business process consists of a set of activities which are performed in a coordination way to obtain an&#13;
objective. Sometimes the definition of this objective using only a classic business processes management is&#13;
not possible. When the choreography of the processes cannot be defined with a combination of tasks using&#13;
sequences, conditions, ’xor’, ’or’ and ’split’ control flow patterns, another representation and solution are&#13;
necessary to be used. This problem makes difficult the decision making in software management projects.&#13;
In this paper a way to describe a process agreement is described where the execution and the number of&#13;
tasks execution order of the Web Services cannot be defined. As a case study, the resource distribution in&#13;
a multiproject development environment is used. In this case, the processes have to achieve an agreement&#13;
in function of the business rules that relate the processes. In order to achieve this objective, the Distributed&#13;
Constraint Satisfaction Problems are used to model and solve this type of problems.
</description>
<pubDate>Sat, 01 Jan 2011 00:00:00 GMT</pubDate>
<guid isPermaLink="false">https://hdl.handle.net/20.500.12412/5928</guid>
<dc:date>2011-01-01T00:00:00Z</dc:date>
</item>
<item>
<title>Process Instance Query Language to Include Process Performance Indicators in DMN</title>
<link>https://hdl.handle.net/20.500.12412/5927</link>
<description>Process Instance Query Language to Include Process Performance Indicators in DMN
Pérez Álvarez, José Miguel; Gómez-López, María Teresa; Parody Núñez, María Luisa; Martínez Gasca, Rafael
Companies are increasingly incorporating commercial Business Process Management Systems (BPMSs) as mechanisms to automate their daily procedures. These BPMSs manage&#13;
the information related to the instances that flow through the&#13;
model (business data), and recover the information concerning the process performance (Process Performance Indicators).&#13;
Process Performance Indicators (PPIs) tend to be used for the&#13;
detection of possible deviations of expected behaviour, and help in&#13;
the post-mortem analysis and redesign by improving the goals of&#13;
the processes. However, not only are PPIs important in terms of&#13;
their ability to measure and detect a derivation, but they should&#13;
also be included at decision points to make the business processes&#13;
more adaptable to the process reality at runtime. In this paper,&#13;
we propose a complete solution that allows the incorporation of&#13;
the PPIs into decision tasks, following the Decision Model and&#13;
Notation (DMN) standard, with the aim of enriching the decisions&#13;
that can be taken during the process execution. Our proposal&#13;
firstly includes an extension of the decision rule grammar of the&#13;
DMN standard, by incorporating the definition and the use of a&#13;
Process Instance Query Language (PIQL) that offers information&#13;
about the instances related to the PPIs involved. In order to&#13;
achieve this objective, a framework has also been developed to&#13;
support the enrichment of process instance query expressions&#13;
(PIQEs). This framework combines a set of mature technologies&#13;
to evaluate the decisions about PPIs at runtime. As an illustration&#13;
a real sample has been used whose decisions are improved thanks&#13;
to the incorporation of the PPIs at runtime.
</description>
<pubDate>Fri, 01 Jan 2016 00:00:00 GMT</pubDate>
<guid isPermaLink="false">https://hdl.handle.net/20.500.12412/5927</guid>
<dc:date>2016-01-01T00:00:00Z</dc:date>
</item>
<item>
<title>Extending BPMN 2.0 for Modelling the Combination of Activities That Involve Data Constraints</title>
<link>https://hdl.handle.net/20.500.12412/5926</link>
<description>Extending BPMN 2.0 for Modelling the Combination of Activities That Involve Data Constraints
Parody Núñez, María Luisa; Gómez-López, María Teresa; Martínez Gasca, Rafael
The combination of activities to achieve optimal goals some times has a complex solution. Business Process Model and Notation&#13;
(BPMN) 2.0 facilitates the modelling of business processes by providing&#13;
new artifacts, such as various types of tasks, source of data and relations&#13;
between tasks. Sometimes, although the order of the activities can be&#13;
known, the concrete data values that the activities interchange to opti mize their behaviour needs to be found, specially when input parameters&#13;
of an activity affect to the input parameter of the others. Taking into ac count the lack of priority and clear sequential relationship between the&#13;
activities of such combination, a deep analysis of possible models and&#13;
data input values for the activities is necessary. For that reason, an ex tension of BPMN 2.0 with a new type of sub-process and its associated&#13;
marker is proposed. The aim of this new sub-process is to define, in an&#13;
easy way, a combination of several activities to find out, in an automated&#13;
way, the concrete values of the data handling that optimize an overall&#13;
objective.
</description>
<pubDate>Sun, 01 Jan 2012 00:00:00 GMT</pubDate>
<guid isPermaLink="false">https://hdl.handle.net/20.500.12412/5926</guid>
<dc:date>2012-01-01T00:00:00Z</dc:date>
</item>
</channel>
</rss>
