Weak, Strong and Dynamic Controllability of Access-Controlled Workflows Under Conditional Uncertainty

A workflow (WF) is a formal description of a business process in which single atomic work units (tasks), organized in a partial order, are assigned to processing entities (agents) in order to achieve some business goal(s). A workflow management system must coordinate the execution of tasks and WF instances. Usually, the assignment of tasks to agents is accomplished by external constraints not represented in a WF. An access-controlled workflow (ACWF) extends a classical WF by explicitly representing agent availability for each task and authorization constraint. Authorization constraints model which users are authorized for which tasks depending on \u201cwho did what\u201d. Recent research has addressed temporal controllability of WFs under conditional and temporal uncertainty. However, controllability analysis for ACWFs under conditional uncertainty has never been addressed before. In this paper, we define weak, strong and dynamic controllability of ACWFs under conditional uncertainty, we present algorithmic approaches to address each of these types of controllability, and we synthesize execution strategies that specify which user has been (or will be) assigned to which task

Hybrid SAT-Based Consistency Checking Algorithms for Simple Temporal Networks with Decisions

A Simple Temporal Network (STN) consists of time points modeling temporal events and constraints modeling the minimal and maximal temporal distance between them. A Simple Temporal Network with Decisions (STND) extends an STN by adding decision time points to model temporal plans with decisions. A decision time point is a special kind of time point that once executed allows for deciding a truth value for an associated Boolean proposition. Furthermore, STNDs label time points and constraints by conjunctions of literals saying for which scenarios (i.e., complete truth value assignments to the propositions) they are relevant. Thus, an STND models a family of STNs each obtained as a projection of the initial STND onto a scenario. An STND is consistent if there exists a consistent scenario (i.e., a scenario such that the corresponding STN projection is consistent). Recently, a hybrid SAT-based consistency checking algorithm (HSCC) was proposed to check the consistency of an STND. Unfortunately, that approach lacks experimental evaluation and does not allow for the synthesis of all consistent scenarios. In this paper, we propose an incremental HSCC algorithm for STNDs that (i) is faster than the previous one and (ii) allows for the synthesis of all consistent scenarios and related early execution schedules (offline temporal planning). Then, we carry out an experimental evaluation with KAPPA, a tool that we developed for STNDs. Finally, we prove that STNDs and disjunctive temporal networks (DTNs) are equivalent

Temporal and Resource Controllability of Workflows Under Uncertainty

Workflow technology has long been employed for the modeling, validation and execution of business processes. A workflow is a formal description of a business process in which single atomic work units (tasks), organized in a partial order, are assigned to processing entities (agents) in order to achieve some business goal(s). Workflows can also employ workflow paths (projections with respect to a total truth value assignment to the Boolean variables associated to the conditional split connectors) in order (not) to execute a subset of tasks. A workflow management system coordinates the execution of tasks that are part of workflow instances such that all relevant constraints are eventually satisfied. Temporal workflows specify business processes subject to temporal constraints such as controllable or uncontrollable durations, delays and deadlines. The choice of a workflow path may be controllable or not, considered either in isolation or in combination with uncontrollable durations. Access controlled workflows specify workflows in which users are authorized for task executions and authorization constraints say which users remain authorized to execute which tasks depending on who did what. Access controlled workflows may consider workflow paths too other than the uncertain availability of resources (users, throughout this thesis). When either a task duration or the choice of the workflow path to take or the availability of a user is out of control, we need to verify that the workflow can be executed by verifying all constraints for any possible combination of behaviors arising from the uncontrollable parts. Indeed, users might be absent before starting the execution (static resiliency), they can also become so during execution (decremental resiliency) or they can come and go throughout the execution (dynamic resiliency). Temporal access controlled workflows merge the two previous formalisms by considering several kinds of uncontrollable parts simultaneously. Authorization constraints may be extended to support conditional and temporal features. A few years ago some proposals addressed the temporal controllability of workflows by encoding them into temporal networks to exploit "off-the-shelf" controllability checking algorithms available for them. However, those proposals fail to address temporal controllability where the controllable and uncontrollable choices of workflow paths may mutually influence one another. Furthermore, to the best of my knowledge, controllability of access controlled workflows subject to uncontrollable workflow paths and algorithms to validate and execute dynamically resilient workflows remain unexplored. To overcome these limitations, this thesis goes for exact algorithms by addressing temporal and resource controllability of workflows under uncertainty. I provide several new classes of (temporal) constraint networks and corresponding algorithms to check their controllability. After that, I encode workflows into these new formalisms. I also provide an encoding into instantaneous timed games to model static, decremental and dynamic resiliency and synthesize memoryless execution strategies. I developed a few tools with which I carried out some initial experimental evaluations

