Submitted Paper
| ID | 1 |
| Submitted | 2006-01-05 |
| Last Update | |
| Title | From Interaction Diagrams to State Machines: Moving to Class-Level |
| Author(s) | Author #1 Name: Yves Bontemps Org: FUNDP Country: Belgium Email: ybo@info.fundp.ac.be Author #2 Name: Germain Saval Org: FUNDP Country: Belgium Email: gsa@info.fundp.ac.be Author #3 Name: Patrick Heymans Org: FUNDP Country: Belgium Email: phe@info.fundp.ac.be Author #4 Name: Pierre-Yves Schobbens Org: FUNDP Country: Belgium Email: pys@info.fundp.ac.be |
| Other Author(s) | |
| Contact Author | Author #4 Alt Email: Telephone: +3281724990 |
| Keywords | |
| Abstract | Scenarios and State Machines offer two complimentary views
on the behavior of distributed systems. The former presents a bird’s eye view on ob jects interactions, whereas the latter describes the complete behavior of every ob ject, thus being closer to implementation. Many algorithms translating scenarios to state machines have been devised. All these algorithms work at instance-level, i.e. for a fixed finite num- ber of ob jects. Real-world object-oriented systems may contain arbitrar- ily many ob jects. Modeling languages and synthesis algorithms need to be adapted to this situation. We propose a simple and elegant ex- tension of State Machines and Interaction Diagrams, that adds univer- sal/existential quantifiers. This makes it possible to describe protocols such as “when some observer detects an event, it notifies all registered clients”. The problem we want to solve is precisely defined and an algo- rithmic solution is given and proven correct. Our synthesis algorithm is similar to state of the art approaches but adds a novel instantiation step to cope with quantifiers. |
| Topics | |
| Comments | |
| Paper | 1.pdf (574KB) |