Towards a Logic for Performance and Mobility
TL;DR: MoSL, a temporal logic for StocKlaim is proposed which addresses and integrates the issues of distribution awareness and mobility and those concerning stochastic behaviour of systems and the satisfiability relation is formally defined over labelled Markov chains.
read more
About: This article is published in Electronic Notes in Theoretical Computer Science. The article was published on 01 May 2006. and is currently open access. The article focuses on the topics: Temporal logic & Systems architecture.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Policy-based Coordination in PAGODA: A Case Study
TL;DR: This paper describes a specification of PAGODA using the Russian Dolls model of policy-based coordination and principles for showing that the policies satisfy the requirements are discussed as a first step toward a logic of Policy And GOal Based Distributed Autonomy.
22
Comparing Three Coordination Models: Reo, ARC, and RRD
TL;DR: Three models of coordination-Reo, Actors-Roles-Coordinators (ARC), and Reflective Russian Dolls (RRD)-are compared and contrasted according to a set of coordination features.
16
Less is More: Estimating Probabilistic Rewards over Partial System Explorations
TL;DR: This article presents a novel automated technique for metric estimation that combines simulation, invariant inference, and probabilistic model checking, and reports on experiments that suggest that metric estimation using this technique can be more effective than (full-model) Probabilistic and statistical model checking.
Combining Timed Coordination Primitives and Probabilistic Tuple Spaces
Mario Bravetti,Diego Latella,Michele Loreti,Mieke Massink,Gianluigi Zavattaro +4 more
- 05 Apr 2009
TL;DR: An integration of PLinda, a probabilistic extension of Linda, and StoKlaim, a stochastic extension of KLAIM is presented, a natural development and integration of previous results of the SENSORIA Project in the area of Probabilistic and time-stochastic extensions of Tuple Space based coordination languages.
Garantías cuantitativas para espacios de estados no tratables
Esteban Pavese
- 19 Oct 2015
TL;DR: In this paper, an extension probabilistica al formalism of Interface Automata is presented, in which the probabilidades of eventos independientes are compared with estimaciones obtenidas of the observación del comportamiento a modelar.
References
A logic for reasoning about time and reability
Hans Hansson,Bengt Jonsson +1 more
TL;DR: This work presents a logic for stating properties such as, “after a request for service there is at least a 98% probability that the service will be carried out within 2 seconds” and gives algorithms for checking that a given Markov chain satisfies a formula in the logic.
•Book
Modeling and Analysis of Stochastic Systems
Vidyadhar G. Kulkarni
- 15 May 1996
TL;DR: In this paper, the authors define a discrete-time Markov chain to describe the dynamics of a stochastic process, and investigate the effect of different types of discontinuities.
850
KLAIM: a kernel language for agents interaction and mobility
TL;DR: This work investigates the issue of designing a kernel programming language for mobile computing and describes KLAIM, a language that supports a programming paradigm where processes, like data, can be moved from one computing environment to another.
•Journal Article
Approximate symbolic model checking of continuous-time Markov chains
TL;DR: In this article, a model checking algorithm for continuous-time Markov chains for an extension of the continuous stochastic logic CSL of Aziz et al. is presented, which contains a time-bounded until operator and a novel operator to express steady-state probabilities.
198
Related Papers (5)
Andrea Bianco,Luca de Alfaro +1 more
- 18 Dec 1995
Mads Dam,Lars-Åke Fredlund,Dilian Gurov +2 more
- 08 Sep 1997