MétaCan
Menu
Retour à la cohorte
Enregistrement W1601780922 · doi:10.20381/ruor-2935

Legal-URN Framework for Legal Compliance of Business Processes

2013· dissertation· en· W1601780922 sur OpenAlex

Pourquoi ce travail est dans la base

Une base qui oublie comment elle a trouvé un travail ne peut pas être vérifiée. Voici les voies qui ont admis celui-ci.

affAu moins un auteur déclare une institution canadienne dans l'instantané OpenAlex épinglé.

Notice bibliographique

RevueuO Research (University of Ottawa) · 2013
Typedissertation
Langueen
DomaineBusiness, Management and Accounting
ThématiqueBusiness Process Modeling and Analysis
Établissements canadiensUniversity of Ottawa
Organismes subventionnairesnon disponible
Mots-clésVaguenessComputer scienceBusiness processProcess (computing)NotationConstraint (computer-aided design)ReputationSemantics of Business Vocabulary and Business RulesBusiness process modelingProcess managementBusinessEngineeringOperations managementArtificial intelligencePolitical scienceLawWork in processLinguistics

Résumé

récupéré en direct d'OpenAlex

In recent years, the number of regulations an organization needs to comply with has been increasing, and organizations have to ensure that their business processes are aligned with these regulations. However, because of the complexity and intended vagueness of regulations in general, it is not possible to treat them the same way as other types of requirements. On the other hand, the cost of being non-compliant can also be fairly high; non-compliance can cause crucial harm to the organization with financial penalties or loss of reputation. Therefore, it is very important for organizations to take a systematic approach to ensuring that their compliance with related laws, regulations and standards is established and maintained. To achieve this goal, this thesis proposes a model-based compliance analysis framework for business processes called Legal-URN. This framework is composed of four layers of abstraction linked to each other. The framework exploits the User Requirements Notation (URN) as the modeling language to describe and combine legal and organizational models. In order to model legal documents, legal statements are first classified into four classes of Hohfeldian rights, and then Hohfeldian models of the regulations and their statements are created. These models are further refined into legal goal and business process models via a domain-specific version of URN called Legal URN profile. To check the well-formedness of the models and to identify instances of non-compliance, 23 Object Constraint Language (OCL) rules are provided. In this thesis, the quantitative and qualitative analysis algorithms of URN's Goal-oriented Requirement Language are extended to help analyze quantitatively and qualitatively the degree of compliance of an organization to the legal models. Furthermore, with the help of a prioritization algorithm, the framework enables one to decide, while taking the organization goals into consideration, which non-compliant instances to address first in order to provide a suitable evolution path for business processes. In addition, to assess compliance with more than one regulation, a pair-wise comparison algorithm enables organizations to identify the similarities and conflicts among regulations and incorporate them in the models. The jUCMNav tool, an Eclipse plug-in for URN modeling and analysis, was extended to support the framework and its algorithms and rules. The thesis contributions are evaluated through a gap analysis based on a systematic literature review, a comparison with closely related work, and two case studies in the healthcare domain: one with a single regulation and realistic business processes, and a second with three additional regulations. We also identify the benefits and limitations of the framework, as well as potential extensions for future work. The Legal-URN framework provides a tool-supported, rigorous approach to compliance analysis of organizations against relevant regulations.

Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.

Prédiction distillée sur la base complète

Imitation des enseignants

Ni prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.

score de la tête « metaresearch » (Codex)0,001
score de la tête « metaresearch » (Gemma)0,001
Version: codex-gemma-dda1882f352aStatut de validation: machine_predicted_unvalidated
Catégories candidatesMéta-épidémiologie (sens strict)
Catégories consensuellesaucune
DomaineSignal candidat: aucune · Signal consensuel: aucune
Devis d'étudeSignal candidat: Sans objet · Signal consensuel: aucune
GenreSignal candidat: Empirique · Signal consensuel: Empirique
Score de désaccord entre enseignants0,693
Score d'incertitude au seuil1,000

Scores Codex et Gemma par catégorie

CatégorieCodexGemma
Métarecherche0,0010,001
Méta-épidémiologie (sens strict)0,0000,000
Méta-épidémiologie (sens large)0,0010,000
Bibliométrie0,0010,003
Études des sciences et des technologies0,0010,000
Communication savante0,0000,002
Science ouverte0,0010,000
Intégrité de la recherche0,0000,001
Charge utile insuffisante (le modèle a refusé de juger)0,0000,000

Scores machine (provisoires)

Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.

Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.

Tête enseignante Opus0,083
Tête enseignante GPT0,321
Écart entre enseignants0,239 · la distance entre les deux têtes enseignantes sur ce seul travail
Statut de validationscore_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle