Probabilistic Regular Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Probabilistic Regular Graphs


Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extension of regular graphs obtained by labelling the terminal arcs of the graph grammars by probabilities. Stochastic properties of these graphs are expressed using PCTL, a probabilistic extension of computation tree logic. We present here an algorithm to perform approximate verification of PCTL formulae. Moreover, we prove that the exact model-checking problem for PCTL on probabilistic regular graphs is undecidable, unless restricting to qualitative properties. Our results generalise those of [EKM06], on probabilistic pushdown automata, using similar methods combined with graph grammars techniques.
Fichier principal
Vignette du fichier
final.pdf (171.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00525388 , version 1 (11-10-2010)


  • HAL Id : inria-00525388 , version 1


Nathalie Bertrand, Christophe Morvan. Probabilistic Regular Graphs. Infinity (International Workshop on Verification of Infinite-State Systems), 2010, Singapour, Singapore. pp.77-90. ⟨inria-00525388⟩
66 View
85 Download


Gmail Facebook X LinkedIn More