Statecharts¶
Harel, D. (1987). Statecharts: A Visual Formalism for Complex Systems. Science of Computer Programming, 8(3), 231-274.
Cited by¶
4 citations across 4 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
Mechanisms¶
- Control-State Diagram
- It is the artifact that connects the landscape to enforceable action.
This sourcePresents statecharts as a visual formalism that turns a system's behavioral state landscape into an executable-style specification of transitions and actions.
- It is the artifact that connects the landscape to enforceable action.
- State Exclusivity Table
- But because the incompatible pairs and their edge cases are declared once, explicitly, everyone downstream — the coder writing the interlock, the reviewer signing off, the tester writing cases — works from the same statement of what may never overlap.
This sourceStatecharts use explicit XOR decomposition to represent mutually exclusive substates within a structured behavioral specification.
- But because the incompatible pairs and their edge cases are declared once, explicitly, everyone downstream — the coder writing the interlock, the reviewer signing off, the tester writing cases — works from the same statement of what may never overlap.
- State Machine vs Flow Model
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. Neither this nor any other of the 4 citations of this work carries a recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:dd705601753c · see in the full table