Dynamic controllability via Timed Game Automata

Cimatti, Alessandro; Hunsberger, Luke; Micheli, Andrea; Posenato, Roberto; Roveri, Marco

doi:10.1007/s00236-016-0257-2

Cited by 15 publications

(26 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proof follows the argumentation above: the only condition for values of a correct schedule frame, in which values of a node do not depend on all of their immediate predecessors, their immediate successor, or their own duration are the conditions (6) and (7) of Definition 10, i.e. when the values are determined by an upper-bound constraint.…”

Section: Definition 16 (Partially Unfolded Graph) U(n E L B) = (Pmentioning

confidence: 95%

“…Another stream of research studies temporal constraint networks [12], which were applied for workflows in [1], and now reached the necessary expressiveness for analyzing business process models: checking the controllability [7] and dynamic controllability of temporal networks, as discussed in [8]. In particular, [6,26,28] present algorithms for checking the controllability of conditional simple temporal networks with a sound-and-complete algorithm for conditional simple temporal networks with uncertainty (CSTNU), the type of network corresponding to the process models discussed here. While these approaches check, whether an execution strategy avoiding time failures exists, our approach actually computes conditional schedules which guide the execution at run-time.…”

Section: Related Workmentioning

confidence: 99%

“…dynamic controllability of process definitions with several This article is part of the topical collection "Future Data and Security Engineering 2019" guest edited by Tran Khanh Dang. sets of temporal constraints have been proposed for different flavors of process models, e.g., [2,3,6,8,15,26,27,30,37]. Nevertheless, an algorithm which is computationally feasible, both sound and complete and effectively computes a conditional schedule was still missing.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Conditional Schedules for Processes with Temporal Constraints

2020

View full text Add to dashboard Cite

Temporal aspects are among the most important quality criteria for executing business processes. It is mandatory to check process definitions at design time for temporal properties to avoid that structural properties of process models cause time failures at run-time. Here, we propose to check process models for conditional controllability and to compute conditional schedules for their execution without time failures. Schedules have to be conditional, since it is a characteristics of business processes, that control flow decisions are based on conditions, which can only be evaluated in the course of process execution at run-time and not before the process starts. We present a procedure for checking the conditional controllability of processes with temporal constraints, which is both sound and complete and effectively and efficiently computes conditional schedules for temporally constrained business processes.

show abstract

Section: Definition 16 (Partially Unfolded Graph) U(n E L B) = (Pmentioning

confidence: 95%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Conditional Schedules for Processes with Temporal Constraints

2020

View full text Add to dashboard Cite

show abstract

“…The DC-checking problem is the problem of deciding if a CSTNU is DC. We can answer the DC-checking problem by using sound and complete TGA reachability algorithms [4,5]. We model the DC-checking as a two-player game between a controller (ctrl) and the environment (env).…”

Section: Dynamic Controllabilitymentioning

confidence: 99%

Conditional simple temporal networks with uncertainty and decisions

Zavatteri

Viganò

2019

Theoretical Computer Science

View full text Add to dashboard Cite

A conditional simple temporal network with uncertainty (CSTNU) is a framework 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. The proposed approach is fully automated.

show abstract

“…The notion of controllability, extensively studied in the context of scheduling and planning problems over temporal networks [6,7,8,27,31,32], has been considered as a useful concept for supporting decisions in business process management and design [9,21,22].…”

Section: Related Work and Conclusionmentioning

confidence: 99%

Verifying Controllability of Time-Aware Business Processes

Angelis

Fioravanti

Meo

et al. 2017

Rules and Reasoning

View full text Add to dashboard Cite

Abstract. We present an operational semantics for time-aware business processes, that is, processes modeling the execution of business activities, whose durations are subject to linear constraints over the integers. We assume that some of the durations are controllable, that is, they can be determined by the organization that enacts the process, while others are uncontrollable, that is, they are determined by the external world.Then, we consider controllability properties, which guarantee the completion of the enactment of the process, satisfying the given duration constraints, independently of the values of the uncontrollable durations. Controllability properties are encoded by quantified reachability formulas, where the reachability predicate is recursively defined by a set of Constrained Horn Clauses (CHCs). These clauses are automatically derived from the operational semantics of the process.Finally, we present two algorithms for solving the so called weak and strong controllability problems. Our algorithms reduce these problems to the verification of a set of quantified integer constraints, which are simpler than the original quantified reachability formulas, and can effectively be handled by state-of-the-art CHC solvers.

show abstract

Dynamic controllability via Timed Game Automata

Cited by 15 publications

References 40 publications

Conditional Schedules for Processes with Temporal Constraints

Conditional Schedules for Processes with Temporal Constraints

Conditional simple temporal networks with uncertainty and decisions

Verifying Controllability of Time-Aware Business Processes

Contact Info

Product

Resources

About