Book ChapterDOI
Interface-based design
Luca de Alfaro,Thomas A. Henzinger +1 more
- pp 83-104
Reads0
Chats0
TLDR
This work motivates and introduces the theory behind formalizing rich interfaces for software and hardware components, called interface automata, which permits a compiler to check the compatibility of component interaction protocols.Abstract:
Surveying results from [5] and [6], we motivate and introduce the theory behind formalizing rich interfaces for software and hardware components. Rich interfaces specify the protocol aspects of component interaction. Their formalization, called interface automata, permits a compiler to check the compatibility of component interaction protocols. Interface automata support incremental design and independent implementability. Incremental design means that the compatibility checking of interfaces can proceed for partial system descriptions, without knowing the interfaces of all components. Independent implementability means that compatible interfaces can be refined separately, while still maintaining compatibility.read more
Citations
More filters
Proceedings ArticleDOI
Cyber Physical Systems: Design Challenges
TL;DR: It is concluded that it will not be sufficient to improve design processes, raise the level of abstraction, or verify designs that are built on today's abstractions to realize the full potential of cyber-Physical Systems.
Book ChapterDOI
The embedded systems design challenge
TL;DR: In this article, the authors summarize some current trends in embedded systems design and point out some of their characteristics, such as the chasm between analytical and computational models, and the gap between safety-critical and best-effort engineering practices.
Book ChapterDOI
Modal I/O automata for interface and product line theories
TL;DR: In this article, the authors define modal I/O automata, an extension of interface automata with modality that can express liveness properties, disallowing trivial implementations of interfaces, a problem that exists for theories build around simulation preorders.
Journal ArticleDOI
Actor-oriented design of embedded hardware and software systems
TL;DR: It is argued that model- based design and platform-based design are two views of the same thing, and that a platform is equivalently a set of designs.
Book
Contracts for System Design
Albert Benveniste,Benoît Caillaud,Dejan Nickovic,Roberto Passerone,Jean-Baptiste Raclet,Philipp Reinkemeier,Alberto Sangiovanni-Vincentelli,Werner Damm,Thomas A. Henzinger,Kim Guldstrand Larsen +9 more
TL;DR: This paper intends to provide treatment where contracts are precisely defined and characterized so that they can be used in design methodologies such as the ones mentioned above with no ambiguity, and provides an important link between interfaces and contracts to show similarities and correspondences.
References
More filters
Book
Distributed algorithms
TL;DR: This book familiarizes readers with important problems, algorithms, and impossibility results in the area, and teaches readers how to reason carefully about distributed algorithms-to model them formally, devise precise specifications for their required behavior, prove their correctness, and evaluate their performance with realistic measures.
Proceedings ArticleDOI
Interface automata
TL;DR: This work presents a light-weight formalism that captures the temporal aspects of software component interfaces through an automata-based language that supports automatic compatability checks between interface models, and thus constitutes a type system for component interaction.
Book ChapterDOI
Interface Theories for Component-Based Design
TL;DR: This work states that many aspects of interface models, such as compatibility and refinement checking between interfaces, are properly viewed in a gametheoretic setting, where the input and output values of an interface are chosen by different players.
Book ChapterDOI
Alternating Refinement Relations
TL;DR: This paper generalizes the definitions of the simulation and trace containment preorders from labeled transition systems to alternating transition systems, and shows that, like ordinary simulation, alternating simulation can be checked in polynomial time using a fixpoint computation algorithm.
Journal ArticleDOI
The complexity of two-player games of incomplete information
TL;DR: Various games of incomplete information are presented which are shown to be universal in the sense that they are the hardest of all reasonable games of complete information.