FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4318499495> ?p ?o ?g. }

• W4318499495 endingPage "120" @default.
• W4318499495 startingPage "71" @default.
• W4318499495 abstract "Compliance in business processes has become a fundamental requirement given the constant rise in regulatory requirements and competitive pressures that have emerged in recent decades. While in other areas of business process modelling and execution, considerable progress towards automation has been made (e.g., process discovery, executable process models), the interpretation and implementation of compliance requirements is still a highly complex task requiring human effort and time. To increase the level of “mechanization” when implementing regulations in business processes, compliance research seeks to formalize compliance requirements. Formal representations of compliance requirements should, then, be leveraged to design correct process models and, ideally, would also serve for the automated detection of violations. To formally specify compliance requirements, however, multiple process perspectives, such as control flow, data, time and resources, have to be considered. This leads to the challenge of representing such complex constraints which affect different process perspectives. To this end, current approaches in business process compliance make use of a varied set of languages. However, every approach has been devised based on different assumptions and motivating scenarios. In addition, these languages and their presentation usually abstract from real-world requirements which often would imply introducing a substantial amount of domain knowledge and interpretation, thus hampering the evaluation of their expressiveness. This is a serious problem, since comparisons of different formal languages based on real-world compliance requirements are lacking, meaning that users of such languages are not able to make informed decisions about which language to choose. To close this gap and to establish a uniform evaluation basis, we introduce a running example for evaluating the expressiveness and complexity of compliance rule languages. For language selection, we conducted a literature review. Next, we briefly introduce and demonstrate the languages’ grammars and vocabularies based on the representation of a number of legal requirements. In doing so, we pay attention to semantic subtleties which we evaluate by adopting a normative classification framework which differentiates between different deontic assignments. Finally, on top of that, we apply Halstead’s well-known metrics for calculating the relevant characteristics of the different languages in our comparison, such as the volume, difficulty and effort for each language. With this, we are finally able to better understand the lexical complexity of the languages in relation to their expressiveness. In sum, we provide a systematic comparison of different compliance rule languages based on real-world compliance requirements which may inform future users and developers of these languages. Finally, we advocate for a more user-aware development of compliance languages which should consider a trade off between expressiveness, complexity and usability." @default.
• W4318499495 created "2023-01-30" @default.
• W4318499495 creator A5021712760 @default.
• W4318499495 creator A5022163121 @default.
• W4318499495 creator A5030545218 @default.
• W4318499495 creator A5058392257 @default.
• W4318499495 date "2023-01-28" @default.
• W4318499495 modified "2023-10-18" @default.
• W4318499495 title "Evaluation of Compliance Rule Languages for Modelling Regulatory Compliance Requirements" @default.
• W4318499495 cites W1485377267 @default.
• W4318499495 cites W1552644025 @default.
• W4318499495 cites W1556785770 @default.
• W4318499495 cites W1563196767 @default.
• W4318499495 cites W1603508393 @default.
• W4318499495 cites W160533777 @default.
• W4318499495 cites W1759097521 @default.
• W4318499495 cites W1938029965 @default.
• W4318499495 cites W1942290839 @default.
• W4318499495 cites W1943924251 @default.
• W4318499495 cites W1964962870 @default.
• W4318499495 cites W1975599245 @default.
• W4318499495 cites W1976331977 @default.
• W4318499495 cites W1994092777 @default.
• W4318499495 cites W1994410397 @default.
• W4318499495 cites W1995956436 @default.
• W4318499495 cites W1996832037 @default.
• W4318499495 cites W1999386180 @default.
• W4318499495 cites W2001265555 @default.
• W4318499495 cites W2010104109 @default.
• W4318499495 cites W2015282105 @default.
• W4318499495 cites W2015477148 @default.
• W4318499495 cites W2018530348 @default.
• W4318499495 cites W2025043404 @default.
• W4318499495 cites W2027158876 @default.
• W4318499495 cites W2029978116 @default.
• W4318499495 cites W2038180015 @default.
• W4318499495 cites W2068965694 @default.
• W4318499495 cites W2070591515 @default.
• W4318499495 cites W2076328920 @default.
• W4318499495 cites W2086744115 @default.
• W4318499495 cites W2087132336 @default.
• W4318499495 cites W2089655116 @default.
• W4318499495 cites W2094758254 @default.
• W4318499495 cites W2098791425 @default.
• W4318499495 cites W2100680119 @default.
• W4318499495 cites W2104537183 @default.
• W4318499495 cites W2105848112 @default.
• W4318499495 cites W2106956101 @default.
• W4318499495 cites W2109499854 @default.
• W4318499495 cites W2114305512 @default.
• W4318499495 cites W2120327813 @default.
• W4318499495 cites W2123849585 @default.
• W4318499495 cites W2141804465 @default.
• W4318499495 cites W2143396069 @default.
• W4318499495 cites W2152977648 @default.
• W4318499495 cites W2153590490 @default.
• W4318499495 cites W2156683747 @default.
• W4318499495 cites W2341842883 @default.
• W4318499495 cites W2483520468 @default.
• W4318499495 cites W2499406820 @default.
• W4318499495 cites W2540145024 @default.
• W4318499495 cites W2756115833 @default.
• W4318499495 cites W2785156082 @default.
• W4318499495 cites W2886595164 @default.
• W4318499495 cites W3094051283 @default.
• W4318499495 cites W3106418261 @default.
• W4318499495 cites W3123654228 @default.
• W4318499495 cites W3131731947 @default.
• W4318499495 cites W3139170996 @default.
• W4318499495 cites W3183843234 @default.
• W4318499495 cites W4232088898 @default.
• W4318499495 cites W4233185143 @default.
• W4318499495 cites W4252627521 @default.
• W4318499495 cites W4300986989 @default.
• W4318499495 doi "https://doi.org/10.3390/software2010004" @default.
• W4318499495 hasPublicationYear "2023" @default.
• W4318499495 type Work @default.
• W4318499495 citedByCount "1" @default.
• W4318499495 crossrefType "journal-article" @default.
• W4318499495 hasAuthorship W4318499495A5021712760 @default.
• W4318499495 hasAuthorship W4318499495A5022163121 @default.
• W4318499495 hasAuthorship W4318499495A5030545218 @default.
• W4318499495 hasAuthorship W4318499495A5058392257 @default.
• W4318499495 hasBestOaLocation W43184994951 @default.
• W4318499495 hasConcept C11066294 @default.
• W4318499495 hasConcept C112930515 @default.
• W4318499495 hasConcept C115903868 @default.
• W4318499495 hasConcept C123247970 @default.
• W4318499495 hasConcept C127413603 @default.
• W4318499495 hasConcept C144133560 @default.
• W4318499495 hasConcept C160145156 @default.
• W4318499495 hasConcept C174998907 @default.
• W4318499495 hasConcept C177688676 @default.
• W4318499495 hasConcept C195094911 @default.
• W4318499495 hasConcept C199360897 @default.
• W4318499495 hasConcept C207505557 @default.
• W4318499495 hasConcept C21547014 @default.
• W4318499495 hasConcept C41008148 @default.

• next