Abstract
Building on the theory of interface automata by de Alfaro and Henzinger we design an interface language for Lynch’s I/O, a popular formalism used in the development of distributed asynchronous systems, not addressed by previous interface research. We introduce an explicit separation of assumptions from guarantees not yet seen in other behavioral interface theories. Moreover we derive the composition operator systematically and formally, guaranteeing that the resulting compositions are always the weakest in the sense of assumptions, and the strongest in the sense of guarantees. We also present a method for solving systems of relativized behavioral inequalities as used in our setup and draw a formal correspondence between our work and interface automata.
| Original language | English |
|---|---|
| Title of host publication | FM 2006: Formal Methods : 14th International Symposium on Formal MethodsHamilton, Canada, August 21-27, 2006 Proceedings |
| Editors | Jayadev Misra, Tobias Nipkow, Emil Sekerinski |
| Number of pages | 16 |
| Volume | Springer |
| Publisher | Springer |
| Publication date | 2006 |
| Pages | 82-97 |
| ISBN (Print) | 3540372156 |
| ISBN (Electronic) | 3540372156 |
| DOIs | |
| Publication status | Published - 2006 |
| Event | FM 2006 - Hamilton, Canada Duration: 21 Aug 2006 → 27 Aug 2006 Conference number: 14 |
Conference
| Conference | FM 2006 |
|---|---|
| Number | 14 |
| Country/Territory | Canada |
| City | Hamilton |
| Period | 21/08/2006 → 27/08/2006 |