A decidable probability logic for timed probabilistic systems

DOI10.3233/FI-2009-171MaRDI QIDQ3400533zbMATH OpenOpenAlexFDO

Authors Ruggero Lanotte, Danièle Beauquier

Publication date 5 February 2010

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2009-171

zbMATH Keywords

Markov decision processesmodel checkingpredicate logic of probabilitiesprobabilistic timed transition systems

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Probability and inductive logic (03B48) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• scientific article; zbMATH DE number 1948170
• A Logic of Probability with Decidable Model Checking
• Probabilistic propositional temporal logics
• A logic for reasoning about time and reliability
• Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity

Cited in

(19)

• Polytime model checking for times probabilistic computation tree logic
• A logic for reasoning about time and reliability
• Stochastic temporal logic abstractions: challenges and opportunities
• SLAP: specification logic of actions with probability
• scientific article; zbMATH DE number 3869302 (Why is no real title available?)
• A Logic of Probability with Decidable Model Checking
• scientific article; zbMATH DE number 1948170 (Why is no real title available?)
• Probabilistic propositional temporal logics
• Decidability and complexity for \(\omega \)-regular properties of stochastic systems
• scientific article; zbMATH DE number 7319046 (Why is no real title available?)
• Undecidable cases of model checking probabilistic temporal-epistemic logic (extended abstract)
• scientific article; zbMATH DE number 7455747 (Why is no real title available?)
• Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic
• Computer Science Logic
• Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity
• Decission Markov logic
• Formal Modeling and Analysis of Timed Systems
• Weak bisimulation for probabilistic timed automata
• Probabilistic and prioritized models of timed CSP

Describes a project that uses

Uses Software

• Uppaal

This page was built for publication: A decidable probability logic for timed probabilistic systems

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