Decidability and complexity for -regular properties of stochastic systems

DOI10.1093/JIGPAL/JZR054MaRDI QIDQ4914007zbMATH OpenOpenAlexDBLPWikidataFDO

Authors

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

probabilistic reasoningsatisfiabilitytemporal logic

Mathematics Subject Classification ID

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

Recommendations

• On the satisfiability of some simple probabilistic logics
• STACS 2005
• The satisfiability problem for unbounded fragments of probabilistic CTL
• Probabilistic propositional temporal logics
• A decidable probability logic for timed probabilistic systems

Cited in

(6)

• When are stochastic transition systems tameable?
• Probabilization of logics: completeness and decidability
• scientific article; zbMATH DE number 1241943 (Why is no real title available?)
• On the satisfiability of some simple probabilistic logics
• The satisfiability problem for unbounded fragments of probabilistic CTL
• On frequency LTL in probabilistic systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4914007)