2012 IEEE 16th International Enterprise Distributed Object Computing Conference 2012
DOI: 10.1109/edoc.2012.15
|View full text |Cite
|
Sign up to set email alerts
|

Techniques for a Posteriori Analysis of Declarative Processes

Abstract: The increasing availability of event data recorded by information systems, electronic devices, web services and sensor networks provides detailed information about the actual processes in systems and organizations. Process mining techniques can use such event data to discover processes and check the conformance of process models. For conformance checking, we need to analyze whether the observed behavior matches the modeled behavior. In such settings, it is often desirable to specify the expected behavior in te… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
56
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 42 publications
(57 citation statements)
references
References 18 publications
1
56
0
Order By: Relevance
“…In this case, we say that the constraint is vacuously satisfied [35]. In [18], the authors introduce the notion of behavioral vacuity detection according to which a constraint is non-vacuously satisfied in a trace when it is activated in that trace. An activation of a constraint in a trace is an event whose occurrence imposes, because of that constraint, some obligations on other events (targets) in the same trace.…”
Section: Declarementioning
confidence: 99%
See 4 more Smart Citations
“…In this case, we say that the constraint is vacuously satisfied [35]. In [18], the authors introduce the notion of behavioral vacuity detection according to which a constraint is non-vacuously satisfied in a trace when it is activated in that trace. An activation of a constraint in a trace is an event whose occurrence imposes, because of that constraint, some obligations on other events (targets) in the same trace.…”
Section: Declarementioning
confidence: 99%
“…In trace t 4 , for example, the response constraint G(a → Fb) is activated twice, but the first activation leads to a fulfillment (eventually b occurs) and the second activation leads to a violation (b does not occur subsequently). An algorithm to discriminate between fulfillments and violations for a constraint in a trace is presented in [18]. Table 1 reports the activations for the main Declare templates.…”
Section: Declarementioning
confidence: 99%
See 3 more Smart Citations