A Decidable Probability Logic for Timed Probabilistic Systems

Authors:
Ruggero Lanotte;Danièle Beauquier
Affiliations:
Dipartimento di Scienze della Cultura, Politiche e dell'Informazione Università dell'Insubria, Italy. E-mail: ruggero.lanotte@uninsubria.it;LACL CNRS FRE 2673, Université Paris 12 Val de Marne, France
Venue:
Fundamenta Informaticae
Year:
2009

Citing 16
Cited 1

Implementing fault-tolerant services using the state machine approach: a tutorial

ACM Computing Surveys (CSUR)
Automata on infinite objects

Handbook of theoretical computer science (vol. B)
Real-time logics: complexity and expressiveness

Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
A theory of timed automata

Theoretical Computer Science
The complexity of probabilistic verification

Journal of the ACM (JACM)
On the verification of qualitative properties of probabilistic processes under fairness constraints

Information Processing Letters
Automatic verification of real-time systems with discrete probability distributions

Theoretical Computer Science
Markov decision processes and deterministic Büchi automata

Fundamenta Informaticae
On probabilistic timed automata

Theoretical Computer Science
Model-Checking for Probabilistic Real-Time Systems (Extended Abstract)

ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
It Usually Works: The Temporal Logic of Stochastic Systems

Proceedings of the 7th International Conference on Computer Aided Verification
A Logic of Probability with Decidable Model-Checking

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Verifying Automata Specifications of Probabilistic Real-time Systems

Proceedings of the Real-Time: Theory in Practice, REX Workshop
Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM

International Journal on Software Tools for Technology Transfer (STTT)
Updatable timed automata

Theoretical Computer Science
Automatic verification of probabilistic concurrent finite state programs

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science

Weak bisimulation for Probabilistic Timed Automata

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we extend the predicate logic introduced by Beauquier et al. in order to deal with Markov decision processes. We prove that with respect to qualitative probabilistic properties, model checking is decidable for this logic applied to Markov decision processes. Furthermore we apply our logic to probabilistic timed transition systems using predicates on clocks. We prove that results on Markov decision processes hold also for probabilistic timed transition systems. The interest of this logic lies in particular on the fact that some important properties are expressible in this logic but not expressible in pCTL.