Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Kwiatkowska, G. Norman, J. Sproston (2003)
Probabilistic Model Checking of Deadline Properties in the IEEE 1394 FireWire Root Contention ProtocolFormal Aspects of Computing, 14
C. Courcoubetis, M. Yannakakis (1995)
The complexity of probabilistic verificationJ. ACM, 42
D. Lehmann, S. Shelah (1982)
Reasoning with Time and ChanceInf. Control., 53
Moshe Vardi (1985)
Automatic verification of probabilistic concurrent finite state programs26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
R. McNaughton (1963)
Review: J. Richard Buchi, Weak Second-Order Arithmetic and Finite Automata; J. Richard Buchi, On a Decision Method in Restricted second Order ArithmeticJournal of Symbolic Logic, 28
L. Aceto, P. Bouyer, Augusto Burgueño, K. Larsen (1998)
The power of reachability testing for timed automataTheor. Comput. Sci., 300
R. Barbuti, L. Tesei (2004)
Timed automata with urgent transitionsActa Informatica, 40
R. Alur, D. Dill (1994)
A Theory of Timed AutomataTheor. Comput. Sci., 126
D. Beauquier (2002)
Markov Decision Processes and Deterministic Büchi AutomataFundam. Informaticae, 50
W. Roever, H. Langmaack, A. Pnueli (1997)
Revised Lectures from the International Symposium on Compositionality: The Significant Difference
C. Baier, M. Kwiatkowska (1998)
On the Verification of Qualitative Properties of Probabilistic Processes under Fairness ConstraintsInf. Process. Lett., 66
(1994)
A logic of reasoning about time and probability
R. Alur, C. Courcoubetis, D. Dill (1991)
Verifying Automata Specifications of Probabilistic Real-time Systems
P. Bouyer, C. Dufourd, E. Fleury, A. Petit (2004)
Updatable timed automataTheor. Comput. Sci., 321
G. Behrmann, Alexandre David, K. Larsen (2004)
A Tutorial on Uppaal
R. Alur, C. Courcoubetis, D. Dill (1993)
Model-Checking in Dense Real-timeInf. Comput., 104
D. Beauquier, A. Rabinovich, A. Slissenko (2002)
A Logic of Probability with Decidable Model-Checking
Sébastien Bornot, J. Sifakis (1997)
Relating Time Progress and Deadlines in Hybrid Systems
C. Daws, M. Kwiatkowska, G. Norman (2002)
Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISMInternational Journal on Software Tools for Technology Transfer, 5
M. Kwiatkowska, G. Norman, R. Segala, J. Sproston (1999)
Automatic verification of real-time systems with discrete probability distributions
R. Alur, C. Courcoubetis, D. Dill (1991)
Model-Checking for Probabilistic Real-Time Systems (Extended Abstract)
B. Nordstrom (2005)
FINITE MARKOV CHAINS
S. Sieber (1960)
On a decision method in restricted second-order arithmetic
P. Bouyer (2002)
Timed Automata May Cause Some TroublesBRICS Report Series, 9
Sébastien Bornot, J. Sifakis, S. Tripakis (1997)
Modeling Urgency in Timed Systems
W. Thomas (1991)
Automata on Infinite Objects
R. Alur, T. Henzinger (1990)
Real-time logics: complexity and expressiveness[1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science
M. Kwiatkowska, G. Norman, J. Sproston, Fuzhi Wang (2007)
Symbolic model checking for probabilistic timed automataInf. Comput., 205
D. Beauquier (2003)
On probabilistic timed automataTheor. Comput. Sci., 292
A. Aziz, V. Singhal, F. Balarin (1995)
It Usually Works: The Temporal Logic of Stochastic Systems
P. Bouyer, C. Dufourd, E. Fleury, A. Petit (2000)
Are Timed Automata Updatable?
F. Schneider (1990)
Implementing fault-tolerant services using the state machine approach: a tutorialACM Comput. Surv., 22
URL www.lsv.ens-cachan.fr/Publis
J. Ferrante, C. Rackoff (1975)
A Decision Procedure for the First Order Theory of Real Addition with OrderSIAM J. Comput., 4
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.
Fundamenta Informaticae – IOS Press
Published: Jan 1, 2009
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.