Replication, refinement &amp; reachability: complexity in dynamic condition-response graphs

Debois, Søren; Hildebrandt, Thomas; Slaats, Tijs

doi:10.1007/s00236-017-0303-8

Cited by 25 publications

(30 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [11] it was also shown that non-invasiveness guarantees the refine relation. This can be extended to timed processes.…”

Section: Compliance Checking By Refinementmentioning

confidence: 96%

“…Proof. 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.…”

Section: Compliance Checking By Refinementmentioning

confidence: 99%

“…While generally checking refinement for DCR processes is NP-hard already in the absence of time, [11] showed that the refines relation can be approximated by a static property, the non-invasiveness on the graphs recalled below.…”

Section: Compliance Checking By Refinementmentioning

confidence: 99%

“…Proof (sketch). We need to extend the proof in [11] to timed processes observing the following: 1) in the case of conflicting deadlines the most strict deadlines always take precedence, 2) therefore after composition of a R and P which share a timed relation with a different deadline, the most strict deadline will be followed, and 3) the composed process will not allow for traces which were forbidden under the strictest deadline.…”

Section: Compliance Checking By Refinementmentioning

confidence: 99%

“…This is particularly important in our case, as compliance specialists in local governments do not have prior training in using verification techniques using temporal logics. Finally, verification is efficient: it relies on refinement of transition systems with responses [6,28], and although the complexity process refinement belongs to the category of NPhard problems [11], we have shown that we can use syntactic restrictions to check compliance in polynomial time.…”

Section: Related Workmentioning

confidence: 99%

See 4 more Smart Citations

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

“…In [11] it was also shown that non-invasiveness guarantees the refine relation. This can be extended to timed processes.…”

Section: Compliance Checking By Refinementmentioning

confidence: 96%

Section: Compliance Checking By Refinementmentioning

confidence: 99%

Section: Compliance Checking By Refinementmentioning

confidence: 99%

Section: Compliance Checking By Refinementmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 3 more Smart Citations

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

show abstract

Towards an Empirical Evaluation of Imperative and Declarative Process Mining

Back

Debois

Slaats

2018

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Process modelling notations fall in two broad categories: declarative notations, which specify the rules governing a process; and imperative notations, which specify the flows admitted by a process. We outline an empirical approach to addressing the question of whether certain process logs are better suited for mining to imperative than declarative notations. We plan to attack this question by applying a flagship imperative and declarative miner to a standard collection of process logs, then evaluate the quality of the output models w.r.t. the standard model metrics of precision and generalisation. This approach requires perfect fitness of the output model, which substantially narrows the field of available miners; possible candidates include Inductive Miner and MINERful. With the metrics in hand, we propose to statistically evaluate the hypotheses that (1) one miner consistently outperforms the other on one of the metrics, and (2) there exist subsets of logs more suitable for imperative respectively declarative mining.

show abstract

DCR Event-Reachability via Genetic Algorithms

Høgnason

Debois

2019

Business Process Management Workshops

View full text Add to dashboard Cite

Replication, refinement & reachability: complexity in dynamic condition-response graphs

Cited by 25 publications

References 37 publications

Business Process Compliance Using Reference Models of Law

Business Process Compliance Using Reference Models of Law

Towards an Empirical Evaluation of Imperative and Declarative Process Mining

DCR Event-Reachability via Genetic Algorithms

Contact Info

Product

Resources

About