Sciweavers

169 search results - page 24 / 34
» Temporalization of Probabilistic Propositional Logic
Sort
View
FORMATS
2004
Springer
15 years 5 months ago
Symbolic Model Checking for Probabilistic Timed Automata
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 13 days ago
Model Checking Probabilistic Timed Automata with One or Two Clocks
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t...
Marcin Jurdzinski, François Laroussinie, Je...
174
Voted
LICS
2003
IEEE
15 years 5 months ago
Model checking for probability and time: from theory to practice
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
Marta Z. Kwiatkowska
ATAL
2008
Springer
15 years 2 months ago
Verifying Social Expectations by Model Checking Truncated Paths
One approach to moderating the expected behaviour of agents in open societies is the use of explicit languages for defining norms, conditional commitments and/or social expectation...
Stephen Cranefield, Michael Winikoff
128
Voted
ASIAN
2003
Springer
170views Algorithms» more  ASIAN 2003»
15 years 5 months ago
Model Checking Probabilistic Distributed Systems
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
Benedikt Bollig, Martin Leucker