Synthesis of Interface Automata

Bhaduri, Purandar

doi:10.1007/11562948_26

Cited by 6 publications

(4 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is referred to as the compatibility of interfaces. A quotient, which is the adjoint of the game-based composition, has been proposed in [17] for the deterministic case.…”

Section: Beyond Modalitiesmentioning

confidence: 99%

Quantitative Modal Transition Systems

Larsen

Legay

2013

Recent Trends in Algebraic Development Techniques

View full text Add to dashboard Cite

show abstract

“…This is referred to as the compatibility of interfaces. A quotient, which is the adjoint of the game-based composition, has been proposed in [17] for the deterministic case.…”

Section: Beyond Modalitiesmentioning

confidence: 99%

Quantitative Modal Transition Systems

Larsen

Legay

2013

Recent Trends in Algebraic Development Techniques

View full text Add to dashboard Cite

show abstract

“…Hence, tools such as TICC or CHIC only provide these operations. Theories exists for quotient [3] and conjunction [12], but they have not been implemented neither in TICC nor in CHIC. More recently, Bauer et al have proposed a new extension of interface automata with A first dense time extension of the theory of interface automata has been developed in [11].…”

Section: Related Workmentioning

confidence: 99%

ECDAR: An Environment for Compositional Design and Analysis of Real Time Systems

David

Larsen

Legay

et al. 2010

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

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 real-time constraints on communication events between components. The compositional approach allows for scalability in the verification. OverviewThe context. Contemporary IT systems are assembled out of multiple independently developed components. Component providers operate under a contract on what the interface of each component is. Interfaces are typically described using textual documents or models in languages such as UML or WSDL. Unfortunately, such specifications are subject to interpretation. To avoid the risk of ambiguity, we recommend mathematically sound formalisms, such as interface theories, whenever possible. A good interface theory supports refinement checking (whether an interface can be replaced by another one), satisfaction checking (whether an implementation satisfies the requirements expressed with the interface), consistency checking (whether the interface can be implemented), a composition operator (structurally combining interfaces), a conjunction operator (computing a specification whose implementations are satisfying both operands), and a quotient operation that is the adjoint for composition. It should also guarantee important properties such as independent implementability [10].It has been argued [7,10] that games constitute a natural model for interface theories: each component is represented by an automaton whose transitions are typed with input and output modalities. The semantics of such an automaton is given by a two-player game: the input player represents the environment, and the output player represents the component. Contrary to the input/output

show abstract

“…Interface automaton is developed based on the finite state automaton. As a useful tool for depicting block-based open system, interface automata can be used to further verify and test software system [9,10]. For the purpose of automatic test of Simulink/Stateflow models, this paper adopts the interface automata to depict a Simulink/Stateflow model, and a transformation method from Simulink/Stateflow to hierarchical interface automata is presented which can transform Simulink model and Stateflow model to hierarchical interface automata model respectively and then compose them to obtain the ideal hierarchical interface automata model.…”

mentioning

confidence: 99%

A Transformation from Simulink/Stateflow to Hierarchical Interface Automata

Cheng

Yang

et al. 2013

2013 International Conference on Information Technology and Applications

View full text Add to dashboard Cite

The Simulink/Stateflow is a model used for modeling and simulation for dynamic system. However, Simulink/Stateflow is not suitable for the automatic generation of test cases. This paper adopts the hierarchical interface automata to depict the test model and presents the transformation method from Simulink/Stateflow to hierarchical interface automata. The Simulink sub-model and Stateflow sub-model will be transformed to hierarchical interface automata respectively and then combined together. In the transformation method presented in this paper, the hierarchical structure of Simulink/Stateflow model has been analyzed, and the generated hierarchical interface automata will be consistent with the original Simulink/Stateflow model in structure. Keywords-Simulink/Stateflow; Model Transformation; Hierarchical Interface Automata; Model Driven Testing I INTRODUCTIONFor modeling and verification for the rationality and correctness of embedded software design, OMG presented the Model Driven Architecture (MDA) and the Model Driven Testing (MDT) [1,2], and test model is used to abstractly describe the expected behavior of the system in MDT. However, with the increasing scale and complexity of embedded system, the difficulty of manually generating test model exaggerates, and automatic generation of test model has become an urgent problem in MDT.Simulink/Stateflow is a model used for modeling and simulation for dynamic system and has become widely used in the modeling and simulation of linear system, non-linear system, digital control and digital signal processing after tens of years of improving [3,4,5]. Simulink/Stateflow constructs the dynamic, hierarchical and event-driven hybrid system model by using graphs and diagrams. It can depict both the event-driven concrete system behavior and the time-dependent continuous system behavior, and provide convenience for the system design. However, Simulink/Stateflow is not suitable for the automatic generation of test cases.The Simulink/Stateflow model should be transformed to a test model for the automatic generation of test cases in MDT. A common method is to transform the Simulink/Stateflow model to automata model. Aditya Agrawal presents the method of transforming Simulink/Stateflow to Hybrid automata [6], but this method uses graph transformation as the underlying procedure for transforming and composing models, which cannot fully capture the attributes of the Simulink/Stateflow model. Alur R. presents the method of transforming Simulink/Stateflow to Hybrid automata for the purpose of improving simulation coverage [7], but this method can only be applied in the Simulink/Stateflow model with no blocks which will cause simulation branches. The tool-kit Hylink developed by UIUC is also devoted to transform Simulink/Stateflow to Input/Output automata [8], but the tool-kit destroys the hierarchical structure of Stateflow model during the transformation.The transformation method mentioned above focuses on transforming Simulink/Stateflow model to automata. However, these transformation ...

show abstract

Synthesis of Interface Automata

Cited by 6 publications

References 21 publications

Quantitative Modal Transition Systems

Quantitative Modal Transition Systems

ECDAR: An Environment for Compositional Design and Analysis of Real Time Systems

A Transformation from Simulink/Stateflow to Hierarchical Interface Automata

Contact Info

Product

Resources

About