@article{luttgen2015_21974,
  title = {Richer interface automata with optimistic and pessimistic compatibility},
  author = {Lüttgen, Gerald and Vogler, Walter and Fendrich, Sascha},
  year = {2015},
  journal = {Acta Informatica},
  volume = {52},
  number = {4/5},
  pages = {305-336},
  publisher = {Springer},
  address = {Heidelberg [u.a.]},
  issn = {1432-0525},
  doi = {10.1007/s00236-014-0211-0},
  url = {https://fis.uni-bamberg.de/handle/uniba/21974},
  language = {eng},
  abstract = {Modal transition systems are a popular semantic underpinning of interface theories, such as Nyman et al.’s IOMTS and Bauer et al.’s MIO, which facilitate component-based reasoning for concurrent systems. Our interface theory MIA repaired a compositional flaw of IOMTS-refinement and introduced a conjunction operator. In this paper, we first modify MIA to properly deal with internal computations including internal must-transitions, which were largely ignored already in IOMTS. We then study a MIA variant that adopts MIO’s pessimistic—rather than IOMTS’ optimistic—view on component compatibility and define, for the first-time in a pessimistic, non-deterministic setting, conjunction and disjunction on interfaces. For both the optimistic and pessimistic MIA variant, we also discuss mechanisms for extending alphabets when refining interfaces, which is a desired feature for perspective-based specification. We illustrate our advancements via a small example.}
}
