Formalizing Semantics for UML Activity Diagram through Regular Expression Translation
Bibliographic record
Abstract
Formalization of UML models now becomes a requisite action by most of the software designers. UML is semiformal in nature. So it becomes necessary to formalize the UML which would reduce the overall complexity of software design. Today as software becoming more interactive and distributed in nature, the formal syntax and automated verification analysis of behavioral aspect of any model becomes very important in order to reduce overall software development cost and time. UML Activity diagram has become widely acceptable tool for documenting the artifacts related to Control flow and complexity of the software system. Here Authors proposed the semantics for activity diagram of UML by means of regular expression and its equivalent transition system. UML has now become one of the most widely acceptable standards for visual modeling related to object based software development. Since inception, continuous adoption of various design patterns and profiles of software have been included to make it more flexible and capable to represent different views of software design at early phases of its development. It is also found that the mapping of these visual modeling structures to some pre-established formal graphical notations of data structures like graph certainly provides more realistic and robust automated verification and validation ground for these models. The available literature shows the tremendous research work is being carried out to make it more adoptable and reliable visual modeling platform across the globe. Although UML has a richer and wider visual modeling skill set, but still it is not very easy to find better ground for establishing, set of rules and semantics for UML model verification and validation. The research work also proposes a formal verification and traceability method for any activity model with the help of Arden's lemma. The correctness of proposed verification method has been shown with supporting case studies after generating its corresponding formal regular expression.
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.003 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.003 | 0.003 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.004 | 0.002 |
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".