Model-checking for probabilistic real-time systems (extended abstract)
Proceedings of the 18th international colloquium on Automata, languages and programming
Bisimulation through probabilistic testing
Information and Computation
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
Time-abstracted bisimulation: implicit specifications and decidability
Information and Computation
Automatic verification of real-time systems with discrete probability distributions
Theoretical Computer Science
On probabilistic timed automata
Theoretical Computer Science
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On Discretization of Delays in Timed Automata and Digital Circuits
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Minimization of Timed Transition Systems
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Minimum-Cost Reachability for Priced Timed Automata
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Improvements in BDD-Based Reachability Analysis of Timed Automata
FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Verifying Progress in Timed Systems
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Two examples of verification of multirate timed automata with Kronos
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Optimal paths in weighted timed automata
Theoretical Computer Science - Logic, semantics and theory of programming
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
Theoretical Computer Science
Checking Timed Büchi Automata Emptiness Efficiently
Formal Methods in System Design
Performance analysis of probabilistic timed automata using digital clocks
Formal Methods in System Design
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Game-based Abstraction for Markov Decision Processes
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Probably on Time and within BudgetOn Reachability in Priced Probabilistic Timed Automata
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Symbolic model checking for probabilistic timed automata
Information and Computation
MODEST: A Compositional Modeling Formalism for Hard and Softly Timed Systems
IEEE Transactions on Software Engineering
Optimal infinite scheduling for multi-priced timed automata
Formal Methods in System Design
On conciseness of extensions of timed automata
Journal of Automata, Languages and Combinatorics
Time-Abstracting Bisimulation for Probabilistic Timed Automata
TASE '08 Proceedings of the 2008 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering
ISOLA '06 Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation
Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Concavely-Priced Probabilistic Timed Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Strict Divergence for Probabilistic Timed Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Stochastic Games for Verification of Probabilistic Timed Automata
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
The Ins and Outs of the Probabilistic Model Checker MRMC
QEST '09 Proceedings of the 2009 Sixth International Conference on the Quantitative Evaluation of Systems
A Modest Approach to Checking Probabilistic Timed Automata
QEST '09 Proceedings of the 2009 Sixth International Conference on the Quantitative Evaluation of Systems
Automatic Analysis of a Non-Repudiation Protocol
Electronic Notes in Theoretical Computer Science (ENTCS)
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
UPPAAL-Tiga: time for playing games!
CAV'07 Proceedings of the 19th international conference on Computer aided verification
A game-based abstraction-refinement framework for Markov decision processes
Formal Methods in System Design
On Probabilistic Automata in Continuous Time
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Fortuna: Model Checking Priced Probabilistic Timed Automata
QEST '10 Proceedings of the 2010 Seventh International Conference on the Quantitative Evaluation of Systems
Quantitative analysis of real-time systems using priced timed automata
Communications of the ACM
PRISM 4.0: verification of probabilistic real-time systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Relating average and discounted costs for quantitative analysis of timed systems
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Game-based Abstraction and Controller Synthesis for Probabilistic Hybrid Systems
QEST '11 Proceedings of the 2011 Eighth International Conference on Quantitative Evaluation of SysTems
Discrete-Time Verification and Control for Probabilistic Rectangular Hybrid Automata
QEST '11 Proceedings of the 2011 Eighth International Conference on Quantitative Evaluation of SysTems
Characterization of the Expressive Power of Silent Transitions in Timed Automata
Fundamenta Informaticae
An extension of the inverse method to probabilistic timed automata
Formal Methods in System Design
Preface to the special issue on Probabilistic Model Checking
Formal Methods in System Design
| Hi-index | 0.00 |
Probabilistic timed automata (PTAs) are a formalism for modelling systems whose behaviour incorporates both probabilistic and real-time characteristics. Applications include wireless communication protocols, automotive network protocols and randomised security protocols. This paper gives an introduction to PTAs and describes techniques for analysing a wide range of quantitative properties, such as "the maximum probability of the airbag failing to deploy within 0.02 seconds", "the maximum expected time for the protocol to terminate" or "the minimum expected energy consumption required to complete all tasks". We present a temporal logic for specifying such properties and then give a survey of available model-checking techniques for formulae specified in this logic. We then describe two case studies in which PTAs are used for modelling and analysis: a probabilistic non-repudiation protocol and a task-graph scheduling problem.