A decidable probability logic for timed probabilistic systems

DOI10.3233/FI-2009-171zbMATH Open1198.68169OpenAlexW1564918302MaRDI QIDQ3400533FDOQ3400533

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

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

zbMATH Keywords

model checkingMarkov decision processespredicate logic of probabilitiesprobabilistic timed transition systems

Mathematics Subject Classification ID

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

Cited In (11)

• Title not available (Why is that?)
• Probabilistic and prioritized models of timed CSP
• Title not available (Why is that?)
• Title not available (Why is that?)
• Formal Modeling and Analysis of Timed Systems
• Stochastic temporal logic abstractions: challenges and opportunities
• A logic for reasoning about time and reliability
• Weak bisimulation for probabilistic timed automata
• Title not available (Why is that?)
• Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic
• Probabilistic propositional temporal logics

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)