About Decisiveness of Dynamic Probabilistic Models - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

About Decisiveness of Dynamic Probabilistic Models

Résumé

Decisiveness of infinite Markov chains with respect to some (finite or infinite) target set of states is a key property that allows to compute the reachability probability of this set up to an arbitrary precision. Most of the existing works assume constant weights for defining the probability of a transition in the considered models. However numerous probabilistic modelings require (dynamic) weights that depend on both the current state and the transition. So we introduce a dynamic probabilistic version of counter machine (pCM). After establishing that decisiveness is undecidable for pCMs even with constant weights, we study the decidability of decisiveness for subclasses of pCM. We show that, without restrictions on dynamic weights, decisiveness is undecidable with a single state and single counter pCM. On the contrary with polynomial weights, decisiveness becomes decidable for single counter pCMs under mild conditions. Then we show that decisiveness of probabilistic Petri nets (pPNs) with polynomial weights is undecidable even when the target set is upward-closed unlike the case of constant weights. Finally we prove that the standard subclass of pPNs with a regular language is decisive with respect to a finite set whatever the kind of weights.

Dates et versions

hal-04112843 , version 1 (01-06-2023)

Identifiants

Citer

Alain Finkel, Serge Haddad, Lina Ye. About Decisiveness of Dynamic Probabilistic Models. the 34th International Conference on Concurrency Theory, Sep 2023, Gif-sur-Yvette, France. ⟨10.4230/LIPICS.CONCUR.2023.14⟩. ⟨hal-04112843⟩
35 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More