Using Timed Automata for <i>a Priori</i> Warnings and Planning for Timed Declarative Process Models

Maggi, Fabrizio Maria; Westergaard, Michael

doi:10.1142/s0218843014400036

Cited by 14 publications

(10 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…declare is a declarative process modeling language originally introduced by Pesic and van der Aalst in [3,6] to express rules over the control flow of a process. More recently, declare has been extended to take into account other process perspectives that go beyond the pure control flow, such as time [30,31] and data [32,33,34].…”

Section: Declarementioning

confidence: 99%

On the relevance of a business constraint to an event log

Ciccio

Maggi

Montali

et al. 2018

Information Systems

Self Cite

View full text Add to dashboard Cite

Declarative process modeling languages such as declare describe the behavior of processes by means of constraints. Such constraints exert rules on the execution of tasks upon the execution of other tasks called activations. The constraint is thus fulfilled both if it is activated and the consequent rule is respected, or if it is not activated at all. The latter case, named vacuous satisfaction, is clearly less interesting than the former. Such a distinction becomes of utmost importance in the context of declarative process mining techniques, where processes are analyzed based on the identification of the most relevant constraints valid in an event log. Unfortunately, this notion of relevance has never been formally defined, and all the proposals existing in the literature use ad-hoc definitions that are only applicable to a pre-defined set of constraint patterns. This makes existing declarative process mining techniques inapplicable when the target constraint language is extensible, and may contain formulae that go beyond the pre-defined patterns. In this paper, we tackle this open challenge, and show how the notion of constraint activation and vacuous satisfaction can be captured semantically, in the case of constraints expressed in arbitrary temporal logics over finite

show abstract

Section: Declarementioning

confidence: 99%

On the relevance of a business constraint to an event log

Ciccio

Maggi

Montali

et al. 2018

Information Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…We exclude works that are not related to business processes, view temporal constraints solely in the sense of ordering relations, or only mention temporal constraints at an abstract level (i.e., no specific temporal constraints are discussed). In the end, several papers [20,9,16,17,15,32,10,4,26,2,18] were identified as relevant works in the context of our research.…”

Section: Temporal Constraints In Declarative Processes Modeling Langumentioning

confidence: 99%

“…Features F1 F2 F3 F4 Montali et al [20] X X Hildebrandt et al [9] X X X Maggi et al [16,17,15] X X X Jiang et al [10] X X Burattin et al [4,26] X X X Mans et al [18] X X Barba et al [2] = true, X = false declarative modeling language as appropriate as it enables the specification of a wide range of process models in a flexible way. Respective process models are denoted as constraint-based, i.e., they comprise information about (1) the activities that may be performed during process enactment as well as (2) the constraints to be obeyed in this context.…”

Section: Workmentioning

confidence: 99%

“…Although there exists related work on declarative BP modeling [28,31,20,9,17,10,4], only few approaches pay attention to the temporal perspective from a wider point of view, i.e., beyond viewing temporal constraints solely just in the sense of ordering relations [20,9,17,16,32,15,26,10,4]. To assess to what extent these works may support the temporal constraints required by the considered scenario, we performed a review which revealed that there exists other works that partially addresses some of the requirements related to the time patterns (i.e., activity durations and time lags between activities).…”

Section: Legendmentioning

confidence: 99%

“…Declarative approaches are becoming increasingly popular for modeling business processes as they are able to cope with some of the limitations imperative notations are facing [28,31,20,9,17,10,4]. Although declarative modeling languages have been extensively discussed in literature [19,5], even in the context of healthcare [29,21,25], to the best of our knowledge, they have not been used to model complex, real-world scenarios that comprise constraints going beyond control-flow.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Clinical Processes - The Killer Application for Constraint-Based Process Interactions?

Ramirez

Barba

Reichert

et al. 2018

Advanced Information Systems Engineering

View full text Add to dashboard Cite

For more than a decade, the interest in aligning information systems in a process-oriented way has been increasing. To enable operational support for business processes, the latter are usually specified in an imperative way. The resulting process models, however, tend to be too rigid to meet the flexibility demands of the actors involved. Declarative process modeling languages, in turn, provide a promising alternative in scenarios in which a high level of flexibility is demanded. In the scientific literature, declarative languages have been used for modeling rather simple processes or synthetic examples. However, to the best of our knowledge, they have not been used to model complex, real-world scenarios that comprise constraints going beyond control-flow. In this paper, we propose the use of a declarative language for modeling a sophisticated healthcare process scenario from the real world. The scenario is subject to complex temporal constraints and entails the need for coordinating the constraint-based interactions among the processes related to a patient treatment process. As demonstrated in this work, the selected real process scenario can be suitably modeled through a declarative approach.

show abstract

A Linear Temporal Logic Model Checking Method over Finite Words with Correlated Transition Attributes

Couvreur

Ezpeleta

2019

Lecture Notes in Business Information Processing

View full text Add to dashboard Cite

Temporal logic model checking techniques are applied, in a natural way, to the analysis of the set of finite traces composing a system log. The specific nature of such traces helps in adapting traditional techniques in order to extend their analysis capabilities. The paper presents an adaption of the classical Timed Propositional Temporal Logic to the case of finite words and considers relations among different attributes corresponding to different events. The introduced approach allows the use of general relations between event attributes by means of freeze quantifiers as well as future and past temporal operators. The paper also presents a decision procedure, as well as a study of its computational complexity.

show abstract

Using Timed Automata for a Priori Warnings and Planning for Timed Declarative Process Models

Cited by 14 publications

References 17 publications

On the relevance of a business constraint to an event log

On the relevance of a business constraint to an event log

Clinical Processes - The Killer Application for Constraint-Based Process Interactions?

A Linear Temporal Logic Model Checking Method over Finite Words with Correlated Transition Attributes

Contact Info

Product

Resources

About