Strong Controllability of Disjunctive Temporal Problems with Uncertainty

Peintner, Bart; Venable, Kristen Brent; Yorke-Smith, Neil

doi:10.1007/978-3-540-74970-7_64

Cited by 20 publications

(35 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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%

See 1 more Smart Citation

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

Section: Related Work and Conclusionmentioning

confidence: 99%

“…Later, sound and complete algorithms were developed for both strong [27] and weak [31] controllability of Disjunctive Temporal Problems with Uncertainty (DTPU). More recently, a general and effective method for checking strong [7] and weak [8] controllability of DTPU's via SMT has been developed.…”

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

show abstract

“…[5] investigated the semantics of DTPU constraints and proposed a way to check if Strong Controllability holds. That work focused on checking if there exists a solution that ensures all constraints will be satisfied regardless of Nature's realization of uncontrollable events.…”

Section: Introductionmentioning

confidence: 99%

“…The Disjunctive Temporal Problem with Uncertainty (DTPU) is a fundamental problem that expresses temporal reasoning with both disjunctive constraints and contingency. A recent work (Peintner et al, 2007) develops a complete algorithm for determining Strong Controllability of a DTPU. Such a notion that guarantees 100% confidence of execution may be too conservative in practice.…”

mentioning

confidence: 99%

Risk Minimization of Disjunctive Temporal Problem with Uncertainty

Lau

Hoang

2014

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

Abstract. The Disjunctive Temporal Problem with Uncertainty (DTPU) is a fundamental problem that expresses temporal reasoning with both disjunctive constraints and contingency. A recent work (Peintner et al, 2007) develops a complete algorithm for determining Strong Controllability of a DTPU. Such a notion that guarantees 100% confidence of execution may be too conservative in practice. In this paper, following the idea of (Tsamardinos 2002), we are interested to find a schedule that minimizes the risk (i.e. probability of failure) of executing a DTPU. We present a problem decomposition scheme that enables us to compute the probability of failure efficiently, followed by a hill-climbing local search to search among feasible solutions. We show experimentally that our approach effectively produces solutions which are near-optimal.

show abstract

“…Various other approaches have been designed in the literature to deal with DTPPs [4][5][6]2], possibly relying on alternative preference aggregation methods (see, e.g. [7,8]). …”

Section: Introductionmentioning

confidence: 99%

A Reduction-Based Approach for Solving Disjunctive Temporal Problems with Preferences

Bourguet

Maratea

Pulina

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Disjunctive Temporal Problems with Preferences (DTPPs) extend DTPs with piece-wise constant preference functions associated to each constraint of the form l ≤ x − y ≤ u, where x, y are (real or integer) variables, and l, u are numeric constants. The goal is to find an assignment to the variables of the problem that maximizes the sum of the preference values of satisfied DTP constraints, where such values are obtained by aggregating the preference functions of the satisfied constraints in it under a "max" semantic. The state-of-the-art approach in the field, implemented in the DTPP solver Maxilitis, extends the approach of the DTP solver Epilitis. In this paper we present an alternative approach that reduces DTPPs to Maximum Satisfiability of a set of Boolean combination of constraints of the form l x − y u, ∈ {<, ≤}, that extends previous work that dealt with constant preference functions only. Results obtained with the Satisfiability Modulo Theories (SMT) solver Yices on randomly generated DTPPs show that our approach is competitive to, and can be faster than, Maxilitis.

show abstract

Strong Controllability of Disjunctive Temporal Problems with Uncertainty

Cited by 20 publications

References 9 publications

Verifying Controllability of Time-Aware Business Processes

Verifying Controllability of Time-Aware Business Processes

Risk Minimization of Disjunctive Temporal Problem with Uncertainty

A Reduction-Based Approach for Solving Disjunctive Temporal Problems with Preferences

Contact Info

Product

Resources

About