1,721,096 research outputs found
Foundations of Collaborative DECLARE
No full textCollaborative work processes are widespread, and call for sophisticated modelling techniques to guarantee that the in-focus process is able to suitably handle all the relevant ways in which external, uncontrollable participants can influence the overall behaviour. In the presence of external actors, one needs to distinguish the internal, controllable nondeterminism of the in-focus process from the uncontrollable nondeterminism of external participants. While collaborative processes have been previously studied in the context of declarative processes, where specifications distinguish how different sources of control interact, no study along this line exists in the context of the DECLARE declarative process modeling framework. To this end, we introduce “collaborative DECLARE ” (coDECLARE), where activities are assigned to the internal orchestrator or to external participants, and constraints are partitioned into conditions on how the external participants can interact with the in-focus process, and conditions that must be guaranteed by the in-focus process itself, framing the resulting specifications in style of assume-guarantee (behavioral) contracts. We discuss the conceptual and explain how central tasks such as that of DECLARE consistency and enactment have to be revised for coDECLARE. Moreover, we show how the resulting tasks can be encoded into corresponding realisability and reactive synthesis tasks for LTL specifications on finite traces
delphic: Practical DEL Planning via Possibilities
No full textDynamic Epistemic Logic (DEL) provides a framework for epistemic planning that is capable of representing non-deterministic actions, partial observability, higher-order knowledge and both factual and epistemic change. The high expressivity of DEL challenges existing epistemic planners, which typically can handle only restricted fragments of the whole framework. The goal of this work is to push the envelop of practical DEL planning, ultimately aiming for epistemic planners to be able to deal with the full range of features offered by DEL. Towards this goal, we question the traditional semantics of DEL, defined in terms on Kripke models. In particular, we propose an equivalent semantics defined using, as main building block, so-called possibilities: non well-founded objects representing both factual properties of the world, and what agents consider to be possible. We call the resulting framework delphic. We argue that delphic indeed provides a more compact representation of epistemic states. To substantiate this claim, we implement both approaches in ASP and we set up an experimental evaluation to compare delphic with the traditional, Kripke-based approach. The evaluation confirms that delphic outperforms the traditional approach in space and time
Foundations of Reactive Synthesis for Declarative Process Specifications
No full textGiven a specification of Linear-time Temporal Logic interpreted over finite traces (LTLf), the reactive synthesis problem asks to find a finitely-representable, terminating controller that reacts to the uncontrollable actions of an environment in order to enforce a desired system specification. In this paper we study, for the first time, the foundations of reactive synthesis for DECLARE, a well-established declarative, pattern-based business process modelling language grounded in LTLf. We provide a threefold contribution. First, we define a reactive synthesis problem for DECLARE. Second, we show how an arbitrary DECLARE specification can be polynomially encoded into an equivalent pure-past one in LTLf, and exploit this to define an EXPTIME algorithm for DECLARE synthesis. Third, we derive a symbolic version of this algorithm, by introducing a novel translation of pure-past temporal formulas into symbolic deterministic finite automata
Integrating BPMN and DMN: Modeling and Analysis
Full text linkThe operational backbone of modern organizations is the target of business process management, where business process models are produced to describe how the organization should react to events and coordinate the execution of activities so as to satisfy its business goals. At the same time, operational decisions are made by considering internal and external contextual factors, according to decision models that are typically based on declarative, rule-based specifications that describe how input configurations correspond to output results. The increasing importance and maturity of these two intertwined dimensions, those of processes and decisions, have led to a wide range of data-aware models and associated methodologies, such as BPMN for processes and DMN for operational decisions. While it is important to analyze these two aspects independently, it has been pointed out by several authors that it is also crucial to analyze them in combination. In this paper, we provide a native, formal definition of DBPMN models, namely data-aware and decision-aware processes that build on BPMN and DMN S-FEEL, illustrating their use and giving their formal execution semantics via an encoding into Data Petri nets (DPNs). By exploiting this encoding, we then build on previous work in which we lifted the classical notion of soundness of processes to this richer, data-aware setting, and show how the abstraction and verification techniques that were devised for DPNs can be directly used for DBPMN models. This paves the way towards even richer forms of analysis, beyond that of assessing soundness, that are based on the same technique
Repairing Soundness Properties in Data-Aware Processes
No full textWithin the growing area of data-aware processes, Data Petri nets (DPNs) with arithmetic data have recently gained popularity thanks to their ability to balance simplicity with expressiveness. DPNs can be automatically mined from event data, but these process discovery techniques typically come without any correctness guarantees. In particular, the generated models may violate the crucial property of data-aware soundness. While data-aware soundness can be checked automatically for a large class of models, nothing is known about how to repair such processes once a violation is detected. In this paper we are concerned with repairing DPNs so that the refined model satisfies the desired soundness properties. Our approach is based on conservative behavioural changes, which are minimally invasive in the sense that the behaviour of the repaired model coincides with that of the original model except for (prefixes of) traces that caused the violation. We show experimentally that the approach can be used to repair unsound DPNs from the literature
Regulation of A1 adenosine receptor functioning induced by P2Y1 purinergic receptor activation in human astroglial cells
No full textIn the rat brain, a heteromeric association between adenosine A(1) and purinergic P2Y(1) receptors has been demonstrated. It is suggested that this association plays an important role in the control of purine-mediated responses during pathophysiological conditions. Recently, we have demonstrated that these receptors colocalize on glutamatergic synaptic and astroglial membranes in rat hippocampus and reciprocally interact, thus modulating their functional responses at the G protein coupling level. In the present work, by means of immunoprecipitation studies, we demonstrated that A(1) and P2Y(1) receptors are present in human astroglial cells (ADF) and aggregate to form a multimeric complex. P2Y(1) receptor activation by its agonist, 2-methylthio-adenosine 5'-diphosphate (MeSADP), induced a time-dependent reduction in agonist-mediated A(1) receptor functional responses, causing a drop in A(1) receptor agonist potency to promote receptor-G protein coupling and to inhibit the adenylate cyclase pathway. These effects appeared to be selectively mediated by P2Y(1) receptor activation and probably occurred as a consequence of a direct receptor-receptor interaction at the plasma membrane level. These results indicated that P2Y(1) receptor activation induces A(1) receptor heterologous desensitization. The interaction between A(1) and P2Y(1) receptors may play an important role in the purinergic signaling cascade in astrocytes, which are involved in cell-to-cell communication and in control of synaptic transmission, particularly during pathological conditions, when large amounts of purines are released
Declarative Process Specifications: Reasoning, Discovery, Monitoring
Full text linkThe declarative specification of business processes is based upon the elicitation of behavioural rules that constrain the legal executions of the process. The carry-out of the process is up to the actors, who can vary the execution dynamics as long as they do not violate the constraints imposed by the declarative model. The constraints specify the conditions that require, permit or forbid the execution of activities, possibly depending on the occurrence (or absence) of other ones. In this chapter, we review the main techniques for process mining using declarative process specifications, which we call declarative process mining. In particular, we focus on three fundamental tasks of (1) reasoning on declarative process specifications, which is in turn instrumental to their (2) discovery from event logs and their (3) monitoring against running process executions to promptly detect violations. We ground our review on Declare, one of the most widely studied declarative process specification languages. Thanks to the fact that Declare can be formalized using temporal logics over finite traces, we exploit the automata-theoretic characterization of such logics as the core, unified algorithmic basis to tackle reasoning, discovery, and monitoring. We conclude the chapter with a discussion on recent advancements in declarative process mining, considering in particular multi-perspective extensions of the original approach
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
- …
