L. de Alfaro, "How to specify and verify the longrun average behaviour of probabilistic systems", In Proc. of LICS'98, IEEE Press, 1998, 454--465. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Quantitative Observables and Averages in Probabilistic.. - Di Pierro, Wiklicky (1999) (Correct)
....the evaluation and modelling of many relevant performance and reliability indices of probabilistic systems, where one commonly refers to the long run average time required by the system to perform given tasks. By long run average it is therefore meant an average over an in nite period of time [10, 16]. On the other hand, the average behaviour of a probabilistic program can also be captured by considering the average among all its possible results from a given initial store. We will show that this correspond to the expected value of a suitably de ned random variable expressing the particular ....
....seems to bear some similarities to the work presented in this paper. We also showed how average properties can be naturally expressed by means of our augmented operational semantics. This provides a base for the speci cation and analysis of probabilistic properties such as the ones called in [10] long run average properties, and for an average case analysis of the program behaviour similar to the asymptotic average case analysis of the complexity of algorithms. We intend to further develop these ideas as part of a more general programme aiming at the de nition of an abstract ....
Luca de Alfaro. How to Specify and Verify the Long-Run Average Behavior of Probabilistic Systems. In Procceedings of LICS'98 - 13th Symposium on Logic in Computer Science, pages 174-183, Indianapolis, 1998. IEEE Computer Society Press.
Probabilistic Symbolic Model Checking with PRISM: A.. - Kwiatkowska, Norman.. (2002) (11 citations) (Correct)
....converging alternatives such as Gauss Seidel or Krylov methods to be used. Further details of this will be available in [Par01] The development of PRISM is an ongoing activity. In the near future we plan to consider extensions of PCTL for expressing expected time and long run average properties [dA98] and of CSL to include rewards [BHHK00b] expand the PRISM input language to allow process algebra terms, for example PEPA [Hil96] and develop model checking engines for PRISM which work in a parallel or distributed setting. ....
L. de Alfaro. How to specify and verify the long-run average behavior of probabilistic systems. In Proc. LICS'98, 1998.
Process Algebra for Performance Evaluation - Hermanns, Herzog, Katoen (2000) (10 citations) (Correct)
....[9,72] An alternative approach is to specify the measure of interest in a temporal logic extended with rewards. Such an approach for Hennessy Milner logic has been proposed in [21] A challenging direction for future research is to combine such logical approach with model checking techniques [23,8]. Acknowledgements The remarkable level of todays stochastic process algebra research has only been possible, since scientists of both communities, theoretical computer science and performance evaluation, worked closely together. Stimulating was also the close international cooperation of ....
L. de Alfaro. How to specify and verify the long-run average behavior of probabilistic systems. In LICS, 1998.
Long-run Properties of Periodic Probabilistic Systems - Bodirsky, Gärtner, al. (Correct)
....these results by reducing the probabilistic problems to equivalent purely combinatorial period problems, which can be eciently solved using power series. 1 Introduction The speci cation and veri cation of long run average properties of probabilistic systems was recently studied by de Alfaro [6]. He measured the properties of a system over a period of time the length of which diverges to in nity. A speci cation language is formulated for probabilistic systems that are Markov chains augmented by additional information on the timing behaviour of the system and nondeterminism. De Alfaro ....
L. de Alfaro. How to specify and verify the long-run average behavior of probabilistic systems. In Proc. 13th IEEE Sypm. on Logic in Computer Science, IEEE Computer Society Press, 1998.
PRISM: Probabilistic Symbolic Model Checker - Kwiatkowska, Norman, Parker (2002) (28 citations) (Correct)
....of CTMCs using CSL speci cations. PRISM is the only model checking tool which allows the quantitative model checking of MDPs. The development of PRISM is an ongoing activity. In the near future we plan to consider extensions of PCTL for expressing expected time and long run average properties [14] and of CSL to include rewards [6] We are also in the process of making eciency improvements to the tool, in particular to the hybrid engine. Details of this work will be available in [25] ....
L. de Alfaro. How to specify and verify the long-run average behavior of probabilistic systems. In Proc. LICS'98, 1998.
Probabilistic Model Checking of Deadline Properties in .. - Kwiatkowska, Norman.. (6 citations) (Correct)
.... as a basis for the computation of an approximation of the expected time to leader election; it would therefore be of interest to formalise such a notion in the context of probabilistic timed automata, and to relate it to other precedents in the probabilistic model checking literature, for example [8]. One aspect that is missing from our approach is an automatic method for verifying that the probability of the system electing a leader within a deadline of in nity is 1. This requires a thorough investigation into such a class of probabilistic liveness properties, which cannot be analysed by ....
L. de Alfaro. How to specify and verify the long-run average behavior of probabilistic systems. In V. Pratt, editor, Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS'98), pages 454-465. IEEE Computer Society Press, 1998.
Verifying Quantitative Properties of Continuous.. - Kwiatkowska.. (2000) (14 citations) (Correct)
....Veri cation of our continuous probabilistic timed automaton then reduces to a straightforward application of the model checking method of [17] We illustrate our method with the help of an example similar to the above. Related work: There are many probabilistic veri cation frameworks, see e.g. [5, 15, 11, 12], most of which only handle discrete probability and time. We are aware of two previous models for systems with continuously distributed delays that operate in real valued time. Our results directly supersede those of [2] which concern the model checking of purely 1 To see that such a ....
L. de Alfaro. How to specify and verify the long-run average behaviour of probabilistic systems. In Proc. LICS'98, pages 454-465. IEEE Computer Society Press, 1998.
Symbolic Model Checking of Probabilistic Processes .. - de Alfaro.. (2000) (5 citations) Self-citation (De alfaro) (Correct)
No context found.
L. de Alfaro. How to specify and verify the long-run average behavior of probabilistic systems. In Proc. LICS'98, pages 454-465, 1998.
Decidability Results for Parametric Probabilistic Transition.. - Lanotte, al. (Correct)
No context found.
L. de Alfaro, "How to specify and verify the longrun average behaviour of probabilistic systems", In Proc. of LICS'98, IEEE Press, 1998, 454--465.
Approximate Symbolic Model Checking of Continuous-Time.. - Baier, Katoen, Hermanns (1999) (29 citations) (Correct)
No context found.
L. de Alfaro. How to specify and verify the long-run average behavior of probabilistic systems. In LICS, 1998.
Deciding Monotonic Games - Abdulla, Bouajjani, d'Orso (2003) (4 citations) (Correct)
No context found.
L. de Alfaro. How to specify and verify the long-run average behavior of probabilistic systems. In Proc. LICS' 98 13 IEEE Int. Symp. on Logic in Computer Science, 1998.
Decidability Results for Parametric Probabilistic.. - Lanotte.. (2004) (Correct)
No context found.
L. de Alfaro, "How to specify and verify the longrun average behaviour of probabilistic systems", In Proc. of LICS'98, IEEE Press, 1998, 454--465.
Analysing Randomized Distributed Algorithms - Norman (Correct)
No context found.
L. de Alfaro. How to specify and verify the long-run average behaviour of probabilistic systems. In Proc. Symp. Logic in Computer Science (LICS'98), pages 454-465. IEEE Computer Society Press, 1998.
Temporal Rewards for Performance Evaluation - Voeten (1 citation) (Correct)
No context found.
L. de Alfaro. How to Specify and Verify Long-Run Average Behaviour of Probabilistic Systems. In Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science, 454--465, 1998.
PRISM: Probabilistic Symbolic Model Checker - Kwiatkowska, Norman, Parker (2002) (29 citations) (Correct)
No context found.
L. de Alfaro. How to specify and verify the long-run average behavior of probabilistic systems. In Proc. LICS'98, 1998.
Symbolic Model Checking of Concurrent Probabilistic .. - Kwiatkowska.. (1999) (8 citations) (Correct)
No context found.
L. de Alfaro. How to specify and verify the long-run average behaviour of probabilistic systems. In Proc. 13th IEEE Symp. Logic in Computer Science, pages 454-465, 1998.
Performance Evaluation With Temporal Rewards - Voeten (2002) (1 citation) (Correct)
No context found.
L. de Alfaro, How to specify and verify long-run average behaviour of probabilistic systems?, in: Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science, 1998, pp. 454--465.
Formal Modeling and Analysis of Power-Aware Real-Time Systems - Lee, Philippou, Sokolsky (2001) (1 citation) (Correct)
No context found.
L. de Alfaro. How to specify and verify the long-run average behavior of probabilistic systems. In Proceedings 13 Annual IEEE Symposium on Logic in Computer Science, pages 454-465. IEEE, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC