Modal Interface Automata - Theoretical Computer Science
Conference Papers Year : 2012

Modal Interface Automata

Abstract

De Alfaro and Henzinger’s Interface Automata (IA) and Nyman et al.’s recent combination IOMTS of IA and Larsen’s Modal Transition Systems (MTS) are established frameworks for specifying interfaces of system components. However, neither IA nor IOMTS consider conjunction that is needed in practice when a component satisfies multiple interfaces, while Larsen’s MTS-conjunction is not closed. In addition, IOMTS-parallel composition exhibits a compositionality defect.This paper defines conjunction on IA and MTS and proves the operators to be ‘correct’, i.e., the greatest lower bounds wrt. IA- and resp. MTS-refinement. As its main contribution, a novel interface theory called Modal Interface Automata (MIA) is introduced: MIA is a rich subset of IOMTS, is equipped with compositional parallel and conjunction operators, and allows a simpler embedding of IA than Nyman’s. Thus, it fixes the shortcomings of related work, without restricting designers to deterministic interfaces as Raclet et al.’s modal interface theory does.
Fichier principal
Vignette du fichier
978-3-642-33475-7_19_Chapter.pdf (308.6 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01556228 , version 1 (04-07-2017)

Licence

Identifiers

Cite

Gerald Lüttgen, Walter Vogler. Modal Interface Automata. 7th International Conference on Theoretical Computer Science (TCS), Sep 2012, Amsterdam, Netherlands. pp.265-279, ⟨10.1007/978-3-642-33475-7_19⟩. ⟨hal-01556228⟩
202 View
90 Download

Altmetric

Share

More