Results 1 -
8 of
8
A Survey of Markovian Behavioral Equivalences
"... Abstract. Markovian behavioral equivalences are a means to relate and manipulate the formal descriptions of systems with an underlying CTMC semantics. There are three fundamental approaches to their definition: bisimilarity, testing, and trace. In this paper we survey the major results appeared in t ..."
Abstract
-
Cited by 8 (1 self)
- Add to MetaCart
(Show Context)
Abstract. Markovian behavioral equivalences are a means to relate and manipulate the formal descriptions of systems with an underlying CTMC semantics. There are three fundamental approaches to their definition: bisimilarity, testing, and trace. In this paper we survey the major results appeared in the literature about Markovian bisimilarity, Markovian testing equivalence, and Markovian trace equivalence. The objective is to compare these equivalences with respect to a number of criteria such as their discriminating power, the exactness of the CTMC-level aggregations they induce, the achievement of the congruence property, the existence of sound and complete axiomatizations, the existence of logical characterizations, and the existence of efficient verification algorithms. 1
Formal Techniques for Performance Analysis: blending SAN and PEPA
- UNDER CONSIDERATION FOR PUBLICATION IN FORMAL ASPECTS OF COMPUTING
"... In this paper we consider two performance modelling techniques from the perspectives of model construction, generation of an underlying continuous time Markov process, and the potential for reduction in the Markov process. Such careful comparison of modelling techniques allows us to appreciate the ..."
Abstract
-
Cited by 8 (3 self)
- Add to MetaCart
In this paper we consider two performance modelling techniques from the perspectives of model construction, generation of an underlying continuous time Markov process, and the potential for reduction in the Markov process. Such careful comparison of modelling techniques allows us to appreciate the strengths and weaknesses of different approaches, and facilitates cross-fertilization between them. In the present case we take a characteristic of one formalism, functional rates in Stochastic Automata Networks, and introduce it to the other formalism, Performance Evaluation Process Algebra. We investigate the benefits of this cross-fertilization, particularly from the perspectives of Markov process generation and reduction.
StoKlaim: A Stochastic Extension of Klaim
, 2006
"... Global (or network-aware) computing entails large-scale networks of computers performing tasks in a cooperative and coordinated manner. Programming and modeling languages such as Klaim focus on key functional aspects of global computing such as distribution awareness, (code and agent) mobility, and ..."
Abstract
-
Cited by 6 (3 self)
- Add to MetaCart
Global (or network-aware) computing entails large-scale networks of computers performing tasks in a cooperative and coordinated manner. Programming and modeling languages such as Klaim focus on key functional aspects of global computing such as distribution awareness, (code and agent) mobility, and privacy aspects. This paper instead concentrates on their performance and dependability aspects. It proposes StoKlaim, an extension of Klaim which permits the description of random phenomena such as spontaneous computer crashes and spurious network hick ups. The operational semantics of StoKlaim is based on continuous-time Markov chains. The approach is illustrated by modeling the spreading of a virus through a network.
Probabilistic mobile ambients
- Theoretical Computer Science
, 2009
"... Abstract The calculus of Mobile Ambients has been introduced for expressing mobility and mobile computation. In this paper we present a probabilistic version of Mobile Ambients by augmenting the syntax of the original Ambient Calculus with a (guarded) probabilistic choice operator. To allow for the ..."
Abstract
-
Cited by 5 (1 self)
- Add to MetaCart
(Show Context)
Abstract The calculus of Mobile Ambients has been introduced for expressing mobility and mobile computation. In this paper we present a probabilistic version of Mobile Ambients by augmenting the syntax of the original Ambient Calculus with a (guarded) probabilistic choice operator. To allow for the representation of both the probabilistic behaviour introduced through the new probabilistic choice operator and the non-determinism present in the original Ambient Calculus we use probabilistic automata as the underpinning semantic model. We also introduce the Probabilistic Ambient Logic for specifying properties of Probabilistic Mobile Ambients, which extends the Ambient Logic, a logic for Mobile Ambients, that contains a novel treatment of both locations and hidden names. In addition, to show the utility of our approach we present an example of a virus infecting a network.
Factoring user experience into the design of ambient and mobile systems
"... Abstract The engineering of ubiquitous computing systems provides important challenges. Not least among these is the need to understand how to implement designs that create a required experience for users. The paper explores a particular class of such systems for built environments. In particular i ..."
Abstract
- Add to MetaCart
Abstract The engineering of ubiquitous computing systems provides important challenges. Not least among these is the need to understand how to implement designs that create a required experience for users. The paper explores a particular class of such systems for built environments. In particular it is concerned with the capture of experience requirements and production of prototypes that create experience. The aim is to develop methods and tools for such environments to enable the creation of particular sorts of experience in users. An approach that combines the use of scenarios, personae and snapshots with the use of prototypes and models is described. The technique aims to elicit an understanding of the required experience of the system and then create a design that satisfies the requirements.
Coalgebraic Bisimulation Of Futs
, 2013
"... Labeled state-to-function transition systems, FuTSs for short, capture transition schemes incorporat-ing multiplicities from states to functions of finite support over general semirings. As such FuTSs constitute a convenient modeling instrument to deal with process languages and their stochastic ex- ..."
Abstract
- Add to MetaCart
Labeled state-to-function transition systems, FuTSs for short, capture transition schemes incorporat-ing multiplicities from states to functions of finite support over general semirings. As such FuTSs constitute a convenient modeling instrument to deal with process languages and their stochastic ex-tensions in particular. In this paper, the notion of bisimulation induced by a FuTS is addressed from a coalgebraic point of view. A correspondence result is established stating that FuTS-bisimilarity co-incides with behavioural equivalence of the associated functor. Moreover, it is shown that for FuTSs involving a specific type of semiring only, weak pullbacks are preserved. As a consequence, for these FuTSs, behavioural equivalence coincides with coalgebraic bisimilarity. As generic examples, the equivalences underlying the stochastic process algebras PEPA and IML are related to the bisimilar-ity of specific FuTSs. By the correspondence result coalgebraic justification of the equivalences of these calculi is obtained. Further illustrations of FuTS semantics are discussed for deterministically (discrete) timed process algebras and Markov Automata.
Assisting the design of a groupware system -- Model checking usability aspects of thinkteam
- THE JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING
, 2009
"... ..."
