20 research outputs found

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

    Get PDF
    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 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

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

    No full text
    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 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

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

    No full text
    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 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

    Interface automata with error states

    Get PDF
    De Alfaro and Henzinger advocated interface automata to model and study behavioural types, which describe communication patterns of systems while abstracting e.g. from data. They come with a specific parallel composition: if, in some state, one component tries to make an output, which the other one cannot receive, the state is regarded as an error. Error states are removed along with some states leading to them. As refinement relation an alternating simulation is introduced. In this report, we study to what degree this refinement relation is justified by the desires to avoid error states and to support modular refinement. For this, we leave the error states in place and mark them as such instead of removing them in the composition. Our Error-I-O-Transition systems are slightly more general than Interface automata, which are restricted to input determinism. Our basic requirement is: an implementation must be error free, if the specification is. For two different notions of error freeness, we determine the coarsest precongruences contained in the respective basic refinement relations. We characterize these best refinement relations meeting our desirables with trace sets. Thus our precongruences are less discriminating than simulation-based ones. Along the way we point out an error in an early paper by de Alfaro and Henzinger

    Error-pruning in interface automata

    No full text

    Design av ett användarvänligt sökgränssnitt för analoga arbetare : En pilotstudie inuti ett kostym- och rekvisitaförråd

    No full text
    The Swedish Television ́s department for costumes and props is digitizing the work processes concerning the documentation, rental and storage of over two million objects. This thesis is a pilot study with the objective of investigating which design elements are crucial to ensure a smooth transition from the analog domain to the digital, in a specialized field. By utilizing core usability techniques, such as observations, workshops, paper prototypes and workload estimates, the key habits and work methods of the employees became apparent. This information was used to produce a high fidelity prototype of a search user interface, which was tested by 7 employees, followed by the NASA Task Load Index questionnaire. Results showed a statistically significant decrease in mean subjective workload and an increase in satisfaction while using the prototype.Sveriges Televisions avdelning för kostym och rekvisita håller på att digitalisera arbetsprocesserna gällande dokumentation, uthyrning och förvaring av över två miljoner objekt. Detta examensarbete är en pilotstudie med syfte att undersöka vilka designelement som är avgörande för att garantera en smidig övergång från det analoga till det digitala, inom ett specialiserat område. Genom användning av typiska tekniker för användbarhet, såsom observationer, workshops, pappersprototyper och uppskattning av arbetsbörda, blev betydande vanor och arbetsmetoder för de anställda tydliga. Denna information användes för att skapa en high fidelity prototyp av ett sökgränssnitt, vilken testades av 7 anställda. Detta följdes av NASA Task Load Index-formuläret. Resultaten visade en statistisk signifikant minskning av medelvärdet för den subjektiva arbetsbördan samt en ökning av nöjdhet vid användandet av prototypen

    [Nevin Çoker'e ait resim çalışmaları]

    No full text
    Taha Toros Arşivi, Dosya No: 162-Çoker'le

    Error-pruning in interface automata

    No full text
    corecore