Decidability and complexity for -regular properties of stochastic systems

DOI10.1093/JIGPAL/JZR054zbMATH Open1277.68218DBLPjournals/igpl/HenriquesBBM12OpenAlexW2036947848WikidataQ59196661 ScholiaQ59196661MaRDI QIDQ4914007

No author found.

Publication date: 17 April 2013

Published in: Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/jigpal/jzr054

zbMATH Keywords

temporal logicsatisfiabilityprobabilistic reasoning

Mathematics Subject Classification ID

Temporal logic (03B44) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (3)

When are stochastic transition systems tameable? ⋮ Unnamed Item ⋮ Probabilization of logics: completeness and decidability

This page was built for publication: Decidability and complexity for  -regular properties of stochastic systems