MétaCan
Menu
Back to cohort
Record W2548609159 · doi:10.1109/icocs.2012.6458609

Towards change and verification support in collaborative business processes

2012· article· en· W2548609159 on OpenAlexaff
Ismaïl Khriss, Mohammed El Koutbi, Youssef Dkiouak

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldBusiness, Management and Accounting
TopicBusiness Process Modeling and Analysis
Canadian institutionsUniversité du Québec à Rimouski
Fundersnot available
KeywordsBusiness processComputer scienceBusiness ruleArtifact-centric business process modelProcess managementBusiness process modelingBusiness Process Model and NotationBusiness process managementProcess (computing)Business process discoveryProtocol (science)Process modelingAutomationSoftware engineeringWork in processBusinessOperations managementEngineering

Abstract

fetched live from OpenAlex

The automation of business processes raises several challenges for enterprises. One of those challenges relates to the maintenance and verification of business processes, more precisely how to facilitate changes within existing business processes even at the run-time. Furthermore, changing a collaborative business process can have an impact on the contract specified between the involved parties. Thus, a business process may need to adapt and meet reliably the new contract. In this paper, we discuss an approach to support change and verification for such collaborative processes. This approach consists of (1) a protocol, called Change Protocol for Collaboration (CPC), for managing the changes that can have an incidence on the contract; (2) an algorithm for supporting migration of running business process instances to their new schemas; and (3) a verification framework for supporting of the accuracy of changes before their adoption.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.028
metaresearch head score (Gemma)0.072
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.028
Threshold uncertainty score0.149

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0280.072
Meta-epidemiology (narrow)0.0010.002
Meta-epidemiology (broad)0.0010.003
Bibliometrics0.0020.002
Science and technology studies0.0020.006
Scholarly communication0.0080.017
Open science0.0050.009
Research integrity0.0060.007
Insufficient payload (model declined to judge)0.0030.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.048
GPT teacher head0.257
Teacher spread0.208 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations1
Published2012
Admission routes1
Has abstractyes

Explore more

Same topicBusiness Process Modeling and AnalysisFrench-language works237,207