Results 1  10
of
15
The Discipline of Embedded Systems Design
 Computer
"... embedded systems at bay. It is time to build a new scientific foundation with embedded systems design as the cornerstone, which will ensure a systematic and evenhanded integration of the two fields. Computer science is maturing. Researchers have solved many of the discipline’s original, defining pr ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
embedded systems at bay. It is time to build a new scientific foundation with embedded systems design as the cornerstone, which will ensure a systematic and evenhanded integration of the two fields. Computer science is maturing. Researchers have solved many of the discipline’s original, defining problems, and many of those that remain require a breakthrough that is impossible to foresee. Many current research challenges—the Semantic Web, nanotechnologies, computational biology, and sensor networks, for example—are pushing existing technology to the limits and into new applications. Many of the brightest students no longer aim to become computer scientists, but choose to enter directly into the life sciences or nanoengineering. 1 At the same time, computer technology has become ubiquitous in
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 10 (6 self)
 Add to MetaCart
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.
Modelling of Complex Software Systems: a Reasoned Overview
"... This paper is devoted to the presentation of the key concepts on which a mathematical theory of complex (industrial) systems can be based. We especially show how this formal framework can capture the realness of modern information technologies. We also present some new modelling problems that are na ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
This paper is devoted to the presentation of the key concepts on which a mathematical theory of complex (industrial) systems can be based. We especially show how this formal framework can capture the realness of modern information technologies. We also present some new modelling problems that are naturally emerging in the specific context of complex software systems.
TKKICSR25 INTERFACE SPECIFICATION METHODS FOR SOFTWARE COM PONENTS
"... Informaatio ja luonnontieteiden tiedekunta ..."
Synthesizing Probabilistic Composers ⋆
"... Abstract. Synthesis from components is the automated construction of a composite system from a library of reusable components such that the system satisfies the given specification. This is in contrast to classical synthesis, where systems are always “constructed from scratch”. In the controlflow m ..."
Abstract
 Add to MetaCart
Abstract. Synthesis from components is the automated construction of a composite system from a library of reusable components such that the system satisfies the given specification. This is in contrast to classical synthesis, where systems are always “constructed from scratch”. In the controlflow model of composition, exactly one component is in control at a given time and control is switched to another when the component reaches an exit state. The composition can then be described implicitly by a transducer, called a composer, which statically determines how the system transitions between components. Recently, Lustig, Nain and Vardi have shown that controlflow synthesis of deterministic composers from libraries of probabilistic components is decidable. In this work, we consider the more general case of probabilistic composers. We show that probabilistic composers are more expressive than deterministic composers, and that the synthesis problem still remains decidable.
New Results on Abstract Probabilistic Automata
"... Abstract—Probabilistic Automata (PAs) are a recognized framework for modeling and analysis of nondeterministic systems Probabilistic Automata (APAs)—an abstraction framework for PAs. In this paper, we discuss APAs over dissimilar alphabets, a determinisation operator, conjunction of nondeterministi ..."
Abstract
 Add to MetaCart
Abstract—Probabilistic Automata (PAs) are a recognized framework for modeling and analysis of nondeterministic systems Probabilistic Automata (APAs)—an abstraction framework for PAs. In this paper, we discuss APAs over dissimilar alphabets, a determinisation operator, conjunction of nondeterministic APAs, and an APAembedding of Interface Automata. We conclude introducing a tool for automatic manipulation of APAs. I.
On Greatest Lower Bound of Modal Transition Systems
"... Modal Transition Systems (MTSs) are finitestate automata whose transitions are typed with may and must modalities. MTSs can be used to represent a possibly infinite set of transition systems (TSs) that are its implementations. Informally, a must transition is available in every TS that implements t ..."
Abstract
 Add to MetaCart
Modal Transition Systems (MTSs) are finitestate automata whose transitions are typed with may and must modalities. MTSs can be used to represent a possibly infinite set of transition systems (TSs) that are its implementations. Informally, a must transition is available in every TS that implements the MTS, while a may transition needs not be. Given two MTSs, we consider the problem of computing their greatest lower bound (GLB), i.e., a new MTSs whose set of implementations is the intersection of those of the original MTSs. We show that for nondeterministic MTSs, such an intersection may not be computable. We then consider Acceptance Set Automata (ASAs) that is an extension of MTSs where may and must modalities are replaced by sets of actions. We show that the GLB of two ASs can always be computed. We conclude by showing that, contrary to the deterministic case, the class of nondeterministic MTSs is not a proper subclass of the one of nondeterministic ASAs. Keywords: 1.
Probabilistic Contract Based Reasoning with Markov Decision Processes
"... Abstract. In this paper we propose a probabilistic adaptation to the classical Assume/Guarantee contracts reasoning. This formalism relies on the notion of controllable Markov chains. We also propose an algorithm in order to compute probabilistic satisfaction and give possible definitions for probab ..."
Abstract
 Add to MetaCart
Abstract. In this paper we propose a probabilistic adaptation to the classical Assume/Guarantee contracts reasoning. This formalism relies on the notion of controllable Markov chains. We also propose an algorithm in order to compute probabilistic satisfaction and give possible definitions for probabilistic composition and dominance. 1
Constraint Markov Chains
, 2011
"... 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
 Add to MetaCart
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.