Name
Abstract | ||
|---|---|---|
To model the behavior of a distributed system, analysts often use two types of lan- guages: Sequence Diagrams and State Diagrams. The former presents a bird's eye view on objects interactions, whereas the latter describes the complete local behavior of every ob- ject. Many algorithms translating scenarios to state machines have been devised. All these algorithms work at instance-level, i.e. for a fixed finite number of objects. Real-world object- oriented systems often contain arbitrarily many objects. Modeling languages and synthesis algorithms need to be adapted to this situation. We propose to add universal and existential quantifiers. After defining the syntax and semantics of the two extended languages, we extend also a state of the art algorithm by a novel instantiation step to cope with quantifiers. As the base algorithm, our correction is weak since it allows implied behaviors. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.3166/tsi.26.797-817 | Technique et Science Informatiques |
Keywords | Field | DocType |
state diagram,diagramme d'état,synthèse de classe. keywords: sequence diagram,class-level synthesis.,mots-clés : diagramme de séquence,msc | Sequence diagram,Finite set,Computer science,State diagram,Modeling language,Algorithm,Theoretical computer science,Finite-state machine,Formal methods,Syntax,Semantics,Distributed computing | Journal |
Volume | Issue | Citations |
26 | 7 | 0 |
PageRank | References | Authors |
0.34 | 17 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yves Bontemps | 1 | 348 | 17.36 |
| Germain Saval | 2 | 115 | 6.56 |
| Pierre-Yves Schobbens | 3 | 2042 | 104.80 |
| Patrick Heymans | 4 | 2634 | 136.40 |