Conditional Simple Temporal Networks with Uncertainty and Decisions

A Conditional Simple Temporal Network with Uncertainty (CSTNU) is a formalism able to model temporal plans subject to both conditional constraints and uncertain durations. The combination of these two characteristics represents the uncontrollable part of the network. That is, before the network starts executing, we do not know completely which time points and constraints will be taken into consideration nor how long the uncertain durations will last. Dynamic Controllability (DC) implies the existence of a strategy scheduling the time points of the network in real time depending on how the uncontrollable part behaves. Despite all this, CSTNUs fail to model temporal plans in which a few conditional constraints are under control and may therefore influence (or be influenced by) the uncontrollable part. To bridge this gap, this paper proposes Conditional Simple Temporal Networks with Uncertainty and Decisions (CSTNUDs) which introduce decision time points into the specification in order to operate on this conditional part under control. We model the dynamic controllability checking (DC-checking) of a CSTNUD as a two-player game in which each player makes his moves in his turn at a specific time instant. We give an encoding into timed game automata for a sound and complete DC-checking. We also synthesize memoryless execution strategies for CSTNUDs proved to be DC and carry out an experimental evaluation with Esse, a tool that we have designed for CSTNUDs to make the approach fully automated

Consistency checking of STNs with decisions: Managing temporal and access-control constraints in a seamless way

A Simple Temporal Network (STN) consists of time points modeling temporal events and constraints modeling the minimal and maximal temporal distance between them. A Simple Temporal Network with Decisions (STND) extends an STN to model temporal plans with decisions. STNDs label time points and constraints by conjunctions of literals saying for which scenarios (i.e., complete truth value assignments to the propositions) they are relevant. In this paper, we deal with the use of STNDs for modeling and synthesizing execution strategies. We propose an incremental hybrid SAT-based consistency checking algorithm for STNDs that is faster than the one previously proposed and allows for the synthesis of all consistent scenarios and related early execution schedules (offline temporal planning). We carry out an experimental evaluation with Kappa, a tool that we developed for STNDs. We also show that any STND can be easily translated into a disjunctive temporal network and vice versa

Adaptive Time- and Process-Aware Information Systems

For the digitized enterprise the proper handling of the temporal aspects of its business processes is vital. Delivery times, appointments and deadlines must be met, processing times and durations be monitored, and optimization objectives shall be pursued. However, contemporary Process-Aware Information Systems (PAISs)--the go-to solution for the computer-aided support of business processes—still lack a sophisticated support of the time perspective. Hence, there is a high demand for a more profound support of temporal aspects in PAISs. Accordingly, both the specification and the operational support of temporal aspects constitute fundamental challenges for the further development and dissemination of PAISs. The aim of this thesis is to propose a framework for supporting the time perspective of business processes in PAISs. As PAISs enable the design, execution and evolution of business processes, the designated framework must support these three fundamental phases of the process life cycle. The ATAPIS framework proposed by this thesis essentially comprises three major com-ponents. First, a universal and comprehensive set of time patterns is provided. Respective time patterns represent temporal concepts commonly found in business processes and are based on empirical evidence. In particular, they provide a universal and comprehensive set of notions for describing temporal aspects in business processes. Moreover, a precise formal semantics for each of the time patterns is provided based on an in-depth analysis of a large set of real-world use cases. Respective formal semantics enable the proper integration of the time patterns into PAISs. In turn, the latter will allow for the specification of time-aware process schemas. Second, a generic framework for implementing the time patterns based on their formal semantics is developed. The framework and its techniques enable the verification of time-aware process schemas regarding their temporal consistency, i. e., their ability to be successfully executed without violating any of their temporal constraints. Subsequently, the framework is extended to consider advanced aspects like the contingent nature of activity durations and alternative execution paths as well. Moreover, an algorithm as well as techniques for executing and monitoring time-aware process instances in PAISs is provided. Based on the presented concepts, it becomes possible to ensure that a time-aware process instance may be executed without violating any of its temporal constraints. Third, a set of change operations for dynamically modifying time-aware process instances during run time is suggested. Respective change operations ensure that a modified time-aware process instance remains temporally consistent after the respective modification. Moreover, to reduce the complexity involved when applying multiple change operations a sophisticated approximation-based technique is presented. Overall, the developed change operations allow providing the flexibility required by business processes in practice. Altogether, the ATAPIS framework provides fundamental concepts, techniques and algorithms for integrating the time perspective into PAISs. As beauty of this framework the specification, execution and evolution of business processes is supported by an integrated approach

