Modal Interface Automata: A Theory for Heterogeneous Specification of Parallel Systems

  • This thesis presents the latest incarnation of the interface theory of Modal Interface Automata (MIA) which unifies several different types of specification mechanisms. It allows for stepwise and aspect-oriented specifications and provides structural operators, like parallel composition and hiding, logical operators like conjunction and disjunction, and even temporal logic operators like Universal and Existential Next-operators and an Unless-operator. MIA combines the modalities of (disjunctive) Modal Transition Systems (dMTSs) with the input/output handling of Interface Automata (IA). Thus, we examine the fundamentals of these two specification theories considering different aspects of possible refinement relations before presenting the MIA framework. We examine failure semantics and failure/divergence semantics for dMTSs and their justification via testing scenarios. We also examine the fundamental design decisions of IA: the pruning built into parallel composition and theThis thesis presents the latest incarnation of the interface theory of Modal Interface Automata (MIA) which unifies several different types of specification mechanisms. It allows for stepwise and aspect-oriented specifications and provides structural operators, like parallel composition and hiding, logical operators like conjunction and disjunction, and even temporal logic operators like Universal and Existential Next-operators and an Unless-operator. MIA combines the modalities of (disjunctive) Modal Transition Systems (dMTSs) with the input/output handling of Interface Automata (IA). Thus, we examine the fundamentals of these two specification theories considering different aspects of possible refinement relations before presenting the MIA framework. We examine failure semantics and failure/divergence semantics for dMTSs and their justification via testing scenarios. We also examine the fundamental design decisions of IA: the pruning built into parallel composition and the optimistic approach of the refinement. The resulting refinement relations are compared to the more traditional simulation relations on which the refinement of MIA is built. Further insights from these examinations are also incorporated into the interface theory that is MIA.show moreshow less

Download full text files

Export metadata

Statistics

Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Ferenc Bujtor
URN:urn:nbn:de:bvb:384-opus4-438055
Frontdoor URLhttps://opus.bibliothek.uni-augsburg.de/opus4/43805
Advisor:Walter Vogler
Type:Doctoral Thesis
Language:English
Year of first Publication:2018
Publishing Institution:Universität Augsburg
Granting Institution:Universität Augsburg, Fakultät für Angewandte Informatik
Date of final exam:2018/10/12
Release Date:2018/11/27
GND-Keyword:Theoretische Informatik; Formale Methode; Softwareschnittstelle
Pagenumber:196
Institutes:Fakultät für Angewandte Informatik
Fakultät für Angewandte Informatik / Institut für Informatik
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Licence (German):Deutsches Urheberrecht