A decidable probability logic for timed probabilistic systems
DOI10.3233/FI-2009-171zbMATH Open1198.68169OpenAlexW1564918302MaRDI QIDQ3400533FDOQ3400533
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
Recommendations
model checkingMarkov decision processespredicate logic of probabilitiesprobabilistic timed transition systems
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 (18)
- Undecidable cases of model checking probabilistic temporal-epistemic logic (extended abstract)
- Title not available (Why is that?)
- Probabilistic and prioritized models of timed CSP
- Title not available (Why is that?)
- SLAP: specification logic of actions with probability
- Title not available (Why is that?)
- Formal Modeling and Analysis of Timed Systems
- Computer Science Logic
- A Logic of Probability with Decidable Model Checking
- Stochastic temporal logic abstractions: challenges and opportunities
- A logic for reasoning about time and reliability
- Weak bisimulation for probabilistic timed automata
- Decidability and complexity for \(\omega \)-regular properties of stochastic systems
- Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity
- Title not available (Why is that?)
- Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic
- Probabilistic propositional temporal logics
- Decission Markov logic
Uses Software
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)
