Results 1  10
of
87
Modeling Heterogeneous RealTime Components in BIP
 In 4 th IEEE International Conference on Software Engineering and Formal Methods (SEFM06
, 2006
"... We present a methodology for modeling heterogeneous realtime components. Components are obtained as the superposition of three layers: Behavior, specified as a set of transitions; Interactions between transitions of the behavior; Priorities, used to choose amongst possible interactions. A parameter ..."
Abstract

Cited by 111 (34 self)
 Add to MetaCart
(Show Context)
We present a methodology for modeling heterogeneous realtime components. Components are obtained as the superposition of three layers: Behavior, specified as a set of transitions; Interactions between transitions of the behavior; Priorities, used to choose amongst possible interactions. A parameterized binary composition operator is used to compose components layer by layer. We present the BIP language for the description and composition of layered components as well as associated tools for executing and analyzing components on a dedicated platform. The language provides a powerful mechanism for structuring interactions involving rendezvous and broadcast. We show that synchronous and timed systems are particular classes of components. Finally, we provide examples and compare the BIP framework to existing ones for heterogeneous componentbased modeling. 1.
Modeling and Validating Distributed Embedded RealTime Control Systems
, 2008
"... The development of complex embedded control systems can be improved significantly by applying formal techniques from control engineering and software engineering. It is shown how these approaches can be combined to improve the design and analysis of hightech systems, both in theory and practice. Th ..."
Abstract

Cited by 38 (16 self)
 Add to MetaCart
The development of complex embedded control systems can be improved significantly by applying formal techniques from control engineering and software engineering. It is shown how these approaches can be combined to improve the design and analysis of hightech systems, both in theory and practice. The semantics of the integration of two established rigorous techniques has been defined formally in this work. The strength of this integrated semantics is demonstrated by means of a significant industrial case study: the embedded control of a printer paper path, whereby the full development lifecycle from model to realization is covered. The resulting modeldriven design approach fits the current engineering practice in industry and is both flexible and effective.
Formal verification of hybrid systems
, 2011
"... In formal verification, a designer first constructs a model, with mathematically precise semantics, of the system under design, and performs extensive analysis with respect to correctness requirements. The appropriate mathematical model for embedded control systems is hybrid systems that combines th ..."
Abstract

Cited by 34 (0 self)
 Add to MetaCart
(Show Context)
In formal verification, a designer first constructs a model, with mathematically precise semantics, of the system under design, and performs extensive analysis with respect to correctness requirements. The appropriate mathematical model for embedded control systems is hybrid systems that combines the traditional statemachine based models for discrete control with classical differentialequations based models for continuously evolving physical activities. In this article, we briefly review selected existing approaches to formal verification of hybrid systems, along with directions for future research.
A.: Timed I/O Automata: A Complete Specification Theory for Realtime Systems
 In: HSCC 2010
, 2010
"... A specification theory combines notions of specifications and implementations with a satisfaction relation, a refinement relation and a set of operators supporting stepwise design. We develop a complete specification framework for realtime systems using Timed I/O Automata as the specification form ..."
Abstract

Cited by 34 (15 self)
 Add to MetaCart
(Show Context)
A specification theory combines notions of specifications and implementations with a satisfaction relation, a refinement relation and a set of operators supporting stepwise design. We develop a complete specification framework for realtime systems using Timed I/O Automata as the specification formalism, with the semantics expressed in terms of Timed I/O Transition Systems. We provide constructs for refinement, consistency checking, logical and structural composition, and quotient of specifications – all indispensable ingredients of a compositional design methodology. The theory is implemented on top of an engine for timed games, Uppaaltiga, and illustrated with a small case study.
Modal Interfaces: Unifying Interface Automata and Modal Specifications
, 2009
"... This paper presents 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 b ..."
Abstract

Cited by 26 (9 self)
 Add to MetaCart
(Show Context)
This paper presents 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 that is more complete but which does not allow to distinguish between the environment and the component. Partial unifications of these two frameworks have been explored recently. A first attempt by Larsen et al. considers modal interfaces, an extension of modal specifications that deals with compatibility issues in the composition operator. However, this composition operator is incorrect. A second attempt by Raclet et al. gives a different perspective, and emphasises on conjunction and residuation of modal specifications, including when interfaces have dissimilar alphabets, but disregards interface compatibility. The present paper contributes a thorougher unification of the two theories by correcting the modal interface composition operator presented in the paper 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.
On Determinism in Modal Transition Systems
, 2009
"... Modal transition systems (MTS) is a formalism which extends the classical notion of labelled transition systems by introducing transitions of two types: must transitions that have to be present in any implementation of the MTS and may transitions that are allowed but not required. The MTS framework ..."
Abstract

Cited by 21 (6 self)
 Add to MetaCart
Modal transition systems (MTS) is a formalism which extends the classical notion of labelled transition systems by introducing transitions of two types: must transitions that have to be present in any implementation of the MTS and may transitions that are allowed but not required. The MTS framework has proved to be useful as a specification formalism of componentbased systems as it supports compositional verification and stepwise refinement. Nevertheless, there are some limitations of the theory, namely that the naturally defined notions of modal refinement and modal composition are incomplete with respect to the semantic view based on the sets of the implementations of a given MTS specification. Recent work indicates that some of these limitations might be overcome by considering deterministic systems, which seem to be more manageable but still interesting for several application areas. In the present article, we provide a comprehensive account of the MTS framework in the deterministic setting. We study a number of problems previously considered on MTS and point out to what extend we can expect better results under the restriction of determinism.
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
Synthesis of quantized feedback control software for discrete time linear hybrid systems
, 2010
"... Abstract. We present an algorithm that given a Discrete Time Linear Hybrid System H returns a correctbyconstruction software implementation K for a (near time optimal) robust quantized feedback controller for H along with the set of states on which K is guaranteed to work correctly (controllable ..."
Abstract

Cited by 16 (15 self)
 Add to MetaCart
(Show Context)
Abstract. We present an algorithm that given a Discrete Time Linear Hybrid System H returns a correctbyconstruction software implementation K for a (near time optimal) robust quantized feedback controller for H along with the set of states on which K is guaranteed to work correctly (controllable region). Furthermore, K has a Worst Case Execution Time linear in the number of bits of the quantization schema. 1
Compositional design methodology with constraint Markov chains
 in: International Conference on Quantitative Evaluation of Systems, QEST, IEEE Computer Society
"... Notions of specification, implementation, satisfaction, and refinement, together with operators supporting stepwise design, constitute a specification theory. We construct such a theory for Markov Chains (MCs) employing a new abstraction of a Constraint MC. Constraint MCs permit rich constraints on ..."
Abstract

Cited by 14 (7 self)
 Add to MetaCart
(Show Context)
Notions of specification, implementation, satisfaction, and refinement, together with operators supporting stepwise design, constitute a specification theory. We construct such a theory for Markov Chains (MCs) employing a new abstraction of a Constraint MC. Constraint MCs permit rich constraints on probability distributions and thus generalize prior abstractions such as Interval MCs. Linear (polynomial) constraints suffice for closure under conjunction (respectively parallel composition). This is the first specification theory for MCs with such closure properties. We discuss its relation to simpler operators for known languages such as probabilistic process algebra. Despite the generality, all operators and relations are computable. I.