Computing and Information Systems - Research Publications

Permanent URI for this collection

http://hdl.handle.net/11343/350

Filters

2014 - 2015 2
Reset filters

Settings
Statistics
Citations
Author: Conforti, Raffaele × Author: Polyvyanyy, Artem × Type: Conference Paper ×

Search Results

Now showing 1 - 2 of 2
  • Item
    Thumbnail Image
    Process querying in apromore
    La Rosa, M ; Polyvyanyy, A ; Corno, L ; Conforti, R ; Raboczi, S ; Fortino, G (CEUR Workshop Proceedings, 2015-01-01)
    Process querying addresses the problem of automatically retrieving process models from collections thereof on the basis of user-defined queries. Process querying can be used to tackle problems of process compliance, reuse, redesign, and standardization [1].In this paper, we demonstrate a process querying environment that resulted from integrating Process Query Language (PQL) [2] into the Apromore process model reposi-tory [3]. PQL is a programming language based upon temporal logic with an intuitive SQL-like syntax for the specification of queries. The semantics of PQL queries is grounded in process model behavior. The intent of a PQL query is to retrieve process models from a collection of models based on the arrangements of activities and/or events in the process instances that these models describe. A screen cast that demonstrates the environment is available at https://youtu.be/S_U6frTWd3M. In the remainder of this paper, we provide an overview of PQL and its implementation,present the Apromore process model repository, discuss the integration of PQL into Apromore, and demonstrate the use of PQL in Apromore using a typical process querying scenario in the context of a process model collection taken from industry
  • Item
    Thumbnail Image
    The 4C spectrum of fundamental behavioral relations for concurrent systems
    Polyvyanyy, A ; Weidlich, M ; Conforti, R ; La Rosa, M ; Ter Hofstede, AHM (Springer International Publishing, 2014-01-01)
    The design of concurrent software systems, in particular process-aware information systems, involves behavioral modeling at various stages. Recently, approaches to behavioral analysis of such systems have been based on declarative abstractions defined as sets of behavioral relations. However, these relations are typically defined in an ad-hoc manner. In this paper, we address the lack of a systematic exploration of the fundamental relations that can be used to capture the behavior of concurrent systems, i.e., co-occurrence, conflict, causality, and concurrency. Besides the definition of the spectrum of behavioral relations, which we refer to as the 4C spectrum, we also show that our relations give rise to implication lattices. We further provide operationalizations of the proposed relations, starting by proposing techniques for computing relations in unlabeled systems, which are then lifted to become applicable in the context of labeled systems, i.e., systems in which state transitions have semantic annotations. Finally, we report on experimental results on efficiency of the proposed computations.