A proposal for a global task planning architecture using the RoboEarth cloud based framework

As robotic systems become more and more capable of assisting in human domains, methods are sought to compose robot executable plans from abstract human instructions. To cope with the semantically rich and highly expressive nature of human instructions, Hierarchical Task Network planning is often being employed along with domain knowledge to solve planning problems in a pragmatic way. Commonly, the domain knowledge is specific to the planning problem at hand, impeding re-use. Therefore this paper conceptualizes a global planning architecture, based on the worldwide accessible RoboEarth cloud framework. This architecture allows environmental state inference and plan monitoring on a global level. To enable plan re-use for future requests, the RoboEarth action language has been adapted to allow semantic matching of robot capabilities with previously composed plans

Tackling Dierent Business Process Perspectives

Business Process Management (BPM) has emerged as a discipline to design, control, analyze, and optimize business operations. Conceptual models lie at the core of BPM. In particular, business process models have been taken up by organizations as a means to describe the main activities that are performed to achieve a specific business goal. Process models generally cover different perspectives that underlie separate yet interrelated representations for analyzing and presenting process information. Being primarily driven by process improvement objectives, traditional business process modeling languages focus on capturing the control flow perspective of business processes, that is, the temporal and logical coordination of activities. Such approaches are usually characterized as \u201cactivity-centric\u201d. Nowadays, activity-centric process modeling languages, such as the Business Process Model and Notation (BPMN) standard, are still the most used in practice and benefit from industrial tool support. Nevertheless, evidence shows that such process modeling languages still lack of support for modeling non-control-flow perspectives, such as the temporal, informational, and decision perspectives, among others. This thesis centres on the BPMN standard and addresses the modeling the temporal, informational, and decision perspectives of process models, with particular attention to processes enacted in healthcare domains. Despite being partially interrelated, the main contributions of this thesis may be partitioned according to the modeling perspective they concern. The temporal perspective deals with the specification, management, and formal verification of temporal constraints. In this thesis, we address the specification and run-time management of temporal constraints in BPMN, by taking advantage of process modularity and of event handling mechanisms included in the standard. Then, we propose three different mappings from BPMN to formal models, to validate the behavior of the proposed process models and to check whether they are dynamically controllable. The informational perspective represents the information entities consumed, produced or manipulated by a process. This thesis focuses on the conceptual connection between processes and data, borrowing concepts from the database domain to enable the representation of which part of a database schema is accessed by a certain process activity. This novel conceptual view is then employed to detect potential data inconsistencies arising when the same data are accessed erroneously by different process activities. The decision perspective encompasses the modeling of the decision-making related to a process, considering where decisions are made in the process and how decision outcomes affect process execution. In this thesis, we investigate the use of the Decision Model and Notation (DMN) standard in conjunction with BPMN starting from a pattern-based approach to ease the derivation of DMN decision models from the data represented in BPMN processes. Besides, we propose a methodology that focuses on the integrated use of BPMN and DMN for modeling decision-intensive care pathways in a real-world application domain

Process time patterns: A formal foundation

