2003
DOI: 10.5381/jot.2003.2.6.a2
|View full text |Cite
|
Sign up to set email alerts
|

State Machines as Mixins.

Abstract: Mainstream object modelling techniques use Statechart Diagrams as a means of modelling object behaviour. Research into how statecharts can be used in the context of class generalization hierarchies has focused on applying the Liskov Substitution Principle (LSP) to statecharts. This approach is problematic, and we describe three reservations.We propose an alternative approach based on mixin-style composition of state transition diagrams. This avoids the problems we note in the LSP based approach; and is also a … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
20
0

Year Published

2005
2005
2024
2024

Publication Types

Select...
5
1
1

Relationship

2
5

Authors

Journals

citations
Cited by 23 publications
(20 citation statements)
references
References 4 publications
0
20
0
Order By: Relevance
“…Indeed, the standard formalism for determining the masses of hadrons on a lattice may be inappropriate in the presence of open decay channels and special techniques may be needed [20,21,22]. The MILC collaboration reported problems in extracting the masses of non-singlet 0 ++ [23] and 1 −+ [24] mesons, that they at-tributed to open decay channels.…”
Section: Introductionmentioning
confidence: 99%
“…Indeed, the standard formalism for determining the masses of hadrons on a lattice may be inappropriate in the presence of open decay channels and special techniques may be needed [20,21,22]. The MILC collaboration reported problems in extracting the masses of non-singlet 0 ++ [23] and 1 −+ [24] mesons, that they at-tributed to open decay channels.…”
Section: Introductionmentioning
confidence: 99%
“…Observational Consistency and Local reasoning. Suppose that P M 1 and P M 2 are protocol machines and that P M 1 and P M 1 P M 2 are both trace independent, then P M 1 P M 2 is Observationally Consistent [5] with P M 1 . This means that if T is a trace of P M 1 P M 2 and we remove from T the events that are not in the alphabet of P M 1 , we will obtain a trace of P M 1 [1].…”
Section: Reasoning About Behaviour and Model Evolutionmentioning
confidence: 99%
“…Protocol models can be directly executed (tested) after any step of model evolution, and this is supported by the ModelScope [6] tool, providing run-time machine composition and a generic (metadata driven) user interface. The input of the tool is the textual presentation of a protocol model described in Section 3, and Figure 9 shows the user interface as it appears when executing the CMS case study.…”
Section: Model Execution and Testabilitymentioning
confidence: 99%
“…If a given sequence of events is presented to a model twice starting from the same initial state, the final state of the model will be the same, as will be the set of events that it could accept next. The reason for requiring determinism is the ability this gives to argue about behavior based on traces 6 . There is, however, no assumption that non-determinism may not be introduced at physical design time if it is decided to distribute the model across multiple (real or virtual) processors; but this must be done in such a way that the behavior of the model is not broken by such a distribution.…”
Section: Concurrency and Determinismmentioning
confidence: 99%
See 1 more Smart Citation