Sciweavers

125 search results - page 25 / 25
» A Logic of Probability with Decidable Model Checking
Sort
View
QEST
2008
IEEE
14 years 4 days ago
Hintikka Games for PCTL on Labeled Markov Chains
We present Hintikka games for formulae of the probabilistic temporal logic PCTL and countable labeled Markov chains as models, giving an operational account of the denotational se...
Harald Fecher, Michael Huth, Nir Piterman, Daniel ...
FORMATS
2003
Springer
13 years 11 months ago
Performance Analysis of Probabilistic Timed Automata Using Digital Clocks
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...
RTSS
2006
IEEE
13 years 11 months ago
Mutual Consistency in Real-Time Databases
A real-time database is composed of real-time objects whose values remain valid only within their validity intervals. Each object in the database models a real world entity. The f...
Abhay Kumar Jha, Ming Xiong, Krithi Ramamritham
LICS
2003
IEEE
13 years 11 months ago
Labelled Markov Processes: Stronger and Faster Approximations
This paper reports on and discusses three notions of approximation for Labelled Markov Processes that have been developed last year. The three schemes are improvements over former...
Vincent Danos, Josee Desharnais
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
13 years 3 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...