Probably on Time and within BudgetOn Reachability in Priced Probabilistic Timed Automata

Authors:
Jasper Berendsen;David N. Jansen;Joost-Pieter Katoen
Affiliations:
University of Twente, Netherlands;University of Twente, Netherlands;RWTH Aachen Software Modeling and Verification Group Aachen, Germany
Venue:
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Year:
2006

Citing 0
Cited 5

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
A framework for verification of software with time and probabilities

FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Model checking for probabilistic timed automata

Formal Methods in System Design
A compositional modelling and analysis framework for stochastic hybrid systems

Formal Methods in System Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

This talk will provide an overview of work that I have done with Hana Chockler, Orna Kupferman, and Judea Pearl [1, 2, 10, 9] on defining notions such as causality, explanation, responsibility, and blame. I first review the Halpern-Pearl definition of ...