Companies increasingly adopt process-aware information systems (PAISs) to model, execute, monitor, and evolve their business processes. Though the handling of temporal constraints (e.g., deadlines or time lags between activities) is crucial for the proper support of business processes, existing PAISs vary significantly regarding the support of the temporal perspective. Both the formal specification and the operational support of temporal constraints constitute fundamental challenges in this context. In previous work, we introduced process time patterns, which facilitate the comparison and evaluation of PAISs in respect to their support of the temporal perspective. Furthermore, we provided empirical evidence for these time patterns. To avoid ambiguities and to ease the use as well as the implementation of the time patterns, this paper formally defines their semantics. To additionally foster the use of the patterns for a wide range of process modeling languages and to enable pattern integration with existing PAISs, the proposed semantics are expressed independently of a particular process meta model. Altogether, the presented pattern formalization will be fundamental for introducing the temporal perspective in PAISs

Proseduraalisen tietomallintamisen käyttöönotto kaupunkisuunnittelussa

This thesis examines procedural modeling as a tool for urban plan creation. Procedural modeling historically has been used for 3D visualization of natural features, but with the release of the soft-ware CityEngine in 2008 the technology can easily be adopted also in problem domains dealing with urban environments. The study begins with a requirement analysis conducted to explore the needs urban planning imposes on the technology, based on which a functional procedural modeling production system is built using the CityEngine platform and its Computer Generated Architecture (CGA) scripting language. A solution is presented to the problem of control in procedural generation methods by introducing the concept of a selectable “Level of Control” and how its implementation in the produced system enables the planner to flexibly assume the necessary amount of control over the generated model. The finished product is then compared against the presented requirements of accuracy, efficiency, ease of use, high visual qualities, and advanced analytical capabilities. The efficiency of the system measured as the ratio between user interactions (mouse clicks and keystrokes) and modeling output in the setting of the assessment is found out to be two to three times greater than the efficiency of a more established manual modeling software. The technology as demonstrated through the produced system is concluded to be especially suitable for preliminary land use studies estimating the building potentials of extensive land areas. Directions for future research with potential to expand the applicability of the technology are discussed.Tässä diplomityössä tutkitaan proseduraalista mallintamista kaupunkisuunnittelun työvälineenä. Proseduraalista mallintamista on historiallisesti käytetty luonnonmuotojen 3D-visualisoimiseen, mutta vuonna 2008 julkaistu CityEngine-ohjelma mahdollistaa teknologian helpon käyttöönoton myös rakennettua ympäristöä koskevissa aihepiireissä. Tutkielma alkaa analyysillä kaupunkisuunnittelun teknologiaan kohdistamista vaatimuksista, joiden perusteella rakennetaan CityEngineen ja sen Computer Generated Architecture (CGA) ohjel-mointikieleen perustuva proseduraalinen mallinnusjärjestelmä. Ratkaisuna proseduraaliseen mallintamiseen liittyvään kontrollin problematiikkaan esitellään käsite valittavasta ”kontrollitasosta”, ja kuinka sen implementaatio toteutetussa järjestelmässä mahdollistaa suunnittelijan ottaa joustavasti tarpeellisen määrän kontrollia generoitavan mallin suhteen. Valmista tuotetta verrataan esitettyihin tarkkuuden, tehokkuuden, käytön helppouden, korkealaatuisen visuaalisuuden, sekä kehittyneen analytiikan vaatimuksiin. Järjestelmän tehokkuus mitattuna käyttäjäinteraktioiden (hiiren klikkaukset ja näppäimistön painallukset) ja tuotetun mallin suhteena mittauksen asetelmassa on kahdesta kolmeen kertaa suurempi kuin vakiintuneemman manuaalisen mallinnusohjelman tehokkuus. Proseduraalisen mallintamisen, sellaisena kuin se tuotetussa järjestelmässä on implementoitu, todetaan olevan erityisen sopiva alustavien rakentamisen määrää laajoille alueille haarukoivien maankäyttötarkastelujen tuottamiseen. Työn lopuksi käsitellään teknologian käyttöaluetta laajentavia tutkimussuuntia