2013
DOI: 10.1016/j.jlap.2013.05.005
|View full text |Cite
|
Sign up to set email alerts
|

Contracts for cross-organizational workflows as timed Dynamic Condition Response Graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
39
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 53 publications
(39 citation statements)
references
References 17 publications
0
39
0
Order By: Relevance
“…We know from [11] that refinement of DCR processes is known to be decidable; this fact relies on the state space of a DCR process being finite. Time does not change this; see [24] for details. It is therefore sufficient to prove that for any R and G, the set Inst(R, G, P ) is finite.…”
Section: Compliance Checking By Refinementmentioning
confidence: 99%
See 1 more Smart Citation
“…We know from [11] that refinement of DCR processes is known to be decidable; this fact relies on the state space of a DCR process being finite. Time does not change this; see [24] for details. It is therefore sufficient to prove that for any R and G, the set Inst(R, G, P ) is finite.…”
Section: Compliance Checking By Refinementmentioning
confidence: 99%
“…In contrast to Declare, the DCR graphs technology has been succesfully employed in major industrial case management systems, and at the moment it supports 70% of the Danish Central Government institutions 5 . DCR graphs have been extended to include both data [43], time [5,24], sub-processes [10], and choreographies [25]. In the present paper we consider the core notation with time, which is expressive enough to represent both regular and omega-regular languages [10] as well as so-called true concurrency [9].…”
Section: Introductionmentioning
confidence: 99%
“…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%
See 1 more Smart Citation