Quantitative Evaluation in Embedded System Design: Validation of Multiprocessor Multithreaded Architectures

Coste,; Hermanns,; Thonnart, Yvain; Garavel,; Hersemeule,; Zidouni,

doi:10.1109/date.2008.4484666

Cited by 9 publications

(9 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…PA as well as IMC are supported by mature software tools, PRISM [29] and CADP [16]. We are eagerly exploring possibilities to arrive at tool support for the analysis of MA.…”

Section: Discussionmentioning

confidence: 99%

Concurrency and Composition in a Stochastic World

Eisentraut

Hermanns

Zhang

2010

CONCUR 2010 - Concurrency Theory

Self Cite

View full text Add to dashboard Cite

Abstract. We discuss conceptional and foundational aspects of Markov automata [22]. We place this model in the context of continuous-and discrete-time Markov chains, probabilistic automata and interactive Markov chains, and provide insight into the parallel execution of such models. We further give a detailled account of the concept of relations on distributions, and discuss how this can generalise known notions of weak simulation and bisimulation, such as to fuse sequences of internal transitions.

show abstract

“…PA as well as IMC are supported by mature software tools, PRISM [29] and CADP [16]. We are eagerly exploring possibilities to arrive at tool support for the analysis of MA.…”

Section: Discussionmentioning

confidence: 99%

Concurrency and Composition in a Stochastic World

Eisentraut

Hermanns

Zhang

2010

CONCUR 2010 - Concurrency Theory

Self Cite

View full text Add to dashboard Cite

show abstract

“…318490. arbitrary phase-type distributions such as hyper-and hypoexponentials [28]. Since IMCs smoothly extend classical LTSs, the model has received attention in academic as well as in industrial settings [6,13,12,16].…”

Section: Introductionmentioning

confidence: 99%

Improving Time Bounded Reachability Computations in Interactive Markov Chains

Hatefi

Hermanns

2013

Fundamentals of Software Engineering

Self Cite

View full text Add to dashboard Cite

Abstract. Interactive Markov Chains (IMCs) are compositional behaviour models extending both Continuous Time Markov Chain (CTMC) and Labeled Transition System (LTS). They are used as semantic models in different engineering contexts ranging from ultramodern satellite designs to industrial system-on-chip manufacturing. Different approximation algorithms have been proposed for model checking of IMC, with time bounded reachability probabilities playing a pivotal role. This paper addresses the accuracy and efficiency of approximating time bounded reachability probabilities in IMC, improving over the state-of-the-art in both efficiency of computation and tightness of approximation. Experimental evidence is provided by applying the new method on a case study.

show abstract

“…Examples of studies include software reuse [12], unit testing [30], web service performance [13], middleware specification [28], software deployment protocols [31], multi-processor multi-threaded architectures [10], and software decomposition [7], in which processes usually represent software components, such as servers, packages, threads, objects or functions. These applications often involve the (possibly automatic) translation of (architectural) software description languages such as Uml, statecharts, or Bpel, each of which provides its own composition model, to a formal model.…”

Section: Introductionmentioning

confidence: 99%

Smart Reduction

Crouzen¹,

Lang²

2011

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Abstract.Compositional aggregation is a technique to palliate state explosion -the phenomenon that the behaviour graph of a parallel composition of asynchronous processes grows exponentially with the number of processes -which is the main drawback of explicit-state verification. It consists in building the behaviour graph by incrementally composing and minimizing parts of the composition modulo an equivalence relation. Heuristics have been proposed for finding an appropriate composition order that keeps the size of the largest intermediate graph small enough. Yet the underlying composition models are not general enough for systems involving elaborate forms of synchronization, such as multiway and/or nondeterministic synchronizations. We overcome this by proposing a generalization of compositional aggregation that applies to an expressive composition model based on synchronization vectors, subsuming many composition operators. Unlike some algebraic composition models, this model enables any composition order to be used. We also present an implementation of this approach within the Cadp verification toolbox in the form of a new operator called smart reduction, as well as experimental results assessing the efficiency of smart reduction.

show abstract

Quantitative Evaluation in Embedded System Design: Validation of Multiprocessor Multithreaded Architectures

Abstract: Abstract

Cited by 9 publications

References 7 publications

Concurrency and Composition in a Stochastic World

Concurrency and Composition in a Stochastic World

Improving Time Bounded Reachability Computations in Interactive Markov Chains

Smart Reduction

Contact Info

Product

Resources

About