Declarative Choreographies and Liveness

Hildebrandt, Thomas; López, Hugo A.; Debois, Søren; Carbone, Marco

doi:10.1007/978-3-030-21759-4_8

Cited by 11 publications

(11 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Additionally, the Buyer communicates the requested product to the Seller, and their decision depends on the quote received from the Seller and certain decision logic based on the Buyer's locally specified maximum acceptable quote. These aspects cannot be expressed in our earlier versions of declarative choreographies [16], but become expressible in this contribution.…”

Section: Introductionmentioning

confidence: 87%

“…In earlier work [16] we presented how to use the declarative Dynamic Condition Response (DCR) graphs [13] formalism as a choreography language by using interactions as labels instead of actions, thereby addressing the adequacy limitation of BPMN Choreographies for flexible processes or the specification of contracts. We also provided sound and effectively computable criteria for the realizability of DCR Choreographies.…”

Section: Introductionmentioning

confidence: 99%

“…Our second contribution is an updated set of criteria to determine whether declarative choreographies with data and time constraints are realizable. This requires us to revise the original Definitions of projectability in [16] and extend for the causal dependencies created by local computations and the evaluation of guards. Concretely, we add additional constraints, guaranteeing that only locally available data is used in expressions.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Declarative Choreographies with Time and Data

Hildebrandt,

López,

Slaats

2023

Lecture Notes in Business Information Processing

Self Cite

View full text Add to dashboard Cite

Choreographic models express coordination between business roles, in contrast to standard process models that merge local control flow and communication between parties. A choreography is realizable, also known as endpoint projectable, if the independent behaviour of each role in composition with other roles, only behaves exactly in the same way as described in the choreography. We introduce a novel choreographic language expressing safety and liveness properties, incorporating multiperspective constraints in communication flows, data, and time. This language builds upon recent developments in declarative choreographies using the Dynamic Condition Response (DCR) graph formalism and extends it to accommodate data and time. The interaction between multiple dimensions can render models unrealizable, so we determine the conditions required for realizability through causal relationships within multi-perspective declarative choreographies. This way, realizable choreographies are guaranteed freedom of conflicts in the message exchanges that otherwise can lead to deadlocks.

show abstract

Section: Introductionmentioning

confidence: 87%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Declarative Choreographies with Time and Data

Hildebrandt,

López,

Slaats

2023

Lecture Notes in Business Information Processing

Self Cite

View full text Add to dashboard Cite

show abstract

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

Business Process Compliance Using Reference Models of Law

López¹,

Debois²,

Slaats³

et al. 2020

Fundamental Approaches to Software Engineering

Self Cite

View full text Add to dashboard Cite

Legal compliance is an important part of certifying the correct behaviour of a business process. To be compliant, organizations might hard-wire regulations into processes, limiting the discretion that workers have when choosing what activities should be executed in a case. Worse, hard-wired compliant processes are difficult to change when laws change, and this occurs very often. This paper proposes a model-driven approach to process compliance and combines a) reference models from laws, and b) business process models. Both reference and process models are expressed in a declarative process language, The Dynamic Condition Response (DCR) graphs. They are subject to testing and verification, allowing law practitioners to check consistency against the intent of the law. Compliance checking is a combination of alignments between events in laws and events in a process model. In this way, a reference model can be used to check different process variants. Moreover, changes in the reference model due to law changes do not necessarily invalidate existing processes, allowing their reuse and adaptation. We exemplify the framework via the alignment of laws and business rules and a real contract change management process, Finally, we show how compliance checking for declarative processes is decidable, and provide a polynomial time approximation that contrasts NP complexity algorithms used in compliance checking for imperative business processes. All-together, this paper presents technical and methodological steps that are being used by legal practitioners in municipal governments in their efforts towards digitalization of work practices in the public sector.

show abstract

“…Montesi and Yoshida developed a theory of compositional choreographic programming that supports open distributed systems [38]; Carbone et al studied connections between choreographic programming and linear logic [6,11]; Dalla Preda et al combined choreographic programming with dynamic adaptation [39][40][41]; Cruz-Filipe and Montesi developed a minimal Turing-complete language of global programs [21]; Cruz-Filipe et al and Kjaer et al presented techniques to extract global programs from families of local programs [17,35]; Giallorenzo et al studied a correspondence between choreographic programming and multitier languages [27]; Jongmans and Van den Bos combined choreographic programming with deductive verification [34]; Hirsch and Garg and Cruz-Filipe et al developed functional choreographic programming languages [16,30]. Other work includes results on case studies [18], procedural abstractions [20], asynchronous communication [19], polyadic communication [22,29], implementability [26], and formalisation/mechanisation in Coq [23,24,30]. These theoretical developments are supported in practice by several tools [4,10,27,40,41].…”

mentioning

confidence: 99%