Results 11  20
of
21
Towards Model Checking Stochastic Aspects of the thinkteam User Interface
 IN PROC. 12TH INTERNATIONAL WORKSHOP ON DESIGN, SPECIFICATION AND VERIFICATION OF INTERACTIVE SYSTEMS (DSVIS’05
, 2005
"... Stochastic model checking is a recent extension of traditional modelchecking techniques for the integrated analysis of both qualitative and quantitative system properties. In this paper we show how stochastic model checking can be conveniently used to address a number of usability concerns that inv ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
Stochastic model checking is a recent extension of traditional modelchecking techniques for the integrated analysis of both qualitative and quantitative system properties. In this paper we show how stochastic model checking can be conveniently used to address a number of usability concerns that involve quantitative aspects of a user interface for the industrial groupware system thinkteam. thinkteam is a readytouse Product Data Management application developed by think3. It allows enterprises to capture, organise, automate, and share engineering product information and it is an example of an asynchronous and dispersed groupware system. Several aspects of the functional correctness, such as concurrency aspects and awareness aspects, of the groupware protocol underlying thinkteam and of its planned publish/subscribe notification service have been addressed in previous work by means of a traditional modelchecking approach. In this paper we investigate the tradeoff between two different design options for granting users access to files in the database: a retrial approach and a waitinglist approach and show how stochastic model checking can be used for such analyses.
Eager Markov chains
 In Proc. ATVA ’06, 4Ø�Int. Symp. on Automated Technology for Verification and Analysis
, 2006
"... Abstract. We consider infinitestate discrete Markov chains which are eager: the probability of avoiding a defined set of final states for more thanÒsteps is bounded by some exponentially decreasing function�(Ò). We prove that eager Markov chains include those induced by Probabilistic Lossy Channel ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Abstract. We consider infinitestate discrete Markov chains which are eager: the probability of avoiding a defined set of final states for more thanÒsteps is bounded by some exponentially decreasing function�(Ò). We prove that eager Markov chains include those induced by Probabilistic Lossy Channel Systems, Probabilistic Vector Addition Systems with States, and Noisy Turing Machines, and that the bounding function�(Ò) can be effectively constructed for them. Furthermore, we study the problem of computing the expected reward (or cost) of runs until reaching the final states, where rewards are assigned to individual runs by computable reward functions. For eager Markov chains, an effective path exploration scheme, based on forward reachability analysis, can be used to approximate the expected reward upto an arbitrarily small error. 1
MoSL: A Stochastic Logic for StoKlaim
 TR, ISTI
, 2006
"... The programming and modeling language Klaim has been designed to address key functional aspects of global computing such as distribution awareness, (code and agent) mobility, and privacy aspects. This paper concentrates on their integration with performance and dependability aspects, the logical cha ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
The programming and modeling language Klaim has been designed to address key functional aspects of global computing such as distribution awareness, (code and agent) mobility, and privacy aspects. This paper concentrates on their integration with performance and dependability aspects, the logical characterization of performance and dependability requirements, and the automatic validation of system models against integrated formal functional and performance/dependability requirements. To that purpose the temporal logic MoSL is introduced for formulating properties of models specified in StoKlaim, a Markovian extension of Klaim introduced in previous work of the authors. MoSL is inspired by (an actionbased version of) CSL, an extension of CTL with ample means to refer to performance and dependability aspects. It is shown that a substantial fragment of the logic can be mapped onto the input language of existing probabilistic model checkers, thus allowing for the automated verification of qualitative and quantitative properties of networkaware programs. The approach is illustrated by modeling and verifying the spreading of a virus through a network.
Limiting Behavior of Markov Chains with Eager Attractors
, 2006
"... We consider discrete infinitestate Markov chains which contain an eager finite attractor. A finite attractor is a finite subset of states that is eventually reached with probability 1 from every other state, and the eagerness condition requires that the probability of avoiding the attractor in n o ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We consider discrete infinitestate Markov chains which contain an eager finite attractor. A finite attractor is a finite subset of states that is eventually reached with probability 1 from every other state, and the eagerness condition requires that the probability of avoiding the attractor in n or more steps after leaving it is exponentially bounded in n. Examples of such Markov chains are those induced by probabilistic lossy channel
Assisting the design of a groupware system  Model checking usability aspects of thinkteam
 THE JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING
, 2009
"... ..."
unknown title
, 2004
"... Mueller (Kaiserslautern University), Bernd Reuther (Kaiserslautern University), ..."
Abstract
 Add to MetaCart
Mueller (Kaiserslautern University), Bernd Reuther (Kaiserslautern University),
CaberNet Vision of Research and Technology Development in Distributed and Dependable Systems
"... Foreword CaberNet 1 is the Network of Excellence (NoE) in distributed and dependable systems. It is funded by the ..."
Abstract
 Add to MetaCart
Foreword CaberNet 1 is the Network of Excellence (NoE) in distributed and dependable systems. It is funded by the
Network of Excellence in Distributed and Dependable Computing Systems
, 2004
"... This document presents a CaberNet vision of Research and Technology Development (RTD) in Distributed and Dependable systems. It takes as a basis the stateoftheart (SOTA) Report prepared by John Bates in 1998: this document was commissioned by CaberNet as a first step towards the definition of ..."
Abstract
 Add to MetaCart
This document presents a CaberNet vision of Research and Technology Development (RTD) in Distributed and Dependable systems. It takes as a basis the stateoftheart (SOTA) Report prepared by John Bates in 1998: this document was commissioned by CaberNet as a first step towards the definition of a roadmap for European research in distributed and dependable systems. This report overviewed the developments in the main areas to which the CaberNet members made outstanding contributions, which were the most important at the time of its preparation, and analysed the most important trends in R&D in those areas