Practical rules for reduction on the number of states of a state diagram
Bibliographic record
Abstract
Many object-oriented modeling methods adopt state-based formalisms to specify the behavior of objects. State-based formalisms, pioneered by David Harel (1987), are a powerful and yet intuitive tool in modeling the dynamics of objects. However, when a real world object has a huge number (or an infinite number) of states, we usually have to map them into a relatively small number of states in practice. This mapping has been done intuitively and heuristically by software designers. There has not been a set of general and systematic rules for this mapping. We focus on exploring a set of such rules with which a system of a large number (or an infinite number) of states can be transformed systematically into an equivalent finite-state system with a smaller number of states. Examples are given and the suggested rules are explained.
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.009 | 0.028 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.004 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.003 | 0.007 |
| Scholarly communication | 0.005 | 0.007 |
| Open science | 0.004 | 0.005 |
| Research integrity | 0.003 | 0.009 |
| Insufficient payload (model declined to judge) | 0.010 | 0.005 |
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".