A Decidable Probability Logic for Timed Probabilistic Systems

DOI10.3233/FI-2009-171zbMath1198.68169OpenAlexW1564918302MaRDI QIDQ3400533

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

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

Related Items (1)

Weak bisimulation for probabilistic timed automata

Uses Software

• Uppaal

This page was built for publication: A Decidable Probability Logic for Timed Probabilistic Systems