L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, Department of Computer Science, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
MoDeST - A Modelling and Description Language for.. - D'Argenio.. (Correct)
....concepts. PTS: Probabilistic transition systems are labelled transition systems where some state changes are governed by discrete probability distributions while others are nondeterministic. They can be analysed with techniques from Markov decision theory, model checking, and equivalence checking [31,9]. MoDeST subsumes (simple) PTS via the palt construct which is action guarded by default. Tabl 2. Submodels of STA LTS PTS TA PTA MC GSMP IMC SA STA probabilistic branchan no yes no yes yes yes yes yes yes clocks no no yes yesrestricted yesrestricted yes yes random variables no no no no ....
L. de Alfaro. Formal Verification of Probabilistic Systems.Ph th]33' Stanford University, 1997.
Beyond Memoryless Distributions: Model Checking Semi-Markov .. - Lopez, Hermanns, Katoen (2001) (3 citations) (Correct)
....distribution have receivedscan tatten tion in the literature so far. Three related works are knwn to the authors. Van Hun an Chaochen [17] havedefin5 a probabilistic varian t of theduration calculus to express properties over SMCs, but did nd reporton an y verification algorithms. De Alfaro [12] discusses model checkin oflon#FFF average properties an expected reachability timeson semi Markovdecision processes. These modelscan becon]5q[# as SMCsextenF1 withnhqAA flFq[# FA1 Time b formulas are ne con10 q[# Kwiatkowska et al. 19] haverecen tly conA50Aq[ the verification of a ....
....2. For an y t the probability #(s, s # ,t) doesnfl equal #(s, s # ,t 1) because the probability massaltern05q between the two states. Thus, a limit for of #(s, s # ,t) does nq exist. However, wecan defin a related measure basedon the averageamoun t of time spen t in some state, similar to [12]. For this purpose, we fix a state s,an let # s be a path taken ranfl5 0 from the set Path(s) Then thequan tity 1 s # (# s t) is aran0F variable,inble,qflfl whether the state s # is occupied at time twhen startin in s. Here we use the characteristicfunacte 1 s # (s ## ) 1ifs # = s ## an 0 ....
L. de Alfaro. Formal Verification of Probabilistic Systems.Ph thHJJI Stanford University, 1997.
A Compositional Translation of Stochastic Automata into Timed.. - D'Argenio (Correct)
....embedded systems or communication protocols, do not only require to be functionally correct but also e#cient. Approaches that combine qualitative and quantitative analysis of design models have been addressed from many di#erent perspectives including process algebra and model checking (see e.g. [24, 1, 22, 25, 35, 19, 11, 23, 17, 9, 16, 26]) Thus, these models provide a framework both for functional analysis of the system design under consideration, and for obtaining performance and reliability measures of such a system. Recently, the author of this article has been involved in the development of a general model of this kind. The ....
L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, December 1997.
Probabilistic Extensions of Process Algebras - Jonsson, Larsen, Yi (2001) (27 citations) (Correct)
.... with non determinism by Bianco and de Alfaro [8, 21] Symbolic modelchecking algorithms of these logics was presented by Baier et al. in [6] For more detailed information on the interesting topic of model checking probabilistic systems, we refer the reader to the excellent works by Alfaro [20] and Baier [4] 8 CONCLUSION and TRENDS In this chapter, we have dealt with a number of classical process algebraic issues in a rather general setting allowing both discrete probabilistic choice as well as nondeterminism. In particular, we have shown how non probabilistic process algebraic ....
L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Dept. of Computer Sciences, Stanford University, Dec. 1997.
LiQuor: A tool for Qualitative and Quantitative Linear.. - Reactive Systems Frank (Correct)
No context found.
L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, Department of Computer Science, 1997.
Don't Know in Probabilistic Systems - Harald Fecher Martin (Correct)
No context found.
Luca de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997. Technical report STAN-CS-TR-98-1601.
Experiments with Deterministic ω-Automata for Formulas.. - Klein, Baier (2005) (Correct)
No context found.
de Alfaro, L.: Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, Department of Computer Science (1997)
Partial Order Reduction For Probabilistic Branching Time - Baier, D'Argenio, Groesser (2005) (Correct)
No context found.
L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, Department of Computer Science, 1997.
Quantitative Analysis of Distributed Randomized Protocols - Baier, Ciesinski, Groesser (2005) (Correct)
No context found.
L. de Alfaro. Formal Verification of Probabilistic Systems. Ph.D. thesis, Stanford University , 1997.
Algorithms for Stochastic Parity Games - Chatterjee, Henzinger (2005) (Correct)
No context found.
L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997.
An Introduction to Probabilistic Automata - Stoelinga (2002) (Correct)
No context found.
L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997.
Implementation of Symbolic Model Checking for Probabilistic.. - Parker (1999) (5 citations) (Correct)
No context found.
L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997.
Probabilistic Automata: System Types, Parallel Composition.. - Sokolova, de Vink (Correct)
No context found.
L. de Alfaro, Formal verification of probabilistic systems, Ph.D. thesis, Stanford University, 1997.
Probability, Nondeterminism and Concurrency: Two Denotational.. - Varacca (2003) (Correct)
No context found.
Luca de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, December 1997.
Probabilistic Model Checking of the CSMA/CD.. - Duflot, Fribourg, .. (2004) (Correct)
No context found.
L. de Alfaro. Formal Verification of Probabilistic Systems. PhD Thesis, Stanford University, 1997.
Alea jacta est - Verification of Probabilistic, Real-Time and.. - Stoelinga (2002) (Correct)
No context found.
L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997.
Model Checking for Probabilistic Timed Systems - Sproston (Correct)
No context found.
L. de Alfaro. Formal verification of probabilistic systems. PhD thesis, Stanford University, Department of Computer Science, 1997.
Alea jacta est - Verification of Probabilistic, Real-Time and.. - Stoelinga (2002) (Correct)
No context found.
L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997.
An-Automata Approach to the Representation of Bilevel Images - Lin, Yen (Correct)
No context found.
L. de Alfaro, "Formal verification of probabilistic systems," Ph.D. dissertation, Dept. Comput. Sci., Stanford Univ., Stanford, CA, Dec. 1997.
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