Capturing business transaction requirements in use case models
Bibliographic record
Abstract
A significant portion of our modern economy is dependent on the reliability and usability of enterprise applications (EAs) of which business transactions and concurrency management are central concepts. The correct orchestration of subordinate system transactions forming a business transaction, as well as proper concurrency conflict resolution strategies are crucial factors. In this paper we argue that modeling business transactions and concurrency management are a domain activity and as such, are to be analyzed and documented during the requirements phase. Failing to do so can have a significant negative effect on the usability of an application. Driven by our own experiences in writing use cases for EAs, we demonstrate how business transactions can be modeled within use case specifications. Concrete examples and usage guidelines are offered as well as a demonstration of how our approach helps contribute to the difficult task of requirements elicitation.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.011 | 0.034 |
| Meta-epidemiology (narrow) | 0.002 | 0.003 |
| Meta-epidemiology (broad) | 0.001 | 0.003 |
| Bibliometrics | 0.006 | 0.004 |
| Science and technology studies | 0.002 | 0.002 |
| Scholarly communication | 0.008 | 0.008 |
| Open science | 0.003 | 0.004 |
| Research integrity | 0.004 | 0.003 |
| Insufficient payload (model declined to judge) | 0.003 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".