Results 1 
4 of
4
A modal interface theory for componentbased design. Fundamenta Informaticae
, 2011
"... Abstract. This paper presents the modal interface theory, a unification of interface automata and modal specifications, two radically dissimilar models for interface theories. Interface automata is a gamebased model, which allows to make assumptions on the environment and propose an optimistic vie ..."
Abstract

Cited by 20 (6 self)
 Add to MetaCart
(Show Context)
Abstract. This paper presents the modal interface theory, a unification of interface automata and modal specifications, two radically dissimilar models for interface theories. Interface automata is a gamebased model, which allows to make assumptions on the environment and propose an optimistic view for composition : two components can be composed if there is an environment where they can work together. Modal specification is a language theoretic account of a fragment of the modal mucalculus logic with a rich composition algebra meeting some methodological requirements but which does not allow to distinguish between the environment and the component. The present paper contributes a thorougher unification of the two theories by correcting a first attempt in this direction by Larsen et al., drawing a complete picture of the modal interface algebra, and pushing even further the comparison between interface automata, modal automata and modal interfaces. The work reported here is based on the earlier work in
Interface Synthesis and Protocol Conversion
 Formal Aspects of Computing
, 2008
"... Abstract. Given deterministic interfaces P and Q, we investigate the problem of synthesising an interface R such that P composed with R refines Q. We show that a solution exists iff P and Q ⊥ are compatible, and the most general solution is given by (P � Q ⊥ ) ⊥ , where P ⊥ is the interface P with ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
Abstract. Given deterministic interfaces P and Q, we investigate the problem of synthesising an interface R such that P composed with R refines Q. We show that a solution exists iff P and Q ⊥ are compatible, and the most general solution is given by (P � Q ⊥ ) ⊥ , where P ⊥ is the interface P with inputs and outputs interchanged. Remarkably, the result holds both for asynchronous and synchronous interfaces. We model interfaces using the interface automata formalism of de Alfaro and Henzinger. For the synchronous case, we give a new definition of synchronous interface automata based on Mealy machines and show that the result holds for a weak form of nondeterminism, called observable nondeterminism. We also characterise solutions to the synthesis problem in terms of winning input strategies in the automaton (P ⊗ Q ⊥ ) ⊥ , and the most general solution in terms of the most permissive winning strategy. We apply the solution to the synthesis of converters for mismatched protocols in both the asynchronous and synchronous domains. For the asynchronous case, this leads to automatic synthesis of converters for incompatible network protocols. In the synchronous case, we obtain automatic converters for mismatched intellectual property blocks in systemonchip designs. The work reported here is based on earlier work on interface synthesis in [Bha05] for the asynchronous case, and [BR06] for the synchronous one.
A.: Ecdar: An environment for compositional design and analysis of real time systems
 In: ATVA. Volume 6252 of LNCS
, 2010
"... Abstract. We present Ecdar a new tool for compositional design and verification of real time systems. In Ecdar, a component interface describes both the behavior of the component and the component’s assumptions about the environment. The tool supports the important operations of a good composition ..."
Abstract

Cited by 11 (6 self)
 Add to MetaCart
(Show Context)
Abstract. We present Ecdar a new tool for compositional design and verification of real time systems. In Ecdar, a component interface describes both the behavior of the component and the component’s assumptions about the environment. The tool supports the important operations of a good compositional reasoning theory: composition, conjunction, quotient, consistency/satisfaction checking, and refinement. The operators can be used to combine basic models into larger specifications to construct comprehensive system descriptions from basic requirements. Algorithms to perform these operations have been based on a game theoretical setting that permits, for example, to capture the realtime constraints on communication events between components. The compositional approach allows for scalability in the verification. 1
unknown title
"... Reuse of IP blocks has been advocated as a means to conquer the complexity of today’s systemonchip (SoC) designs. Component integration and verification in such systems is a cumbersome and time consuming process. We present synchronous interface automata (SIA) as a framework for modelling communic ..."
Abstract
 Add to MetaCart
(Show Context)
Reuse of IP blocks has been advocated as a means to conquer the complexity of today’s systemonchip (SoC) designs. Component integration and verification in such systems is a cumbersome and time consuming process. We present synchronous interface automata (SIA) as a framework for modelling communication aspects of IP blocks, to serve as a unifying model in the topdown refinement, synthesis and verification stages of the design process. We show how to formally specify component composition and protocol compatibility in our model, and how we can apply the model to the problem of synthesising converters for incompatible protocols of interaction between IP blocks. Our model is based on the game theoretic framework of interface automata, suitably adapted for practical modelling of IP blocks. 1.