125 search results - page 13 / 25 » A Logic of Probability with Decidable Model Checking |
105
click to vote
LFCS
2009
Springer
15 years 6 months ago
2009
Springer
In this paper we study several properties of the Exogenous Probabilistic Propositional Logic (EPPL), a logic for reasoning about probabilities, with the purpose of introducing a t...
106
click to vote
ICFEM
2009
Springer
14 years 9 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
104
click to vote
DAC
2004
ACM
16 years 19 days ago
2004
ACM
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
71
Voted
UC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computin...
92
Voted
ISW
2004
Springer
15 years 5 months ago
2004
Springer
We present a model of access control which provides fine-grained data-dependent control, can express permissions about permissions, can express delegation, and can describe syste...